Research map / Learning theory and algorithms / Combinatorial and search optimization
Decidability and Complexity of Action-Based Temporal Planning over Dense Time
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.
Closest papers by meaning
- Temporal Numeric Planning with Patterns (AAAI 2025 · similarity 0.87)
- Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity Analysis (AAAI 2024 · similarity 0.86)
- Dealing with Numeric and Metric Time Constraints in PDDL3 via Compilation to Numeric Planning (AAAI 2024 · similarity 0.85)
- Thought of Search: Planning with Language Models Through The Lens of Efficiency (NeurIPS 2024 · similarity 0.84)
- Abstract Action Scheduling for Optimal Temporal Planning via OMT (AAAI 2024 · similarity 0.84)
- Towards Practical Classical Planning Compilations of Numeric Planning (AAAI 2025 · similarity 0.84)
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.