---
title: "Parallel Non-Binary Planning in Polynomial Time"
authors:
  - "Christer Bäckström"
  - "Inger Klein"
doi: ""
url: "https://ijcai.org/proceedings/1991/40"
pdf: "https://ijcai.org/proceedings/1991/0040.pdf"
venue: "Proceedings of the Twelfth International Joint Conference on Artificial Intelligence"
year: 1991
pages: "268-272"
track: "Automated Reasoning"
keywords:
---

# Parallel Non-Binary Planning in Polynomial Time

Christer Bäckström, Inger Klein

*Proceedings of the Twelfth International Joint Conference on Artificial Intelligence*, 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.