M. Yokoo. Distributed Constraint Satisfaction:Foundation of Cooperation in Multi-agent Systems. Springer, 2001.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....agree on a common methodology to model the products and exchange information at run time. Distributed reasoning. Within the last years significant advances in the field of Distributed AI and, in particular, in the fields of MultiAgent Systems and Distributed Constraint Satisfaction have been made [16, 22]. However, most of these approaches do not fit well the characteristics of distributed configuration for various reasons. For instance, configuration systems typically do not work autonomously or fully parallel like, e.g. agents do. Moreover, they require very specific problem solving mechanisms ....

....CAWICOMS main configurator is based on ILOG s Java based JConfigurator [9] library that implements a Generative Constraint Satisfaction [6, 10] mechanism and provides an abstraction layer for the configuration domain. There have been some major advances in the field of Dis tributed CSPs (DisCSP) [16, 22] over the last years that are motivated by the inherent distributedness of the tackled problems and not by speeding up the solving process. However, current techniques have some limitations w.r.t. their applicability in the configuration domain: First, configuration agents do not necessarily start ....

[Article contains additional citation context not shown here]

M. Yokoo, Distributed constraint satisfaction - foundations of cooperation in multi-agent systems. Springer Verlag, Berlin, Germany, 2001.

....have been proposed and discussed in the literature [2, 7, 9] A DisCSP is composed of a set of agents, each with its own local constraints network. Agents cooperate by exchanging messages in order to find an assignment of values to all variables of all agents that is globally consistent (cf. [10]) Each agent owns exclusively a subset of variables. Variables are connected by constraints, either to local variables of the same agent or to variables of other agents. Distributed search algorithms on distributed constraints networks (DisCSPs) are executed by a set of agents, where the ....

....to local variables of the same agent or to variables of other agents. Distributed search algorithms on distributed constraints networks (DisCSPs) are executed by a set of agents, where the sequence of computations of one agent depends in general on the intermediate results of other agents (cf. [10]) The intermediate results of agents computations are distributed by exchanging messages between the agents. Usually, messages about assignments trigger the checking of constraints against received assignments by the receiving contacting author: Tel 972 8 6477492, Fax: 972 8 6477650 agent. ....

[Article contains additional citation context not shown here]

M. Yokoo. Distributed constraint satisfaction: foundations of cooperation in multi-agent systems. Berlin Springer, 2001.

....concepts of counter o er and reward) Generally speaking, the various constraint based negotiation processes can be regarded as a type of Distributed Constraint Satisfaction Problem (DCSP) where the domain, variables and constraints are distributed among multiple agents. Yokoo and his colleagues [64 66,63] have designed various algorithms to search for solutions to DCSPs. However, all these algorithms are based on the assumption that agents are not at all self interested and so they always communicate constraints and modify their local solutions cooperatively. However, in many applications, agents ....

M. Yokoo. Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-Agent Systems. Springer, 2000.

....described in Section 2.1 search is defined as the scheduling of nodes of the search tree that await constraint propagation and subsequent splitting. It should be noted that compared to the Asynchronous Backtracking algorithm, and derived algorithms for solving distributed CSP s described in [14], DICE focusses on distributed constraint propagation instead of distributed search. Di#erent solver processes may be running di#erent search strategies concurrently, and several autonomous solvers may explore di#erent parts of the search space in parallel, but the scheduling of nodes for ....

....of this, the termination detection algorithm that we use has a considerable overhead, and a DICE solver is easily outperformed by any sequential solver on standard combinatorial benchmarks like the n queens problem. However, the current implementation is well suited for handling distributed CSP s [14], where knowledge of the constraints is distributed, while it is impractical or impossible to gather this information in a single solver. Imagine for example that constraints are defined by the contents of databases, running on di#erent machines. DRF components could be written that query these ....

M. Yokoo. Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-Agent Systems , Springer-Verlag, 2001.

....concepts of counter offer and reward) Generally speaking, the various constraint based negotiation processes can be regarded as a type of Distributed Constraint Satisfaction Problem (DCSP) where the domain, variables and constraints are distributed among multiple agents. Yokoo and his colleagues [64 66,63] have designed various algorithms to search for solutions to DCSPs. However, all these algorithms are based on the assumption that agents are not at all self interested and so they always communicate constraints and modify their local solutions cooperatively. However, in many applications, agents ....

M. Yokoo. Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-Agent Systems. Springer, 2000.

....problem (SAT) in which the objective is to determine whether or not there exists a set of assignments to variables that satisfies a Boolean expression in conjunctive normal form. The transition has been observed both in backtracking approaches [13] and in some local search scenarios [3, 21], though the underlying mechanisms that drive the transition are different in the two cases. We are interested in how phase changes of this sort manifest themselves in multi agent resource allocation systems. These systems are optimization problems rather than decision problems. That is, we are ....

....start) functions as the measure of computational effort It is reasonable that this algorithm should succeed sooner with underconstrained problems than with those that are somewhat more constrained, but not immediately apparent why overconstraint should also yield lower computational costs. [21] has recently developed an alternative intuition that explains this behavior. The nemesis of any hill climbing algorithm is the local minimum (step 3) which traps the search and can be escaped only by a nonlocal and usually random move to some other part of the search space. Such a minimum, ....

M. Yokoo. Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-Agent Systems. Berlin, Springer, 2001.

No context found.

Yokoo, M.: Distributed Constraint Satisfaction:Foundation of Cooperation in Multi-agent Systems. Springer (2001)

No context found.

M. Yokoo. Distributed Constraint Satisfaction: Foundation of Cooperation in Multi-agent Systems. Springer, 2001.

