In order to resolve the question, the thesis put forward the optimal path algorithm in distributed multi-level road network.
针对这一问题，本文提出了大区域分布式多级道路网的最优路径算法。
Combined the characteristic of sensor network and the properties of ant algorithm to quickly identify optimal path, an ant routing algorithm based on deflection Angle is proposed.
根据传感器网络的特性，结合蚂蚁算法能够快速找出最优路径的特点，提出了一种基于偏转角的蚂蚁路由算法。
Path analysis is the most important to Traffic network analysis, while optimal path algorithm is the core of path analysis.
交通网络分析的重点是路径分析，而路径分析的核心为最优路径算法。
After analyzing and comparing some path search algorithms, the paper ultimately adopted a simple single threshold algorithm and attained optimal parameters through simulation.
本文分析、比较了现有的几种路径搜索算法，最后采用一种比较简单的单门限算法，并通过仿真得到参数最优值。
Based on the analysis of the shortest path algorithm in urban traffic network and the characteristics of GIS, the algorithm of optimal dispatch path when emergency incident occurs is put forward.
在分析城市道路网络最短路径算法和地理信息系统（GIS）特点的基础上，提出城市紧急事件发生后，应急调度中最佳路径算法。
Some experiments have been made to examine the principles of optimal path, shortest tree and maximum flow as well as the application of algorithm in the network of road.
研究试验了最优路径、最短树、最大流等方面的原理与算法在道路图中的应用。
The paper proposed an optimal path-planning algorithm for dynamic environment with multiple robots (obstacles).
提出一种在未知动态环境中进行启发式优化搜索的实时路径规划算法。
The optimal algorithm for selecting military material provision path is one of the key algorithms for the auxiliary decision-making system of material provision.
军用物资供应道路选择最优算法是物资后勤保障辅助决策系统的核心算法之一。
Based on the characteristic of multi-path frequency selective channel, the algorithm combines rapid table lookup and Lagrange-multiplier method to iteratively search the optimal bit allocation scheme.
算法根据多径信道选择性衰落的特性，结合查表法和拉格朗日乘子的混合迭代搜索法，最优地分配各个子载波的传输比特数。
Based on the analysis and study of the aircrafts ground taxing safety problem, the paper proposed a genetic-tabu hybrid algorithm to solving the optimal taxing path.
在分析和研究机场场面滑行路径的基础上，采用了一种遗传禁忌混合算法来求解滑行路径最优。
Theoretical analysis and experimental results show that the algorithm can find the optimal path.
理论分析和试验结果证明该算法能较好的找到最优路径。
Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient.
Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
The algorithm reduced the unnecessary search space by using anchors and path reuse, and reduced load on server. Finally it discovered a near optimal path.
通过定位点的使用和路径复用，使得无用空间的探索大幅减少，降低了服务器的负载，最终探索出一条接近最优的路径。
A kind of algorithm for the optimal path of manipulation arm, which possesses restraint of joint turning angle based on dynamic solution region and has n degree of freedom, was put forward.
提出了一种基于动态区间映射的数据对象布局算法，在均衡数据分配和最少迁移数据方面都是统计意义上最优的，并且支持按照存储节点的权重分配数据和任意的数据对象副本。
A kind of algorithm for the optimal path of manipulation arm, which possesses restraint of joint turning angle based on dynamic solution region and has n degree of freedom, was put forward.
提出了一种基于动态区间映射的数据对象布局算法，在均衡数据分配和最少迁移数据方面都是统计意义上最优的，并且支持按照存储节点的权重分配数据和任意的数据对象副本。
应用推荐