Utilizing the shortest path algorithm in Graph Theory to search functional dimension chains automatically in the assembly model and ascertain the functional dimensions of the part.
运用图论中的最短路径搜索算法从装配模型中自动搜索出功能约束尺寸链，确定零件的功能尺寸。
The algorithm consists of Cell Shape, Graph Search, Local Path Planning, Cell Splitting, Probabilistic Sampling.
该算法主要由栅格形状，图搜索，局部规划器，栅格分解，栅格抽样等部分组成。
In all the applications of search algorithm, people always focus on the map Path-Finding.
在搜索算法的各种应用中，人们一直关注的是地图寻径问题。
After analyzing and comparing some path search algorithms, the paper ultimately adopted a simple single threshold algorithm and attained optimal parameters through simulation.
本文分析、比较了现有的几种路径搜索算法，最后采用一种比较简单的单门限算法，并通过仿真得到参数最优值。
On uncertain network, through the construction of distribution network, we have proposed Shortest Path Search algorithm Based on the thinking of dynamic programming.
在网络不确定情况下，通过对配送网络的构建，提出了基于动态规划思想的最短路径搜索算法。
Making use of precomputation, algorithm ERAMC simplifies network topology and USES a breadth-first search algorithm with priority to find a transmission path that satisfies multiple constraints.
ERAMC算法利用预先计算来简化网络拓扑，然后采用带优先权的宽度优先搜索算法寻找满足多个限制条件的传输路径。
This article gives an algorithm of building search path, which has a more efficient space and time complexity.
本文提出了一种基于宽度优先搜索的路径生成算法，具有较好的时间复杂性和空间复杂性。
An effective evaluation function is constructed, which use the signal line on the propagation path among the fault point and primary outputs. That makes the algorithm has the minimal search space.
该算法基于遗传算法，使用故障信号传播路径上的信号线来构造算法的评价函数，使得算法具有最小的搜索空间。
The path optimization problem belongs to combinatorial optimization problems, which is solved generally by using heuristic search algorithm.
路径优化问题属于组合优化问题，而解决组合优化问题一般使用启发式搜索算法。
This paper proposes a breath-first search based data collection tree algorithm that taking in account size of backbone, energy of node and path. The data collection tree is maintained locally.
本文综合考虑骨干网的大小、节点能量及路径，提出了一种基于广度优先搜索的数据收集树算法，并采用局部式方法进行维护。
This paper analyzed the disadvantages of the traditional algorithm of hex-path odor searching algorithm, which can guide a mobile robot with single gas sensor to search for underground odor source.
分析机器人依靠传感器通过测量地表土壤中气味浓度搜索地下气味源的定步长六边形路径算法的不足，对其进行改进。
And the feasible path was obtained by using RRT algorithm to perform random search of path node.
采用RRT算法，通过随机搜索路径节点，得到可行姿态路径。
This paper presents a trust path search algorithm based on random walk, which is able to improve the search by using the path information in the past.
传统的局部信任模型采用简单洪泛的方法获得信任信息，针对该方法效率较低且对网络资源消耗较大的问题，提出一种基于随机漫步的搜索信任路径的算法。
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算法求得不完全无向图中各节点间的最短路径和最短路径长度，然后设计了捕食搜索算法对模型进行求解。
At the same time, neighborhood search methods and the Calculation of Path difference designed to speed up algorithm speed.
同时设计了邻域搜索办法和路径差的计算办法，加快了算法的运行速度。
The method can improve the efficiency of path planning effectively, and can be applied to reduce the search space of other algorithm of path planning to increase the convergence speed.
该方法可有效提高航路规划效率，缩小其他航路规划算法的搜索空间，加速算法收敛。
Studied a kind of search algorithm based on grid and used in Path Planning for the robot.
研究了一种基于栅格法的搜索算法，并把该算法用于机器人的路径规划。
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.
算法根据多径信道选择性衰落的特性，结合查表法和拉格朗日乘子的混合迭代搜索法，最优地分配各个子载波的传输比特数。
According to this hybrid trust model, it presents an algorithm constructing a path base on a depth first search, and summarizes the path validation algorithm.
针对该信任模型，提出一种深度优先搜索的路径构建算法，并对路径验证算法进行了概述。
This method USES intermediate nodes' location information to create undirected graph at destination node, and USES Breath-First Search (BFS) algorithm to find another disjoint path.
本文提出的方法在目的端利用获得的中间节点位置信息来生成无向图，再利用广度优先遍历算法BFS计算出另外一条不相交路径。
This algorithm consists of heuristic-based search algorithm, primal-dual-based optimal path selection algorithm and channel assignment adjustment algorithm.
包括启发式路径搜索算法、基于原始-对偶算法的最优路径选择算法、信道分配调整算法等三个部分。
Based on the research of the rules to compose the interlocking table and simple path search of graph, we design an algorithm to generate the interlocking table from signal arrangement.
研究和实现了图论中无向图的简单路径查找算法，对连锁表的编制规则进行了总结，实现了相应的联锁表自动生成算法。
The basic theory of ant colony algorithm is applied to shortest path search in the logistics network of distribution for reducing the cost of logistic distribution.
将蚁群算法的基本原理用到物流配送网最短路径搜索中，对降低配送成本有重要意义。
Then following the existing path-following method for solving BMI problem, an iterative LMI algorithm is proposed to locally search the desired output-feedback gain.
进一步，在问题有解时，通过极小化增益矩阵元素绝对值的和，给出了求解期望低成本输出反馈控制的算法。
An improved Ant Colony Algorithm (ACA) is presented that can be used to search shortest grinding path for the grinding machine and the grinding path optimization mathematical model is given.
提出一种适用于钢坯修磨轨迹优化问题的改进蚁群算法，给出一种修磨轨迹优化问题的实用数学模型。
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.
通过定位点的使用和路径复用，使得无用空间的探索大幅减少，降低了服务器的负载，最终探索出一条接近最优的路径。
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.
通过定位点的使用和路径复用，使得无用空间的探索大幅减少，降低了服务器的负载，最终探索出一条接近最优的路径。
应用推荐