Show simple item record

dc.contributor.authorYu, Peng
dc.contributor.authorFang, Cheng
dc.contributor.authorWilliams, Brian Charles
dc.date.accessioned2015-01-20T16:58:42Z
dc.date.available2015-01-20T16:58:42Z
dc.date.issued2015-01
dc.identifier.urihttp://hdl.handle.net/1721.1/92981
dc.description.abstractWhen 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 uncertaintyen_US
dc.description.sponsorshipBoeing Company (Grant MIT-BA-GTA-1)en_US
dc.language.isoen_US
dc.publisherAssociation for the Advancement of Artificial Intelligenceen_US
dc.relation.isversionofhttp://www.aaai.org/Conferences/AAAI/2015/aaai15schedule.pdfen_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcePeng Yuen_US
dc.titleResolving Over-constrained Probabilistic Temporal Problems through Chance Constraint Relaxationen_US
dc.typeArticleen_US
dc.identifier.citationYu, Peng, Cheng Fang, and Brian Williams. "Resolving Over-constrained Probabilistic Temporal Problems through Chance Constraint Relaxation." in Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI-15), January 25-30, 2015, Austin Texas, USA.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronauticsen_US
dc.contributor.mitauthorYu, Pengen_US
dc.contributor.mitauthorFang, Chengen_US
dc.contributor.mitauthorWilliams, Brian Charlesen_US
dc.relation.journalProceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI-15)en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsYu, Peng; Fang, Cheng; Williams, Brianen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-6995-7690
dc.identifier.orcidhttps://orcid.org/0000-0002-1057-3940
dc.identifier.orcidhttps://orcid.org/0000-0001-7016-9803
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record