Research map / Learning theory and algorithms / Combinatorial and search optimization
Deciding Unsolvability in Temporal Planning under Action Non-Self-Overlapping
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 terminating DBM-based heuristic search for ANSO temporal planning | TAMER-CTP · Total Unsolvable | instances solved | Helped |
| use symbolic timed-transition-system model checking | NUXMV encoding · Total Unsolvable | instances solved | Helped |
| use TAMER-CTP rather than compilation-based approaches | solvable temporal-planning instances · Total Solvable | instances solved | Mixed |
| add the hadd heuristic rather than using a zero heuristic (ablation) | TAMER-CTP · Total Solvable | instances solved: 38 -> 390 | Helped |
| add the hadd heuristic rather than using a zero heuristic (ablation) | TAMER-CTP · Total Unsolvable | instances solved: 105 -> 110 | Helped |
| combine NUXMV with TAMER-CTP | unsolvable benchmarks · Total Unsolvable | instances solved | Helped |
Closest papers by meaning
- Decidability and Complexity of Action-Based Temporal Planning over Dense Time (AAAI 2020 · similarity 0.90)
- Abstract Action Scheduling for Optimal Temporal Planning via OMT (AAAI 2024 · similarity 0.88)
- Temporal Numeric Planning with Patterns (AAAI 2025 · similarity 0.87)
- Automatic Selection of Macro-Events for Heuristic-Search Temporal Planning (AAAI 2025 · similarity 0.86)
- Temporal Task and Motion Planning with Metric Time for Multiple Object Navigation (AAAI 2025 · similarity 0.86)
- Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity Analysis (AAAI 2024 · similarity 0.86)
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.