A study of probability collectives multi-agent systems on optimization and robustness

Authors:
Chien-Feng Huang;Bao Rong Chang
Affiliations:
Department of Computer Science and Information Engineering, National University of Kaohsiung, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, National University of Kaohsiung, Taiwan, R.O.C.
Venue:
Transactions on computational collective intelligence IV
Year:
2011

Citing 11
Cited 0

A connectionist machine for genetic hillclimbing

A connectionist machine for genetic hillclimbing
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Distributed evolutionary optimization, in Manifold: Rosenbrock's function case study

Information Sciences: an International Journal - Special issue on frontiers in evolutionary algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization

Proceedings of the 3rd International Conference on Genetic Algorithms
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.
Information Theory, Inference & Learning Algorithms

Information Theory, Inference & Learning Algorithms
A comparative study of probability collectives based multi-agent systems and genetic algorithms

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Distributed optimization and flight control using collectives

Distributed optimization and flight control using collectives
Probability Collectives: A multi-agent approach for solving combinatorial optimization problems

Applied Soft Computing
Probability collectives multi-agent systems: a study of robustness in search

ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a study on optimization and robustness of Probability Collectives Multi-agent Systems (PCMAS). 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.