Bonet, BlaiGeffner, Héctor2018-12-042018-12-042012Bonet B, Geffner H. Width and complexity of belief tracking in non-deterministic conformant and contingent planning. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence; 2012 Jul 22-26. Toronto, Canada. [Menlo Park, California]:AAAI; 2012. p. 1756-62http://hdl.handle.net/10230/35974Comunicació presentada a: the 26th AAAI Conference on Artificial Intelligence, celebrada a Toronto, Canadà, del 22 al 26 de juliol de 2012It 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.application/pdfeng© 2012, Association for the Advancement of Artificial Intelligence (www.aaai.org)info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/openAccess