Comparative Analysis of Optimal Path Search Algorithms

This article discusses widely used algorithms for finding optimal paths. Currently, there is a fairly wide list of algorithms for the problem of finding the shortest path, and is actively used in mobile robotics to find the optimal route. The article offers a two-level system that performs traffic planning. Comparative analysis of various search methods was carried out: their length, complexity, and a number of turning points. The purpose of the article is to study and compare algorithms from the field of artificial intelligence for finding the shortest path in a maze and a hexagonal grid. Algorithms under study: A* (star), Dijkstra algorithm, BFS, DFS, and Greedy algorithm. Algorithms are compared based on two criteria: the length of the found path and the time it takes to find the path. The results, presented analytically and graphically, show the application of five algorithms for mazes with different size and number of obstacles.

Download Full-text

Identification of Optimal Path in Power System Network Using Bellman Ford Algorithm

Modelling and Simulation in Engineering ◽

10.1155/2012/913485 ◽

2012 ◽

Vol 2012 ◽

pp. 1-6 ◽

Cited By ~ 2

Author(s):

S. Hemalatha ◽

P. Valsalal

Keyword(s):

Power System ◽

Transmission Line ◽

Shortest Path ◽

Voltage Stability ◽

Optimal Path ◽

Power Balance ◽

Line Voltage ◽

System Components ◽

Path Search ◽

Search Guidance

Power system network can undergo outages during which there may be a partial or total blackout in the system. In that condition, transmission of power through the optimal path is an important problem in the process of reconfiguration of power system components. For a given set of generation, load pair, there could be many possible paths to transmit the power. The optimal path needs to consider the shortest path (minimum losses), capacity of the transmission line, voltage stability, priority of loads, and power balance between the generation and demand. In this paper, the Bellman Ford Algorithm (BFA) is applied to find out the optimal path and also the several alternative paths by considering all the constraints. In order to demonstrate the capability of BFA, it has been applied to a practical 230 kV network. This restorative path search guidance tool is quite efficient in finding the optimal and also the alternate paths for transmitting the power from a generating station to demand.

Download Full-text

Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system

Indonesian Journal of Electrical Engineering and Computer Science ◽

10.11591/ijeecs.v24.i2.pp1173-1182 ◽

2021 ◽

Vol 24 (2) ◽

pp. 1173

Author(s):

K. Ibrahim Ata ◽

A. Che Soh ◽

A. J. Ishak ◽

H. Jaafar

Keyword(s):

Shortest Path ◽

Ant Colony Algorithm ◽

Optimal Path ◽

Search Tree ◽

Binary Search ◽

Ant Colony ◽

Binary Search Tree ◽

Dijkstra Algorithm ◽

Dijkstra's Algorithm ◽

Parking System

A common algorithm to solve the single-source shortest path (SSSP) is the Dijkstra algorithm. However, the traditional Dijkstra’s is not accurate and need more time to perform the path in order it should visit all the nodes in the graph. In this paper, the Dijkstra-ant colony algorithm (ACO) with binary search tree (BST) has been proposed. Dijkstra and ACO are integrated to produce the smart guidance algorithm for the indoor parking system. Dijkstra algorithm initials the paths to finding the shortest path while ACO optimizes the paths. BST has been used to store the paths that Dijkstra algorithm initialled. The proposed algorithm is aimed to control the shortest path as well as guide the driver towards the nearest vacant available space near the entrance. This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. Moreover, the reason behind using the BST is to make the generation of the path by Dijkstra’s algorithm more accurate and less time performance. The results show a range of 8.3% to 26.8% improvement in the proposed path compared to the traditional Dijkstra’s algorithm.

Download Full-text

Research on Composite Web Services Selection Based on Dijkstra Algorithm

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.596.861 ◽

2014 ◽

Vol 596 ◽

pp. 861-867 ◽

Cited By ~ 1

Author(s):

Yu Qiang Li ◽

Yu Wen Li ◽

Lei Che

Keyword(s):

Web Services ◽

Shortest Path ◽

Feasible Solution ◽

Optimal Path ◽

Shortest Path Problem ◽

Dijkstra Algorithm ◽

Relevant Theory ◽

Composite Web Services

Services composing have played an important role in the industry and academia in recent years. Based on the relevant theory and experience of the shortest path problem in a DAG, we propose the method of dijkstra algorithm implementing services composing way selection. Then we provide the pseudo code description of the algorithm implementing the optimal path selecting process and test the correctness of algorithm through the contrast experiment to offer a feasible solution for services composing way selection.

Download Full-text

Shortest Path Search Futsal Field Location With Dijkstra Algorithm

IJCCS (Indonesian Journal of Computing and Cybernetics Systems) ◽

10.22146/ijccs.34513 ◽

2018 ◽

Vol 12 (2) ◽

pp. 161 ◽

