Chance-constrained Scheduling via Conflict-directed Risk Allocation
Temporal uncertainty in large-scale logistics forces one to trade off between lost efficiency through built-in slack and costly replanning when deadlines are missed. Due to the difficulty of reasoning about such likelihoods and consequences, a computational framework is needed to quantify and bound...
Main Authors: | Wang, Andrew J., Williams, Brian Charles |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Association for the Advancement of Artificial Intelligence
2015
|
Online Access: | http://hdl.handle.net/1721.1/92982 https://orcid.org/0000-0002-1057-3940 |
Similar Items
-
Risk allocation strategies for distributed chance-constrained task allocation
by: Ponda, Sameera S., et al.
Published: (2013) -
Decentralized chance-constrained finite-horizon
by: Williams, Brian Charles, et al.
Published: (2011) -
RAO*: an Algorithm for Chance-Constrained POMDP’s
by: Santana, Pedro, et al.
Published: (2016) -
Chance-Constrained Probabilistic Simple Temporal Problems
by: Fang, Cheng, et al.
Published: (2015) -
Chance Constrained Finite Horizon Optimal Control
by: Ono, Masahiro, et al.
Published: (2011)