atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning

AAAI 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Classical and HTN planning · 22 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use IP model instead of its LP relaxation for the heuristic (ablation)interval-relaxation heuristic · numeric planning benchmarkscoverage: 147 -> 170 (h^{c,tr} LP vs IP)Helped
Use IP instead of LP on propositional-heavy IPC domains (ablation)h^c · Rover, Satellite, Depots, Zeno TravelcoverageHurt
Add landmark, relevance, dominance and inverse-action constraints to LP (ablation)LP heuristic · numeric planning benchmarkscoverageHelped
Add state equation constraints (ablation)h^c · numeric planning benchmarkscoverageHelped
Add sequencing constraints (8)-(9) (ablation)h^c_IP · numeric planning benchmarkssolving time: coverage 173 -> 170Hurt
Use IP-based interval relaxation heuristics instead of h^lma+ and h^r_maxA* with IP heuristics · numeric planning benchmarksstates expanded: 17620.2 -> 504.1Helped
Solve cost partitioning of h^lma+ as IP instead of LPh^lma+ · numeric planning benchmarkscoverage: 153 -> 143No clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy