路径规划

帆船最优行驶路径规划是帆船比赛取胜的关键环节。

Optimal path planning is a key link for the sailing contest .

levelset方法求解机器人路径规划的探讨

The Solution for Robot Path Planning Based on Level Set Method

基于C空间的机器人双手协调避碰路径规划

Collision-free path planning for dual-robot arms cooperating based on C-space

一种保持Agent团队队形的路径规划方法

A Path Planning Algorithm with Agent Team Formation Maintained

系统由路径规划模块和辅助操作模块组成。可以完成对CT图像进行轮廓提取、三维模型重建以及实现手术路径规划和手术导引等功能。

The system includes two modules : path planning module and aided operation module .

路径规划作为CAD与在线检测系统集成的纽带，在加工中心在线检测系统中具有举足轻重的作用。

The path planning is the ligament between CAD and on-line inspecting system .

GIS环境下的最佳路径规划

Optimum path planning based on GIS Environment

移动机器人路径规划（PathPlanning）是移动机器人技术研究中关键的问题之一。

Path Planning for Mobile Robot is one of the most critical technologies among all of the Robotics researches .

测量路径规划包括已知CAD模型和未知CAD模型两种类型。

Blade measurement path planning , including two types & known and unknown CAD models .

基于GIS的无人飞行器路径规划

GIS-based Unmanned Air Vehicle Route Planning

一种GIS环境下基于MAS的动态路径规划方法

Dynamic Route Planning Method Based on MAS in GIS Enviroment

对距离变换（DistanceTransform）路径规划方法进行推广，提出了基于代价变换的航路规划方法。

By expanding the path planning method based on distance transform , cost-based distance transform ( CDT ) method is presented .

基于Q强化学习与CMAC的移动机器人局部路径规划

Mobile Robot Local Path Planning Based on Q Reinforcement Learning and CMAC

该3D数据能够有效地支持无人直升机在应用任务执行过程中的避障、路径规划和应用任务的适时控制。

These 3D information can effectively supports the implementation of UAV tasks like : obstacle avoidance , path planning and flight control application .

针对多目标不确定环境下移动机器人路径规划算法复杂的问题，提出了一种新的规划算法&混沌控制算法，并用VISUALBASIC语言进行了仿真。

A new path planning algorithm , namely chaos control method , is introduced to solved the complexity of multi-target under uncertainty environment and is simulated by Visual Basic .

通过对电极的路径规划，实现了HIT字符型阵列、往复直线、圆弧、四边形等形状的沉积。

Through planning electrodes ' path , the shapes of HIT character type array , reciprocating straight , arc and quadrilateral are deposited .

基于遗传算法的AUV三维海底路径规划

AUV Path Planning in 3D Seabed Environment Using Genetic Algorithm

未知环境的基于传感器AUV三维实时路径规划

Real-time 3D Path Planning for Sensor-based AUV in Unknown Environment

基于粒子GT算法的最短避障路径规划的研究

Research on Shortest Obstacle Avoidance Path Planning Based on Granular GT Algorithm

基于虚拟势场理论的AUV局部路径规划方法

Local Path Planning Method for Autonomous Underwater Vehicle Based on Virtual Field Force

基于机床方向和位置矩阵的AGV路径规划

The path planning for AGV based on the position and orientation matrix of machine tools

一种基于图像声纳的AUV局部路径规划方法

Image-sonar-based Local Path Planning for AUV

客户端软件利用OpenGL绘制机器人三维模型完成利用虚拟现实技术进行仿真的功能，并给出一个机械臂的空间路径规划算法。

The client software implements simulating functions by drawing 3D robot model in OpenGL , and a path-planning algorithm also is brought forward .

面向数控加工，本论文讨论了STL模型的刀具路径规划问题。

Oriented to NC process , the tool path planning based on STL model is discussed in the thesis .

将分级路径规划算法与传统的Dijkstra算法进行比较，验证算法的合理性。

The hierarchical path planning algorithm and compared the traditional Dijkstra algorithm , authentication algorithm is reasonable .

本文首先总结了金属薄板直壁件的路径规划方法，即数控程序直接生成G代码的路径规划和UG直接造型的路径规划工艺，比较了两种方法的优缺点。

According to the character of CNC forming , route planning method is most important for straight-wall parts ' forming . Two got route planning methods are compared .

在求解Packing问题、机器人路径规划、虚拟装配、碰撞检测等常用到椭圆-矩形的不干涉算法。

When resolving problem of interference such as packing , robot motion planning , virtual assembly , collision detection and so on , the interference algorithm for ellipse-rectangle is often used .

阐述了花纹块模具NC加工时刀具选取、走刀路径规划、切削参数选择等技术，保证了在满足加工精度要求的情况下提高加工效率。

Research on its NC machining , whose problems include : cutter selection , tool path planning , cutting parameters decision , and so on , ensures precision accuracy and high efficiency .

以所提出的逻辑流程为基础，论文从子问题中抽象出多UCAV协同任务分配和多UCAV协同路径规划两个关键问题。

The cooperative UCAVs mission assignment and the path planning problems were extracted from the sub-problems .

提出一种时间复杂度为O（n）的限制搜索区域距离最短路径规划算法（n为路网节点数）。

A route planning algorithm for the shortest distance in a restricted searching area , with a time complexity O ( n ) is proposed ( n being the number of nodes in the road net ) .