Abstract
Today, Automatic Guided Vehicles (AGVs) with a path planning algorithm are being used in many industrial fields. There are A*, D*, and D* lite algorithms in the path planning algorithm. In this paper, propose a modified D* lite algorithm using the most efficient D* lite among these algorithms. The modified D* lite path planning algorithm is proposed to improve these D* lite path planning algorithm’s weaknesses such as traversing across obstacles sharp corners, or traversing between two obstacles. The modified D* lite path planning algorithm has function to set target points differently from the existing D* lite path planning algorithm. To do this task, the followings are done. First, a work space is divided into square cells. Second, cost of each edge connecting current node to neighbor nodes is calculated. Third, the shortest paths from the initial point to all multiple target points are computed and the shortest paths from any target point to remaining target points including the goal point are computed by using Hamilton path. Fourth, a cost-minimal path is re-calculated as soon as the laser sensor detects an obstacle and make an updated list of target points. Finally, the validity of the proposed modified D* lite path planning algorithm is verified through simulation and experimental results in known environment.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Likhachev, M., Koenig, S.: Lifelong planning A* and dynamic A* lite: the proofs. Technical report, Atlanta (2001)
Choset, H.: Robotic motion planning: A* and D* search. Robotics Institute (2007)
Setiawan, Y.D., Pratama, P.S., Jeong, S.K., Vo, H.D., Kim, S.B.: Experimental comparison of A* and D* lite path planning algorithm for differential drive automated guided vehicle. Lecture Notes in Electrical Engineering, vol. 282, pp. 555–564 (2013)
Setiawan, Y.D., Pratama, P.S., Kim, J.W., Kim, D.H., Jeong, Y.S., Kim, S.B.: Path replanning and controller design for trajectory tracking of automated guided vehicles. In: International Conference on Advances in Computing, Communications and Informatics (ICACCI) (2014)
Koenig, S., Likhachev, M.: Improved fast replanning for robot navigation in unknown terrain. In: Proceedings of the IEEE International Conference on Robotics and Automation-ICRA (2002)
Acknowledgement
This work (Grants No. C0456375) was supported by Business for Cooperative R&D between Industry, Academy, and Research Institute funded Korea Small and Medium Business Administration in 20.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Kim, C.K., Kim, S.W., Nguyen, H.H., Kim, D.H., Kim, H.K., Kim, S.B. (2018). Path Planning for Automatic Guided Vehicle with Multiple Target Points in Known Environment. In: Duy, V., Dao, T., Zelinka, I., Kim, S., Phuong, T. (eds) AETA 2017 - Recent Advances in Electrical Engineering and Related Sciences: Theory and Application. AETA 2017. Lecture Notes in Electrical Engineering, vol 465. Springer, Cham. https://doi.org/10.1007/978-3-319-69814-4_70
Download citation
DOI: https://doi.org/10.1007/978-3-319-69814-4_70
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69813-7
Online ISBN: 978-3-319-69814-4
eBook Packages: EngineeringEngineering (R0)