Path Planning Through Time and Space in Dynamic Domains

Simple item page
dc.contributor.authorSlack, Marc G.en
dc.contributor.authorMiller, David P.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:35:55Zen
dc.date.available2013-06-19T14:35:55Zen
dc.date.issued1987-05-01en
dc.description.abstractRealistic robot problems involve navigating the robot through time as well as space. The obstacles that a robot must avoid and the pathways on which it travels are subject to changes throughout time. These changes can occur in a predictable or unpredictable fashion. This paper presents an integrated route planning and spatial representation system that allows paths to be calculated in dynamic domains. The path planner finds the "best route" through a given n-dimensional space. The "best route" is defined as the path through space-time with the best score as determined by a set of user-defined evaluationen
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000053/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000053/01/TR-87-05.pdfen
dc.identifier.trnumberTR-87-05en
dc.identifier.urihttp://hdl.handle.net/10919/20004en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titlePath Planning Through Time and Space in Dynamic Domainsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-87-05.pdf
Size:
757.6 KB
Format:
Adobe Portable Document Format
Download
Collections
Computer Science Technical Reports