|
Título:
|
Width and complexity of belief tracking in non-deterministic conformant and contingent planning
|
|
Autor/a:
|
Bonet, Blai; Geffner, Héctor
|
|
Otros autores:
|
Bonet, Blai |
|
Abstract:
|
Comunicació presentada a: the 26th AAAI Conference on Artificial Intelligence, celebrada a Toronto, Canadà, del 22 al 26 de juliol de 2012 |
|
Abstract:
|
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. |
|
Abstract:
|
H. Geffner is partially supported by grants TIN2009-10232, MICINN, Spain, and EC-7PM SpaceBook. |
|
Derechos:
|
© 2012, Association for the Advancement of Artificial Intelligence (www.aaai.org)
|
|
Tipo de documento:
|
Objeto de conferencia
Artículo - Versión aceptada |
|
Editor:
|
Association for the Advancement of Artificial Intelligence (AAAI)
|
|
Compartir:
|
|
