dijkstra算法 meaning in Chinese
dijkstra's algorithm
Examples
- In the part of upper - layer software , new global path planningalgorithm , which is based on improved dijkstra algorithm and ant system algorithm , is givenin the thesis , and the new algorithm is proved to be valid in simulation , the map representationproblemofspatialandslamproblemformobilerobotare brieflyanalyzed
在上层软件部分,提出了以改进的dijkstra算法和蚁群优化算法为基础的新的全局路径规划算法,并仿真验证了该算法的有效性,初步分析了移动机器人的环境空间地图表示问题和slam问题。 - Main technic of giss webgiso thus function modules architecture and network topological structure are confirmed webgis system implements the basic function of electronical map , such as map zoonu pan , and the abundant query of geograph and database by using maplnfo mapxtreme for java as map server and jsp . , java technico this system also can implement the routing of linesx analysing of buffer and so on0 this paper advances storage model of roads and pipelines topology data , efficiently solves the maintenace problem of network topology data of webgis and implements the shortest path algorathm based on webgis by improving it0 the system has better opening by suppling database interface of map ? the system has perfect on - line help and user forum and favorable interfaces and implementation of this system makes fundament for the further research of webgiso
本系统利用mapinfomapxtremeforjava作为地图服务器，采用jsp和java技术，实现了基于webgis的电子地图的缩放、漫游等基本功能，并具有丰富的图文定位查询功能；实现线路路由、缓冲区分析等辅助决策功能；构建了道路管线网络拓扑数据的存储模型，有效地解决了基于webgis的网络拓扑数据的维护问题；对dijkstra算法进行了一些改进，实现了基于webgis的最短路径算法；本系统提供了电子地图数据库接口，使本系统具有很好的开放性和通用性； webgis系统软件具有完善的在线帮助和用户交流论坛，人机界面友好。 - By analyzing the normal parallel method and comparing parallel routing table computation based warr and jesper ' s parallel dijkstra algorithm , propose a scheme of distributed implementation of ospf protocol . secondly , based on the warr , we propose a wholely distributed implementation method of ospf
分析了可扩展tbit路由器结构的特点以及分布式系统协议并行的一般方法，并对基于warr方法的并行路由表计算和jesper的并行dijkstra算法进行比较，选取加速ospf协议路由表计算的方法。 - Second , dijkstra algorithms is discussed and improved on this paper as a result , d * algorithms is proposed in order to meet qos requests , in which dijkstra is repeatedly employed to successively eliminate those undesired nodes and links and simplify the network . thus , d can improve the convergence of the algorithms
其次讨论了dijkstra算法，并对此算法进行了改进，提出了d ~ *算法，即为满足qos请求的需要，多次运用dijkstra算法，在网络中依次删除不满足要求的结点及链路，逐渐简化网络，从而达到提高算法收敛性的目的。