Dynamic Online Planning and Scheduling Using a Static Invariant-Based Evaluation Model

Sequential decision-making under uncertainty often uses an approach in which a plan is built over a given horizon ahead using a deterministic model, the first decisions in this plan are applied, new information is acquired, the plan is adapted or rebuilt from scratch over a sliding horizon, and so on. This paper introduces a generic local search library that can be used in this context to quickly build and rebuild good quality plans. This library is built upon the notion of invariant used in constraint-based local search. Invariants allow temporal constraints, resource constraints, and criteria to be very quickly evaluated from a variable assignment and re-evaluated from a small change in this assignment. The paper also shows how the library can be used to reason on dynamic problem instances using a unique static problem model, without dynamic memory allocation. The approach is illustrated on a problem of data download under uncertainty about the volume of data, coming from the space domain.

[1]  Ivan Serina,et al.  Plan Stability: Replanning versus Plan Repair , 2006, ICAPS.

[2]  Manuela M. Veloso,et al.  Rationale-Based Monitoring for Planning in Dynamic Environments , 1998, AIPS.

[3]  Gérard Verfaillie,et al.  Constraint Solving in Uncertain and Dynamic Environments: A Survey , 2005, Constraints.

[4]  Cédric Pralet,et al.  Time-dependent Simple Temporal Networks: Properties and Algorithms , 2013, RAIRO Oper. Res..

[5]  Benjamin Cichy,et al.  Flight software issues in onboard automated planning: lessons learned on EO-1 , 2004 .

[6]  Brian Falkenhainer,et al.  Dynamic Constraint Satisfaction Problems , 1990, AAAI.

[7]  Russell Bent,et al.  Online stochastic combinatorial optimization , 2006 .

[8]  Mark Wallace,et al.  Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.

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

[10]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[11]  Karen L. Myers.  CPEF: A Continuous Planning and Execution Framework , 1999, AI Mag..

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

[13]  Amedeo Cesta,et al.  Managing Dynamic Temporal Constraint Networks , 1994, AIPS.

[14]  Narendra Jussien,et al.  Explanation-based repair techniques for solving dynamic scheduling problems , 2002 .

[15]  Thierry Benoist,et al.  LocalSolver 1.x: a black-box local-search solver for 0-1 programming , 2011, 4OR.

[16]  Enrique Alba,et al.  Metaheuristics for Dynamic Optimization , 2012, Metaheuristics for Dynamic Optimization.

[17]  Bertrand M. T. Lin,et al.  A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..

[18]  Rob Sherwood,et al.  Using Iterative Repair to Improve the Responsiveness of Planning and Scheduling , 2000, AIPS.

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

[20]  I. M. Ovacikt,et al.  Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times , 1994 .

[21]  Marc Schoenauer,et al.  An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning , 2010, ICAPS.

[22]  Martha E. Pollack,et al.  There's More to Life than Making Plans: Plan Management in Dynamic, Multiagent Environments , 1999, AI Mag..

[23]  Stanislaw Gawiejnowicz,et al.  Time-Dependent Scheduling , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[24]  Amedeo Cesta,et al.  Gaining efficiency and flexibility in the simple temporal problem , 1996, Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96).

[25]  Robert T. Effinger,et al.  Enabling Fast Flexible Planning through Incremental Temporal Reasoning with Conflict Extraction , 2005, ICAPS.

[26]  Pascal Van Hentenryck,et al.  Constraint-based local search , 2018, Handbook of Heuristics.

[27]  Edmund H. Durfee,et al.  A Survey of Research in Distributed, Continual Planning , 1999, AI Mag..

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

[29]  Ivan Serina,et al.  Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..