A methodology for 2D and 3D collision free path planning algorithm in a structured environment is presented. The isolated free convex areas are represented as a nodes in a graph, and a graph traversal strategy that dynamically allocates costs to graph path is used. Modification of the algorithm for small computational time and optimality is discussed. The 3D path planning is done in the three orthogonal two-dimensional projections of a 3D environment. Collision checking to increase the optimality for 3D paths is done in each of the three orthogonal two-dimensional subspaces.
Identifer | oai:union.ndltd.org:pdx.edu/oai:pdxscholar.library.pdx.edu:open_access_etds-4823 |
Date | 01 January 1988 |
Creators | Kim, Hyun Suk |
Publisher | PDXScholar |
Source Sets | Portland State University |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | Dissertations and Theses |
Page generated in 0.0017 seconds