A contingent planning problem P, which is a non-deterministic search problem in belief space, is compiled into a non-deterministic problem X(P) in state space, whose literals represent beliefs over P. The planner CLG (Closed-Loop Greedy Planner) accepts a contingent planning problem P with non-deterministic actions, and solves it by using the translation X(P) for keeping track of the beliefs, and a suitable strenghtening relaxation X+(P) for selecting the actions to apply next.
- Albore, A.; Palacios, H.; Geffner, H. Fast and Informed Action Selection for Planning with Sensing. In: A.A.V.V. Proc. 12th Conf. Spanish AI (CAEPIA-07). 1 ed. New York: Springer; 2007. p. 1-10.
- Albore, A.; Palacios, H.; Geffner, H.. A Translation-based Approach to Contingent Planning. In: Boutilier, C. (Ed). IJCAI-09, Proceedings of the 21st International Joint Conference on Artificial Intelligence. 1 ed. Pasadena: Morgan Kaufmann; 2009. p. 1623-1628.
- Albore, A.: Translation-Based Approaches to Automated Planning with Incomplete Information and Sensing, (2011).
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.