Modeling probabilistic commitments for maintenance is inherently harder than for achievement

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

Most research on probabilistic commitments focuses on commitments to achieve enabling preconditions for other agents. Our work reveals that probabilistic commitments to instead maintain preconditions for others are surprisingly harder to use well than their achievement counterparts, despite strong semantic similarities. We isolate the key difference as being not in how the commitment provider is constrained, but rather in how the commitment recipient can locally use the commitment specification to approximately model the provider’s effects on the preconditions of interest. Our theoretic analyses show that we can more tightly bound the potential suboptimality due to approximate modeling for achievement than for maintenance commitments. We empirically evaluate alternative approximate modeling strategies, confirming that probabilistic maintenance commitments are qualitatively more challenging for the recipient to model well, and indicating the need for more detailed specifications that can sacrifice some of the agents’ autonomy.

Cite

CITATION STYLE

APA

Zhang, Q., Durfee, E. H., & Singh, S. (2020). Modeling probabilistic commitments for maintenance is inherently harder than for achievement. In AAAI 2020 - 34th AAAI Conference on Artificial Intelligence (pp. 10326–10333). AAAI press. https://doi.org/10.1609/aaai.v34i06.6596

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free