Research map / Learning theory and algorithms / Combinatorial and search optimization
Expressive Optimal Temporal Planning via Optimization Modulo Theory
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 |
|---|---|---|---|
| Use OMT-based ANMLOMT rather than OPTIC | Temporal planning · MAJSP | instances proven optimal: 0 -> 12 | Helped |
| Use OMT-based ANMLOMT rather than OPTIC | Temporal planning · PAINTER | instances proven optimal: 0 -> 15 | Helped |
| Use OPTIC rather than ANMLOMT INC (OMSAT) | Temporal planning · MATCH-MS | instances proven optimal: 30 -> 26 | Hurt |
| Use OMT-based ANMLOMT rather than OPTIC | Temporal planning · MATCH-AC | instances proven optimal: 1 -> 27 | Helped |
| Use OMT-based ANMLOMT rather than OPTIC | Temporal planning · OVERSUB | instances proven optimal: 10 -> 30 | Helped |
| Use ANMLOMT INC (OMSAT) rather than OPTIC | Temporal planning · All domains | instances proven optimal: 41 -> 110 | Helped |
| Add incremental encoding (ablation) | ANMLOMT with OMSAT · All domains | instances proven optimal: 84 -> 110 | Helped |
| Add incremental encoding (ablation) | ANMLOMT with Z3 · All domains | instances proven optimal: 91 -> 88 | Hurt |
| Add incremental encoding (ablation) | ANMLOMT with OMSAT · OVERSUB | instances proven optimal: 7 -> 30 | Helped |
| Add incremental encoding (ablation) | ANMLOMT with Z3 · PAINTER | instances proven optimal: 13 -> 12 | Hurt |
| Use incremental encoding with OMSAT rather than without it (ablation) | ANMLOMT · MATCH-MS | instances proven optimal: 27 -> 26 | Hurt |
| Use incremental encoding with OMSAT rather than without it (ablation) | ANMLOMT · MATCH-AC | instances proven optimal: 25 -> 27 | Helped |
Closest papers by meaning
- Abstract Action Scheduling for Optimal Temporal Planning via OMT (AAAI 2024 · similarity 0.90)
- Automatic Selection of Macro-Events for Heuristic-Search Temporal Planning (AAAI 2025 · similarity 0.85)
- Temporal Numeric Planning with Patterns (AAAI 2025 · similarity 0.84)
- Dealing with Numeric and Metric Time Constraints in PDDL3 via Compilation to Numeric Planning (AAAI 2024 · similarity 0.83)
- Symbolic Numeric Planning with Patterns (AAAI 2024 · similarity 0.83)
- Improving planning and MBRL with temporally-extended actions (NeurIPS 2025 · 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.