Collective Problem Solving through Coordinated Reaction

Jyi Shane Liu and Katia Sycara
Conference Paper, Proceedings of the IEEE International Conference on Evolutionary Computation, Vol. 2, pp. 575 - 578, June, 1994

View Publication

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


We present a methodology, called Constraint Partition and Coordinated Reaction (CP&CR), for collective, evolutionary problem solving. Problem solving is viewed as an emergent functionality from the evolving process of a group of diverse, interacting, and well-coordinated reactive agents. Cheap and effective search knowledge is extracted from local interactions and embedded in the coordination mechanism. Our domain of problem solving is constraint satisfaction problems. We have applied the methodology to job shop scheduling, an NP-complete constraint satisfaction problem. Experimental results on a benchmark suite of problems show that CP&CR outperformed three other state-of-the-art direct search scheduling techniques, in both effi ciency and number of problems solved. In addition, CP&CR was experimentally tested on problems of larger sizes and showed favorable scaling-up characteristics.

author = {Jyi Shane Liu and Katia Sycara},
title = {Collective Problem Solving through Coordinated Reaction},
booktitle = {Proceedings of the IEEE International Conference on Evolutionary Computation},
year = {1994},
month = {June},
volume = {2},
pages = {575 - 578},
keywords = {Collective Problem Solving, Agent Society, Coordination Strategy, Coordinated Search},
} 2017-09-13T10:51:22-04:00