Planning with Uncertain Action Models
Francesco Percassi, Alessandro Saetti, Enrico Scala
Abstract
Uncertainty over model knowledge is a core challenge in planning and has been addressed through various approaches tailored to different scenarios. In this paper, we focus on scenarios where the agent does not initially know the exact outcome of its actions but gains knowledge upon execution, i.e., each action reveals its actual effect, removing uncertainty about future occurrences. We refer to this formulation as Planning with Uncertain Models of Actions (PUMA). We show that PUMA can be compiled in polynomial time in both Fully Observable Non-Deterministic planning and, perhaps more unexpectedly, classical planning, providing a constructive proof that PUMA remains PSPACE-complete despite its apparent exponential uncertainty. Finally, we experimentally evaluate both compilations with benchmark domains that capture the key aspects of the problem. The results show the practical feasibility of our approach and reveal a complementary behavior between the two compilations.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ce6aa48e-261d-4a8e-aaa7-01db5c7e9e35Builds on4
- Learning Safe Action Models with Partial ObservabilityHai S. Le, Brendan Juba, Roni SternAAAI 2024 · 7 citations
- An Effective Polynomial Technique for Compiling Conditional Effects AwayAlfonso Emilio Gerevini, Francesco Percassi, Enrico ScalaAAAI 2024 · 5 citations
- PRP Rebooted: Advancing the State of the Art in FOND PlanningChristian Muise, Sheila A. McIlraith, J. Christopher BeckAAAI 2024 · 3 citations
- Towards Practical Classical Planning Compilations of Numeric PlanningLuigi Bonassi, Francesco Percassi, Enrico ScalaAAAI 2025 · 1 citation
Related papers
- Learning Probably Approximately Complete and Safe Action Models for Stochastic WorldsBrendan Juba, Roni SternAAAI 2022 · 18 citations
- Learning Safe Numeric Action ModelsArgaman Mordoch, Brendan Juba, Roni SternAAAI 2023 · 6 citations
- Planning with Quantized Opponent ModelsXiaopeng Yu, Kefan Su, Zongqing LuNeurIPS 2025
- Revelations: A Decidable Class of POMDPs with Omega-Regular ObjectivesMarius Belly, Nathanaël Fijalkow, Hugo Gimbert, Florian Horn et al.AAAI 2025 · 5 citations
- Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity AnalysisPascal Bachor, Gregor BehnkeAAAI 2024 · 5 citations
