LILaC - paper abstract

Updates, actions, and planning

Herzig, Andreas and Lang, Jérômeand Marquis, Pierre and Polacsek, Thomas


A general framework for update-based planning is presented. We first give a new family of dependence-based update operators that are well-suited to the representation of simple actions and we identify the complexity of query entailment from an updated belief base. Then conditional actions, nondeterministic actions, concurrent actions and conditional plans are defined on this ground. Plan verification and existence are expressed in this update-based framework and their complexity is investigated under various assumptions about observability. Finally, we briefly explain how our framework can be extended to deal with partial observability in a more satisfying way.


PostScript, gzipped


@InProceedings{ HeLaMaPo-Ijcai01,
author    = {Herzig, Andreas and Lang, Jérome and 
             Marquis, Pierre and Polacsek, Thomas},
title     = "{Updates, actions, and planning}",
booktitle = {Int. Joint Conf. on Artificial Intelligence (IJCAI'01), Seattle},
publisher = {Morgan Kaufmann},
year      = {2001},
month     = aug,
pages     = {8},