Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Relevance Score: A Landmark-Like Heuristic for Planning (2403.07510v1)

Published 12 Mar 2024 in cs.AI

Abstract: Landmarks are facts or actions that appear in all valid solutions of a planning problem. They have been used successfully to calculate heuristics that guide the search for a plan. We investigate an extension to this concept by defining a novel "relevance score" that helps identify facts or actions that appear in most but not all plans to achieve any given goal. We describe an approach to compute this relevance score and use it as a heuristic in the search for a plan. We experimentally compare the performance of our approach with that of a state of the art landmark-based heuristic planning approach using benchmark planning problems. While the original landmark-based heuristic leads to better performance on problems with well-defined landmarks, our approach substantially improves performance on problems that lack non-trivial landmarks.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (21)
  1. Planning as heuristic search. Artificial Intelligence, 129(1-2):5–33.
  2. LM-BFS : A Framework for Landmarks in Planning. ICAPS 2021 Workshop on Heuristics and Search for Domain-independent Planning.
  3. Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4009 LNCS:36–48.
  4. Chapter 2 - representations for classical planning. In Ghallab, M., Nau, D., and Traverso, P., editors, Automated Planning, The Morgan Kaufmann Series in Artificial Intelligence, pages 19 – 53. Morgan Kaufmann, Burlington.
  5. Haslum, P. (2009). h^m( P ) = h^1(P^m): Alternative Characterisations of the Generalisation From h^{max} To h^m. Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling, pages 354–357.
  6. Helmert, M. (2006). The fast downward planning system. Journal of Artificial Intelligence Research, 26:191–246.
  7. Landmarks, Critical Paths and Abstractions: What’s the Difference Anyway? Proceedings of the 19th International Conference on Automated Planning and Scheduling, pages 162–169.
  8. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14:253–302.
  9. Ordered Landmarks in Planning. Journal of Artificial Intelligence Research, 22:215–278.
  10. Cost-optimal planning with landmarks. IJCAI International Joint Conference on Artificial Intelligence, pages 1728–1733.
  11. Heuristics for Planning with Action Costs Revisited. ECAI, pages 588—-592.
  12. Sound and complete landmarks for And/Or graphs. ECAI, pages 335—-340.
  13. Landmark-based heuristic online contingent planning. Autonomous Agents and Multi-Agent Systems, 32(5):602–634.
  14. Landmark-Based Heuristics for Goal Recognition. Proceedings of the 31th Conference on Artificial Intelligence, pages 3622–3628.
  15. On the Extraction, Ordering, and Usage of Landmarks in Planning. Proceedings of ECP01, 129:37–48.
  16. Landmarks revisited. Proceedings of the National Conference on Artificial Intelligence, 2:975–982.
  17. The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks. Journal of Artificial Intelligence Research (JAIR), 39:127–177.
  18. Scaling-Up Generalized Planning as Heuristic Search with Landmarks. Proceedings of the International Symposium on Combinatorial Search, 15(1):171–179.
  19. Towards Online Goal Recognition Combining Goal Mirroring and Landmarks. Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 2112–2114.
  20. Landmark Heuristics for Lifted Classical Planning. IJCAI International Joint Conference on Artificial Intelligence, pages 4665–4671.
  21. Landmark Extraction via Planning Graph Propagation. ICAPS Doctoral Consortium, pages 156—-160.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com