Evidential reasoning using stochastic simulation of causal models
Artificial Intelligence
Phase transitions and the search problem
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Distributed problem solving in sensor networks
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
The Evolution of Customer Middleware Requirements
PDIS '94 Proceedings of the Third International Conference on Parallel and Distributed Information Systems
The Phase Transition in Distributed Constraint Satisfaction Problems: Fist Results
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Distributed breakout revisited
Eighteenth national conference on Artificial intelligence
An asynchronous complete method for distributed constraint optimization
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Anytime local search for distributed constraint optimization
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Directed soft arc consistency in pseudo trees
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Asynchronous Forward-Bounding for Distributed Constraints Optimization
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Diagnosis of multi-robot coordination failures using distributed CSP algorithms
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Solving DisCSPs with penalty driven search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Anytime local search for distributed constraint optimization
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Completeness and performance of the APO algorithm
Journal of Artificial Intelligence Research
Asynchronous forward bounding for distributed COPs
Journal of Artificial Intelligence Research
Quality guarantees on k-optimal solutions for distributed constraint optimization problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Distributed Constraint Optimization for Large Teams of Mobile Sensing Agents
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Trading off solution quality for faster computation in DCOP search algorithms
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A constraint based formalisation for distributed cooperative sensor resource allocation
International Journal of Intelligent Information and Database Systems
A study for representations of distributed cooperative search algorithms based on pseudo-trees
SEPADS'11 Proceedings of the 10th WSEAS international conference on Software engineering, parallel and distributed systems
Communication-constrained DCOPs: message approximation in GDL with function filtering
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Hi-index | 0.00 |
This research is motivated by some distributed scheduling problems in distributed sensor networks, in which computational and communication resources are scarce. We first cast these problems as distributed constraint satisfaction problems (DisCSPs) and distributed constraint optimization problems (DisCOPs) and model them as distributed graph coloring. To cope with limited resources and restricted real-time requirement, it is imperative to use distributed algorithms that have low overhead on resource consumption and high-quality anytime performance. To meet these requirements, we study two existing DisCSP algorithms, distributed stochastic search algorithm (DSA) and distributed breakout algorithm (DBA), for solving DisCOPs and the distributed scheduling problems. We experimentally show that DSA has a phase-transition or threshold behavior, in that its solution quality degenerates abruptly and dramatically when the degree of parallel executions of distributed agents increases beyond some critical value. We also consider the completeness and complexity of DBA for distributed graph coloring. We show that DBA is complete on coloring acyclic graphs, coloring an acyclic graph of n nodes in O(n2) steps. However, on a cyclic graph, DBA may never terminate. To improve DBA's performance on coloring cyclic graphs, we propose two stochastic variations. Finally, we directly compare DSA and DBA for solving distributed graph coloring and distributed scheduling problems in sensor networks. The results show that DSA is superior to DBA when controlled properly, having better or competitive solution quality and significantly lower communication cost than DBA. Therefore, DSA is the algorithm of choice for our distributed scheduling problems and other distributed problems of similar properties.