Abstract
One of the major requirement of automation is to reduce or eliminate human hands, even in extreme situations like rescue of humans from disaster where robots are employed in large numbers. The robots in such instances need to be proficient in identifying the targets and tiding through hazardous environment without collection. Literature has several techniques of path planning of a robot to reach the destination without collision. In this paper, path planning of a robot is attempted using genetic algorithm which is modelled as a traveling salesman problem (TSP). The basics of the TSP is that when the robot deviates from the designed path, the TSP algorithm is executed for several iterations to reach the destination optimally. The algorithm is tested on a robot hardware called iRobot (ICreate) which is interfaced with ARM Cortex M3 controller. The iRobot was able to track the destination successfully by avoiding obstacles and by making rotation of 90°. Improvement are being worked out to implement more optimal rotations.
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
References
Tuncer, A., Yildirim, M.: Dynamic path planning of mobile robots with improved genetic algorithm. In: Computers and Electricals Engineering, Elsevier, Amsterdam (2012)
Elshami, A., Abdhullah, H.A., Areibi, S.: Genetic algorithm for dynamic path planning. 0-7803-8213-6/04. IEEE (2004)
Shiltagh, N.A., Jalal, L.D.: Path planning of intelligent mobile robot using modified genetic algorithm. Int. J. Soft Comput. Eng. (IJSCE) 3(2), 31–36 (2013). ISSN: 2231–2307
Parvez, W., Dhar, S.: Path planning optimization using genetic algorithm—a literature review. Int. J. Comput. Eng. Res. 3(4), 23–28 (2013)
Carpaneto, G., Dell’amico, M., Toth, P.: Exact solution of large-scale asymmetric traveling salesman problems. ACM Trans. Math. Softw. 21, 394–409 (1995)
Wang, C., Soh, Y.G., Wang, H., Wang, H.: A hierarchical genetic algorithm for path planning in a static environment with obstacles. IEEE, 2002, 0-7803-7282-4/02. In: High Performance Distributed Computing, pp. 181–184. IEEE Press, New York (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
George, R.J., Supriya, P. (2019). Path Planning of Mobile Robot Using Traveling Salesman Problem Modeled for Genetic Algorithm. In: Abawajy, J., Othman, M., Ghazali, R., Deris, M., Mahdin, H., Herawan, T. (eds) Proceedings of the International Conference on Data Engineering 2015 (DaEng-2015) . Lecture Notes in Electrical Engineering, vol 520. Springer, Singapore. https://doi.org/10.1007/978-981-13-1799-6_31
Download citation
DOI: https://doi.org/10.1007/978-981-13-1799-6_31
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1797-2
Online ISBN: 978-981-13-1799-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)