Timeline-based planning over dense temporal domains

DOI10.1016/j.tcs.2019.12.030zbMath1433.68406OpenAlexW2999896779WikidataQ126397358 ScholiaQ126397358MaRDI QIDQ1989337

Alberto Molinari, Adriano Peron, Laura Bozzelli, Angelo Montanari, Gerhard J. Woeginger

Publication date: 21 April 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.12.030

zbMATH Keywords

timed automataplanningmetric temporal logictimelines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Temporal logic (03B44)

Related Items (3)

Decidability and complexity of action-based temporal planning over dense time ⋮ Unnamed Item ⋮ Complexity issues for timeline-based planning over dense time under future and minimal semantics

Cites Work

• Planning and execution with flexible timelines: a formal account
• Graphs, networks and algorithms.
• Real-time logics: Complexity and expressiveness
• A theory of timed automata
• Constraint-based attribute and interval planning
• LTL with the freeze quantifier and register automata
• The benefits of relaxing punctuality
• On the decidability and complexity of Metric Temporal Logic over finite words
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Timeline-based planning over dense temporal domains