Chance-Constrained Probabilistic Simple Temporal Problems
Scheduling under uncertainty is essential to many autonomous systems and logistics tasks. Probabilistic methods for solving temporal problems exist which quantify and attempt to minimize the probability of schedule failure. These methods are overly conservative, resulting in a loss in schedule utili...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Association for the Advancement of Artificial Intelligence (AAAI)
2015
|
| Online Access: | http://hdl.handle.net/1721.1/94526 https://orcid.org/0000-0002-6995-7690 https://orcid.org/0000-0002-1057-3940 https://orcid.org/0000-0001-7016-9803 |