Path Planning Through Time and Space in Dynamic Domains
Abstract
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
Cite
Text
Slack and Miller. "Path Planning Through Time and Space in Dynamic Domains." International Joint Conference on Artificial Intelligence, 1987.Markdown
[Slack and Miller. "Path Planning Through Time and Space in Dynamic Domains." International Joint Conference on Artificial Intelligence, 1987.](https://mlanthology.org/ijcai/1987/slack1987ijcai-path/)BibTeX
@inproceedings{slack1987ijcai-path,
title = {{Path Planning Through Time and Space in Dynamic Domains}},
author = {Slack, Marc G. and Miller, David P.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1987},
pages = {1067-1070},
url = {https://mlanthology.org/ijcai/1987/slack1987ijcai-path/}
}