Abstract
This paper presents an efficient grid-based robotic path planning algorithm. This method is motivated by the engineering requirement in practical embedded systems where the hardware resource is always limited. The main target of this algorithm is to reduce the searching time and to achieve the minimum number of movements. In order to assess the performance, the classical A* algorithm is also developed as a reference point to verify the effectiveness and determine the performance of the proposed algorithm. The comparison results confirm that the proposed approach considerably shortens the searching time by nearly half and produces smoother paths with less jagged segments than A* algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Reif, J.H.: Complexity of the mover’s problem and generalizations. In: Proceeding of the 20th IEEE Symposium on Foundations of Computer Science, pp. 421–427. IEEE, New York (1979)
Burgard, W., Cremers, A.B., Fox, D., Hahnel, D., Lakemeyer, G., Schulz, D., Steiner, W., Thrun, S.: The interactive museum tourguide robot. In: Proceeding of the Fifteenth National Conference on Artificial Intelligence, Madison, Wisconsin, United States, pp. 11–18 (1998)
Arai, T., Pagello, E., Parker, L.E.: Advanced in multi-robot systems. IEEE Transactions on Robotics and Automation 18(5), 655–661 (2002)
Al-Sultanl, K.S., Aliyul, M.D.S.: A new potential field-based algorithm for path planning. Journal of Intelligent and Robotic Systems (17), 265–282 (1996)
Taha, T., Valls Miro, J., Dissanayake, G.: Sampling based time efficient path planning algorithm for mobile platforms. In: Proceeding of the 2006 International Conference on Man-Machine Systems (ICoMMS 2006), Langkawi, Malaysia (2006)
Zhou, R., Hansen, E.A.: Breadth-first heuristic search. Artificial Intelligence 170(4), 385–408 (2006)
Vacariu, L., Roman, F., Timar, M., Stanciu, T., Banabic, R., Cret, O.: Mobile robot path planning implementation in software and hardware. In: Proceedings of the 6th WSEAS International Conference on Signal Processing, Robotics and Automation, pp. 140–145 (2007)
Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics (2), 100–107 (1968)
Nash, A., Daniel, K., Koenig, S., Felner, A.: Any-angle path planning on grids. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 1177–1183 (2007)
Šišlák, D., Volf, P., Pěchouček, M.: Accelerated a* trajectory planning: Grid-based path planning comparison. In: Proceedings of ICAPS 2009 Workshop on Planning and Plan Execution for Real-World Systems, Greece, pp. 74–81 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, A., Niu, Q., Zhao, W., Li, K., Irwin, G.W. (2010). An Efficient Algorithm for Grid-Based Robotic Path Planning Based on Priority Sorting of Direction Vectors. In: Li, K., Fei, M., Jia, L., Irwin, G.W. (eds) Life System Modeling and Intelligent Computing. ICSEE LSMS 2010 2010. Lecture Notes in Computer Science, vol 6329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15597-0_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-15597-0_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15596-3
Online ISBN: 978-3-642-15597-0
eBook Packages: Computer ScienceComputer Science (R0)