Opportunistic Branched Plans to Maximise Utility in the Presence of Resource Uncertainty

In many applications, especially autonomous exploration, there is a trade-off between operational safety, forcing conservatism about resource usage; and maximising utility, requiring high resource utilisation. In this paper we consider a method of generating plans that maintain this conservatism whilst allowing exploitation of situations where resource usage is better than pessimistically estimated. We consider planning problems with soft goals, each with a violation cost. The challenge is to maximise utility (minimise the violation cost paid) whilst maintaining confidence that the plan will execute within the specified limits. We first show how forward search planning can be extended to generate such plans. Then we extend this to build branched plans: tree structures labelled with conditions on executing branches. Lower cost branches can be followed if their conditions are met. We demonstrate that the use of such plans can dramatically increase utility whilst still obeying strict safety constraints.

[1]  Brian Charles Williams,et al.  Drake: An Efficient Executive for Temporal Plans with Choice , 2011, J. Artif. Intell. Res..

[2]  Andrew Coles,et al.  LPRPG-P: Relaxed Plan Heuristics for Planning with Preferences , 2011, ICAPS.

[3]  François Michaud,et al.  Planning with Concurrency under Resources and Time Uncertainty , 2010, ECAI.

[4]  Ugur Kuter,et al.  Incremental plan aggregation for generating policies in MDPs , 2010, AAMAS.

[5]  Patrik Haslum,et al.  Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners , 2009, Artif. Intell..

[6]  Subbarao Kambhampati,et al.  Anytime heuristic search for partial satisfaction planning , 2009, Artif. Intell..

[7]  Jorge A. Baier,et al.  A Heuristic Search Approach to Planning with Temporally Extended Preferences , 2007, IJCAI.

[8]  Ruth Aylett,et al.  On-board timeline validation and repair : a feasibility study , 2006 .

[9]  Maria Fox,et al.  VAL: automatic plan validation, continuous effects and mixed initiative planning using PDDL , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

[10]  Håkan L. S. Younes,et al.  Policy Generation for Continuous-time Stochastic Domains with Concurrency , 2004, ICAPS.

[11]  David E. Smith Choosing Objectives in Over-Subscription Planning , 2004, ICAPS.

[12]  John L. Bresina,et al.  Just-In-Case Scheduling , 1994, AAAI.

[13]  Mausam,et al.  Planning with Durative Actions in Stochastic Domains , 2008, J. Artif. Intell. Res..

[14]  Patrick Fabiani,et al.  A Simulation-based Approach for Solving Temporal Markov Problems , 2008 .

[15]  S. Edelkamp,et al.  Large-Scale Optimal PDDL 3 Planning with MIPS-XXL , 2006 .

[16]  J. Ho,et al.  The Metric FF Planning System Translating Ignoring Delete Lists to Numeric State Variables , 2003 .