Skip to main navigation Skip to search Skip to main content

Olisipo: A probabilistic approach to the adaptable execution of deterministic temporal plans

Tomás Ribeiro, Oscar Lima, Michael Cashmore, Andrea Micheli, Rodrigo Ventura

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

12 Downloads (Pure)

Abstract

The robust execution of a temporal plan in a perturbed environment is a problem that remains to be solved. Perturbed environments, such as the real world, are non-deterministic and filled with uncertainty. Hence, the execution of a temporal plan presents several challenges and the employed solution often consists of replanning when the execution fails. In this paper, we propose a novel algorithm, named Olisipo, which aims to maximise the probability of a successful execution of a temporal plan in perturbed environments. To achieve this, a probabilistic model is used in the execution of the plan, instead of in the building of the plan. This approach enables Olisipo to dynamically adapt the plan to changes in the environment. In addition to this, the execution of the plan is also adapted to the probability of successfully executing each action. Olisipo was compared to a simple dispatcher and it was shown that it consistently had a higher probability of successfully reaching a goal state in uncertain environments, performed fewer replans and also executed fewer actions. Hence, Olisipo offers a substantial improvement in performance for disturbed environments.
Original languageEnglish
Title of host publication28th International Symposium on Temporal Representation and Reasoning (TIME 2021)
EditorsCarlo Combi, Johann Eder, Mark Reynolds
Place of PublicationDagstuhl, Germany
DOIs
Publication statusPublished - 16 Sept 2021

Keywords

  • temporal planning
  • temporal plan execution
  • robotics

Fingerprint

Dive into the research topics of 'Olisipo: A probabilistic approach to the adaptable execution of deterministic temporal plans'. Together they form a unique fingerprint.

Cite this