Near-Optimal Path Planning for a Car-Like Robot Visiting a Set of Waypoints With Field of View Constraints Academic Article uri icon

abstract

  • © 2016 IEEE. This letter considers two variants of a shortest path problem for a car-like robot visiting a set of waypoints. The sequence of waypoints to be visited is specified in the first variant while the robot is allowed to visit the waypoints in any sequence in the second variant. The shortest path problem is first solved for two waypoints with heading angle constraints at the waypoints using the Pontryagin's minimum principle. Using the results for the two point problem, tight lower and upper bounds on the length of the shortest path are developed for visiting n points by relaxing the requirement that the arrival angle must be equal to the departure angle of the robot at each waypoint. Theoretical bounds are also provided on the length of the feasible solutions obtained by the proposed algorithm. Simulation results verify the performance of the bounds for instances with 20 waypoints.

author list (cited authors)

  • Rathinam, S., Manyam, S. G., & Zhang, Y.

publication date

  • April 2019