Dynamic Policy Sabotage

2021 ◽  
Author(s):  
Germán Gieczewski ◽  
Christopher Li
Keyword(s):  
Dynamic Policy

The technological car district in Piedmont: definitions, dynamic, policy

2001 ◽  
Vol 1 (4) ◽  
pp. 397 ◽  
Author(s):  
Ronny Bianchi ◽  
Aldo Enrietti ◽  
Renato Lanzetti
Keyword(s):  
Dynamic Policy

scholarly journals Robustness Computation of Dynamic Controllability in Probabilistic Temporal Networks with Ordinary Distributions

2020 ◽  
Author(s):  
Michael Saint-Guillain ◽  
Tiago Stegun Vaquero ◽  
Jagriti Agrawal ◽  
Steve Chien
Keyword(s):  
Probability Distributions ◽  
Dynamic Control ◽  
Success Probability ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Temporal Networks ◽  
Fixed Parameter ◽  
Probability Of Success ◽  
Dynamic Policy ◽  
Simple Temporal Networks

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.

Sign in / Sign up

Export Citation Format

Share Document