Target Searching of Mobile Robots Using Improved A* Searching Algorithm

Abstract:

The paper studies motion path planning problem using improved A* searching algorithm, and implements the movement scenario using mobile robot system. Solving the shortest path problem, Dijkstra algorithm can finds the shortest path to solve the path searching problem. The searching depth is not applicable in certain circumstances to be a disadvantage. The paper proposed improved A* searching algorithm using the intelligent node judgment method, it not only be able to retain the advantages of the traditional A* algorithm but also improve the shortcomings. It programs the on-time motion path in dynamic environment; it also programs the motion path more closed to the best path. Finally, the paper uses multiple strategies to improve the searching motion path to be the best motion path, and compares with the traditional A* algorithm to reduce the searching time.

• Periodical: Applied Mechanics and Materials (Volumes 300-301)
• Pages: 519-522
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.300-301.519
• Online since: February 2013
• Authors: Chih Hung Chang, Jie Tong Zou, Kuo Lan Su
• Keywords: Dijkstra Algorithm, Improved A* Searching Algorithm

References

[1] Y. Y. Ding, H. Yang, Jing-ping Jiang: Self-organizing multi-robot system based on personality evolution, IEEE International Conference on Systems (2002), p.6.

DOI: 10.1109/icsmc.2002.1176414

[2] K. L. Su, Y. S. Li, Y. H. Ting and J. S. Jhuang: Develop a Fire Fighting Robot for Home Security System, The Annual Mechatronic and Industry Interact Cross Strait, (2006), p.24.

[3] K. Sugihara and J. Smith: Genetic algorithm for adaptive motion planning of an autonomous mobile robot, International Symp. on Comp. Intelligence in Robotics and Auto. (1997), p.138.

[4] X. F. Dai, X. M. Ning and Y. Shi: A novel path planning algorithm for mobile robots based on cloud model, ICIC Express Letters, Vol. 3, N0. 4(A), p.877, (2009).