Emergence from local evaluation function
查看参考文献27篇
文摘
|
This paper presents a new look on emergence from the aspect of locality and globality of evaluation functions for solving traditional computer problems. We first translate the Constraint Satisfaction Problem (CSP) into the multi-agent system, and then show how a global solution emerges from the system in which every agent uses a local evaluation function to decide its action, while comparing to other traditional algorithms, such as Local search and Simulated Annealing which use global evaluation functions. We also give some computer experimental results on large-scale JV-queen problems and k-Coloring problems, and show that emergence only depends on problem instance, not details of agent settings, i.e. in some CSPs, the system can self-organize to a global solution, but can not in some other CSPs no matter what settings of agents have. |
来源
|
Journal of Systems Science and Complexity
,2003,16(3):372-390 【核心库】
|
关键词
|
constraint satisfaction problem
;
evolution function
;
multi-agent system
|
地址
|
1.
Institute of Systems Science, Academy of Mathematics and Systems Sciences, 北京, 100080
2.
Department of Computer Science, University of Science and Technology of China, Hefei, 230026
|
语种
|
英文 |
文献类型
|
研究性论文 |
ISSN
|
1009-6124 |
学科
|
数学 |
基金
|
国家自然科学基金
;
美国SantaFe研究所国际合作计划
|
文献收藏号
|
CSCD:1271197
|
参考文献 共
27
共2页
|
1.
Martin Gardner. The fantastic combinations of John Conway's new solitaire game "life".
Scientific American,1970,223:120-123
|
CSCD被引
17
次
|
|
|
|
2.
.
http://www.red3d.com/cwr/boids/applet
|
CSCD被引
1
次
|
|
|
|
3.
J H Holland. Adaptation in Natural and Artificial Systems.
Adaptation in Natural and Artificial Systems,1975
|
CSCD被引
611
次
|
|
|
|
4.
M Dorigo. The ant colony optimization meta-heuristic.
In New Ideas in Optimization,1999:11-32
|
CSCD被引
1
次
|
|
|
|
5.
Jing Hah. From ALIFE Agents to a Kingdom of N Queens.
Intelligent Agent Technology: Systems, Methodologies, and Tools,1999:110-120
|
CSCD被引
1
次
|
|
|
|
6.
Jiming Liu.
Artificial Intelligence,2002,136(1):101-144
|
CSCD被引
10
次
|
|
|
|
7.
Vipin Kumar. a survey.
AI Magazine,1992,13(1):32-44
|
CSCD被引
2
次
|
|
|
|
8.
David S Johnson.
Operations Research,1991,39(3):378-406
|
CSCD被引
8
次
|
|
|
|
9.
Rok Sosic. A case study of the N-queen problem.
IEEE Transactions on Knowledge and Data Engineering,1994,6(5):661-668
|
CSCD被引
7
次
|
|
|
|
10.
Kumar V.
Encyclopaedia of Artificial Intelligence: Vol 2:1004-1005
|
CSCD被引
1
次
|
|
|
|
11.
S Minton. A heuristic repair method for constraint satisfaction and scheduling problems.
Artificial Intelligence,1992,52:161-205
|
CSCD被引
13
次
|
|
|
|
12.
Bart Selman. Local Search Strategies for Satisfiability Testing.
Second DIMACS Challenge on Cliques,Coloring, and Satisfiability,1993
|
CSCD被引
1
次
|
|
|
|
13.
McAllester D. Evidence for Invariants in Local Search In Proceedings of AAAI'97.
Evidence for Invariants in Local Search In Proceedings of AAAI'97,1997:321-326
|
CSCD被引
1
次
|
|
|
|
14.
F Glover. ORSA Journal on Computing.
ORSA Journal on Computing,1989,1(3):190-206
|
CSCD被引
178
次
|
|
|
|
15.
F Glover. ORSA Journal on Computing.
ORSA Journal on Computing,1990,2(1):4-32
|
CSCD被引
115
次
|
|
|
|
16.
Kirkpatrick S. Optimization by simulated annealing.
Science,1983,220(4598):671-681
|
CSCD被引
1031
次
|
|
|
|
17.
S Boettcher. Nature's way of optimizing.
Artificial Intelligence,2000(119):275-286
|
CSCD被引
1
次
|
|
|
|
18.
.
http://www.rl.af. mil/tech/programs/aior/ThvsPrac.html
|
CSCD被引
1
次
|
|
|
|
19.
Hogg T.
Proceedings of AAAI'93,1993:231-236
|
CSCD被引
1
次
|
|
|
|
20.
Selman B. A New Method for Solving Hard Satisfiability Problems.
In Proceedings of AAAI'92,1992:440-446
|
CSCD被引
1
次
|
|
|
|
|