Conference Proceeding Article
The Disjunctive Temporal Problem with Uncertainty (DTPU) is a fundamental problem that expresses temporal reasoning with both disjunctive constraints and contingency. A recent work (Peintner et al, 2007) develops a complete algorithm for determining Strong Controlla- bility of a DTPU. Such a notion that guarantees 100% confidence of execution may be too conservative in practice. In this paper, following the idea of (Tsamardinos 2002), we are interested to find a schedule that minimizes the risk (i.e. probability of failure) of executing a DTPU. We present a problem decomposition scheme that enables us to compute the probability of failure efficiently, followed by a hill-climbing local search to search among feasible solutions. We show experimentally that our approach effectively produces solutions which are near-optimal.
Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
Knowledge and Systems Engineering: Proceedings of the Fifth International Conference KSE 2013, Volume 2, Hanoi, Vietnam, 17-19 October, 2013
City or Country
LAU, Hoong Chuin and HOANG, Tuan Anh.
Risk minimization of disjunctive temporal problem with uncertainty. (2014). Knowledge and Systems Engineering: Proceedings of the Fifth International Conference KSE 2013, Volume 2, Hanoi, Vietnam, 17-19 October, 2013. 2, 223-236. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1925
Copyright Owner and License
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.