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: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
University of British Columbia
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2429/5153 |