A Translation-Based Approach to Contingent Planning
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 1623-1627.
Abstract
The problem of planning in the presence of sensing has been addressed in recent years as a non-deterministic search problem in belief space. In this work, we use ideas advanced recently for compiling conformant problems into classical ones for introducing a different approach where contingent problems P are mapped into non-deterministic problems X(P) in state space. We also identify a contingent width parameter, and show that for problems P with bounded contingent width, the translation is sound, polynomial, and complete. We then solve X(P) by using a relaxation X+(P) that is a classical planning problem. The formulation is tested experimentally over contingent benchmarks where it is shown to yield a planner that scales up better than existing contingent planners.Alexandre Albore, Héctor Palacios, Héctor Geffner
@inproceedings{ijcai2009p271,
title = {A Translation-Based Approach to Contingent Planning},
author = {Albore, Alexandre and Palacios, Héctor and Geffner, Hector},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {1623--1627},
year = {2009},
url = {https://ijcai.org/proceedings/2009/271},
}
TY - CPAPER TI - A Translation-Based Approach to Contingent Planning AU - Albore, Alexandre AU - Palacios, Héctor AU - Geffner, Hector T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 1623 EP - 1627 UR - https://ijcai.org/proceedings/2009/271 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
