Forward Conformant Planning via Symbolic Model Checking
نویسندگان
چکیده
Conformant planning is the problem of finding a sequence of actions that is guaranteed to achieve the goal for any possible initial state and nondeterministic behavior of the planning domain. In this paper we present a new algorithm for conformant planning, returning conformant plans of minimal length if the problem admits a solution, otherwise returning with failure. This work extends previous work on conformant planning, based on model checking techniques. The algorithm presented in this paper takes full advantage of the symbolic representation based on Binary Decision Diagrams (BDDs). In particular, it proceeds forwards, from the initial states towards the goal. It is thus able to exploit forward computation steps, which some times can be significantly more efficient than the corresponding backwards. Furthermore, it implements a new simplification technique which also significantly improves the performance, by containing the combinatorial explosion of the number of explored plans due to the use of a serial encoding. Experimental results suggest that our conformant planner CMBP, besides being strictly more expressive than the state of the art conformant planner CGP, is also able to deal with uncertainties more efficiently.
منابع مشابه
Conformant Planning via Symbolic Model Checking
We tackle the problem of planning in nondeterministic domains, by presenting a new approach to conformant planning. Conformant planning is the problem of nding a sequence of actions that is guaranteed to achieve the goal despite the nondeterminism of the domain. Our approach is based on the representation of the planning domain as a nite state automaton. We use Symbolic Model Checking technique...
متن کاملConformant planning via symbolic model checking and heuristic search
In this paper we tackle the problem of Conformant Planning: find a sequence of actions that guarantees goal achievement regardless of an uncertain initial condition and of nondeterministic action effects. Our approach, set in the framework of search in the belief space, is based on two main intuitions. First, symbolic model checking techniques, Binary Decision Diagrams in particular, can be use...
متن کاملHeuristic Search + Symbolic Model Checking = Efficient Conformant Planning
Planning in nondeterministic domains has gained more and more importance. Conformant planning is the problem of finding a sequential plan that guarantees the achievement of a goal regardless of the initial uncertainty and of nondeterministic action effects. In this paper, we present a new and efficient approach to conformant planning. The search paradigm, called heuristic-symbolic search, relie...
متن کاملInterleaving Execution and Planning via Symbolic Model Checking
Interleaving planning and execution is the practical alternative to the problem of planning off-line with large state spaces. While planning via symbolic model checking has been extensively studied for off-line planning, no framework for interleaving it with execution has been ever devised. In this paper, we extend planning via symbolic model checking with the ability of interleaving planning a...
متن کامل