Distributed constraint satisfaction. Foundations of cooperation in multi-agent systems
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27) Nonnumerical algorithms (68W05)
Constraint satisfaction is a well-known technique in artificial intelligence which can be applied to a large variety of problems. Many algorithms have been developed, and many implementations of these algorithms are available and have been studied. Hence, it is not surprising that the recent developments of dcstributed systems are also successfully extended to this area. Chapter 1 defines constraint satisfaction problems in general and presents the most important algorithms (e.g. backtracking, weak-commitment search, hill-climbing et al.). This introduction is used as the background for distributed constraint satisfaction problems. The given problem is assigned to agents, one agent is responsible for one variable of the problem, constraints are to be considered between different agents. One agent knows all constraints relevant to its variable.Based on these assumptions, the next chapters discuss different methods and algorithms to solve this problem: -- asynchronous backtracking (chapter 3), -- asynchronous weak-commitment search (chapter 4), -- distributed breakout (chapter 5), -- distributed consistency (chapter 6). In chapter 7, the assumption that one agent deals with one variable is deleted, multiple local variables are considered. Chapter 8 shows some over-constrained problems -- the constraints do not allow any solution -- the problem consists now in finding values for the variables so that only a ``small number of constraints remains unsatisfied. The presentation in this book is excellent. Each algorithm is presented by a sequence ``basic ideas -- details of the algorithm -- example of algorithm execution -- evaluation. This allows a very economic representation. The examples are rather small, they allow, however, the understanding of the ideas, and the reader is not overloaded with too many (unimportant) details. By means of this book, an understanding of the problems, solutions and further research fields and topics can be achieved in a rather short time. It is pleasure to read this book.
- scientific article; zbMATH DE number 2162299
- scientific article; zbMATH DE number 1975621
- scientific article; zbMATH DE number 2084769
- Distributed constraint optimization on networked multi-agent systems
- scientific article; zbMATH DE number 67481
- AI 2003: Advances in Artificial Intelligence
- scientific article; zbMATH DE number 1822298
- scientific article; zbMATH DE number 2084760
- Finding a feasible solution for a class of distributed problems with a single sum constraint using agents
- Foundations of distributed interaction systems
- Autonomous dynamic reconfiguration in multi-agent systems. Improving the quality and efficiency of collaborative problem solving
- A distributed optimization method for the geographically distributed data centres problem
- Group planning with time constraints
- Multi-agent coordination over local indexes via clique-based distributed assignment
- Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems
- Distributed search by constrained agents. Algorithms, performance, communication.
- On the complexity of planning for agent teams and its implications for single agent planning
- Explorative anytime local search for distributed constraint optimization
- Asynchronous aggregation and consistency in distributed constraint satisfaction
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
- The distributed breakout algorithms
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
- Secure distributed constraint satisfaction: reaching agreement without revealing private information
- Distributed personnel scheduling -- negotiation among scheduling agents
- scientific article; zbMATH DE number 1708110 (Why is no real title available?)
- Research and development of distributed constraint satisfaction problems
- Boosting Distributed Constraint Satisfaction
- Concurrent forward bounding for distributed constraint optimization problems
- A class of algorithms for distributed constraint optimization.
- scientific article; zbMATH DE number 67481 (Why is no real title available?)
- scientific article; zbMATH DE number 2013508 (Why is no real title available?)
- scientific article; zbMATH DE number 2080333 (Why is no real title available?)
- scientific article; zbMATH DE number 2084765 (Why is no real title available?)
- scientific article; zbMATH DE number 1515287 (Why is no real title available?)
- scientific article; zbMATH DE number 1773058 (Why is no real title available?)
- Distributed constraint optimization problems and applications: a survey
- scientific article; zbMATH DE number 2152347 (Why is no real title available?)
- scientific article; zbMATH DE number 2162299 (Why is no real title available?)
- scientific article; zbMATH DE number 1927173 (Why is no real title available?)
- scientific article; zbMATH DE number 4116016 (Why is no real title available?)
- scientific article; zbMATH DE number 2084769 (Why is no real title available?)
- AI 2003: Advances in Artificial Intelligence
- Advances in Artificial Intelligence
- Recent Advances in Constraints
- Evolutionary Computation in Combinatorial Optimization
- On market-inspired approaches to propositional satisfiability
- A fuzzy constraint based model for bilateral, multi-issue negotiations in semi-competitive environments
- Min-domain retroactive ordering for asynchronous backtracking
- Distributed constraint satisfaction with partially known constraints
This page was built for publication: Distributed constraint satisfaction. Foundations of cooperation in multi-agent systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2704802)