2000 character limit reached
PRP Rebooted: Advancing the State of the Art in FOND Planning (2312.11675v2)
Published 18 Dec 2023 in cs.AI
Abstract: Fully Observable Non-Deterministic (FOND) planning is a variant of classical symbolic planning in which actions are nondeterministic, with an action's outcome known only upon execution. It is a popular planning paradigm with applications ranging from robot planning to dialogue-agent design and reactive synthesis. Over the last 20 years, a number of approaches to FOND planning have emerged. In this work, we establish a new state of the art, following in the footsteps of some of the most powerful FOND planners to date. Our planner, PR2, decisively outperforms the four leading FOND planners, at times by a large margin, in 17 of 18 domains that represent a comprehensive benchmark suite. Ablation studies demonstrate the impact of various techniques we introduce, with the largest improvement coming from our novel FOND-aware heuristic.
- Human-aware Contingent Planning. Fundam. Informaticae, 174(1): 63–81.
- The Generalizability of FOND Solutions in Uncertain Environments. In 2023 Workshop on Integrated Acting, Planning and Execution (IntEx) at the 33rd International Conference on Automated Planning and Scheduling (ICAPS).
- High-level Programming via Generalized Planning and LTL Synthesis. In Calvanese, D.; Erdem, E.; and Thielscher, M., eds., Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, September 12-18, 2020, 152–161.
- Planning as heuristic search. Artificial Intelligence, 129(1-2): 5–33.
- From FOND to Robust Probabilistic Planning: Computing Compact Policies that Bypass Avoidable Deadends. In Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, (ICAPS), 65–69.
- Non-Deterministic Planning with Temporally Extended Goals: LTL over Finite and Infinite Traces. In Singh, S.; and Markovitch, S., eds., Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, 3716–3724. AAAI Press.
- Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence, 147(1): 35–84.
- Strong Cyclic Planning Revisited. In Recent Advances in AI Planning, Proc. 5th European Conference on Planning (ECP’99), volume 1809 of Lecture Notes in Computer Science, 35–48. Springer.
- Synthesis for LTL and LDL on Finite Traces. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI), 1558–1564.
- Monitoring plan optimality during execution. In 17th International Conference on Automated Planning and Scheduling, 144–151.
- Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems. In 22nd International Joint Conference On Artificial Intelligence, 1949–1954.
- Compact Policies for Fully Observable Non-Deterministic Planning as SAT. In de Weerdt, M.; Koenig, S.; Röger, G.; and Spaan, M. T. J., eds., Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018, Delft, The Netherlands, June 24-29, 2018, 88–96. AAAI Press.
- An Introduction to the Planning Domain Definition Language. Morgan & Claypool. ISBN 9781627058759.
- Helmert, M. 2006. The Fast Downward Planning System. Journal of Artificial Intelligence Research, 26: 191–246.
- Hoffmann, J. 2001. FF: The Fast-Forward Planning System. AI Mag., 22(3): 57–62.
- Generalized Planning via Abstraction: Arbitrary Numbers of Objects. In The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, 7610–7618.
- SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs. In Fox, M.; and Poole, D., eds., Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, July 11-15, 2010. AAAI Press.
- Using classical planners to solve nondeterministic planning problems. In 18th International Conference on Automated Planning and Scheduling, 190–197.
- Pattern database heuristics for fully observable nondeterministic planning. In 20th International Conference on Automated Planning and Scheduling, 105–112.
- A Best-First Search Algorithm for FOND Planning and Heuristic Functions to Optimize Decompressed Solution Size. In The 33rd International Conference on Automated Planning and Scheduling, The 33rd International Conference on Automated Planning and Scheduling.
- Planning for Goal-Oriented Dialogue Systems. arXiv:1910.08137.
- Improved Non-deterministic Planning by Exploiting State Relevance. In The 22nd International Conference on Automated Planning and Scheduling, The 22nd International Conference on Automated Planning and Scheduling.
- Non-Deterministic Planning With Conditional Effects. In The 24th International Conference on Automated Planning and Scheduling.
- Computing Contingent Plans via Fully Observable Non-Deterministic Planning. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI), 2322–2329.
- Iterative Depth-First Search for Fully Observable Non-Deterministic Planning. In The 32nd International Conference on Automated Planning and Scheduling.
- Directed Fixed-Point Regression-Based Planning for Non-Deterministic Domains. In Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS).
- Reiter, R. 2001. Knowledge in action: logical foundations for specifying and implementing dynamical systems. The MIT Press. ISBN 0262182181.
- Waldinger, R. 1977. Achieving several goals simultaneously. Machine Intelligence, 8: 94–136.