Abstract
We present a robustness study of the search of Probability Collectives Multi-agent Systems (PCMAS) for optimization problems. This framework for distributed optimization is deeply connected with both game theory and statistical physics. In contrast to traditional biologically-inspired algorithms, Probability-Collectives (PC) based methods do not update populations of solutions; instead, they update an explicitly parameterized probability distribution p over the space of solutions by a collective of agents. That updating of p arises as the optimization of a functional of p. The functional is chosen so that any p that optimizes it should be p peaked about good solutions. By comparing with genetic algorithms, we show that the PCMAS method appeared superior to the GA method in initial rate of decent, long term performance as well as the robustness of the search on complex optimization problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Dorigo, M.: Optimization, learning and natural algorithms. Ph.D. thesis, Politecnico di Milano (1992)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. of IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)
Wolpert, D.H.: Theory of collectives. In: The Design and Analysis of Collectives, Springer, New York (2003), http://ic.arc.nasa.gov/dhw
Wolpert, D.H.: Bounded rational games, information theory, and statistical physics. In: Braha, D., Bar–Yam, Y. (eds.) Complex Engineering Systems
Wolpert, D.H., Tumer, T.: Optimal payoff functions for members of collectives. Advances in Complex Systems 4(2/3), 265–279 (2001)
Bieniawski, S., Wolpert, D.H., Kroo, I.: Discrete, continuous, and constrained optimization using collectives. In: Proc. of the 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference, AIAA Paper 2004–4580 (2004)
Kulkarni, A., Tai, K.: Probability collectives: a multi-agent approach for solving combinatorial optimization problems. Applied Soft Computing 10(3), 759–771 (2010)
Cheng, C., Wang, W., Xu, D., Chau, K.: Optimizing hydropower reservoir operation using hybrid genetic algorithm and chaos. Water Resource Management 22, 895–909 (2008)
Blumenthal, H., Parker, G.: Benchmarking punctuated anytime learning for evolving a multi-agent team’s binary controllers. In: World Automation Congress (2006)
Bouvry, P., Arbab, F., Seredynski, F.: Distributed evolutionary optimization. Manifold: Rosenbrocks Function Case Study, Information Sciences 122, 141–159 (2000)
Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991)
Mackay, D.: Information Theory, Inference, and Learning Algorithms. Cambridge University Press, Cambridge (2003)
Wolpert, D., Bieniawski, S.: Distributed control by lagrangian steepest descent. In: Proc. of the 43rd IEEE Conference on Decision and Control, pp. 1562–1567 (2004)
Bieniawski, S.: Distributed optimization and flight control using collectives. Ph.D. thesis, Stanford University, CA (2005)
Huang, C.F., Bieniawski, S., Wolpert, D.H., Strauss, C.: Comparative study of probability collectives based multi–agent systems and genetic algorithms. In: Proc. of the 2005 Genetic and Evolutionary Computation Conference (GECCO 2005), pp. 751–752 (2005)
Goldberg D. E., Deb K.: A comparative analysis of selection schemes used in genetic algorithms. Foundation of Genetic Algorithms, 69–93 (1991)
Schaffer, J.D., Caruana, R.A., Eshelman, L.J., Das, R.: A study of control parameters affecting online performance of genetic algorithms for function optimization. In: Proc. 3rd International Conference on Genetic Algorithms, pp. 51–60. Morgan Kaufmann, San Francisco (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, CF., Chang, B.R. (2010). Probability Collectives Multi-Agent Systems: A Study of Robustness in Search. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2010. Lecture Notes in Computer Science(), vol 6422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16732-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-16732-4_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16731-7
Online ISBN: 978-3-642-16732-4
eBook Packages: Computer ScienceComputer Science (R0)