Research map / Learning theory and algorithms / Combinatorial and search optimization
A* Search and Bound-Sensitive Heuristics for Oversubscription 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Add a bound-sensitive hMS heuristic to A* instead of using a blind heuristic (ablation) | A* for compiled OSP tasks · OSP benchmark suite, 75% bound | coverage: 743 -> 778 | Helped |
| Add a bound-sensitive hMS heuristic to A* instead of using a blind heuristic (ablation) | A* for compiled OSP tasks · OSP benchmark suite, 100% bound | coverage: 658 -> 701 | Helped |
| Add a bound-sensitive hMS heuristic to A* instead of using a blind heuristic (ablation) | A* for compiled OSP tasks · OSP benchmark suite, 25% bound | coverage: 1182 -> 1178 | Hurt |
| Add a bound-sensitive hmax heuristic instead of classical hmax (ablation) | A* for compiled OSP tasks · OSP benchmark suite, 25% bound | coverage: 1098 -> 1170 | Helped |
| Add a bound-sensitive hmax heuristic instead of classical hmax (ablation) | A* for compiled OSP tasks · OSP benchmark suite, 50% bound | coverage: 812 -> 881 | Helped |
| Add a bound-sensitive hmax heuristic instead of classical hmax (ablation) | A* for compiled OSP tasks · OSP benchmark suite, 75% bound | coverage: 682 -> 726 | Helped |
| Add a bound-sensitive hmax heuristic instead of classical hmax (ablation) | A* for compiled OSP tasks · OSP benchmark suite, 100% bound | coverage: 612 -> 631 | Helped |
| Add a bound-sensitive hMS heuristic instead of classical hMS (ablation) | A* for compiled OSP tasks · OSP benchmark suite across bounds | coverage: 1170 -> 1178; 884 -> 898; 743 -> 778; 659 -> 701 | Mixed |
| Use A* with a blind heuristic instead of branch-and-bound with a blind heuristic | Compiled OSP tasks · OSP benchmark suite across bounds | coverage: 1190 -> 1182; 897 -> 892; 748 -> 743; 651 -> 658 | Mixed |
Closest papers by meaning
- Symbolic Search for Oversubscription Planning (AAAI 2021 · similarity 0.92)
- Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning (AAAI 2018 · similarity 0.89)
- New Results in Bounded-Suboptimal Search (AAAI 2022 · similarity 0.88)
- Novelty vs. Potential Heuristics: A Comparison of Hardness Measures for Satisficing Planning (AAAI 2024 · similarity 0.85)
- PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning (AAAI 2025 · similarity 0.85)
- Towards Practical Classical Planning Compilations of Numeric Planning (AAAI 2025 · 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.