Undecidability of Future Timeline-based Planning over Dense Temporal Domains?

Planning is one of the most studied problems in computer science. In this paper, we consider the timeline-based approach, where the domain is modeled by a set of independent, but interacting, components, identified by a set of state variables, whose behavior over time (timelines) is governed by a set of temporal constraints (synchronization rules). Timeline-based planning in the dense-time setting has been recently shown to be undecidable in the general case, and undecidability relies on the high expressiveness of the trigger synchronization rules. In this paper, we strengthen the previous negative result by showing that undecidability already holds under the future semantics of the trigger rules which limits the comparison to temporal contexts in the future with respect to the trigger.

[1]  Angelo Montanari,et al.  Decidability and Complexity of Timeline-Based Planning over Dense Temporal Domains , 2018, KR.

[2]  Joël Ouaknine,et al.  On Metric Temporal Logic and Faulty Turing Machines , 2006, FoSSaCS.

[3]  Marco Roveri,et al.  Timelines with Temporal Uncertainty , 2013, AAAI.

[4]  Enrico Tronci,et al.  Flexible Timeline-Based Plan Verification , 2009, KI.

[5]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, JACM.

[6]  Angelo Montanari,et al.  Complexity of Timeline-Based Planning over Dense Temporal Domains: Exploring the Middle Ground , 2018, GandALF.

[7]  Joël Ouaknine,et al.  On the decidability and complexity of Metric Temporal Logic over finite words , 2007, Log. Methods Comput. Sci..

[8]  Enrico Tronci,et al.  Analyzing Flexible Timeline-based Plans , 2010, ECAI.

[9]  Marta Cialdea Mayer,et al.  An Executable Semantics of Flexible Plans in Terms of Timed Game Automata , 2015, 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME).

[10]  Marta Cialdea Mayer,et al.  A Formal Account of Planning with Flexible Timelines , 2014, 2014 21st International Symposium on Temporal Representation and Reasoning.

[11]  Angelo Montanari,et al.  Complexity of Timeline-Based Planning , 2017, ICAPS.

[12]  Jeremy Frank,et al.  Constraint-Based Attribute and Interval Planning , 2003, Constraints.

[13]  Nicola Gigante,et al.  Timeline-based planning: Expressiveness and Complexity , 2019, ArXiv.

[14]  Jussi Rintanen,et al.  Complexity of Concurrent Temporal Planning , 2007, ICAPS.

[15]  Tristan B. Smith,et al.  EUROPA : A Platform for AI Planning, Scheduling, Constraint Programming, and Optimization , 2012 .

[16]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[17]  Steve A. Chien,et al.  Timeline-ased Space Operations Scheduling with External Constraints , 2010 .

[18]  Gerhard J. Woeginger,et al.  Timeline-based planning over dense temporal domains , 2020, Theor. Comput. Sci..

[19]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[20]  Nicola Muscettola,et al.  Planning in Interplanetary Space: Theory and Practice , 2000, AIPS.

[21]  Angelo Montanari,et al.  Decidability and Complexity of Action-Based Temporal Planning over Dense Time , 2020, AAAI.

[22]  Amedeo Cesta,et al.  An Innovative Product for Space Mission Planning: An A Posteriori Evaluation , 2007, ICAPS.

[23]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[24]  Angelo Montanari,et al.  Timelines Are Expressive Enough to Capture Action-Based Temporal Planning , 2016, 2016 23rd International Symposium on Temporal Representation and Reasoning (TIME).

[25]  Nicola Muscettola,et al.  HSTS: Integrating Planning and Scheduling , 1993 .

[26]  Marta Cialdea Mayer,et al.  Planning and execution with flexible timelines: a formal account , 2016, Acta Informatica.

[27]  Dario Della Monica,et al.  A Novel Automata-Theoretic Approach to Timeline-Based Planning , 2018, KR.

[28]  Thomas A. Henzinger,et al.  A really temporal logic , 1994, JACM.