Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Nonholonomic distance to polygonal obstacles for a car-like robot of polygonal shape

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Giordano, P.R. ; Dipt. di Inf. e Sistemistica, Rome Univ. ; Vendittelli, M. ; Laumond, J.-P. ; Soueres, P.

This paper shows how to compute the nonholonomic distance between a polygonal car-like robot and polygonal obstacles. The solution extends previous work of Reeds and Shepp by finding the shortest path to a manifold (rather than to a point) in configuration space. Based on optimal control theory, the proposed approach yields an analytic solution to the problem

Published in:

Robotics, IEEE Transactions on  (Volume:22 ,  Issue: 5 )