In order to ensure the robust execution of a deterministic plan, execution must be adaptable to unexpected situations in the world and to exogenous events. This is critical in domains in which committing to a wrong ordering of actions can cause the plan failure, even when all the actions succeed. We propose an approach for the execution of temporal plans that permits some adaptability to unexpected situations of the environment (non-determinism) while maintaining the validity of the plan through online reasoning. Our approach computes an adaptable, partially-ordered plan from a given totally-ordered plan. The partially-ordered plan is adaptable in that it can exploit beneficial differences between the world and what was expected. The approach is general in that it can be used with any task planner that produces either a totally or a partially-ordered plan.We propose a plan execution algorithm that computes online the complete set of valid totally-ordered plans described by an adaptable partially-ordered plan together with the probability of success for each of them. This set is then used to choose the next action to execute.
|Title of host publication||Workshop on Integrated Execution (IntEx) and Goal Reasoning (GR), International Conference on Automated Planning and Scheduling|
|Subtitle of host publication||The 30th International Conference on Automated Planning and Scheduling|
|Place of Publication||[Germany]|
|Publication status||Published - 31 Jul 2020|
- Artificial Intelligence (AI)
- plan execution