Kongming: a generative planner for hybrid systems with temporally extended goals

Most unmanned missions in space and undersea are commanded by a "script" that specifies a sequence of discrete commands and continuous actions. Currently such scripts are mostly hand-generated by human operators. This introduces inefficiency, puts a significant cognitive burden on the engineers, and prevents re-planning in response to environment disturbances or plan execution failure. For discrete systems, the field of autonomy has elevated the level of commanding by developing goal-directed systems, to which human operators specify a series of temporally extended goals to be accomplished, and the goal-directed systems automatically output the correct, executable command sequences. Increasingly, the control of autonomous systems involves performing actions with a mix of discrete and continuous effects. For example, a typical autonomous underwater vehicle (AUV) mission involves discrete actions, like get GPS and take sample, and continuous actions, like descend and ascend, which are influenced by the dynamical model of the vehicle. A hybrid planner generates a sequence of discrete and continuous actions that achieve the mission goals. In this thesis, I present a novel approach to solve the generative planning problem for temporally extended goals for hybrid systems, involving both continuous and discrete actions. The planner, Kongming1, incorporates two innovations. First, it employs a compact representation of all hybrid plans, called a Hybrid Flow Graph, which combines the strengths of a Planning Graph for discrete actions and Flow Tubes for continuous actions. Second, it engages novel reformulation schemes to handle temporally flexible actions and temporally extended goals. I have successfully demonstrated controlling an AUV in the Atlantic ocean using mission scripts solely generated by Kongming. I have also empirically evaluated Kongming on various real-world scenarios in the underwater domain and the air vehicle domain, and found it successfully and efficiently generates valid and optimal plans. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.) 1Kongming is the courtesy name of the genius strategist of the Three Kingdoms period in ancient China.

[1]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[2]  Seung H. Chung MODEL-BASED PLANNING THROUGH CONSTRAINT AND CAUSAL ORDER DECOMPOSITION , 2008 .

[3]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[4]  Mato Baotic,et al.  Multi-Parametric Toolbox (MPT) , 2004, HSCC.

[5]  Hector Geffner,et al.  Heuristic Planning with Time and Resources , 2014 .

[6]  Ivan Serina,et al.  Planning with Numerical Expressions in LPG , 2004, ECAI.

[7]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[8]  Fahiem Bacchus,et al.  Planning for temporally extended goals , 1996, Annals of Mathematics and Artificial Intelligence.

[9]  María Auxilio Osorio Lama,et al.  Mixed Logical-linear Programming , 1999, Discret. Appl. Math..

[10]  Raimund Seidel,et al.  How Good Are Convex Hull Algorithms? , 1997, Comput. Geom..

[11]  Jörg Hoffmann,et al.  The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables , 2003, J. Artif. Intell. Res..

[12]  Blai Bonet,et al.  Planning as Heuristic Search: New Results , 1999, ECP.

[13]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[14]  John W. Chinneck,et al.  Feasibility and Viability , 1997 .

[15]  Andrew Coles,et al.  Planning with Problems Requiring Temporal Coordination , 2008, AAAI.

[16]  Subbarao Kambhampati,et al.  Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP , 2001, Artif. Intell..

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

[18]  Andrew Coles,et al.  A Hybrid Relaxed Planning Graph'LP Heuristic for Numeric Planning Domains , 2008, ICAPS.

[19]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[20]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[21]  Bruce H. Krogh,et al.  Computing Approximating Automata for a Class of Linear Hybrid Systems , 1997, Hybrid Systems.

[22]  B. Krogh,et al.  Computing polyhedral approximations to flow pipes for dynamic systems , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[23]  Andrew Coles,et al.  Temporal Planning in Domains with Linear Processes , 2009, IJCAI.

[24]  Andreas G. Hofmann Robust execution of bipedal walking tasks from biomechanical principles , 2006 .