Future Generation Computer Systems
Frozen development in graph coloring
Theoretical Computer Science - Phase transitions in combinatorial problems
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Distributed Constraint Satisfaction Algorithm for Complex Local Problems
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Ant Colony Optimization
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
A mediation-based approach to cooperative, distributed problem solving
A mediation-based approach to cooperative, distributed problem solving
Using cooperative mediation to coordinate traffic lights: a case study
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems
Artificial Intelligence Review
Train timetable and route generation using a constraint-based approach
IEA/AIE'1997 Proceedings of the 10th international conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems
Examining DCSP coordination tradeoffs
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
The DynCOAA algorithm for dynamic constraint optimization problems
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Urban Traffic Signal Control Based on Distributed Constraint Satisfaction
HICSS '08 Proceedings of the Proceedings of the 41st Annual Hawaii International Conference on System Sciences
Journal of Artificial Intelligence Research
The distributed breakout algorithms
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Sensor networks and distributed CSP: communication, computation and complexity
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ants can solve constraint satisfaction problems
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
Distributed Constraint Satisfaction (DCSP) has long been considered an important area of research for artificial intelligence and multi-agent systems. Also, Ant Colony Optimization (ACO) is an important evolutionary method for solving various optimization problems. This paper demonstrates the power of ants in solving DCSPs and describes a new approach for such a solution, showing how it differs from previous ACO-based DCSP solvers. The presented algorithm is designed to provide the special requirements that are important in the distributed form of Constraint Satisfaction Problem (CSP). The paper describes the important criteria for distributed CSP and then demonstrates how the presented algorithm stands out over similar DCSP solvers considering these criteria. Finally, the proposed approach is evaluated on random binary problems. The practical results show that this method, in most of the cases, outperforms the Asynchronous Backtracking Algorithm (ABT) and Distributed Breakout Algorithm (DBA) two important algorithms in this field of research.