Advisor

Faris Badi'i

Date of Award

1988

Document Type

Thesis

Degree Name

Master of Science (M.S.) in Electrical Engineering

Department

Electrical Engineering

Physical Description

1 online resource (67 p.)

Subjects

Robotics -- Computer programs, Algorithms -- Data processing, Graph theory -- Data processing

DOI

10.15760/etd.5698

Abstract

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.

Description

If you are the rightful copyright holder of this dissertation or thesis and wish to have it removed from the Open Access Collection, please submit a request to pdxscholar@pdx.edu and include clear identification of the work, preferably with URL

Persistent Identifier

http://archives.pdx.edu/ds/psu/21287

Share

COinS