Satisficing planning engines are often able to generate plans in a reasonable time, however, plans are often far from optimal. Such plans often contain a high number of redundant actions, that are actions, which can be removed without affecting the validity of the plans. Existing approaches for determining and eliminating redundant actions work in polynomial time, however, do not guarantee eliminating the "best" set of redundant actions, since such a problem is NP-complete. We introduce an approach which encodes the problem of determining the "best" set of redundant actions (i.e. having the maximum total-cost) as a weighted MaxSAT problem. Moreover, we adapt the existing polynomial technique which greedily tries to eliminate an action and its dependants from the plan in order to eliminate more expensive redundant actions. The proposed approaches are empirically compared to existing approaches on plans generated by state-of-the-art planning engines on standard planning benchmarks.
|Title of host publication||Proceedings of the Seventh Annual Symposium on Combinatorial Search|
|Subtitle of host publication||(SoCs 2014)|
|Editors||Stefan Edelkamp, Roman Bartak|
|Place of Publication||Prague|
|Number of pages||9|
|Publication status||Published - Sep 2014|
Chrpa, L., Kilani, A., & Balyo, T. (2014). On Different Strategies for Eliminating Redundant Actions from Plans. In S. Edelkamp, & R. Bartak (Eds.), Proceedings of the Seventh Annual Symposium on Combinatorial Search: (SoCs 2014) (pp. 10-18). Prague: AAAI press.