Skip to main content

Towards the Evaluation of Action Reversibility in STRIPS Using Domain Generators

  • Conference paper
  • First Online:
Foundations of Information and Knowledge Systems (FoIKS 2022)

Abstract

Robustness is a major prerequisite for using AI systems in real world applications. In the context of AI planning, the reversibility of actions, i.e., the possibility to undo the effects of an action using a reverse plan, is one promising direction to achieve robust plans. Plans only made of reversible actions are resilient against goal changes during plan execution. This paper presents a naive implementation of a non-deterministic theoretical algorithm for determining action reversibility in STRIPS planning. However, evaluating action reversibility systems turns out to be a difficult challenge, as standard planning benchmarks are hardly applicable. We observed that manually crafted domains and in particular those obtained from domain generators easily contain bias. Based on an existing domain generator, we propose two slight variations that exhibit a completely different search tree characteristics. We use these domain generators to evaluate our implementation in close comparison to an existing ASP implementation and show that different generators indeed favor different implementations. Thus, a variety of domain generators is a necessary foundation for the evaluation of action reversibility systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bylander, T.: The computational complexity of propositional STRIPS planning. Artif. Intell. 69(1–2), 165–204 (1994)

    Article  MathSciNet  Google Scholar 

  2. Chrpa, L., Faber, W., Fiser, D., Morak, M.: Determining action reversibility in STRIPS using answer set programming. In: Workshop Proceedings Co-located with ICLP 2020. CEUR Workshop Proceedings, vol. 2678. CEUR-WS.org (2020). http://ceur-ws.org/Vol-2678/paper2.pdf

  3. Chrpa, L., Faber, W., Morak, M.: Universal and uniform action reversibility. In: KR 2021, pp. 651–654 (2021). https://doi.org/10.24963/kr.2021/63

  4. Cserna, B., Doyle, W.J., Ramsdell, J.S., Ruml, W.: Avoiding dead ends in real-time heuristic search. In: AAAI 2018, pp. 1306–1313. AAAI Press (2018). https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/17405

  5. Daum, J., Torralba, Á., Hoffmann, J., Haslum, P., Weber, I.: Practical undoability checking via contingent planning. In: ICAPS 2016, pp. 106–114. AAAI Press (2016). http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13091

  6. Eiter, T., Erdem, E., Faber, W.: Undoing the effects of action sequences. J. Appl. Log. 6(3), 380–415 (2008)

    Article  MathSciNet  Google Scholar 

  7. Ghallab, M., Nau, D.S., Traverso, P.: Automated Planning - Theory and Practice. Elsevier, San Francisco (2004)

    MATH  Google Scholar 

  8. Ghallab, M., Nau, D.S., Traverso, P.: Automated Planning and Acting. Cambridge University Press, Cambridge (2016)

    Book  Google Scholar 

  9. Haslum, P., Lipovetzky, N., Magazzeni, D., Muise, C.: An Introduction to the Planning Domain Definition Language. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers (2019)

    Google Scholar 

  10. Koehler, J., Hoffmann, J.: On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. J. Artif. Intell. Res. 12, 338–386 (2000)

    Article  MathSciNet  Google Scholar 

  11. Morak, M., Chrpa, L., Faber, W., Fiser, D.: On the reversibility of actions in planning. In: KR 2020, pp. 652–661 (2020)

    Google Scholar 

  12. Rice, J.R.: The algorithm selection problem. Adv. Comput. 15, 65–118 (1976). https://doi.org/10.1016/S0065-2458(08)60520-3

    Article  Google Scholar 

  13. Weber, I., Wada, H., Fekete, A.D., Liu, A., Bass, L.: Automatic undo for cloud management via AI planning. In: HotDep 2012. USENIX Association (2012)

    Google Scholar 

  14. Williams, B.C., Nayak, P.P.: A reactive planner for a model-based executive. In: IJCAI 1997, pp. 1178–1185. Morgan Kaufmann (1997). http://ijcai.org/Proceedings/97-2/Papers/056.pdf

Download references

Acknowledgements

We would like to thank the anonymous reviewers for their insightful feedback. This work has been partially supported by BMBF funding for the project Dependable Intelligent Software Lab. Financial support is gratefully acknowledged.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tobias Schwartz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Schwartz, T., Boockmann, J.H., Martin, L. (2022). Towards the Evaluation of Action Reversibility in STRIPS Using Domain Generators. In: Varzinczak, I. (eds) Foundations of Information and Knowledge Systems. FoIKS 2022. Lecture Notes in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-031-11321-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-11321-5_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-11320-8

  • Online ISBN: 978-3-031-11321-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics