Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 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

Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning (2404.05235v2)

Published 8 Apr 2024 in cs.AI

Abstract: Heuristic search is a powerful approach for solving planning problems and numeric planning is no exception. In this paper, we boost the performance of heuristic search for numeric planning with various powerful techniques orthogonal to improving heuristic informedness: numeric novelty heuristics, the Manhattan distance heuristic, and exploring the use of multi-queue search and portfolios for combining heuristics.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. International Planning Competition 2023 - Numeric Tracks. https://ipc2023-numeric.github.io.
  2. Relaxed Exists-Step Plans in Planning as SMT. In IJCAI, 563–570.
  3. Symbolic Numeric Planning with Patterns. In AAAI, 20070–20077.
  4. A Hybrid Relaxed Planning Graph-LP Heuristic for Numeric Planning Domains. In ICAPS, 52–59.
  5. A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning. J. Artif. Intell. Res., 46: 343–412.
  6. Best-First Width Search for Lifted Classical Planning. In ICAPS, 11–15.
  7. FD-Autotune: Domain-Specific Configuration using Fast Downward. In ICAPS 2011 Workshop on Planning and Learning.
  8. PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. J. Artif. Intell. Res., 20: 61–124.
  9. Learning to Rank for Synthesizing Planning Heuristics. In IJCAI, 3089–3095.
  10. On the Compilability of Bounded Numeric Planning. In IJCAI, 5341–5349.
  11. Helmert, M. 2002. Decidability and Undecidability Results for Planning with Numerical State Variables. In AIPS, 44–53.
  12. Helmert, M. 2006. The Fast Downward Planning System. J. Artif. Intell. Res., 191–246.
  13. Fast Downward Stone Soup: A Baseline for Building Planner Portfolios. In ICAPS 2011 Workshop on Planning and Learning.
  14. Hoffmann, J. 2002. Extending FF to Numerical State Variables. In ECAI, 571–575.
  15. Hoffmann, J. 2003. The Metric-FF Planning System: Translating ”Ignoring Delete Lists” to Numeric State Variables. J. Artif. Intell. Res., 24: 685–758.
  16. Numeric Planning via Abstraction and Policy Guided Search. In IJCAI, 4338–4345.
  17. Adapting Novelty to Classical Planning as Heuristic Search. In ICAPS, 172–180.
  18. Delfi: Online planner selection for cost-optimal planning.
  19. Extracting and Exploiting Bounds of Numeric Variables for Optimal Linear Numeric Planning. In ECAI, 1332–1339.
  20. LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions. In ICAPS, 210–218.
  21. The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions. J. Artif. Intell. Res., 75: 1477–1548.
  22. Effect-Abstraction Based Relaxation for Linear Numeric Planning. In IJCAI, 4787–4793.
  23. Width and Serialization of Classical Planning Problems. In ECAI, 540–545.
  24. Best-First Width Search: Exploration and Exploitation in Classical Planning. In AAAI, 3590–3596.
  25. Online Planner Selection with Graph Neural Networks and Adaptive Scheduling. In AAAI, 5077–5084.
  26. Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning. In AAAI, 6254–6261.
  27. Integrated Hybrid Planning and Programmed Control for Real Time UAV Maneuvering. In AAMAS, 1318–1326.
  28. Preferred Operators and Deferred Evaluation in Satisficing Planning. In ICAPS, 273–280.
  29. The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks. J. Artif. Intell. Res., 39: 127–177.
  30. The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning. In ICAPS, 246–249.
  31. Landmarks for Numeric Planning Problems. In IJCAI, 4384–4390.
  32. Heuristics for Numeric Planning via Subgoaling. In IJCAI, 3228–3234.
  33. Interval-Based Relaxation for General Numeric Planning. In ECAI, 655–663.
  34. Subgoaling Techniques for Satisficing and Optimal Numeric Planning. J. Artif. Intell. Res., 68: 691–752.
  35. Numeric Planning with Disjunctive Global Constraints via SMT. In ICAPS, 276–284.
  36. Search-Guidance Mechanisms for Numeric Planning Through Subgoaling Relaxation. In ICAPS, 226–234.
  37. Learning Portfolios of Automatically Tuned Planners. In ICAPS, 368–372.
  38. Symmetry Detection and Breaking in Linear Cost-Optimal Numeric Planning. In ICAPS, 393–401.
  39. Boundary Extension Features for Width-Based Planning with Simulators on Continuous-State Domains. In IJCAI, 4183–4189.
Citations (1)
View on Semantic Scholar

Summary

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now