Results 1  10
of
97
Backtracking in distributed constraint networks
 International Journal on Artificial Intelligence Tools
, 1998
"... The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the potential speedup of a parallel exploration in the processing of distributed problems. This paper extends DIBT, a distri ..."
Abstract

Cited by 86 (15 self)
 Add to MetaCart
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the potential speedup of a parallel exploration in the processing of distributed problems. This paper extends DIBT, a distributed search procedure operating in distributed constraint networks [6]. The extension is twofold. First the procedure is updated to face delayed information problems upcoming in heterogeneous systems. Second, the search is extended to simultaneously explore independent parts of a distributed search tree. By this way we introduce parallelism into distributed search, which brings to Interleaved Distributed Intelligent BackTracking (IDIBT). Our results show that 1) insoluble problems do not greatly degrade performance over DIBT and 2) superlinear speedup can be achieved when the distribution of solution is nonuniform.
Distributed Constraint Satisfaction Algorithm for Complex Local Problems
, 1998
"... A distributed constraint satisfaction problem can formalize various application problems in MAS, and several algorithms for solving this problem have been developed. One limitation of these algorithms is that they assume each agent has only one local variable. Although simple modifications enable th ..."
Abstract

Cited by 76 (9 self)
 Add to MetaCart
A distributed constraint satisfaction problem can formalize various application problems in MAS, and several algorithms for solving this problem have been developed. One limitation of these algorithms is that they assume each agent has only one local variable. Although simple modifications enable these algorithms to handle multiple local variables, obtained algorithms are neither efficient nor scalable to larger problems. We develop a new algorithm that can handle multiple local variables efficiently, which is based on the asynchronous weakcommitment search algorithm. In this algorithm, a bad local solution can be modified without forcing other agents to exhaustively search local problems. Also, the number of interactions among agents can be decreased since agents communicate only when they find local solutions that satisfy all of the local constraints. Experimental evaluations show that this algorithm is far more efficient than an algorithm that uses the prioritization among agents. 1
Distributed partial constraint satisfaction problem
 Principles and Practice of Constraint Programming
, 1997
"... Abstract. Many problems in multiagent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables that satis es all constraints among agents. However, when real problems are formalized as distributed CSPs, th ..."
Abstract

Cited by 64 (12 self)
 Add to MetaCart
(Show Context)
Abstract. Many problems in multiagent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables that satis es all constraints among agents. However, when real problems are formalized as distributed CSPs, they are often overconstrained and have no solution that satis es all constraints. This paper provides the Distributed Partial Constraint Satisfaction Problem (DPCSP) as a new framework for dealing with overconstrained situations. We also present new algorithms for solving Distributed Maximal Constraint Satisfaction Problems (DMCSPs), which belong to an important class of DPCSP. The algorithms are called the Synchronous Branch and Bound (SBB) and the Iterative Distributed Breakout (IDB). Both algorithms were tested on hard classes of overconstrained random binary distributed CSPs. The results can be summarized as SBB is preferable when we are mainly concerned with the optimality ofasolution, while IDB is preferable when we want to get a nearly optimal solution quickly. 1
BnBADOPT: An asynchronous branchandbound DCOP algorithm
 In Proceedings of AAMAS
, 2008
"... Abstract. Distributed constraint optimization problems (DCOPs) are a popular way of formulating and solving agentcoordination problems. It is often desirable to solve DCOPs optimally with memorybounded and asynchronous algorithms. We thus introduce BranchandBound ADOPT (BnBADOPT), a memoryboun ..."
Abstract

Cited by 39 (13 self)
 Add to MetaCart
(Show Context)
Abstract. Distributed constraint optimization problems (DCOPs) are a popular way of formulating and solving agentcoordination problems. It is often desirable to solve DCOPs optimally with memorybounded and asynchronous algorithms. We thus introduce BranchandBound ADOPT (BnBADOPT), a memorybounded asynchronous DCOP algorithm that uses the message passing and communication framework of ADOPT, a well known memorybounded asynchronous DCOP algorithm, but changes the search strategy of ADOPT from bestfirst search to depthfirst branchandbound search. Our experimental results show that BnBADOPT is up to one order of magnitude faster than ADOPT on a variety of large DCOPs and faster than NCBB, a memorybounded synchronous DCOP algorithm, on most of these DCOPs. 1
Open constraint programming
 Artifitial Intelligence
"... Constraint satisfaction and optimization problems often involve multiple participants. For example, producing an automobile involves a supply chain of many companies. Scheduling production, delivery and assembly of the different parts would best be solved as a constraint optimization problem ([35]). ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
(Show Context)
Constraint satisfaction and optimization problems often involve multiple participants. For example, producing an automobile involves a supply chain of many companies. Scheduling production, delivery and assembly of the different parts would best be solved as a constraint optimization problem ([35]). A more familiar task for most of us is meeting scheduling: arrange a set of meetings with varying participants such that no two meetings involving the same person are scheduled at the same time, while respecting order and deadline constraints ([18, 22]). Another application that has been studied in detail is coordinating a network of distributed sensors ([2]). Such problems can of course be solved by gathering all constraints and optimization criteria into a single large CSP, and then solving this problem using a centralized algorithm. In practice there are many cases where this is not feasible, because it is impossible to bound the problem to a manageable set of variables. For example, in meeting scheduling, once two people are planning a common meeting, this meeting is potentially in conflict with many other meetings either of them are planning and whose times are decided in parallel. A centralized solver does not know beforehand
Distributed algorithms for DCOP: A graphicalgamebased approach
 In PDCS
, 2004
"... This paper addresses the application of distributed constraint optimization problems (DCOPs) to largescale dynamic environments. We introduce a decomposition of DCOP into a graphical game and investigate the evolution of various stochastic and deterministic algorithms. We also develop techniques th ..."
Abstract

Cited by 36 (14 self)
 Add to MetaCart
(Show Context)
This paper addresses the application of distributed constraint optimization problems (DCOPs) to largescale dynamic environments. We introduce a decomposition of DCOP into a graphical game and investigate the evolution of various stochastic and deterministic algorithms. We also develop techniques that allow for coordinated negotiation while maintaining distributed control of variables. We prove monotonicity properties of certain approaches and detail arguments about equilibrium sets that offer insight into the tradeoffs involved in leveraging efficiency and solution quality. The algorithms and ideas were tested and illustrated on several graph coloring domains. 1.
Cooperative negotiation for soft realtime distributed resource allocation
 in Proceedings of AAMAS’03
, 2003
"... In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft realtime constraints in a dynamic environment. Two central principles are used in this protocol that allow it to operate in constantly changing conditions. Firs ..."
Abstract

Cited by 31 (5 self)
 Add to MetaCart
(Show Context)
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft realtime constraints in a dynamic environment. Two central principles are used in this protocol that allow it to operate in constantly changing conditions. First, we frame the allocation problem as an optimization problem, similar to a Partial Constraint Satisfaction Problem (PCSP), and use relaxation techniques to derive conflict (constraint violation) free solutions. Second, by using overlapping mediated negotiations to conduct the search, we are able to prune large parts of the search space by using a form of arcconsistency. This allows the protocol to both quickly identify situations where the problem is overconstrained and to identify the appropriate fix to the overconstrained problem. From the global perspective, the protocol has a hill climbing behavior and because it was designed to work in dynamic environments, is an approximate one. We describe the domain which inspired the creation of this protocol, as well as discuss experimental results.
Quality guarantees on koptimal solutions for distributed constraint optimization problems
 In IJCAI
, 2007
"... ..."
An Approach to Overconstrained Distributed Constraint Satisfaction Problems: Distributed Hierarchical Constraint Satisfaction
 PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON MULTIAGENT SYSTEMS (ICMAS2000), PP.135–142
, 2000
"... Many problems in multiagent systems can be described as distributed CSPs. However, some reallife problem can be overconstrained and without a set of consistent variable values when described as a distributed CSP. We have presented the distributed partial CSP for handling such an overconstrained ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
(Show Context)
Many problems in multiagent systems can be described as distributed CSPs. However, some reallife problem can be overconstrained and without a set of consistent variable values when described as a distributed CSP. We have presented the distributed partial CSP for handling such an overconstrained situation and the distributed maximal CSP as a subclass of distributed partial CSP. In this paper, we first show another subclass of distributed partial CSP, the distributed hierarchical CSP. Next, we present a series of new algorithms for solving a distributed hierarchical CSP, each of which is designed based on our previous distributed constraint satisfaction algorithms. Finally, we evaluate the performance of our new algorithms on distributed 3coloring problems in terms of optimality and anytime characteristics. The results show that our new algorithms perform much better than the previous algorithm for finding an optimal solution and produce good results for anytime characteristics.
Privacy loss in distributed constraint reasoning: A quantitative framework for analysis and its applications
, 2006
"... It is critical that agents deployed in realworld settings, such as businesses, offices, universities and research laboratories, protect their individual users ’ privacy when interacting with other entities. Indeed, privacy is recognized as a key motivating factor in the design of several multiagent ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
(Show Context)
It is critical that agents deployed in realworld settings, such as businesses, offices, universities and research laboratories, protect their individual users ’ privacy when interacting with other entities. Indeed, privacy is recognized as a key motivating factor in the design of several multiagent algorithms, such as in distributed constraint reasoning (including both algorithms for distributed constraint optimization (DCOP) and distributed constraint satisfaction (DisCSPs)), and researchers have begun to propose metrics for analysis of privacy loss in such multiagent algorithms. Unfortunately, a general quantitative framework to compare these existing metrics for privacy loss or to identify dimensions along which to construct new metrics is currently lacking. This paper presents three key contributions to address this shortcoming. First, the paper presents VPS (Valuations of Possible States), a general quantitative framework to express, analyze and compare existing metrics of privacy loss. Based on a statespace model, VPS is shown to capture various existing measures of privacy created for specific domains of DisCSPs. The utility of VPS is further illustrated through analysis of privacy loss in DCOP algorithms, when such algorithms are used by personal assistant agents to schedule meetings