PARIS: A Polynomial-Time, Risk-Sensitive Scheduling Algorithm for Probabilistic Simple Temporal Networks with Uncertainty.
Pedro Henrique de Rodrigues Quemel e Assis SantanaTiago VaqueroCláudio ToledoAndrew J. WangCheng FangBrian Charles WilliamsPublished in: ICAPS (2016)
Keyphrases
- scheduling algorithm
- risk sensitive
- simple temporal
- response time
- temporal constraints
- expected utility
- optimal control
- utility function
- decision theory
- scheduling strategy
- conditional probabilities
- markov decision processes
- temporal reasoning
- decision theoretic
- special case
- bayesian networks
- model free
- decision makers
- belief networks
- control policies
- markov decision problems
- computational complexity