Generating Temporally Contingent Plans

Uncertainty applies to many aspects of planning problems. Much research has been done to deal with problems where actions have uncertain effects. In reality, many planning problems also involve actions with uncertain durations, but this type of uncertainty has not been widely studied in planning until the recent development of several planners which incorporate durational uncertainty. Additionally, theoretical work has been done on characterizing the level of controllability in plans involving actions with uncertain durations. We have developed an approach for finding temporally contingent plans, i.e., plans with branches that are based on the duration of an action at execution time. More specifically, the problems we are studying satisfy the following criteria: (1) there is more than one solution plan, (2) solution plans are ranked by a metric that is not fully based on makespan, (3) actions have uncertain durations, (4) the start and/or end times of some actions are constrained, and (5) as actions require more time to complete, plans that are judged highly by the metric become invalid. We describe our approach for determining the time points that cause an unsafe situation and for inserting temporal contingency branches. Experimental results with both sequential and parallel plans are discussed.

[1]  Ivan Serina,et al.  Planning in PDDL2.2 Domains with LPG-td , 2004 .

[2]  Using Interaction Costs for Microarchitectural Bottleneck Analysis , 2003, MICRO.

[3]  Håkan L. S. Younes,et al.  Solving Generalized Semi-Markov Decision Processes Using Continuous Phase-Type Distributions , 2004, AAAI.

[4]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

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

[6]  Martha E. Pollack,et al.  Conditional, Probabilistic Planning: A Unifying Algorithm and Effective Search Control Mechanisms , 1999, AAAI/IAAI.

[7]  David E. Smith,et al.  Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.

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

[9]  Hector Geffner,et al.  Branching and pruning: An optimal temporal POCL planner based on constraint programming , 2004, Artif. Intell..

[10]  Subbarao Kambhampati,et al.  Planning Graph-based Heuristics for Cost-sensitive Temporal Planning , 2002, AIPS.

[11]  David E. Smith,et al.  Incremental Contingency Planning , 2003 .

[12]  Mausam,et al.  Concurrent Probabilistic Temporal Planning , 2005, ICAPS.

[13]  D. Borrajo,et al.  Integrating Hybrid Reasoners for Planning and Scheduling , 2002 .

[14]  Martha E. Pollack,et al.  Merging Plans with Quantitative Temporal Constraints, Temporally Extended Actions, and Conditional Branches , 2000, AIPS.

[15]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

[16]  Sylvie Thiébaux,et al.  Prottle: A Probabilistic Temporal Planner , 2005, AAAI.