Planning with Incomplete Information as Heuristic Search in Belief Space

The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper, we pursue a similar idea in the context planning with incomplete information. Planning with incomplete information can be formulated as a problem of search in belief space, where belief states can be either sets of states or more generally probability distribution over states. While the formulation (as the formulation of classical planning as heuristic search) is not particularly novel, the contribution of this paper is to make it explicit, to test it over a number of domains, and to extend it to tasks like planning with sensing where the standard search algorithms do not apply. The resulting planner appears to be competitive with the most recent conformant and contingent planners (e.g., cgp, sgp, and cmbp) while at the same time is more general as it can handle probabilistic actions and sensing, di erent a...

• Type: Conference
• Year: 2000
• Where: AIPS
• Authors: Blai Bonet, Hector Geffner
• Keywords: AIPS 2000, Artificial Intelligence, Classical Planning, Heuristic Search, Planning