Distributed stochastic search and distributed breakout: Properties, comparison and applications to constraint optimization problems in sensor networks

Artificial Intelligence

Volumn 161, Issue 1-2, 2005, Pages 55-87

  Zhang, Weixiong ^a   Wang, Guandong ^a   Xing, Zhao ^a   Wittenburg, Lars ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Breakout algorithm; Distributed breakout algorithm; Distributed constraint optimization problem; Distributed constraint satisfaction problem; Distributed scheduling; Distributed sensor networks; Distributed stochastic search; Phase transitions

Indexed keywords

ACTUATORS; ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; GRAPH THEORY; OPTIMIZATION; PHASE TRANSITIONS; PROBLEM SOLVING; RANDOM PROCESSES; REAL TIME SYSTEMS; SCHEDULING;

BREAKOUT ALGORITHM; DISTRIBUTED BREAKOUT ALGORITHM; DISTRIBUTED CONSTRAINT OPTIMIZATION PROBLEM; DISTRIBUTED CONSTRAINT SATISFACTION PROBLEM; DISTRIBUTED SCHEDULING; DISTRIBUTED SENSOR NETWORKS; DISTRIBUTED STOCHASTIC SEARCH;

SENSORS;

EID: 10044270060     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2004.10.004     Document Type: Article

References (23)

1. P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are, in: Proc. 12th Internat. Joint Conference on Artificial Intelligence (UCAI-91), Sydney, Australia, 1991, pp. 331-337.
2. M. Fabiunke, Parallel distributed constraint satisfaction, in: Proc. Internat. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA-99), 1999, pp. 1585-1591.
3. S. Fitzpatrick, L. Meertens, An experimental assessment of a stochastic, anytime, decentralized, soft colourer for sparse graphs, in: Proc. 1st Symp. on Stochastic Algorithms: Foundations and Applications, 2001, pp. 49-64.
4. S. Fitzpatrick, L. Meertens, Experiments on dense graphs with a stochastic, peer-to-peer colorer, in: Proc. AAAI-02 Workshop on Probabilistic Approaches in Search, 2002, pp. 24-28.
5. J. Hill, D. Culler, Mica: a wireless platform for deeply embedded networks, IEEE Micro. 22 (6) (2002) 12-24.
6. K. Hirayama, M. Yokoo, K. Sycara, The phase transition in distributed constraint satisfaction problems: First results, in: Proc. Internat. Workshop on Distributed Constraint Satisfaction, 2000.
7. T. Hogg, B.A. Huberman, C. Williams, Phase transitions and the search problem, Artificial Intelligence 81 (1996) 1-15.
8. W.G. Macready, A.G. Siapas, S.A. Kauffman, Criticality and parallelism in combinatorial optimization, Science 271 (1996) 56-59.
9. P.J. Modi, W-M. Shen, M. Tambe, M. Yokoo, An asynchronous complete method for distributed constraint optimization, in: Proc. 2nd Internat. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS-03), 2003, pp. 161-168.
10. P. Morris, The breakout method for escaping from local minima, in: Proc. 11th National Conference on Artificial Intelligence (AAAI-93), Washington, DC, 1993, pp. 40-45.
11. J. Pearl, Evidential reasoning using stochastic simulation of causal models, Artificial Intelligence 32 (1987) 245-257.
12. H. Reichl, Overview and development trends in the field of MEMS packaging, Invited talk given at 14th Internat. Conf. on Micro Electro Mechanical Systems, January 21-25, 2001, Switzerland.
13. M. Takeda, Applications of MEMS to industrial inspection, Invited talk, 14th Internat. Conf. on Micro Electro Mechanical Systems, January 21-25, 2001.
14. G. Tel, Introduction to Distributed Algorithms, second ed., Cambridge University Press, Cambridge, 2000.
15. G. Xing, A performance-driven framework for customizing CSP middleware support, Master's thesis, Washington University in St. Louis, Saint Louis, Missouri, USA, April 2003.
16. M. Yokoo, Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-Agent Systems, Springer, Berlin, 2001.
17. M. Yokoo, E.H. Durfee, T. Ishida, K. Kuwabara, The distributed constraint satisfaction problem: formalization and algorithms, IEEE Trans. Pattern Anal. Machine Intell. 10 (5) (1998) 673-685.
18. M. Yokoo, K. Hirayama, Distributed breakout algorithm for solving distributed constraint satisfaction problems, in: Proc. 2nd Internat. Conference on Multi-Agent Systems (ICMAS-96), 1996, pp. 401-408.
19. W. Zhang, Z. Deng, G. Wang, L. Wittenburg, Z. Xing, Distribute problem solving in sensor networks, in: Proc. 1st Internat. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS-02), 2002, pp. 988-989.
20. W. Zhang, G. Wang, L. Wittenburg, Distributed stochastic search for distributed constraint satisfaction and optimization: parallelism, phase transitions and performance, in: Proc. AAAI-02 Workshop on Probabilistic Approaches in Search, 2002, pp. 53-59.
21. W. Zhang, L. Wittenburg, Distributed breakout revisited, in: Proc. 18th National Conference on Artificial Intelligence (AAAI-02), Edmonton, AB, 2002, pp. 352-357.
22. W. Zhang, Z. Xing, G. Wang, L. Wittenburg, An analysis and application of distributed constraint satisfaction and optimization algorithms in sensor networks, in: Proc. 2nd Internat. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS-03), 2003, pp. 185-192.
23. J. Zhao, R. Govindan, D. Estrin, Computing aggregates for monitoring wireless sensor networks, in: Proc. 1st IEEE Internat. Workshop on Sensor Network Protocols and Applications, 2003.