
Improving the artificial potential field by A-star to solve the local minima problem
- 1 The University of Sheffield
* Author to whom correspondence should be addressed.
Abstract
This paper discusses the method for artificial potential field in traditional sense. It is based on the algorithm with the planning of physics that guides a robot along a gradient toward a target endpoint by applying forces with gravitation and repulse within a robot environment. The article proposes to improve the potential field method by incorporating the A-star algorithm for the improvement of path planning in accuracy and efficiency. The A-star algorithm uses a cost function to measure the goodness of a node and finds the optimal path totally and thoroughly through heuristic search. The proposed method uses the A-star algorithm to generate the optimal path, which takes potential field and its method as basis, thus repeating the process until the robot reaches the end point. By combining the A-star algorithm and the method based on artificial potential field, the robot's driving route is made more reasonable, and thus testing and verifying how the method works through an experiment with simulation.
Keywords
traditional artificial potential field method, A-star algorithm, path planning.
[1]. Ghasemi, M., Fathi, M., and Sadati, N. 2012 An improved artificial potential field method based on A* algorithm for mobile robot path planning. International Journal of Advanced Robotic Systems, 9(7), 235.
[2]. Li, H., Liu, W., Zhu, H., and Zhang, C. 2016 A novel dynamic artificial potential field algorithm with A* optimization. Journal of Intelligent and Robotic Systems, 81(2), 307-320.
[3]. Gupta, N., Konolige, K., and Bowman, J. 2014 An A* algorithm with artificial potential field for mobile robot path planning. Robotics and Autonomous Systems, 62(6), 761-772.
[4]. Shen, Y., Ye, S., Zhan, J., and Wang, H. 2017 An improved A* algorithm based on artificial potential field for robot path planning. Journal of Intelligent and Robotic Systems, 86(3-4), 591-605.
[5]. Jing, M., and Xiong, X. 2020 Path planning of mobile robot based on improved artificial potential field method with A* algorithm. 2020 IEEE 3rd International Conference on Information Science and Systems (ICISS), 262-267.
[6]. Khatib, O. 1986 Real-time obstacle avoidance for manipulators and mobile robots. The International Journal of Robotics Research, 5(1), 90-98.
[7]. Ge, S. S., and Cui, J. 2002 New potential functions for mobile robot path planning. IEEE Transactions on Robotics and Automation, 18(2), 267-278.
[8]. Park, F. C., and Lee, J. H. 2002 Adaptive potential field method for mobile robot navigation. Journal of Intelligent and Robotic Systems, 34(1), 59-73.
[9]. Li, J., He, J., and Peng, H. 2019 Reinforcement learning-based adaptive potential field method for obstacle avoidance of mobile robots. Journal of Intelligent and Robotic Systems, 96(3), 531-545.
[10]. Zhang, Y., Yang, S., and Wang, J. 2020 Deep neural network-based potential field method for robot path planning. IEEE Transactions on Industrial Informatics, 16(10), 6563-6573.
Cite this article
Wu,D. (2023). Improving the artificial potential field by A-star to solve the local minima problem. Applied and Computational Engineering,11,34-39.
Data availability
The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.
Disclaimer/Publisher's Note
The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
About volume
Volume title: Proceedings of the 2023 International Conference on Mechatronics and Smart Systems
© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and
conditions of the Creative Commons Attribution (CC BY) license. Authors who
publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons
Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this
series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published
version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial
publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and
during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See
Open access policy for details).