Research map / Learning theory and algorithms / Combinatorial and search optimization
Refining Abstraction Heuristics during Real-Time Planning
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Avoiding Dead Ends in Real-Time Heuristic Search (AAAI 2018 · similarity 0.92)
- When CEGAR Meets Regression: A Love Story in Optimal Classical Planning (AAAI 2024 · similarity 0.86)
- Automatic Selection of Macro-Events for Heuristic-Search Temporal Planning (AAAI 2025 · similarity 0.86)
- Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity Analysis (AAAI 2024 · similarity 0.85)
- PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning (AAAI 2025 · similarity 0.85)
- Learning Planning Abstractions from Language (ICLR 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.