Path Planning Algorithm Using the Particle Swarm Optimization and the Improved Dijkstra Algorithm
Authors:
- Hwan Il KangHKHwan Il Kang
- Byunghee LeeBLByunghee Lee
- Kabil KimKKKabil Kim
- 1 December 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1002-1004
Abstract
In this paper, we develop the path planning algorithm using the improved Dijkstra algorithm and the particle swarm optimization. To get the optimal path, at first we construct the MAKLINK on the world environment and then make a graph associated with the MAKLINK. From the graph, we obtain the Dijkstra path between the starting point and the destination point. From the optimal path, we search the improved Dijkstra path using the graph. Finally, applying the particle swarm optimization to the improved Dijkstra path, we obtain the optimal path for the mobile robot. It turns out that the proposed method has better performance than the result.Keywords
This publication has 5 references indexed in Scilit:
- Ant Colony System Algorithm for Real-Time Globally Optimal Path Planning of Mobile RobotsActa Automatica Sinica, 2007
- Path planning for mobile robot using the particle swarm optimization with mutation operator2005
- Potential field methods and their inherent limitations for mobile robot navigation2002
- Efficient method to generate collision free paths for an autonomous mobile robot based on new free space structuring approach2002
- Real-time navigation and obstacle avoidance based on grids method for fast mobile robotsEngineering Applications of Artificial Intelligence, 1995