Resolving Over-Constrained Probabilistic Temporal Problems through Chance Constraint Relaxation


  • Peng Yu Massachusetts Institute of Technology
  • Cheng Fang Massachusetts Institute of Technology
  • Brian Williams Massachusetts Institute of Technology



temporal problems, probabilistic temporal constraints, chance-constrained scheduling, over-constrained problems, temporal relaxations


When scheduling tasks for field-deployable systems, our solutions must be robust to the uncertainty inherent in the real world. Although human intuition is trusted to balance reward and risk, humans perform poorly in risk assessment at the scale and complexity of real world problems. In this paper, we present a decision aid system that helps human operators diagnose the source of risk and manage uncertainty in temporal problems. The core of the system is a conflict-directed relaxation algorithm, called Conflict-Directed Chance-constraint Relaxation (CDCR), which specializes in resolving over-constrained temporal problems with probabilistic durations and a chance constraint bounding the risk of failure. Given a temporal problem with uncertain duration, CDCR proposes execution strategies that operate at acceptable risk levels and pinpoints the source of risk. If no such strategy can be found that meets the chance constraint, it can help humans to repair the over-constrained problem by trading off between desirability of solution and acceptable risk levels. The decision aid has been incorporated in a mission advisory system for assisting oceanographers to schedule activities in deep-sea expeditions, and demonstrated its effectiveness in scenarios with realistic uncertainty.




How to Cite

Yu, P., Fang, C., & Williams, B. (2015). Resolving Over-Constrained Probabilistic Temporal Problems through Chance Constraint Relaxation. Proceedings of the AAAI Conference on Artificial Intelligence, 29(1).