{"type":"ScholarlyArticle","title":"Parallel Non-Binary Planning in Polynomial Time","authors":[{"name":"Christer Bäckström","slug":"christer-backstrom","given":"Christer","family":"Bäckström","affiliation":""},{"name":"Inger Klein","slug":"inger-klein","given":"Inger","family":"Klein","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1991/40","pdf":"https://ijcai.org/proceedings/1991/0040.pdf","markdown":"https://ijcai.org/proceedings/1991/40.md","bibtex":"https://ijcai.org/proceedings/1991/bibtex/40","volume":{"slug":"1991","title":"Proceedings of the Twelfth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1991","url":"https://ijcai.org/proceedings/1991/","year":1991,"location":"Sydney, New South Wales, Australia","dates":"24-30 August 1991","editors":"John Mylopoulos and Ray Reiter","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":40,"pages":{"first":268,"last":272},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}