Practical Undoability Checking via Contingent Planning. Daum, J.; Torralba, Á.; Hoffmann, J.; Haslum, P.; and Weber, I. In
Practical Undoability Checking via Contingent Planning [link]Paper  abstract   bibtex   
We consider a general concept of undoability, asking whether a given action can always be undone, no matter which state it is applied to. This generalizes previous concepts of invertibility, and is relevant for search as well as applications. Naive undoability checking requires to enumerate all states an action is applicable to. Extending and operationalizing prior work in this direction, we introduce a compilation into contingent planning, replacing such enumeration by standard techniques handling large belief states. We furthermore introduce compilations for checking whether one can always get back to an at-least-as-good state, as well as for determining partial undoability, i.e., undoability on a subset of states an action is applicable to. Our experiments on IPC benchmarks and in a cloud management application show that contingent planners are often effective at solving this kind of problem, hence providing a practical means for undoability checking.
@inproceedings {icaps16-130,
    track    = {​Main Track},
    title    = {Practical Undoability Checking via Contingent Planning},
    url      = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13091},
    author   = {Jeanette Daum and  Álvaro Torralba and  Joerg Hoffmann and  Patrik Haslum and  Ingo Weber},
    abstract = {We consider a general concept of undoability, asking whether a given
action can always be undone, no matter which state it is applied
to. This generalizes previous concepts of invertibility, and is
relevant for search as well as applications. Naive undoability
checking requires to enumerate all states an action is applicable
to. Extending and operationalizing prior work in this direction, we
introduce a compilation into contingent planning, replacing such
enumeration by standard techniques handling large belief states.  We
furthermore introduce compilations for checking whether one can always
get back to an at-least-as-good state, as well as for determining
partial undoability, i.e., undoability on a subset of states an action
is applicable to.  Our experiments on IPC benchmarks and in a cloud
management application show that contingent planners are often
effective at solving this kind of problem, hence providing a practical
means for undoability checking.},
    keywords = {Conformant/contingent planning,Planning under (non-probabilistic) uncertainty}
}
Downloads: 0