TY - GEN
T1 - Partially observable online contingent planning using landmark heuristics
AU - Maliah, Shlomi
AU - Brafman, Ronen I.
AU - Karpas, Erez
AU - Shani, Guy
N1 - Publisher Copyright:
Copyright © 2014, Association for the Advancement of Artificial Intelligence.
PY - 2014/1/1
Y1 - 2014/1/1
N2 - In contingent planning problems, agents have partial information about their state and use sensing actions to learn the value of some variables. When sensing and actuation are separated, plans for such problems can often be viewed as a tree of sensing actions, separated by conformant plans consisting of non-sensing actions that enable the execution of the next sensing action. This leads us to propose a heuristic, online method for contingent planning which focuses on identifying the next useful sensing action. The key part of our planner is a novel landmarks-based heuristic for selecting the next sensing action, together with a projection method that uses classical planning to solve the intermediate conformant planning problems. This allows our planner to operate without an explicit model of belief space or the use of existing translation techniques, both of which can require exponential space. The resulting Heuristic Contingent Planner (HCP) solves many more problems than state-of-the-art, translation-based online contingent planners, and in most cases much faster.
AB - In contingent planning problems, agents have partial information about their state and use sensing actions to learn the value of some variables. When sensing and actuation are separated, plans for such problems can often be viewed as a tree of sensing actions, separated by conformant plans consisting of non-sensing actions that enable the execution of the next sensing action. This leads us to propose a heuristic, online method for contingent planning which focuses on identifying the next useful sensing action. The key part of our planner is a novel landmarks-based heuristic for selecting the next sensing action, together with a projection method that uses classical planning to solve the intermediate conformant planning problems. This allows our planner to operate without an explicit model of belief space or the use of existing translation techniques, both of which can require exponential space. The resulting Heuristic Contingent Planner (HCP) solves many more problems than state-of-the-art, translation-based online contingent planners, and in most cases much faster.
UR - https://www.scopus.com/pages/publications/84933048989
U2 - 10.1609/icaps.v24i1.13632
DO - 10.1609/icaps.v24i1.13632
M3 - Conference contribution
AN - SCOPUS:84933048989
T3 - Proceedings International Conference on Automated Planning and Scheduling, ICAPS
SP - 163
EP - 171
BT - ICAPS 2014 - Proceedings of the 24th International Conference on Automated Planning and Scheduling
A2 - Chien, Steve
A2 - Fern, Alan
A2 - Ruml, Wheeler
A2 - Do, Minh
PB - Association for the Advancement of Artificial Intelligence
T2 - 24th International Conference on Automated Planning and Scheduling, ICAPS 2014
Y2 - 21 June 2014 through 26 June 2014
ER -