Memoryless cooperative graph search based on the simulated annealing algorithm

Chinese Physics B

Volumn 20, Issue 4, 2011, Pages

  Hou, Jian ^a   Yan, Gang Feng ^a   Fan, Zhen ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

globally optimal; graph partition; search; simulated annealing

Indexed keywords

AUTONOMOUS MOBILE AGENT; COMPUTATION COMPLEXITY; CONSENSUS METHODS; CONTROL STRATEGIES; GLOBALLY OPTIMAL; GRAPH PARTITION; GRAPH SEARCH; KEY PARAMETERS; KNOWN ENVIRONMENTS; MEMORYLESS; MULTI-AGENT; SEARCH; SIMULATED ANNEALING ALGORITHMS; SINGLE-AGENT; UNKNOWN ENVIRONMENTS;

ALGORITHMS; AUTONOMOUS AGENTS; CONVERGENCE OF NUMERICAL METHODS; MOBILE AGENTS; MULTI AGENT SYSTEMS;

SIMULATED ANNEALING;

EID: 79955692723     PISSN: 16741056     EISSN: None     Source Type: Journal    
DOI: 10.1088/1674-1056/20/4/048103     Document Type: Article

References (27)

1. Koopman B O 1946 Operations Evaluations Group Report
2. Stone L D 1975 Theory of Optimal Search (New York: Academic Press) p 1
3. Ieong S, Lambert N, Shoham Y and Brafman R 2007 Proc. National Conf. on Artificial Intelligence, British Columbia, Canada, July 22-26, 2007 p 1158
4. Liu F and Xu X P 2007 Chin. Phys. 16 282
5. DasGupta B, Hespanha J P, Riehl J R and Sontag E 2006 Nonlinear Anal. Theor. E 65 1773
6. Riehl J R and Hespanha J P 2005 Proc. 44th IEEE Conference on Decision and Control, and the European Control Conf., Seville, Spain, December 12-15, 2005 p 2188
7. Riehl J R, Collins G E and Hespanha J P 2007 Proc. 2007 IEEE Conf. on Decision and Control, New Orleans, USA, December 12-14, 2007 p 2998
8. Sujit P B and Ghose D 2004 IEEE. T. Aero. Elec. Syst. E 40 491
9. Chung T H, Kress M and Royset J O 2009 Proc. 2009 IEEE Int. Conf. on Robotics and Automation, Kobe, Japan, May 12-17, 2009 p 243
10. Polycarpou M M, Yang Y and Passino K M 2001 Proc. 2001 IEEE Int. Symp. on Intelligent Control, Mexico City, Mexico, September 5-7, 2001 p 1
11. Riehl J R and Hespanha J P 2007 Proc. 2007 American Control Conf., New York, USA, July 9-13, 2007 p 2557
12. Avetisyan V V 2002 J. Comput. Syst. Sci. Int. E 41 57
13. Blum T and Kohlbacher O 2008 Bioinformatics E 24 2108
14. Vlachos M, Kozat S S and Yu P S 2010 Acm. T. Web. E 41
15. Guruprasad K R and Ghose D 2007 Proc. 1st Int. Conf. on Advances in Control and Optimization of Dynamical Systems, Bangalore, India, February 1-2, 2007 p 380
16. Sujit P B and Ghose D 2004 Proc. 2004 American Control Conf., Boston, USA, June 30-July 2, 2004 p 5564
17. Göbel F and Jagers A A 1974 Stoch. Proc. Appl. E 2 311
18. Lovsz L 1993 Combinatorics E 2 1
19. Hanusse N, Kranakis E and Krizanc D 2004 Discrete Appl. Math. E 137 69
20. Hanusse N, Kavvadias D, Kranakis E and Krizanc D 2008 Theor. Comput. Sci. E 402 190
21. Zhao Z J, Zheng S L, Xu C Y and Kong X Z 2007 Chin. Phys. 16 1619
22. Kirkpatrick S 1984 J. Stat. Phys. E 34 975
23. Wang L and Smith K 1998 IEEE T. Neural Network E 9 716
24. Aarts E H L and Laarhoven P J M 2008 Stat. Neerl. E 43 31
25. Alrefaei M H and Andradóttir S 1999 Manage. Sci. E 45 748
26. Kashyap A, Basar T and Srikant R 2007 Algorithmica E 43 1192
27. Romeo F and Sangiovanni-Vincentelli A 1991 Algorithmica E 6 302