Non-Deterministic Conformant Planning Using a Counterexample-Guided Incremental Compilation to Classical Planning
| Conformant planning SAT Counter-example guided abstraction refinement |
PaperID: 309
pdf
poster
|
| We address the problem of non-deterministic conformant planning, i.e., the problem of finding a plan in a non-deterministic context where the system is not observable. Our approach uses an unsound reduction from conformant planning to classical planning to find a candidate plan; the validity of this plan is then verified by a SAT solver; if the plan is invalid, the reduction is revised to make guarantee that the invalid plan will not be valid in the classical planning problem. This procedure is executed until a valid plan is proved, or it is shown that there is no plan. Experiments show that this approach is competitive with the existing solvers, and is able to solve difficult instances. | |
Session 11: Hybrid Planning| Conformant Planning
Task-Aware Waypoint Sampling for Robotic Planning
Authors: Sarah Keren, Gerard Canal and Michael Cashmore
Keywords:
Task and motion planningRoboticsWaypoint sampling
Verifying Plans and Scripts for Robotics Tasks Using Performance Level Profiles
Authors: Alexander Kovalchuk, Shashank Shekhar and Ronen Brafman
Keywords:
Plan verificationProbabilistic-Timed AutomataPerformance-Level Profiles
In-Station Train Dispatching: A PDDL+ Planning Approach
Authors: Matteo Cardellini, Marco Maratea, Mauro Vallati, Gianluca Boleto and Luca Oneto
Keywords:
In-Station Train DispatchingTrain Traffic ControlHybrid Planning
Non-Deterministic Conformant Planning Using a Counterexample-Guided Incremental Compilation to Classical Planning
Authors: Alban Grastien and Enrico Scala
Keywords:
Conformant planningSATCounter-example guided abstraction refinement