Timeline-based planning over dense temporal domains

DOI10.1016/J.TCS.2019.12.030MaRDI QIDQ1989337zbMATH OpenOpenAlexWikidataFDO

Authors Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, 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

metric temporal logicplanningtimed automatatimelines

Mathematics Subject Classification ID

Temporal logic (03B44) 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)

Recommendations

• Taming the complexity of timeline-based planning over dense temporal domains
• Complexity of timeline-based planning over dense temporal domains: exploring the middle ground
• Complexity issues for timeline-based planning over dense time under future and minimal semantics
• Domain-independent temporal planning in a planning-graph-based approach
• Decidability and complexity of action-based temporal planning over dense time
• Lifted heuristics for timeline-based planning
• scientific article; zbMATH DE number 2085254
• scientific article; zbMATH DE number 140366
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Cites work

• A theory of timed automata
• Algorithmics. The spirit of computing
• Complexity of timeline-based planning over dense temporal domains: exploring the middle ground
• Constraint-based attribute and interval planning
• Graphs, networks and algorithms.
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• LTL with the freeze quantifier and register automata
• On the decidability and complexity of Metric Temporal Logic over finite words
• Planning and execution with flexible timelines: a formal account
• Real-time logics: Complexity and expressiveness
• The benefits of relaxing punctuality

Cited in

(14)

• Strong temporal planning with uncontrollable durations
• Complexity issues for timeline-based planning over dense time under future and minimal semantics
• Decidability and complexity of action-based temporal planning over dense time
• On timeline-based games and their complexity
• Managing temporal cycles in planning problems requiring concurrency
• Complexity of timeline-based planning over dense temporal domains: exploring the middle ground
• scientific article; zbMATH DE number 1536550 (Why is no real title available?)
• Lifted heuristics for timeline-based planning
• A game-theoretic approach to timeline-based planning with uncertainty
• Taming the complexity of timeline-based planning over dense temporal domains
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Controller synthesis for timeline-based games
• Controller synthesis for timeline-based games
• From non-punctuality to non-adjacency: a quest for decidability of timed temporal logics with quantifiers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1989337)