No context found.

M.Yokoo. Distributed Constraint Satisfaction : Foundations of Cooperation in Multi-Agent Systems. Springer Verlag, 2000.

No context found.

M. Yokoo. Distributed Constraint Satisfaction:Foundation of Cooperation in Multi-agent Systems. Springer, 2001.

No context found.

M. Yokoo. Distributed Constraint Satisfaction:Foundation of Cooperation in Multi-agent Systems. Springer, 2001.

No context found.

M. Yokoo. Distributed Constraint Satisfaction:Foundation of Cooperation in Multi-agent Systems. Springer, 2001.

....the global objective function as a set of valued constraints, that is, constraints that are described as functions that return a range of values, rather than predicates that return only true or false. DCOP signi cantly generalizes the Distributed Constraint Satisfaction Problem (DisCSP) framework [22] [20] 13] which has relied on a satisfaction based representation. In DisCSP, problem solutions are characterized with a designation of satisfactory or unsatisfactory and so do not model problems where solutions have degrees of quality or cost. DCOP demands techniques that go beyond existing ....

....is able to provide quality guarantees, while at the same time meeting the requirements of distributedness and asynchrony, is currently missing from the research literature. A well known method for solving DisCSP is the Asynchronous Backtracking (ABT) algorithm of Yokoo, Durfee, Isida, and Kuwabara [22]. Simple extensions of ABT for optimization have relied on converting an optimization problem into a sequence of satisfaction problems in order to allow the use of a DisCSP algorithm [8] This approach has applied only to limited types of optimization problems (e.g. Hierarchical DisCSPs, Maximal ....

[Article contains additional citation context not shown here]

M. Yokoo. Distributed Constraint Satisfaction:Foundation of Cooperation in Multi-agent Systems. Springer, 2001.

....global objective function as a set of valued constraints, that is, constraints that are described as func tions that return a range of values, rather than predicates that return only true or false. DCOP significantly generalizes the Distributed Constraint Satisfaction Problem (DisCSP) framework [13] [11] 7] which has relied on a satisfaction based representation. In DisCSP, problem solutions are characterized with a designation of satisfactory or unsatisfactory and so do not model problems where solutions have degrees of quality or cost. DCOP demands techniques that go beyond existing ....

....able to provide quality guarantees, while at the same time meeting the requirements of distributedness and asynchrony, is currently missing from the multi agent literature. A well known method for solving DisCSP is the Asynchronous Backtracking (ABT) algorithm of Yokoo, Durfee, Isida, and Kuwabara [13]. Simple extensions of ABT for optimization have relied on converting an optimization problem into a sequence of satisfaction problems in order to allow the use of a DisCSP algorithm [3] This approach has applied only to limited types of optimization problems (e.g. Hierarchical DisCSPs, Maximal ....

[Article contains additional citation context not shown here]

M. Yokoo. Distributed Constraint Satisfaction:Foundation of Cooperation in Multi-agent Systems. Springer, 2001.

....the global objective function as a set of valued constraints, that is, constraints that are described as functions that return a range of values, rather than predicates that return only true or false. DCOP significantly generalizes the Distributed Constraint Satisfaction Problem (DisCSP) framework [13] [11] 7] which has relied on a satisfaction based representation. In DisCSP, problem solutions are characterized with a designation of satisfactory or unsatisfactory and so do not model problems where solutions have degrees of quality or cost. DCOP demands techniques that go beyond existing ....

....able to provide quality guarantees, while at the same time meeting the requirements of distributedness and asynchrony, is currently missing from the multi agent literature. A well known method for solving DisCSP is the Asynchronous Backtracking (ABT) algorithm of Yokoo, Durfee, Isida, and Kuwabara [13]. Simple extensions of ABT for optimization have relied on converting an optimization problem into a sequence of satisfaction problems in order to allow the use of a DisCSP algorithm [3] This approach has applied only to limited types of optimization problems (e.g. Hierarchical DisCSPs, Maximal ....

[Article contains additional citation context not shown here]

M. Yokoo. Distributed Constraint Satisfaction:Foundation of Cooperation in Multi-agent Systems. Springer, 2001.

No context found.

M. Yokoo. Distributed Constraint Satisfaction:Foundation of Cooperation in Multi-agent Systems. Springer, 2001.

No context found.

Makoto Yokoo. Distributed constraint satisfaction: foundations of cooperation in multi-agent systems. Springer-Verlag, London, UK, 2001.

No context found.

M. Yokoo. Distributed constraint satisfaction - foundations of cooperation in multi-agent systems (Springer, Berlin, Germany, 2001).

No context found.

Yokoo, M.: 2001, Distributed constraint satisfaction - foundations of cooperation in multiagent systems. Springer Verlag, Berlin, Germany.

No context found.

M. Yokoo. Distributed constraint satisfaction - foundations of cooperation in multi-agent systems. Springer Verlag, Berlin, Germany, 2001.

No context found.

M. Yokoo. Distributed constraint satisfaction: foundations of cooperation in multi-agent systems. Berlin Springer, 2001.

No context found.

M. Yokoo, "Distributed Constraint Satisfaction: Foundation of Cooperation in Multi-agent Systems", Springer, 2001

No context found.

M. Yokoo. Distributed Constraint Satisfaction:Foundation of Cooperation in Multi-agent Systems. Springer, 2001.

No context found.

M. Yokoo. Distributed constraint satisfaction: foundations of cooperation in multi-agent systems. Berlin Springer, 2001.

No context found.

Makoto Yokoo, Distributed constraint satisfaction: Foundation of Cooperation in Multi-agent Systems, Springer, 2001.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC