A theoretical evaluation of selected backtracking algorithms
Artificial Intelligence
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Distributed Algorithms
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
Constraint Processing
Asynchronous backtracking without adding links: a new member in the ABT family
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Asynchronous aggregation and consistency in distributed constraint satisfaction
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Secure distributed constraint satisfaction: reaching agreement without revealing private information
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Completeness and performance of the APO algorithm
Journal of Artificial Intelligence Research
Asynchronous forward bounding for distributed COPs
Journal of Artificial Intelligence Research
Min-domain ordering for asynchronous backtracking
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Asynchronous inter-level forward-checking for DisCSPs
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A general, fully distributed multi-agent planning algorithm
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Distributed constraint programming with agents
ICAIS'11 Proceedings of the Second international conference on Adaptive and intelligent systems
Improving Asynchronous Partial Overlay
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Distributed problem solving in geometrically-structured constraint networks
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Domain-independent multi-agent plan repair
Journal of Network and Computer Applications
Distributed reasoning for multiagent simple temporal problems
Journal of Artificial Intelligence Research
Improving the privacy of the asynchronous partial overlay protocol
Multiagent and Grid Systems - Principles and Practice of Multi-Agent Systems
| Hi-index | 0.00 |
A new search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. Agents assign variables sequentially, but perform forward checking asynchronously. The asynchronous forward-checking algorithm (AFC) is a distributed search algorithm that keeps one consistent partial assignment at all times. Forward checking is performed by sending copies of the partial assignment to all unassigned agents concurrently. The algorithm is described in detail and its correctness proven. The sequential assignment method of AFC leads naturally to dynamic ordering of agents during search. Several ordering heuristics are presented. The three best heuristics are evaluated and shown to improve the performance of AFC with static order by a large factor. An experimental comparison of AFC to asynchronous backtracking (ABT) on randomly generated DisCSPs is also presented. AFC with ordering heuristics outperforms ABT by a large factor on the harder instances of random DisCSPs. These results hold for two measures of performance: number of non-concurrent constraints checks and number of messages sent.