Abstract

Mobile robots have played an important role in our modern life. Most of them use non-holonomic systems that only can be steered when they are moving. Hence, It is not possible to do instant movement on non-holonomic robot. This constraint has led to make the holonomic mobile robot attracting attention. Since their maneuverability enable them to do instant movement that can be useful to do several hard tasks. In this paper, We propose a path planning algorithm using arrival time field for holonomic mobile robot. The arrival time field is used to generate the field that can be extracted into optimum path. We used gradient descent method to find the shortest path alongside the arrival time field. The path will be considered as reference values for the mobile robot to move toward its goal.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.