Abstract
Path planning of autonomous mobile robots in a real-world environment presents several challenges which are usually not raised in other areas. The real world is inherently complex, uncertain and dynamic. Therefore, accurate models of path planning are difficult to obtain and quickly become outdated. Anytime planners are ideal for this type of problem as they can find an initial solution very quickly and then improve it as time allows. This paper proposes a new anytime incremental search algorithm named improved Anytime Dynamic A*(iADA*). The algorithm is based on the currently popular anytime heuristic search algorithm, which is Anytime Dynamic A*(ADA*). The iADA* algorithm improves the calculation of the path lengths and decreases the calculating frequency of the path throughout the search, making it significantly faster. The algorithm is designed to provide an efficient solution to a complex, dynamic search environment when the locally changes affected. Our study shows that the two-dimensional path-planning iADA* experiments were between 2.0 to 3.7 times faster than ADA*, both in partially known and fully unknown dynamic environments. Additionally, in this paper shows the experiment results of the comparison with other four existing algorithms based on computing time and path lengths. iADA* was an average 2.57 times reduced on the computational time for the environment which locally changes effected. For the path length is little increase, but it is not the worst case. According to the experiments, the more the environmental problems and complexity increases, the more iADA* provides a rapid in-search time and total time to obtain the final solution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Connell, D., La, M.H.: Extended rapidly exploring random tree-based dynamic path planning and replanning for moblie robots. Int. J. Adv. Robot. Syst. 15(3), 1–15 (2018)
Mäenpää, P., Aref, M. M. & Mattila, J.: FORMI: a fast Holonomic path planning and obstacle representation method based on interval analysis. Bangkok, Thailand, 2019 IEEE International Conference on Cybernetics and Intelligent Systems (CIS) and IEEE Conference on Robotics, Automation and Mechatronics (RAM), (2019)
Turpin, M., Michael, N., Kumar, V.: Capt: concurrent assignment and planning of trajectories for multiple robots. SAGE. 33(1), 98–112 (2014)
Durrant-Whyte, H., Bailey, T.: Simultaneous localization and mapping : part I. IEEE Robot. Automat. Mag. 13(2), 99–110 (2006)
Hart, P. E., Nillson, J. N. & Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on System Science and Cybernetics (SSC), pp. 100-107, (1968)
Lavalle, S. M. & Kuffner, J.: Rapidly-Exploring Random Trees: Progress and Prospects. [online] Available at: http://dora.eeap.cwru.edu/msb/591/LavKuf01.pdf, (2000)
Luders, B. D., Karaman, S. & How, J. P.: Robust Sampling-based Motion Planning with Asymptotic Optimality Guarantees. s.l., s.n, (2013)
Kavraki, L.E., Svestka, P., Latombe, J.-C., Overmars, M.H.: Probabilistic roadmaps for path planning in high dimensional configuration spaces. Robot. Automat. IEEE Transact. 12(4), 566–580 (1996)
Stentz, A.: The Focussed D* Algorithm for Real-Time Replanning. Montreal, Quebec, Canada , Proceedings of the International Joint Conference on Artificial Intelligence, (1995)
Koenig, S. & Likhachev, M.: D*Lite. American Association for Artificial Intelligence, (2002)
Ferguson, D., Likhachev, M. & Stentz, A.: A Guide to Heuristic-Based Path Planning. Ferguson, ICAPS, (2005)
Likhachev, M. & Koenig, S.: Lifelong Planning A* and Dynamic A* Lite. The proofs. Technical report, College of Computing, Georgia Institute of Technology,Atlanta,(2001)
Ganapathy, V., Yun, S.C., Chien, T.W.: Enhanced D* lite algorithm for autonomous Mobile robot. Int. J. Appl. Sci. Technol. 1(1), 53–78 (2011)
Przybylski, M., Putz, B.: D* extra life : a dynamic A* with search-tree cutting adn frontier-gap Reparing. Int. J. Appl. Math. Comput. Sci. 27(2), 273–290 (2017)
Hansen, E.A., Zhou, R.: Anytime heuristic search. J. Artif. Intell. Res. 28, 267–297 (2007)
Likhachev, M. et al.: Anytime Dynamic A*: an Anytime, Replanning Algorithm. California, ICAPS, (2005a)
Pohl, I.: Heuristic search viewed as path finding in a graph. Artificial Intelligence, pp. 193-204, (1970)
Zhou, R. & Hansen, E. A.: Multiple Sequence Alignment Using Anytime a*. Edmonton, Alberta, Candana, Eighteenth national conference on Artificial intelligence, (2002)
Likhachev, M., Gordon, G. & Thrun, S.: ARA*: Anytime A* with Provable Bounds on Sub-Optimality. British Columbia, Canada, NIPS, (2003)
Ishida, T. & Shimbo, M.: Improving the Learning Efficiencies of Realtime Search. USA, Proceedings of the National Conference on Artificial Intelligence, (1996)
Likhachev, M. et al.: Anytime Dynamic A*: The Proofs, Carnegie Mellon School: Technical Report CMU-RI-TR-05-12, (2005b)
Hernandez, C., Asin, R. & Baier, J. A.: Improving MPGAA* for Extended Visibility Ranges. Austin ,Tx, USA, 19th AAAI Conference on Artificial Intelligence, (2015)
Sturtevant, N.R.: Benchmarks for grid-based Pathfinding. IEEE Transact. Comput. Intell. AI Games. 4(2), 144–148 (2012)
Acknowledgements
This research was supported by Konkuk University in 2018.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Maw, A.A., Tyan, M. & Lee, JW. iADA*: Improved Anytime Path Planning and Replanning Algorithm for Autonomous Vehicle. J Intell Robot Syst 100, 1005–1013 (2020). https://doi.org/10.1007/s10846-020-01240-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10846-020-01240-x