Decidability and complexity of action-based temporal planning over dense time

DOI10.1016/j.artint.2022.103686OpenAlexW4220829591MaRDI QIDQ2124463

Enrico Scala, Andrea Micheli, Angelo Montanari, Nicola Gigante

Publication date: 11 April 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2022.103686

zbMATH Keywords

computational complexitytimed automatatiling problemstemporal planning

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (1)

A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning

Uses Software

• PDDL
• SAPA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real-time logics: Complexity and expressiveness
• On the undecidability of probabilistic planning and related stochastic optimization problems
• Weak, strong, and strong cyclic planning via symbolic model checking
• A theory of timed automata
• The computational complexity of propositional STRIPS planning
• Complexity results for HTN planning
• Complexity, decidability and undecidability results for domain-independent planning
• Updatable timed automata
• A process algebra for timed systems
• Timeline-based planning over dense temporal domains
• A complete parameterized complexity analysis of bounded planning
• Processes and continuous change in a SAT-based planner
• Complexity Analysis of Continuous Petri Nets
• ITSAT: An Efficient SAT-Based Temporal Planner
• Complexity of finite-horizon Markov decision process problems
• A really temporal logic
• Interval-Based Relaxation for General Numeric Planning.
• Time and Space Bounds for Planning

This page was built for publication: Decidability and complexity of action-based temporal planning over dense time