Yokoo M., Ishida T. Search Algorithms for Agents. In Multiagent Systems, G. Weiss editor, Springer, 1999. 25  Home/Search   Document Not in Database   Summary   Related Articles   Check

....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 and T. Ishida. Search algorithms for agents. In G. Weiss, editor, Multiagent Systems, pages 165-201. The MIT Press, 1999.

....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 and T. Ishida. Search algorithms for agents. In G. Weiss, editor, Multiagent Systems, pages 165-201. The MIT Press, 1999.

....However, we use similarity rather than 24 utility to address the inherent uncertainties involved and, as we have shown in section 4.2, this appears to be a better choice in uncertain environments. The process of negotiation has also been modeled as a distributed constraint satisfaction problem [1, 49, 62]. In the work of Sathi and Fox, agents objectives are represented as constraints together with their associated utilities. Strategies (e.g. composition, reconfiguration and relaxation operators) are then used to modify these constraints, or the current solution, until a final solution is reached. ....

....namely reaching a contract which maximises value. Therefore, our approach is to develop reasoning mechanisms that deliberate over raw values rather than objectives. Similarly, Yokoo and colleagues formalize negotiation as an extension to the classic single agent constraint satisfaction framework [60, 62], where variables and constraints are distributed among multiple agents. Search algorithms (asynchronous backtracking and asynchronous weak commitment search) are shown to solve this distributed problem. Both algorithms are complete and the asynchronous weak commitment is shown to be more ....

M. Yokoo and T. Ishida. Search algorithms for agents. In G. Weiss, editor, Multiagent Systems, pages 165--201. The MIT Press, Cambridge, Massachusetts, 1999.

....a binary CSP graph to the different agents. Hence, this is a variable based approach. Their main contribution lies in the development of distributed search algorithms, like asynchronous backtracking and asynchronous weak commitment search. The earlier versions (collectively presented in [41] and [43]) relied on the assumption, that every agents cares for just one variable. Newer versions [42] overcome this restriction by allowing complex local problems. All these algorithms are correct and complete. To coordinate the different forms of asynchronous backtracking, the algorithms establish a ....

M. Yokoo and T. Ishida. Search algorithms for agents. In G. Weiss, editor, Multiagent Systems -- A Modern Approach to Distributed Artificial Intelligence, pages 165-199. MIT Press, 1999.

....navigate and react to their changing environment, and also possibly interact with users. Path planning problems are a key issue in the so called Game AI domain, and have been tackled up to now with traditional AI techniques such as the classical A algorithm [14] or more modern extensions [15], heavily relying on the complete knowledge of the complete virtual environment to define an optimal trajectory for computer controlled characters. We are rather interested in this work in the definition of autonomous agents that are immersed in an undefined and changing environment and have to ....

....considerations might prevent to extend this time window more than a few steps forwards. 7. Application to Path finding and Stimulusdriven Navigation It is worth noticing that the adaptive search method applied to agent navigation is also close to real time search algorithms such as those of [15], but without paying the price for heavy data structures. Let us consider a simple example where the creature has to perform collision avoidance. The behavior consisting in going to a particular goal object while avoiding obstacles is simply described in the following way : go(goal) ....

M. Yokoo and T. Ishida, Search Algorithms for Agents, In: Multiagent Systems, G. Weiss (ed.), MIT

....properties of centralised dynamic backtracking. It ensures the completeness of search, and allows a high level of asynchronism by sidestepping the unnecessary addition of links. 1 Introduction In the last years, several works have considered constraint satisfaction in a distributed form (see [10] for an introduction) These works are motivated by the existence of naturally distributed constraint problems, for which it is impossible or undesirable to gather the whole problem knowledge into a single agent, to solve it using centralized algorithms. 1 Considering complete algorithms for ....

M. Yokoo and T. Ishida. Search algorithms for agents. In G. Weiss, editor, Multiagent Systems, pages 165199. MIT Press, 1999.

