Citation Context

...nformation.) Therefore, there are sixteen combinations for each flexibility base. While the LCDCSP apporach has relation to a popular centralized CSP technique, the least constraining value heuristic =-=[8]-=-, it is not a simple mapping of the least constraining value heuristic onto the DCSP framework. Agents can explicitly reason about which agents to consider most with respect to the constrainedness giv...

Citation Context

..., if any, among their action or resource choices. Distributed Constraint Satisfaction Problems (DCSP) is a major technique in multiagent coordination and conflict resolution in collaborative settings =-=[2]-=-. DCSP provides rich foundation for the representation of multiagent coordination and conflict resolution, and there exist highly efficient baseline algorithms [3,4,5,2]. In most DCSP algorithms, inte...

Citation Context

...ntion, and little investigation has been done for performance measurement which takes into account extra communication overhead. While communicating local information [7,5] and partial centralization =-=[10]-=- have been investigated in DCSP, the communication overhead in different computing/networking environments was not properly evaluated. Fernandez et al. investigated the effect of communication delays ...

Citation Context

...resolution in collaborative settings [2]. DCSP provides rich foundation for the representation of multiagent coordination and conflict resolution, and there exist highly efficient baseline algorithms =-=[3,4,5,2]-=-. In most DCSP algorithms, inter-agent communication is restricted to only exchanging values of variables, since any additional information-exchange is assumed to lead to significant communication ove...

Citation Context

...uch communication overhead. 3.1 Existing Method Since it has been practically difficult to access a real large-scale distributed system (with hundreds of nodes), the standard methodology in the field =-=[3,5,2]-=- is to implement a synchronized distributed system which is a model of distributed system where every agent synchronously performs the following three steps (called a cycle): (i) Agents receives all t...

Citation Context

... but also shows the utility of additional communication in DCSP. 1 Introduction Distributed, collaborative agents play an important role in large-scale multiagent applications such as sensor networks =-=[1]-=-. Collaborative agents in such applications must coordinate their plans, resolving conflicts, if any, among their action or resource choices. Distributed Constraint Satisfaction Problems (DCSP) is a m...

Citation Context

... (different weights to message processing/communication overheads) or (ii) the cost functions. 5 Related Work and Conclusion While significant works have focused on variable or agent ordering in DCSP =-=[9,3,2]-=-, value ordering techniques which exploit additional information-exchange have not received enough attention, and little investigation has been done for performance measurement which takes into accoun...

Citation Context

...on delays on the performance of DCSP algorithms [11]. However, their investigation was limited to the effects from random delays, not from extra value communication. A runtime model by Davin and Modi =-=[12]-=- used a fixed communication latency rather than the latency based on message size/number used in our run-time model (Section 3) which can have a significant impact on performance in a certain network ...

Citation Context

...resolution in collaborative settings [2]. DCSP provides rich foundation for the representation of multiagent coordination and conflict resolution, and there exist highly efficient baseline algorithms =-=[3,4,5,2]-=-. In most DCSP algorithms, inter-agent communication is restricted to only exchanging values of variables, since any additional information-exchange is assumed to lead to significant communication ove...

Citation Context

...ommunication overhead in different computing/networking environments was not properly evaluated. Fernandez et al. investigated the effect of communication delays on the performance of DCSP algorithms =-=[11]-=-. However, their investigation was limited to the effects from random delays, not from extra value communication. A runtime model by Davin and Modi [12] used a fixed communication latency rather than ...

Citation Context

...knowledge and local situation, agents do not communicate such information. However, a few different approaches (based on the communication of local information between agents) were recently presented =-=[6,7,5]-=-. In this section, we describe two algorithms as representative examples. One is Asynchronous Weak Commitment search algorithm [2], one of the most advanced DCSP algorithms, in which agents communicat...

Citation Context

...esolution in collaborative settings [10]. DCSP provides rich foundation for the representation of multiagent coordination and conflict resolution, and there exist highly efficient baseline algorithms =-=[3, 7, 9, 10]-=-. In most DCSP algorithms, inter-agent communication is restricted to only exchanging values of variables, since any additional information-exchange is assumed to lead to significant communication ove...