Research map / Learning theory and algorithms / Combinatorial and search optimization
Efficiently Reasoning with Interval Constraints in Forward Search Planning
Amanda Coles, Andrew Coles, Moises Martinez, Emre Savas, Juan Manuel Delfa, Tomás de la Rosa, Yolanda E-Martín, Angel García-Olaya
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| handle interval constraints natively instead of by compilation to extra actions | OPTIC · Concrete, Crewplanning, Zeno Travel, Cafe | time to solve: under 2 seconds | Improved |
| scale durations and constraints by 10 to fit MTP discretization | MTP · benchmark domains | problems solved | Improved |
| remove total goal ordering (problems 13-18 vs 7-12) | OPTIC · Mars rover | solve time | Improved |
| remove total goal ordering (problems 13-18) | APSI · Mars rover | solve time | Hurt |
Closest papers by meaning
- Dealing with Numeric and Metric Time Constraints in PDDL3 via Compilation to Numeric Planning (AAAI 2024 · similarity 0.88)
- Temporal Numeric Planning with Patterns (AAAI 2025 · similarity 0.86)
- Counting and Reasoning with Plans (AAAI 2025 · similarity 0.85)
- PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning (AAAI 2025 · similarity 0.84)
- LexiCon: a Benchmark for Planning under Temporal Constraints in Natural Language (NeurIPS 2025 · similarity 0.84)
- Leveraging Environment Interaction for Automated PDDL Translation and Planning with Large Language Models (NeurIPS 2024 · similarity 0.83)
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.
