English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Shortest paths to obstacles for a polygonal Dubins car

Robuffo Giordano, P. (2009). Shortest paths to obstacles for a polygonal Dubins car. IEEE Transactions on Robotics, 25(5), 1184-1191. doi:10.1109/TRO.2008.2011421.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Robuffo Giordano, P1, Author           
Affiliations:
1Department Human Perception, Cognition and Action, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497797              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s):
 Dates: 2009-10
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: IEEE Transactions on Robotics
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 25 (5) Sequence Number: - Start / End Page: 1184 - 1191 Identifier: -