Bounded-curvature motion planning amid polygonal obstacles
We consider the problem of finding a bounded-curvature path in the plane from one configuration αs to another configuration αt that avoids the interior of a set of polygonal obstacles Ε. We call any such path from αs to αt a feasible path. In this thesis, we develop algorithms to find feasible paths...
Main Author: | Backer, Jonathan |
---|---|
Format: | Others |
Language: | English |
Published: |
University of British Columbia
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/2429/5153 |
Similar Items
-
Bounded-curvature motion planning amid polygonal obstacles
by: Backer, Jonathan
Published: (2009) -
Bounded-curvature motion planning amid polygonal obstacles
by: Backer, Jonathan
Published: (2009) -
Curvature Continuous and Bounded Path Planning for Fixed-Wing UAVs
by: Xiaoliang Wang, et al.
Published: (2017-09-01) -
Heat kernel estimates based on Ricci curvature integral bounds
by: Rose, Christian
Published: (2017) -
Scalar Curvature via Local Extent
by: Veronelli Giona
Published: (2018-11-01)