Abstract
In this paper, a robot path planning method based on Dijkstra’s Algorithm and Genetic Algorithms is proposed. This method works for any appointed start point and end point in an arbitrary rectangular workspace with arbitrary rectangular obstacles whose edges are perpendicular or parallel to the walls of the workspace. Firstly, use Dijkstra’s Algorithm to find a path among all the midpoints of obstacles’ vertices and the walls of the workspace. Then use Genetic Algorithm to optimize the path gotten from Dijkstra’s Algorithm and finally generate an optimal path for the robot from the start point to the end point.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsBibliography
Shortest Path Algorithms, MIT’s Introduction to Algorithms
Basic Shortest path Algorithms, Andrew V. Goldberg
An Overview of Evolutionary Computation, Xin Yao, Chinese Journal of Advanced Software Research
R. Anthony and E. D. Reilly (1993), Encyclopedia of Computer Science, Chapman & Hall. U. Aybars, K. Serdar, C. Ali, Muhammed C. and Ali A (2009), Genetic Algorithm based solution of TSP on a sphere, Mathematical and Computational Applications, Vol. 14, No. 3, pp. 219–228.
B. Korte (1988), Applications of combinatorial optimization, talk at the 13th International Mathematical Programming Symposium, Tokyo.
E. L. Lawler, J. K. Lenstra, A. H. G. RinnooyKan, and D. B. Shmoys (1985), The Traveling Salesman Problem, John Wiley & Sons, Chichester.
H. Holland (1992), Adaptation in natural and artificial systems, Cambridge, MA, USA: MIT Press.
H. Nazif and L.S. Lee (2010), Optimized CrosSover Genetic Algorithm for Vehicle Routing Problem with Time Windows, American Journal of Applied Sciences 7 (1): pg. 95–101.
R. Braune, S. Wagner and M. Affenzeller (2005), Applying Genetic Algorithms to the Optimization of Production Planning in a real world Manufacturing Environment, Institute of Systems Theory and Simulation Johannes Kepler University.
Z. Ismail, W. Rohaizad and W. Ibrahim (2008), Travelling Salesman problem for solving Petrol Distribution using Simulated Annealing, American Journal of Applied Sciences 5(11): 1543–1546.
Acknowledgements
This work was supported by Major Scientific Research Project in Higher School in Hebei Province (Grant No. ZD20131085), Funding Project of Science & Technology Research and Development in Hebei North University (Grant No. ZD201301), Major Projects in Hebei Food and Drug Administration (Grant No. ZD2015017), Major Funding Project in Hebei Health Department (Grant No. ZL20140127), Youth Funding Science and Technology Projects in Hebei Higher School (Grant No. QN2016192), with Hebei Province Population Health Information Engineering Technology Research Center.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Liu, Y., Liang, J., Li, J., Zhao, Z. (2018). Robot Path Planning Based on Dijkstra’s Algorithm and Genetic Algorithm. In: Yen, N., Hung, J. (eds) Frontier Computing. FC 2016. Lecture Notes in Electrical Engineering, vol 422. Springer, Singapore. https://doi.org/10.1007/978-981-10-3187-8_38
Download citation
DOI: https://doi.org/10.1007/978-981-10-3187-8_38
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-3186-1
Online ISBN: 978-981-10-3187-8
eBook Packages: EngineeringEngineering (R0)