....are held by different agents, which behave autonomously and collaborate among themselves in order to achieve a global solution. The World Wide Web offers many opportunities to actually solve real problems through agents. Several works consider constraint satisfaction in a distributed form (see [Yokoo and Ishida, 1999] for an introduction) These works are motivated by the existence of naturally distributed constraint problems, for which it is impossible or undesirable to gather the whole problem knowledge into a single agent, to solve it using centralised algorithms. 1 There are several reasons for that. The ....

M. Yokoo and T. Ishida. Search algorithms for agents. In G. Weiss, editor, Multi-Agent Systems, pages 165--199. MIT Press, 1999.

....27, is straightforward: 1. Delete the objective function, Expression (2.1) 2. In Expression (2.5) require that D cover only values from finite, discrete domains . 3. The other constraints, Expressions (2.2) 2.4) may be specialized (or deleted) to fit the particular problem to hand. 1 [20] adds a third kind of problem: 2 person (constant sum) games in extensive form. This strikes me as a bit odd. Why exclude 3 person variable sum games and so on Nonetheless, very many problem formulations in AI are well classified as either path finding or constraint satisfaction problems. 30 ....

Makoto Yokoo and Toru Ishida. Search algorithms for agents. In Gerhard Weiss, editor, Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, pages 165--199. MIT Press, Cambridge, Massachusetts, 1999. ISBN: 0-262-23203-0.

....of a binary CSP graph to the di erent agents. Hence, this is a variable based approach. Their main contribution lies in the development of distributed search algorithms, like asynchronous backtracking and asynchronous weak commitment search. The earlier versions (collectively presented in [41] and [43]) relied on the assumption, that every agents cares for just one variable. Newer versions [42] overcome this restriction by allowing complex local problems. All these algorithms are correct and complete. To coordinate the di erent forms of asynchronous backtracking, the algorithms establish a ....

M. Yokoo and T. Ishida. Search algorithms for agents. In G. Weiss, editor, Multiagent Systems | A Modern Approach to Distributed Articial Intelligence, pages 165-199. MIT Press, 1999.

....a binary CSP graph to the different agents. Hence, this is a variable based approach. Their main contribution lies in the development of distributed search algorithms, like asynchronous backtracking and asynchronous weakcommitment search. The earlier versions (collectively presented in [23] and [25]) relied on the assumption, that every agents cares for just one variable. Newer versions ( 24] overcome this restriction by allowing complex local problems. All these algorithms are correct and complete. To coordinate the different forms of asynchronous backtracking, the algorithms establish a ....

....constraint propagation. Additionally, the assumption of simple binary constraints restricts the applicability in real world settings. Nevertheless, their coordination procedures have influenced much other work in this field. The same holds for the coordination protocols in this article. Also in [25] two constraint propagation techniques are mentioned: a filtering algorithm reported in [22] and a hyper resolution based consistency algorithm described in [2] The filtering algorithm achieves arcconsistency by communicating the domains of each process to the neighbors and removing values from ....

M. Yokoo and T. Ishida. Search algorithms for agents. In G. Weiss, editor, Multiagent Systems --- A Modern Approach to Distributed Artificial Intelligence, pages 165--199. MIT Press, 1999.

No context found.

Yokoo M., Ishida T. Search Algorithms for Agents. In Multiagent Systems, G. Weiss editor, Springer, 1999. 25

No context found.

Yokoo, M. & Ishida, T., Search algorithms for agents, in Weiss, G. (ed), Multiagent systems, a modern approach to distributed artificial intelligence, MIT Press, 1999, 165-199

No context found.

Makoto, Y. and Ishida, T. (1999) "Search Algorithms for Agents". In: Weiss, G. (ed.): Multiagent Systems A Modern Approach to Distributed Artificial Intelligence. MIT press

No context found.

Makoto Yokoo and Toru Ishida, `Search algorithms for agents', in Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, ed., Gerhard Weiss, MIT Press, (1999).

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