查询词典 shortest path

Based on the triangulation of the state space of a robot, a dual graph was constructed following the target attractive principle, and then a path planning algorithm was presented to find a sequence of adjacent triangles that were traversed by the shortest path.

对机器人的状态空间进行三角划分，根据目标吸引原理来建立其对偶图，针对对偶图提出路径规划算法得到最短路径穿越的三角形序列。

The path taken by the tennis ball illustrates an object taking the shortest path through curved spacetime.

网球的移动路径说明了物体在扭曲时空沿最短路径移动。

Use C language to find that the "maze" matrix optional path and find the shortest path displayed.

运用C语言实现寻找输入的"迷宫"矩阵中的可选路径，并将找到的最短路径显示出来。

The shortest path algorithm is one of the important question in pathfinding,and it is the base of the best path finding algorithm.

最短路径算法是路径搜索领域的重要问题，也是最优路径分析算法的基础。

GIS network path analysis is the hotspot of GIS research,while the shortest path is the most basic and the most pivotal problem,so the research on it was never interrupted.Based on the Dijkstra algorithm combined with the GIS its own chrematistics,a lot of improvement has been adopted compared with the traditional Dijkstra algorithm.

GIS网络剖析是GIS的研讨暖点和难点，而最短路径题目是GIS网络剖析中最基本和最关键的题目，海内外大量专家学者对最短路径题目入行过深入研讨，提出了多种解决最短路径题目的算法。

Image segmentation based on the graph concept is analyzed in our thesis, a boundary finding problem is formulated as a shortest-path problem in a graph, then a watershed algorithm based ort image foresting transfonn is introduced, which is a unified and efficient approach for simplifying image processing problems to a minimum-cost path forest problem .

将图的概念应用于图像分割的研究中，把边界发现问题归结为图中的最短路径问题，从而引入了一种基于图像森林化变换(Image Foresting Transform，该方法是把图像处理问题简化为在图中求解最短路径森林问题的一种统一有效的方法)的分水岭算法，并分析了平滑滤波、梯度阈值在图像分割中的作用。

Basing on this, this paper proposes a generalized shortest path method. That is, by constructing an intermodal-network multi-ply graph which interrelates the data and information in transit with the nodes and sides of the graph, adding virtual origin and destination stations to the graph, and then analyzing transport costs and transfer costs, this paper applies the Dijkstra algorithm to solve the intermodal optimal transport path problem so as to get the intermodal transport plan with the least generalized costs.

在此基础上，提出一种求解最佳运输路线的广义最短路法，即通过构建多式联运网络多重图，将运输过程中的数据、信息和图中的节点、边关联起来，然后对运输费用和中转费用进行分析估计，并通过在联运网络图中加入虚拟的发、到站，使得该问题可用Dijkstra算法进行求解，从而获得广义费用最少的联运方案。

This study investigated the ant groups algorithm to solve the problem of traveling salesman. The target of the article is that on the map G detect the shortest length of the Hamilton Circle, namely one pair of C n cities and only visit one of the shortest closed curve.

论文主要是研究蚁群算法来解决旅游商问题，其目标是从无向图G中寻出长度最短的Hamilton 圈，此即一条对C中n个城市访问且只访问一次的最短封闭曲线。

Not considering the restriction of the depot s transporting ability in the existing achievement of emergency dispatch, consequently, this chapter establishes a sole-resource optimized dispatch model aimed at "the shortest dispatch time" which includes the constraint of transporting ability under time restriction firstly. Moreover, the chapter deduces the algorithm of the model by mathematical induction step by step. Secondl y, it simplifies the former model and gives a simpler sole-objective model and corresponding algorithm including the constraint of transporting ability. At last, on the basis of the improved model, this chapter discusses a two-phase programming model and a multi-objective programming model which are aimed at "the shortest dispatch time" and "the fewest number of mobilized depots" including the constraint of transporting ability under time restriction.

由于现有应急调运的研究成果中没有考虑到各物资供应点受运输能力的约束，因此本章首先建立限制期内以"应急调运时间最短"为目标且含有运输能力约束的单物资调运优化模型：并利用逐步递推法推导出具体的求解算法；然后，进一步地将此模型及算法进行简化，建立更加简单的含有运输能力约束的单目标优化模型：并且讨论其算法；最后，在改进的优化模型的基础上，讨论限制期内含有运输能力约束且以"调运时间最短"、"出动的供应点数目最少"为目标的双层规划及多目标规划的优化模型及解法。

The main target of emergent material transport is to transport the emergent vehicles to the demand point in the shortest time. The core of this research is the problem of shortest route selection.

应急物资调运主要是应急车辆在最短的时间内把应急物资运送到需求点，其研究的核心是最短路径选择问题。

Summary In copyright infringement cases,if the alleged infringer uses or even plagiarizes the copyrighted works or parts thereof,which causes no substantially adverse effect on the normal exploitation of the work,nor does it inflict any substantial damages to the right owner,the de minis doctrine should be applied to exempt the liabilities of the defendant and seek the balance of interests between the right owner and the general public embodied by the copyright law.

在侵犯著作权案件中，如果被控侵权行为人虽未经著作权人的同意，使用甚至抄袭了受著作权保护的作品或作品的片段，但若情节轻微，未对该作品的正常使用产生任何实质不利的影响，亦未对权利人的权利造成实质性的损害，则应适用&不计琐细原则&，免除行为人的责任，以寻求在权利人利益与著作权法所体现的社会公共利益之间的平衡。

This new product will become our best seller.

这个新产品会成为我们最畅销的产品。