Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning

It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and small. In this work, we introduce a new width notion that applies to non-deterministic conformant and contingent problems as well. We also develop a belief tracking algorithm for non-deterministic problems that is exponential in the problem width, analyze the width of non-deterministic benchmarks, compare the new notion to the previous one over deterministic problems, and present experimental results.

• Type: Journal
• Year: 2012
• Where: AAAI
• Authors: Blai Bonet, Hector Geffner
• Keywords: AAAI 2012, Conformant, Deterministic Problems, Intelligent Agents, Width Parameter