Application of Shortest Path Algorithm to GIS Using Fuzzy Logic. 4th International Symposium of Hungarian Researchers on Computational Intelligence, November 13-14, Budapest, Hungary.Application of Shortest Path Algorithm to GIS Using Fuzzy Logic - Petrík, Madarász, et al. - 2003...
theleastcrossing,itismoresuitablefortheactualtrafficthanDijkstraalgorithm. Keywords:shortestpathalgorithm;Dijkstraalgorithm;A 倡 algorithm 引言 随着计算机技术和空间信息技术的发展与普及, 基于计算机技术、地图学等多学科交叉的地理信息系 统(GIS)已经被应用于人们日常的生产和生活当中。
第32卷第6期V01.32No.6长春师范学院学报(自然科学版)JournalofChangchunNormalUniversity(NaturalScience)2013年12月Dec.2013最短路径算法在校园地理..
The Dijkstra algorithm is the publicly recognized as a better algorithm at home and abroad in the shortest path solution. Improved from Djikstra algorithm, this paper introduces the adjacent point and adjacent edge structure to represent a diagram and regards the weight as the trigger of the ...
Pathfinding is the method for determining the shortest path. Pathfinding is widely used in various fields of Computer Science. One of them is game development. This research will design and analyze the pathfinding using the A-Star algorithm and implement it on a tree planting game. The Artificial...
of a shortest path in a graph with matrix-valued edges. To this end, we define a meaningful way for quantifying the path length for matrix-valued edges, and we propose a simple yet effective algorithm to compute the respective shortest path. While our formalism is universal and thus ...
updatethepathforthenewjoiningnodes.Reducethecostofnetworkcenternoderoutingcomputation. 【Keywords]Potentialalgorithm;Distributed;Theshortestpath. 1.Introduction Wirelesssensornetwork(WSN)istheresultofthecross-development of micro -electronics mechanicalsystem,computer, communication, automationandartificialintelligence ...
The algorithm presented in this paper requires the set of all-pairs shortest paths in a directed and edge-weighted graph. We also propose an efficient All-Pairs Shortest Path algorithm by exploiting a special topological property of the graph. Comparative experiments show that the proposed data ...
theory to solve the K shortest path problem. The K shortest path algorithm is particular useful to find the possible paths for travelers in real-world. The computational performance of the three approaches in large network is explored. This study will be useful for transportation engineers to choo...
Keywords:pathplanning;autonomousunderwatervehicle;geneticalgorithm(GA);particleswarm optimization(PSO):antcolonyoptimization(ACO);collisionavoidance ArticleID:1671-9433(2012)033789 1Introduction Inthepasttwodecades,modelingandcontrolofautonomous underwatervehicles(AUVs)havebecomeintenseareasof oceanicresearchbecauseof...