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
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A formalization for distributed cooperative sensor resource allocation
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
When should there be a "Me" in "Team"?: distributed multi-agent optimization under uncertainty
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Divide-and-coordinate: DCOPs by agreement
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Local search for distributed asymmetric optimization
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Deception in networks of mobile sensing agents
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Analyzing the impact of human bias on human-agent teams in resource allocation domains
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Solving coarse-grained DisCSPs with local search
Web Intelligence and Agent Systems
Benchmarking hybrid algorithms for distributed constraint optimisation games
Autonomous Agents and Multi-Agent Systems
Autonomous Agents and Multi-Agent Systems
Distributed graph coloring for self-organization in LTE networks
Journal of Electrical and Computer Engineering - Special issue on LTE/LTE-advanced cellular communication networks
Quality guarantees for region optimal DCOP algorithms
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Agent-mediated multi-step optimization for resource allocation in distributed sensor networks
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Distributed model shaping for scaling to decentralized POMDPs with hundreds of agents
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Pseudo-tree-based incomplete algorithm for distributed constraint optimization with quality bounds
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Exceeding the efficiency of distributed approximate algorithms enabling by the multiplexing method
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part III
Overlay networks for task allocation and coordination in large-scale networks of cooperative agents
Autonomous Agents and Multi-Agent Systems
The Knowledge Engineering Review
Simple support-based distributed search
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Multi-agent coordination: dcops and beyond
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Max/min-sum distributed constraint optimization through value propagation on an alternating DAG
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
The optimal solution attainment rate of the multiplexing method
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Proceedings of the 7th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Distributed constraint optimisation for resource limited sensor networks
Science of Computer Programming
Considering Equality on Distributed Constraint Optimization Problem for Resource Supply Network
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Improved max-sum algorithm for DCOP with n-ary constraints
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Using conflict resolution to inform decentralized learning
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Asymmetric distributed constraint optimization problems
Journal of Artificial Intelligence Research
Agent-based decentralised coordination for sensor networks using the max-sum algorithm
Autonomous Agents and Multi-Agent Systems
Dynamic multiagent load balancing using distributed constraint optimization techniques
Web Intelligence and Agent Systems
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(n^2) 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.