Parallel Non-Binary Planning in Polynomial Time

Bäckström, Christer; Klein, Inger

Parallel Non-Binary Planning in Polynomial Time

Download BibTeX Cite

Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 268-272.

Abstract

This paper formally presents a class of planning problems which allows non-binary state variables and parallel execution of actions. The class is proven to be tractable, and we provide a sound and complete polynomial time algorithm for planning within this class. This result means that we are getting closer to tackling realistic planning problems in sequential control, where a restricted problem representation is often sufficient, but where the size of the problems make tractability an important issue.

Christer Bäckström, and Inger Klein. 1991. Parallel Non-Binary Planning in Polynomial Time. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91. IJCAI, 268–272. https://ijcai.org/proceedings/1991/40

@inproceedings{ijcai1991p40,
  title     = {Parallel Non-Binary Planning in Polynomial Time},
  author    = {Bäckström, Christer and Klein, Inger},
  booktitle = {Proceedings of the Twelfth International Joint Conference on
               Artificial Intelligence, {IJCAI-91}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {John Mylopoulos and Ray Reiter},
  pages     = {268--272},
  year      = {1991},
  month     = {8},
  note      = {Automated Reasoning},
  url       = {https://ijcai.org/proceedings/1991/40},
}

TY  - CPAPER
TI  - Parallel Non-Binary Planning in Polynomial Time
AU  - Bäckström, Christer
AU  - Klein, Inger
T2  - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1991
SP  - 268
EP  - 272
UR  - https://ijcai.org/proceedings/1991/40
ER  -