Computer Science Technical Reports
CS at VT

Path Planning Through Time and Space in Dynamic Domains

Slack, Marc G. and Miller, David P. (1987) Path Planning Through Time and Space in Dynamic Domains. Technical Report TR-87-05, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
TR-87-05.pdf (775778)


Realistic 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 evaluation

Item Type:Departmental Technical Report
Subjects:Computer Science > Historical Collection(Till Dec 2001)
ID Code:53
Deposited By:User autouser
Deposited On:03 November 2005