TGA-Based Controllers for Flexible Plan Execution

Plans synthesized by Temporal Planning and Scheduling systems may be temporally flexible hence they identify an envelope of possible solutions. Such flexibility can be exploited by an executive systems for robust on-line execution. Recent works have addressed aspects of plan execution using a quite general approach grounded on formal modeling and formal methods. The present work extends such an approach by presenting the formal synthesis of a plan controller associated to a flexible temporal plan. In particular, the controller synthesis exploits Timed Game Automata (TGA) for formal modeling and UPPAAL-TIGA as a model checker. After presenting a formal extension, the paper introduces a detailed experimental analysis on a real-world case study that demonstrates the viability of the approach. In particular, it is shown how the controller synthesis overhead is compatible with the performance expected from a short-horizon planner.

[1]  Vincent Danos,et al.  Transactions in RCCS , 2005, CONCUR.

[2]  Amedeo Cesta,et al.  Unifying planning and scheduling as timelines in a component-based perspective , 2008 .

[3]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[4]  Joseph Sifakis,et al.  On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) , 1995, STACS.

[5]  Frederic Py,et al.  A systematic agent framework for situated autonomous systems , 2010, AAMAS.

[6]  E. Gat On Three-Layer Architectures , 1997 .

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

[8]  Kevin Cheng,et al.  Rock solid , 2007, INTR.

[9]  Julie A. Shah,et al.  Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation , 2008, ICAPS.

[10]  Alex M. Andrew,et al.  Artificial Intelligence and Mobile Robots , 1999 .

[11]  Nicola Muscettola,et al.  Temporal Dynamic Controllability Revisited , 2005, AAAI.

[12]  Thierry Vidal,et al.  Handling contingency in temporal constraint networks: from consistency to controllabilities , 1999, J. Exp. Theor. Artif. Intell..

[13]  Robert P. Goldman,et al.  Exploiting Implicit Representations in Timed Automaton Verification for Controller Synthesis , 2002, HSCC.

[14]  Charles Lesire,et al.  Planning robust temporal plans a comparison between CBTP and TGA approaches , 2007 .

[15]  Nicola Muscettola,et al.  Dynamic Control Of Plans With Temporal Uncertainty , 2001, IJCAI.

[16]  Félix Ingrand,et al.  Interleaving Temporal Planning and Execution in Robotics Domains , 2004, AAAI.

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

[18]  Mark S. Fox,et al.  Intelligent Scheduling , 1998 .

[19]  Kim G. Larsen,et al.  Efficient On-the-Fly Algorithms for the Analysis of Timed Games , 2005, CONCUR.

[20]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.