Search |  Contact |  SRI Home Do not follow this link, or your host will be blocked from this site. This is a spider trap. Do not follow this link, or your host will be blocked from this site. This is a spider trap. Do not follow this link, or your host will be blocked from this site. This is a spider trap.A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A A ASRI International.  333 Ravenswood Avenue.  Menlo Park, CA 94025-3493. SRI International is a nonprofit corporation.

Publication in BibTeX Format

@ARTICLE{AICPub1698:2008, AUTHOR={Rosenfeld, A. and Kraus, S. and Ortiz, C.}, TITLE={Measuring the Expected Gain of Communicating Constraint Information}, JOURNAL={Multiagent and Grid Systems}, YEAR={2008}, KEYWORDS={Multiagent Scheduling, Adaptive Coordination, Localized Deci- sions }, ABSTRACT={Abstract In this paper we investigate methods for measuring the expected utility from communi- cating information in multi-agent planning and scheduling problems. We consider an envi- ronment where human teammates can potentially add information to relax constraint infor- mation. As these problems are NP-complete, no polynomial algorithms exist for evaluating the impact of either adding or relaxing a certain constraint will have on the global problem. We present a general approach based on a notion we introduce called problem tightness. Dis- tributed agents use this notion to identify those problems which are not overly constrained and, therefore, will not benefit from additional information that would relax those constraints. Finally, agents apply traditional machine learning methods based on their specific local prob- lem attributes to attempt to identify which of the constrained problems will most benefit from added information. We evaluated this approach within a distributed c-TAEMS scheduling domain and found that this approach was effective overall. } }

SRI International
©2014 SRI International 333 Ravenswood Avenue, Menlo Park, CA 94025-3493
SRI International is an independent, nonprofit corporation. Privacy policy