Robustness Computation of Dynamic Controllability in Probabilistic Temporal Networks with Ordinary Distributions. Saint-Guillain, M., Vaquero, T. S., Agrawal, J., & Chien, S. In International Joint Conference on Artificial Intelligence (IJCAI), Yokohama, Japan, 2020.
abstract   bibtex   
Most existing works in Probabilistic Simple Temporal Networks (PSTNs) base their frameworks on well-defined probability distributions. This paper addresses on PSTN Dynamic Controllability (DC) robustness measure, i.e. the execution success probability of a network under dynamic control. We consider PSTNs where the probability distributions of the contingent edges are ordinary distributed (e.g. non-parametric, non-symmetric). We introduce the concepts of dispatching protocol (DP) as well as DP-robustness, the probability of success under a predefined dynamic policy. We propose a fixed-parameter pseudo-polynomial time algorithm to compute the exact DP-robustness of any PSTN under NextFirst protocol, and apply to various PSTN datasets, including the real case of planetary exploration in the context of the Mars 2020 rover, and propose an original structural analysis.
@inproceedings{saint-guillain-et-al-IJCAI2020,
author = {Michael Saint-Guillain and Tiago Stegun Vaquero and Jagriti Agrawal
          and Steve Chien},
booktitle = {International Joint Conference on Artificial Intelligence (IJCAI)},
title = {Robustness Computation of Dynamic Controllability in
         Probabilistic Temporal Networks with Ordinary Distributions},
year = {2020},
address = {Yokohama, Japan},
abstract = {Most existing works in Probabilistic Simple Temporal Networks (PSTNs) base their frameworks on well-defined probability distributions. This paper addresses on PSTN Dynamic Controllability (DC) robustness measure, i.e. the execution success probability of a network under dynamic control. We consider PSTNs where the probability distributions of the contingent edges are ordinary distributed (e.g. non-parametric, non-symmetric). We introduce the concepts of dispatching protocol (DP) as well as DP-robustness, the probability of success under a predefined dynamic policy. We propose a fixed-parameter pseudo-polynomial time algorithm to compute the exact DP-robustness of any PSTN under NextFirst protocol, and apply to various PSTN datasets, including the real case of planetary exploration in the context of the Mars 2020 rover, and propose an original structural analysis.},
project = {m2020},
clearance = {CL#20-1880},
}

Downloads: 0