Cited By ~ 1

Author(s):

Delpiah Wahyuningsih ◽

Erzal Syahreza

Keyword(s):

Shortest Path ◽

Destination Node ◽

Dijkstra Algorithm ◽

Initial Node ◽

Shortest Route ◽

Path Search ◽

Surrounding Areas ◽

The City ◽

Shortest Path Search

Pangkalpinang City is a city where futsal field rentals are experiencing growth and improvement. The number of lovers of futsal sport from outside Pangkalpinang city, especially those who are less aware of the streets in Pangkalpinang city will have little difficulty in accessing futsal field places in this city because they do not know in detail information about the route to the futsal field. This research can facilitate futsal players in searching shortest path futsal field with algorithm dijkstra. The dijkstra algorithm determines the shortest path by computing the nodes passed from the initial node to the destination node. Dijkstra algorithm by forming the node graph, the new node then perform the calculation of the number of nodes that will form a new node for the determination of the node to be passed so that the algorithm dijkstra find the smallest node that will form the shortest path in the geographic information system. This system displays the shortest route from the user position to the futsal field which is the destination in the city of Pangkalpinang and surrounding areas.

Download Full-text

Modern Navigation Systems and Related Spatial Query

Geographic Information Systems ◽

10.4018/978-1-4666-2038-4.ch038 ◽

2013 ◽

pp. 631-637 ◽

Cited By ~ 2

Author(s):

Wei-Shinn Ku ◽

Haojun Wang ◽

Roger Zimmermann

Keyword(s):

Shortest Path ◽

Search Algorithms ◽

Navigation Systems ◽

Computational Power ◽

Spatial Query ◽

Positioning Systems ◽

Path Search ◽

Real Time Information ◽

Shortest Path Search ◽

Time Information

With the availability and accuracy of satellite-based positioning systems and the growing computational power of mobile devices, recent research and commercial products of navigation systems are focusing on incorporating real-time information for supporting various applications. In addition, for routing purposes, navigation systems implement many algorithms related to path finding (e.g., shortest path search algorithms). This chapter presents the foundation and state-of-the-art development of navigation systems and reviews several spatial query related algorithms.

Download Full-text

Methods for finding shortest paths on graphs in organizational and economic systems and their implementation

Information Technology and Nanotechnology ◽

10.18287/1613-0073-2019-2416-368-375 ◽

2019 ◽

pp. 368-375

Author(s):

V М Ramzaev ◽

I N Khaimovich ◽

I V Martynov

Keyword(s):

Shortest Path ◽

Shortest Paths ◽

Search Algorithms ◽

Economic Systems ◽

Running Time ◽

Path Search ◽

Shortest Path Search

The article implements the functions in Postgre SQL DBMS, finding the shortest paths on graphs, using the wave algorithm method, the Dijkstra’s method and the Floyd method. The authors determined models of dependencies of the running time of implementations of the shortest-path search algorithms on graphs on the number of graph vertices experimentally. A comparison of the data obtained as a result of the study was carried out to find the best applications of implementations of the shortest path search algorithms in the Postgre SQL DBMS.

Download Full-text

Optimized Graph Search Algorithms for Exploration with Mobile Robot

EMITTER International Journal of Engineering Technology ◽

10.24003/emitter.v9i2.614 ◽

2021 ◽

Vol 9 (2) ◽

pp. 222-238

Author(s):

Aydın GULLU ◽

Hilmi KUŞÇU

Keyword(s):

Mobile Robot ◽

Shortest Path ◽

Hybrid Algorithm ◽

Experimental Studies ◽

Search Algorithms ◽

Graph Search ◽

Dijkstra Algorithm ◽

Unknown Environment ◽

Unknown Environments ◽

Graph Search Algorithms

Graph search algorithms and shortest path algorithms, designed to allow real mobile robots to search unknown environments, are typically run in a hybrid manner, which results in the fast exploration of an entire environment using the shortest path. In this study, a mobile robot explored an unknown environment using separate depth-first search (DFS) and breadth-first search (BFS) algorithms. Afterward, developed DFS + Dijkstra and BFS + Dijkstra algorithms were run for the same environment. It was observed that the newly developed hybrid algorithm performed the identification using less distance. In experimental studies with real robots, progression with DFS for the first-time discovery of an unknown environment is very efficient for detecting boundaries. After finding the last point with DFS, the shortest route was found with Dijkstra for the robot to reach the previous node. In defining a robot that works in a real environment using DFS algorithm for movement in unknown environments and Dijkstra algorithm in returning, time and path are shortened. The same situation was tested with BFS and the results were examined. However, DFS + Dijkstra was found to be the best algorithm in field scanning with real robots. With the hybrid algorithm developed, it is possible to scan the area with real autonomous robots in a shorter time. In this study, field scanning was optimized using hybrid algorithms known.

Download Full-text