Optimal path planning is a key link for the sailing contest.
帆船最优行驶路径规划是帆船比赛取胜的关键环节。
So the most optimal path planning is regard as the problem of searching for roads which have the least cost in a road net.
所以，最优路径规划最终都可以归结为在特定的道路网络中搜索总代价最小的目标路径问题。
This paper proposed an optimal path planning method for a sailboat sailing around race marks based on section optimization.
本论文提出了基于分区段优化思想的帆船比赛绕标航行最优行驶路径规划方法。
A kind of time optimal formation strategy is proposed, which is based on path planning and task decomposition as well as an effective algorithm for assignment problem.
针对移动机器人的最速编队问题，结合路径规划和任务分解，提出一种分派问题的新解法和时间最优的编队策略。
Then, a heuristic breadth-first search is applied for path planning to find an optimal path from an original position to an aim, directing virtual human walkthrough in environments.
然后，用启发式宽度优先搜索算法进行路径规划，产生从初始位置到目标位置的最优路径，引导虚拟人对环境进行漫游。
Global path planning allows finding optimal paths under multi-constraints.
全局路径规划可在多种约束条件下找出最优路径。
Path planning is searching a optimal path without touch form the start to the end under way a performance indicators.
路径规划是按照某一性能指标搜索一条从起始状态到目标状态的最优或近似最优的无碰路径。
Path planning is to find a trajectory from the initial point to the target point which satisfies a certain performance optimal index under some constraints.
路径规划问题一般是指在一定约束条件下，寻找从给定起始点到给定目标点之前满足某种性能指标最优的路径轨迹。
The paper proposed an optimal path-planning algorithm for dynamic environment with multiple robots (obstacles).
提出一种在未知动态环境中进行启发式优化搜索的实时路径规划算法。
Unlike the traditional constant scallop height tool-path planning method, it produces the optimal machining efficiency under the condition of ensuring the tool-path smoothness.
与以往的等残留高度刀具轨迹规划方法不同的是此算法在保证刀具轨迹光顺的前提下使加工效率达到最佳。
Thirdly, basing on characteristics of mobile robot path planning, we designs a kind of Election-survey Algorithm to solve global optimal result of mobile robot path planning.
再次，根据移动机器人路径规划问题的特性，设计出一种新的基于竞选算法的移动机器人全局最优路径规划方法。
Thirdly, basing on characteristics of mobile robot path planning, we designs a kind of Election-survey Algorithm to solve global optimal result of mobile robot path planning.
再次，根据移动机器人路径规划问题的特性，设计出一种新的基于竞选算法的移动机器人全局最优路径规划方法。
应用推荐