Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems

Aaron A. Armstrong, Edmund H. Durfee

Cooperative distributed problem solving (CDPS) is often modeled as being done by a group of loosely-coupled computational agents involved in extensive local computations. A useful way of viewing this is as a distributed constraint satisfaction problem (DCSP), where there are constraints between the local solutions of the different agents. The agents want to exchange enough information to identify violations of constraints and to rectify them.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.