Tracking extrema in dynamic environments using Probability Collectives Multi-agent Systems

We present a study of extrema-tracking in dynamic environments using Probability Collectives Multi-agent Systems (PCMAS). 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 over the space of solutions. Three versions of PCMAS in the extrema-tracking tasks are investigated: PCMAS1 (original PCMAS settings), PCMAS2 (temperature T — a factor controlling the balance between exploration and exploitation of the search space — is reset to the initial state when an environmental change takes place), as well as PCMAS3 (in addition to T being reset to the initial state, the probability distributions are also reset to uniform when an environment changes). By allowing PCMAS to detect changes in environments to re-explore the search space, we show that PCMAS2 and PCMAS3 significantly outperform the original PCMAS (i.e., PCMAS1). The study of the PCMAS in changing environments therefore sheds light on how this multi-agent methodology advances the current state of research in agent-based models for dynamic optimization problems.

[1]  Anand J. Kulkarni,et al.  Probability Collectives: A Decentralized, Distributed Optimization for Multi-Agent Systems , 2009 .

[2]  Kang Tai,et al.  Probability Collectives: A multi-agent approach for solving combinatorial optimization problems , 2010, Appl. Soft Comput..

[3]  Kagan Tumer,et al.  Optimal Payoff Functions for Members of Collectives , 2001, Adv. Complex Syst..

[4]  Chien-Feng Huang,et al.  Probability Collectives in Dynamic Environments: A Study of Controlling the Balance between Exploration and Exploitation of the Search , 2010, 2010 International Conference on Technologies and Applications of Artificial Intelligence.

[5]  David H. Wolpert,et al.  A comparative study of probability collectives based multi-agent systems and genetic algorithms , 2005, GECCO '05.

[6]  David H. Wolpert,et al.  Discrete, Continuous, and Constrained Optimization Using Collectives , 2004 .

[7]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[8]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  D. Ackley A connectionist machine for genetic hillclimbing , 1987 .

[10]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[11]  Bao Rong Chang,et al.  Probability Collectives Multi-Agent Systems: A Study of Robustness in Search , 2010, ICCCI.

[12]  Peter J. Angeline,et al.  Tracking Extrema in Dynamic Environments , 1997, Evolutionary Programming.