Planning with Loops

Levesque, Hector J.

Planning with Loops

Download BibTeX Cite

Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 509-514.

Abstract

Unlike the case for sequential and conditional planning, much of the work on iterative planning (planning where loops may be needed) leans heavily on theorem-proving. This paper does the following: it proposes a different approach where generating plans is decoupled from verifying them; describes the implementation of an iterative planner based on the situation calculus; presents a few examples illustrating the sorts of plans that can be generated; shows some of the strengths and weaknesses of the approach; and finally sketches the beginnings of a theory, where validation of plans is done offline.

Hector J. Levesque. 2005. Planning with Loops. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 509–514. https://ijcai.org/proceedings/2005/2

@inproceedings{ijcai2005p2,
  title     = {Planning with Loops},
  author    = {Levesque, Hector J.},
  booktitle = {Proceedings of the Nineteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-05}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  pages     = {509--514},
  year      = {2005},
  url       = {https://ijcai.org/proceedings/2005/2},
}

TY  - CPAPER
TI  - Planning with Loops
AU  - Levesque, Hector J.
T2  - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2005
SP  - 509
EP  - 514
UR  - https://ijcai.org/proceedings/2005/2
ER  -