Show simple item record

dc.contributor.advisor de Figueiredo, Rui J. P.
dc.creatorCiscon, Lawrence A.
dc.date.accessioned 2009-06-04T00:14:14Z
dc.date.available 2009-06-04T00:14:14Z
dc.date.issued 1990
dc.identifier.urihttps://hdl.handle.net/1911/13422
dc.description.abstract Hierarchical path planning techniques for Intelligent Autonomous Mobile Robots (IAMRs) attempt to subdivide the overall task of path planning into several layers. This subdivision is made more difficult by the physical robot's computational architecture. The most important problem with classic hierarchies is their inability to cope with a diversity of environments and obstacles. In this research, we present a hierarchical path planning paradigm which uses a distributed blackboard architecture as its foundation. We subdivide the path planning problem into three levels: a global path planner, a local planner, and a set of constraint analyzers. By creating a uniform distributed blackboard that spans many processors in a network, we have formed the basis of a uniform operating environment for experimenting with layered path planning, as well as other mobile robot issues. And by dividing the planning into three layers instead of two, the system is able to handle much more complicated and diverse environments.
dc.format.extent 131 p.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.subjectElectronics
Electrical engineering
Computer science
dc.title Hierarchical robot path planning using a distributed blackboard
dc.type.genre Thesis
dc.type.material Text
thesis.degree.department Computer Science
thesis.degree.discipline Engineering
thesis.degree.grantor Rice University
thesis.degree.level Masters
thesis.degree.name Master of Science
dc.identifier.citation Ciscon, Lawrence A.. "Hierarchical robot path planning using a distributed blackboard." (1990) Master’s Thesis, Rice University. https://hdl.handle.net/1911/13422.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record