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

Robuffo Giordano, P; Vendittelli , M; Laumond, J-P; Souères, P

doi:10.1109/TRO.2006.878956

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

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

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1705595
(出版社版)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Robuffo Giordano, P., Vendittelli, M., Laumond, J.-P., & Souères, P. (2006). Nonholonomic distance to polygonal obstacles for a car-like robot of polygonal shape. IEEE Transactions on Robotics, 22(5), 1040-1047. doi:10.1109/TRO.2006.878956.

引用: https://hdl.handle.net/11858/00-001M-0000-0013-D033-5

要旨

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.