Heuristic approach to guarantee safe solutions in probabilistic planning - Information, Connaissance, Interaction Access content directly
Conference Papers Year : 2017

Heuristic approach to guarantee safe solutions in probabilistic planning

Abstract

In this work, we propose a novel approach to solve probabilistic planning problems taking into account the risk that the decision maker is ready to accept regarding the probabilities of reaching the goals. Our approach guarantees that the probability of reaching a state satisfying the selected goals is above a certain limit threshold. To achieve this, we relax the constraints that all goals must be satisfied, and select the most valuable set of goals whose reachability probability is above the threshold. To this end, we propose a goal selection heuristic based on the reachability probability and the cost between goals that are estimated using an abstracted version of the problem. Finally, a planetary exploration problem will be used for illustrating the effectiveness of the proposed approach. Our results show that the obtained selections cover the most valuable possible goals and respect the reachability probability threshold.
Fichier principal
Vignette du fichier
ictai-2017_Final_Lacaze.pdf (264.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01670408 , version 1 (28-06-2021)

Identifiers

Cite

Rémi Lacaze-Labadie, Domitile Lourdeaux, Mohamed Sallak. Heuristic approach to guarantee safe solutions in probabilistic planning. 29th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2017), Nov 2017, Boston, United States. pp.579-585, ⟨10.1109/ICTAI.2017.00093⟩. ⟨hal-01670408⟩
145 View
57 Download

Altmetric

Share

Gmail Facebook X LinkedIn More