Based on those two methods, a new algorithm - Double Propagating Wave algorithm is presented to find a optimum global path.
在这两种方法的基础上，本文提出了基于双波传播算法的全局路径规划方法。
Abstract: a path searching algorithm using contour is presented to obtain the shortest path between two points on a curved surface under the slope constraint.
文摘：给出了一种基于等高线求解坡度约束下曲面上两点间最短路径的搜索算法。
The paper introduced two kinds of graph theory algorithm which is suitable to select other nodes and estimate relating path in actual system on basis of finding out shortest path of node.
在分析过程中以寻求节点最短路径为基础，介绍了两条图论算法，并且这种算法适用于实际系统中其它节点选取以及关联路径的判断。
In this paper, a new routing approach based on discrete particle swarm optimization algorithm is briefly discussed to obtain the optimum path between two nodes in the network.
针对不同的网络实际条件，提出一种改进的离散粒子群算法来寻找网络中任意两个节点间的最优路由。
On the basis of the global model, the algorithm of intelligent decision is developed, which is made up of two parts: path planning and velocity planning.
在此基础上开发了智能决策算法，算法包含路径选优和速度规划两部分；
To solve the model, the shortest path and its length of every two nodes in the incomplete undigraph are calculated with FLOYD algorithm, and a predatory search algorithm is designed for the solution.
为了求解上述模型，首先利用FLOYD算法求得不完全无向图中各节点间的最短路径和最短路径长度，然后设计了捕食搜索算法对模型进行求解。
A path searching algorithm using contour is presented to obtain the shortest path between two points on a curved surface under the slope constraint.
给出了一种基于等高线求解坡度约束下曲面上两点间最短路径的搜索算法。
A composite path algorithm for reliability evaluation of two state flow networks is proposed. Based on the CPE algorithm of s.
提出了两状态流约束通讯网络可靠度计算的一个组合路算法，算法在S。
No need to change the network topology circumstances, the path optimization between two arbitrary nodes is obtained by the iterative algorithm.
在不改变网络的拓扑结构的情况下，该算法可同时获得所有任意两点间的最优路径。
In this paper, we revise the graphical method by means of the Shortest path algorithm, and obtain two variants which are pseudo-polynomial algorithms.
本文利用最短路算法修订了图上作业法，得到了两个拟多项式算法。
Meanwhile, combining these two ideas, we propose a new kind of single-source shortest path algorithm based on bucket structure, which has good time complexity and parallelism property.
同时，提出了结合这两类算法思想的一种基于桶结构的单源最短路径串行算法，算法具有好的运行时间复杂度和可并行性。
Three algorithms are presented for computing the shortest path between two arbitrary points on a polyhedral surface: One is an approximate algorithm;
提出计算多面体面上任意两点之间最短路径的算法：近似算法、最短路径或近似最短路径算法。
Based on Fermat's principle, the paper USES full-path iterative algorithm to realize 3-d VSP two-point ray tracing in volume element model.
本文基于费马原理，利用全路径迭代算法实现体元模型中的三维VSP两点射线追踪。
Based on Fermat's principle, the paper USES full-path iterative algorithm to realize 3-d VSP two-point ray tracing in volume element model.
本文基于费马原理，利用全路径迭代算法实现体元模型中的三维VSP两点射线追踪。
应用推荐