Researchers have developed a refined model for extracting optimal cost-bounded subplans from precomputed plans, a crucial task when budget constraints arise after an initial plan is made. This new approach preserves the original action order and executability while maximizing utility within a cost limit. The study introduces an enhanced Integer Linear Programming (ILP) formulation that significantly reduces model size and boosts computational efficiency, building upon prior work presented at ICAPS 2026. AI
IMPACT This research could lead to more efficient resource management in AI planning systems facing dynamic budget constraints.
RANK_REASON The cluster contains an academic paper detailing a new model and method for planning problems. [lever_c_demoted from research: ic=1 ai=1.0]
- alphaXiv
- arXiv
- CatalyzeX
- DagsHub
- del Toro
- Fuentetaja
- García-Olaya
- Gotit.pub
- Hugging Face
- ICAPS 2026
- integer linear programming
- Oversubscription Planning
- ScienceCast
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
