Abstract
The state-of-the-art graph searching algorithm applied to the optimal global path planning problem for mobile robots is the A* algorithm with the heap structured open list. In this paper, we present a novel algorithm, called the L* algorithm, which can be applied to global path planning and is faster than the A* algorithm. The structure of the open list with the use of bidirectional sublists (buckets) ensures the linear computational complexity of the L* algorithm because the nodes in the current bucket can be processed in any sequence and it is not necessary to sort the bucket. Our approach can maintain the optimality and linear computational complexity with the use of the cost expressed by floating-point numbers. The paper presents the requirements of the L* algorithm use and the proof of the admissibility of this algorithm. The experiments confirmed that the L* algorithm is faster than the A* algorithm in various path planning scenarios. We also introduced a method of estimating the execution time of the A* and the L* algorithm. The method was compared with the experimental results.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Arrora, S., Barak, B.: Computational Complexity: A Modern Approach, 594 p. Cambridge University Press, New York (2009)
Brodal, G.S., Lagogiannis, G., Trajan, R.: Strict fibonacci heaps. In: Proceedings of the 44th Symposium on Theory of Computing, p. 1177 (2012)
Daniel, K., Nash, A., Koenig, S., Fernel, A.: Theta*, any-angle path planning on grids. J. Artif. Intell. Res. 39, 533–579 (2010)
Dial, R.B.: Algorithm 360: shortest-path forest with topological ordering. Commun. ACM 12(11), 632–633 (1969)
Edelkamp, S., Schroedl, S.: Heuristic Search—Theory and Applications. Morgan Kaufmann, San Mateo (2012)
Fredman, M.L., Trajan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34(3), 596–615 (1987)
Hatem, M., Burns, E., Ruml, W.: Faster Problem Solving in Java with Heuristic Search. IBM Developer Works (2013)
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination f minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)
Hernandez, C., Baier, J.A., Asin, R.: Making A* run faster than D*-lite for path-planning in partially known terrain. In: Twenty-Fourth International Conference on Automated Planning and Scheduling (2014)
Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robot. Res. 5(1), 90–98 (1986)
Kliemann, L., Sanders, P.: Algorithm Engineering: Selected Results and Surveys. Springer International Publishing, Basel (2016)
Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artif. Intell. 155(1–2), 93–146 (2004)
Koenig, S., Likhachev, M.: D* Lite. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 476–483 (2002)
Latombe, J.-C.: Robot Motion Planning, p. 651. Kluwer Academic Publisher, Dordrecht (1991)
Niewola, A.: Rough surface description system in 2,5d map for mobile robot navigation. J. Autom. Mob. Robot. Intell. Syst. 7(3), 57–63 (2013)
Niewola, A., Podsedkowski, L.: Nonholonomic mobile robot path planning with linear computational complexity graph searching algorithm. In: 2015 10th International Workshop on Robot Motion and Control (RoMoCo), pp. 217–222 (2015)
Nilsson, N.: Principles of Artificial Intelligence, p. 476. Tioga Publishing Company, Pato Alto (1980)
Podsedkowski, L.: Path planner for nonholonomic mobile robot with fast replanning procedure. In: IEEE International Conference on Robotics and Automation, pp. 3588–3593 (1998)
Stentz, A.: Optimal and efficient path planning for partially-known environment. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA ’94), pp. 3310–3317 (1994)
Stentz, A.: The focussed D* algorithm for real-time replanning. The focussed D* algorithm for real-time replanning. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 1652–1659 (1995)
Sturtevant, N.R.: Benchmarks for grid-based pathfinding. IEEE Trans. Comput. Intell. AI Games 4(2), 144–148 (2012)
Nguyet, T.T.N., Hoai, T.V., Thi, N.A.: Some advanced techniques in reducing time for path planning based on visibility graph. In: 2011 Third International Conference on Knowledge and Systems Engineering (KSE), pp. 190–194 (2011)
Ho, Y.-J., Li, J.-S.: Collision-free curvature-bounded smooth path planning using composite bezier curve based on voronoi diagram. In: 2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation, pp. 463–469 (2009)
Zhiye, L., Xiong, C.: Path planning approach based on probabilistic roadmap for sensor based car-like robot in unknown environments. In: 2004 IEEE International Conference on Systems, Man and Cybernetics, pp. 2907–2912 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Niewola, A., Podsedkowski, L. L* Algorithm—A Linear Computational Complexity Graph Searching Algorithm for Path Planning. J Intell Robot Syst 91, 425–444 (2018). https://doi.org/10.1007/s10846-017-0748-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10846-017-0748-6