Automated Planning and Scheduling using Calculus of Variations in Discrete Space

In this paper, we propose new dominance relations that can speed up significantly the solution process of planning problems formulated as nonlinear constrained dynamic optimization in discrete time and space. We first show that path dominance in dynamic programming cannot be applied when there are general constraints that span across multiple stages, and that node dominance, in the form of Euler-Lagrange conditions developed in optimal control theory in continuous space, cannot be extended to that in discrete space. This paper is the first to propose efficient node-dominance relations, in the form of local saddle-point conditions in each stage of a discrete-space planning problem, for pruning states that will not lead to locally optimal paths. By utilizing these dominance relations, we present efficient search algorithms whose complexity, despite exponential, has a much smaller base as compared to that without using the relations. Finally, we demonstrate the performance of our approach by integrating it in the ASPEN planner and show significant improvements in CPU time and solution quality on some spacecraft scheduling and planning benchmarks.

[1]  Subbarao Kambhampati,et al.  AltAlt: Combining the Advantages of Graphplan and Heuristic State Search , 2000 .

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

[3]  Yixin Chen,et al.  Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization , 2000, CP.

[4]  Peter Stone,et al.  Interactive, repair-based planning and scheduling for Shuttle payload operations , 1997, 1997 IEEE Aerospace Conference.

[5]  Ivan Serina,et al.  LPG: A Planner Based on Local Search for Planning Graphs with Action Costs , 2002, AIPS.

[6]  M. Fourman Propositional Planning , 2000 .

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

[8]  Mary W. Cooper,et al.  Dynamic Programming and the Calculus of Variations , 1981 .

[9]  Zhe Wu,et al.  The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization , 1999, CP.

[10]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[11]  J. Logan,et al.  First integrals in the discrete variational calculus , 1972 .

[12]  Betty Jean Harmsen The discrete calculus of variations , 1995 .

[13]  A. Veselov Integrable discrete-time systems and difference operators , 1988 .

[14]  Alex Fukunaga,et al.  Iterative Repair Planning for Spacecraft Operations Using the Aspen System , 2000 .

[15]  Yue Cao,et al.  Total-Order Planning with Partially Ordered Subtasks , 2001, IJCAI.

[16]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

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

[18]  Ioannis P. Vlahavas,et al.  The GRT Planner , 2001, AI Mag..

[19]  Yixin Chen,et al.  Calculus of variations in discrete space for constrained nonlinear dynamic optimization , 2002, 14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings..

[20]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[21]  Daniel S. Weld,et al.  Combining linear programming and satisfiability solving for resource planning , 2001, The Knowledge Engineering Review.

[22]  Tao Wang,et al.  Simulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization , 1999, CP.

[23]  Stefan Edelkamp Mixed Propositional and Numeric Planning in the Model Checking Integrated Planning System , 2002, AIPS Workshop on Planning for Temporal Domains.

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

[25]  Yixin Chen,et al.  OPTIMAL ANYTIME SEARCH FOR CONSTRAINED NONLINEAR PROGRAMMING , 2001 .

[26]  Henry Kautz,et al.  Integer optimization models of AI planning problems , 2000, The Knowledge Engineering Review.

[27]  Patrick Doherty,et al.  TALplanner: an empirical investigation of a temporal logic-based forward chaining planner , 1999, Proceedings. Sixth International Workshop on Temporal Representation and Reasoning. TIME-99.

[28]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[29]  Gregg Rabideau,et al.  The Citizen Explorer design and operations planning system , 1999, 1999 IEEE Aerospace Conference. Proceedings (Cat. No.99TH8403).

[30]  M. Fox,et al.  Efficient Implementation of the Plan Graph in STAN , 2011, J. Artif. Intell. Res..

[31]  Xin Yao,et al.  Evolutionary Optimization , 2002 .

[32]  Ehl Emile Aarts,et al.  Simulated annealing and Boltzmann machines , 2003 .