An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems

Ringwelski, Georg

doi:10.1007/s10462-005-9003-9

Cited by 3 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The same communication scheme is also used in the DisAC-9 algorithm (Hamadi, 2002b) which is optimal in message passing operations (O(n 2 d)). Other arc consistency algorithms for the CSP were introduced later such as (Silaghi and Faltings, 2005) for search with asynchronous aggregation and (Ringwelski, 2005) for consistency in dynamic CSPs.…”

Section: Algorithms For Distributed Constraint Satisfaction Problemsmentioning

confidence: 99%

Distributed constraint optimization, resource allocation and scheduling in large scale agent networks

Karagiannis¹,

Καραγιάννης²

View full text Add to dashboard Cite

A request may need to be propagated several times before a team of agents capable of handling it is gathered. After a team of agents is formed, the members of the team need to jointly schedule their activities taking into account interdependencies, as well as their other scheduled activities. This is in itself a hard problem which our framework has tackled using a combination of dynamic team reorganization and distributed constraint optimization methods. Every agent team that is assigned a request must find within a finite period of time if there is a proper way to serve it. In that case it will search for the optimal assignment of the appropriate resources to the request. Otherwise, the team must decisively reach to the conclusion that either the request can not be ultimately served or the specific agent team has inadequate It has to be noticed that in our effort we do not deal with communication decisions for optimizing information sharing/exchange as done in (Goldman and Zilberstein, 2003), or for proactively exchanging information (Zhang et al., 2004) This is orthogonal to our research which may further increase the efficiency of the proposed method. However, we point that this can not be done in any way such that agents share a global view of the environment state (

show abstract

Section: Algorithms For Distributed Constraint Satisfaction Problemsmentioning

confidence: 99%

Distributed constraint optimization, resource allocation and scheduling in large scale agent networks

Karagiannis¹,

Καραγιάννης²

View full text Add to dashboard Cite

show abstract

Geometry-based distributed arc-consistency method for multiagent planning and scheduling

Cui

2018

Sci. China Technol. Sci.

View full text Add to dashboard Cite

A mark-based hierarchical asynchronous temporal constraints reasoning algorithm for multi-agent mission planning

Wang,

Xu,

et al. 2024

Expert Systems with Applications

View full text Add to dashboard Cite

An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems

Cited by 3 publications

References 8 publications

Distributed constraint optimization, resource allocation and scheduling in large scale agent networks

Distributed constraint optimization, resource allocation and scheduling in large scale agent networks

Geometry-based distributed arc-consistency method for multiagent planning and scheduling

A mark-based hierarchical asynchronous temporal constraints reasoning algorithm for multi-agent mission planning

Contact Info

Product

Resources

About