An algorithm based on competition optimal planning of power distribution networks is suggested.
提出了一种基于竞争的配电网络优化规划算法。
In allusion to some problems of existing route planning algorithm of large area, a multi-scale optimal route planning algorithm within restricted searching area was proposed.
针对现有大区域范围路径规划算法存在的一些问题，提出一种限制搜索区域的多比例尺最优路径规划算法。
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.
针对移动机器人的最速编队问题，结合路径规划和任务分解，提出一种分派问题的新解法和时间最优的编队策略。
The algorithm uses the thought of delamination, makes local planning and global planning combination, and improves cost function, finally with ensuring optimal trajectory increases search efficiency.
该算法采用分层思想，将局部规划与全局规划相结合，并对代价函数进行了改进，在保证航迹优化的基础上，提高了搜索效率。
The paper proposed an optimal path-planning algorithm for dynamic environment with multiple robots (obstacles).
提出一种在未知动态环境中进行启发式优化搜索的实时路径规划算法。
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.
再次，根据移动机器人路径规划问题的特性，设计出一种新的基于竞选算法的移动机器人全局最优路径规划方法。
应用推荐