J5

P. Robuffo Giordano, M. Vendittelli. Shortest paths to obstacles for a polygonal Dubins car. IEEE Transactions on Robotics, 25(5):1184-1191, October 2009.

Download [help]

Download paper: Doi page

Download paper: Adobe portable document (pdf)

Copyright notice:

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder. This page is automatically generated by bib2html v217, © Inria 2002-2024, Projet Lagadic/Rainbow

Abstract

In this paper, we characterize the time-optimal trajectories leading a Dubins car in collision with the obstacles in its workspace. Due to the constant velocity constraint characterizing the Dubins car model, these trajectories form a sufficient set of shortest paths between any robot configuration and the obstacles in the environment. Based on these paths,we define and give the algorithm for computing a distance function that takes into account the nonholonomic constraints and captures the nonsymmetric nature of the system. The developments presented here assume that the obstacles and the robot are polygons although the methodology can be applied to different shapes

BibTex Reference

@article{J5,
   Author = {Robuffo Giordano, P. and Vendittelli, M.},
   Title = {{Shortest paths to obstacles for a polygonal Dubins car}},
   Journal = {IEEE Transactions on Robotics},
   Volume = {    25},
   Number = {5},
   Pages = {1184--1191},
   Month = {October},
   Year = {2009}
}

EndNote Reference [help]

Get EndNote Reference (.ref)