In search of the best constraint satisfaction search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed Algorithms
Algorithms for Distributed Constraint Satisfaction: A Review
Autonomous Agents and Multi-Agent Systems
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Dynamic Variable Ordering in CSPs
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Using Bidirectionality to Speed up Arc-Constistency Processing
Constraint Processing, Selected Papers
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
Message delay and DisCSP search algorithms
Annals of Mathematics and Artificial Intelligence
Connecting ABT with Arc Consistency
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking
Autonomous Agents and Multi-Agent Systems
Asynchronous forward bounding for distributed COPs
Journal of Artificial Intelligence Research
Dynamic configuration of agent organizations
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Min-domain ordering for asynchronous backtracking
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Effect of DisCSP variable-ordering heuristics in scale-free networks
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Concurrent forward bounding for distributed constraint optimization problems
Artificial Intelligence
Effect of DisCSP variable-ordering heuristics in scale-free networks
Multiagent and Grid Systems - Principles and Practice of Multi-Agent Systems
| Hi-index | 0.00 |
An algorithm that performs asynchronous backtracking on distributed $$CSPs$$, with dynamic ordering of agents is proposed, $$ABT\_DO$$. Agents propose reorderings of lower priority agents and send these proposals whenever they send assignment messages. Changes of ordering triggers a different computation of $$Nogoods$$. The dynamic ordered asynchronous backtracking algorithm uses polynomial space, similarly to standard $$ABT$$. The $$ABT\_DO$$ algorithm with three different ordering heuristics is compared to standard $$ABT$$ on randomly generated $$DisCSPs$$. A Nogood-triggered heuristic, inspired by dynamic backtracking, is found to outperform static order $$ABT$$ by a large factor in run-time and improve the network load.