Distributed constraint optimization for multiagent systems

To coordinate effectively, multiple agents must reason about the interactions between their local decisions. Distributed planning and scheduling, distributed resource allocation and distributed task allocation are some examples of multiagent problems that require such reasoning. To represent these automated reasoning problems, researchers in Multiagent Systems have proposed constraints as a key paradigm. Previous research in Artificial Intelligence and Constraint Programming has shown that constraints are a convenient yet powerful way to represent reasoning problems. This dissertation advances the state-of-the-art in Multiagent Systems and Constraint Programming through three key innovations. First, this dissertation introduces a novel algorithm, named Adopt, for Distributed Constraint Optimization Problems (DCOP). Adopt is the first algorithm for DCOP that is asynchronous and guaranteed to terminate with the optimal solution. Adopt is empirically shown to yield orders of magnitude speedups over existing synchronous methods. The key idea is to perform distributed optimization based on conservative estimates rather than exact knowledge of global solution quality. Second, this dissertation introduces bounded-error approximation as a flexible method whereby agents can find global solutions that may not be optimal but are guaranteed to be within a given distance from optimal. This method is useful for time-limited domains because it decreases solution time and communication overhead. Bounded-error approximation is a significant departure from existing incomplete local methods, which rely exclusively on local information to obtain a decrease in solution time but at the cost of abandoning all theoretical guarantees on solution quality. Third, this dissertation presents generalized mapping strategies that allow a significant class of distributed resource allocation problem to be automatically represented via distributed constraints. These mapping strategies are significant because they not only illustrate the utility of our distributed constraint representation but also provide multiagent researchers with a reusable methodology for solving their own distributed resource allocation problems. These dissertation is intended for future researchers faced with solving distributed reasoning problems and opens the door for solving such problems under real-time dynamic conditions while providing theoretical guarantees on solution quality.

[1]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[2]  Makoto Yokoo,et al.  Distributed constraint satisfaction algorithm for complex local problems , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[3]  M. F. Mar,et al.  ModSAF Behavior Simulation and Control , 1993 .

[4]  Edmund H. Durfee,et al.  Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems , 1997, AAAI/IAAI.

[5]  Bhaskar Krishnamachari,et al.  Communication and Computation in Distributed CSP Algorithms , 2002, CP.

[6]  Victor Lesser,et al.  Criteria-Directed Heuristic Task Scheduling TITLE2: , 1997 .

[7]  Victor R. Lesser,et al.  Implementing soft real-time agent control , 2001, AGENTS '01.

[8]  Victor Lesser,et al.  Quantitative Modeling of Complex Environments , 1993 .

[9]  Stephen Fitzpatrick,et al.  An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs , 2001, SAGA.

[10]  Weixiong Zhang,et al.  Distributed breakout revisited , 2002, AAAI/IAAI.

[11]  Michel Lemaître,et al.  An Incomplete Method for Solving Distributed Valued Constraint Satisfaction Problems , 1997 .

[12]  Al Ward,et al.  Distributed Component-Centered Design as Agent-Based Distributed Constraint Optimization , 1997, AAAI Workshop: Constraints & Agents.

[13]  Norman M. Sadeh,et al.  Distributed constrained heuristic search , 1991, IEEE Trans. Syst. Man Cybern..

[14]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[15]  Michael P. Wellman A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems , 1993, J. Artif. Intell. Res..

[16]  Victor R. Lesser,et al.  The Distributed Vehicle Monitoring Testbed: A Tool for Investigating Distributed Problem Solving Networks , 1983, AI Mag..

[17]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[18]  M. Yokoo,et al.  Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems , 1996 .

[19]  Jean Oh,et al.  Electric Elves: Applying Agent Technology to Support Human Organizations , 2001, IAAI.

[20]  Leen-Kiat Soh,et al.  Reflective Negotiating Agents for Real-Time Multisensor Target Tracking , 2001, IJCAI.

[21]  Katia Sycara,et al.  Multiagent coordination in tightly coupled task scheduling , 1997 .

[22]  Zsófia Ruttkay,et al.  Constraint satisfaction---a survey , 1998 .

[23]  Wei-Min Shen,et al.  A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation , 2001, CP.

[24]  Victor R. Lesser,et al.  Cooperative negotiation for soft real-time distributed resource allocation , 2003, AAMAS '03.

[25]  Victor Lesser,et al.  A Mediation Based Protocol for Distributed Constraint Satisfaction , 2003 .

[26]  Boi Faltings,et al.  Resource Allocation in Networks Using Abstraction and Constraint Satisfaction Techniques , 1999 .

[27]  Katia P. Sycara,et al.  Exploiting Problem Structure for Distributed Constraint Optimization , 1995, ICMAS.

[28]  Marius-Calin Silaghi,et al.  Asynchronous Search with Aggregations , 2000, AAAI/IAAI.

[29]  Nancy A. Lynch,et al.  Distributed Algorithms , 1994, Lecture Notes in Computer Science.

[30]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[31]  Makoto Yokoo,et al.  On Market-Inspired Approaches to Propositional Satisfiability , 2001, IJCAI.

[32]  Victor R. Lesser,et al.  Poaching and distraction in asynchronous agent activities , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[33]  相場 亮,et al.  Distributed Constraint Satisfaction : Foundations of Cooperation in Multi-Agent Systems, Mokoto Yokoo (著), Springer-Verlag, ISBN3540675965 , 2001 .

[34]  Wei-Min Shen,et al.  Are multiagent algorithms relevant for real hardware?: a case study of distributed constraint algorithms , 2003, SAC '03.

[35]  Anthony Barrett,et al.  Enabling Efficient Conflict Resolution in Multiple Spacecraft Missions via DCSP , 2002 .

[36]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[37]  Anthony Barrett AUTONOMY ARCHITECTURES FOR A CONSTELLATION OF SPACECRAFT , 2000 .

[38]  Makoto Yokoo,et al.  Distributed Partial Constraint Satisfaction Problem , 1997, CP.

[39]  Hiroaki Kitano,et al.  RoboCup Rescue: search and rescue in large-scale disasters as a domain for autonomous agents research , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[40]  Srinivasan Seshan,et al.  A comparison of mechanisms for improving TCP performance over wireless links , 1996, SIGCOMM 1996.

[41]  Shlomo Zilberstein,et al.  Monitoring and control of anytime algorithms: A dynamic programming approach , 2001, Artif. Intell..

[42]  Maja J. Mataric,et al.  Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..

[43]  Victor R. Lesser,et al.  Distributed sensor network for real time tracking , 2001, AGENTS '01.

[44]  Makoto Yokoo,et al.  An approach to over-constrained distributed constraint satisfaction problems: distributed hierarchical constraint satisfaction , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[45]  Victor R. Lesser,et al.  Multistage negotiation for distributed constraint satisfaction , 1991, IEEE Trans. Syst. Man Cybern..

[46]  Michael P. Wellman,et al.  A market protocol for decentralized task allocation , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[47]  Thomas Schiex,et al.  Nogood Recording for Static and Dynamic Constraint Satisfaction Problems , 1994, Int. J. Artif. Intell. Tools.