Executing Reactive, Model-Based Programs Through Graph-Based Temporal Planning

Abstract

In the future, webs of unmanned air and space vehicles will act together to robustly perform elaborate missions in uncertain environments. We coordinate these systems by introducing a reactive model-based programming language (RMPL) that combines within a single unified representation the flexibility of embedded programming and reactive execution languages, and the deliberative reasoning power of temporal planners. The KIRK planning system takes as input a problem expressed as a RMPL program, and compiles it into a temporal plan network (TPN), similar to those used by temporal planners, but extended for symbolic constraints and decisions. This intermediate representation clarifies the relation between temporal planning and causal-link planning, and permits a single task model to be used for planning and execution. Such a

Cite

Text

Kim et al. "Executing Reactive, Model-Based Programs Through Graph-Based Temporal Planning." International Joint Conference on Artificial Intelligence, 2001.

Markdown

[Kim et al. "Executing Reactive, Model-Based Programs Through Graph-Based Temporal Planning." International Joint Conference on Artificial Intelligence, 2001.](https://mlanthology.org/ijcai/2001/kim2001ijcai-executing/)

BibTeX

@inproceedings{kim2001ijcai-executing,
  title     = {{Executing Reactive, Model-Based Programs Through Graph-Based Temporal Planning}},
  author    = {Kim, Phil and Williams, Brian C. and Abramson, Mark},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2001},
  pages     = {487-493},
  url       = {https://mlanthology.org/ijcai/2001/kim2001ijcai-executing/}
}