Comparative Reproduction Schemes for Evolving Gathering Collectives A.E. Eiben, G.S. Nitschke, M.C. Schut Computational Intelligence Group Department of.

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

Particle Swarm Optimization (PSO)
Yuri R. Tsoy, Vladimir G. Spitsyn, Department of Computer Engineering
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Constructing Complex NPC Behavior via Multi- Objective Neuroevolution Jacob Schrum – Risto Miikkulainen –
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Lincoln University Canterbury New Zealand Evaluating the Parallel Performance of a Heterogeneous System Elizabeth Post Hendrik Goosen formerly of Department.
Genetic Algorithms. Some Examples of Biologically Inspired AI Neural networks Evolutionary computation (e.g., genetic algorithms) Immune-system-inspired.
Evolvable by Design Panos Oikonomou James Franck Institute Institute of Biophysical Dynamics The University of Chicago Philippe Cluzel How topology affects.
A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Genetic Algorithms Learning Machines for knowledge discovery.
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Tutorial 1 Temi avanzati di Intelligenza Artificiale - Lecture 3 Prof. Vincenzo Cutello Department of Mathematics and Computer Science University of Catania.
L/O/G/O Ant Colony Optimization M1 : Cecile Chu.
Evolving Multi-modal Behavior in NPCs Jacob Schrum – Risto Miikkulainen –
By Paul Cottrell, BSc, MBA, ABD. Author Complexity Science, Behavioral Finance, Dynamic Hedging, Financial Statistics, Chaos Theory Proprietary Trader.
Genetic Algorithms and Ant Colony Optimisation
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
计算机科学概述 Introduction to Computer Science 陆嘉恒 中国人民大学 信息学院
Adapting Convergent Scheduling Using Machine Learning Diego Puppin*, Mark Stephenson †, Una-May O’Reilly †, Martin Martin †, and Saman Amarasinghe † *
1 Artificial Evolution: From Clusters to GRID Erol Şahin Cevat Şener Dept. of Computer Engineering Middle East Technical University Ankara.
Introduction to Genetic Algorithms and Evolutionary Computation
Graph Coloring with Ants
INTRODUCTION TO DATA MINING MIS2502 Data Analytics.
Computational Organization Theory Aaron Drajpuch WPI, CS525M, Spring 2002 Introduction What is an Organization What is Computational Organization Theory.
Modern Heuristic Optimization Techniques and Potential Applications to Power System Control Mohamed A El-Sharkawi The CIA lab Department of Electrical.
1 IE 607 Heuristic Optimization Particle Swarm Optimization.
Selected topics in Ant 2002 By Hanh Nguyen. Selected topics in Ant 2002 Homogeneous Ants for Web Document Similarity Modeling and Categorization Ant Colonies.
Predictive Design Space Exploration Using Genetically Programmed Response Surfaces Henry Cook Department of Electrical Engineering and Computer Science.
Project funded by the Future and Emerging Technologies arm of the IST Programme FET-Open scheme Project funded by the Future and Emerging Technologies.
Static vs. Dynamic Populations in GAs for Coloring a Dynamic Graph Cara Monical Forrest Stonedahl
1 Genetic Algorithms and Ant Colony Optimisation.
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
EGEE-III INFSO-RI Enabling Grids for E-sciencE EGEE and gLite are registered trademarks Grid-enabled parameter initialization for.
Evolutionary Programming
1 Effect of Spatial Locality on An Evolutionary Algorithm for Multimodal Optimization EvoNum 2010 Ka-Chun Wong, Kwong-Sak Leung, and Man-Hon Wong Department.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Evolving Multimodal Networks for Multitask Games
MIS2502: Data Analytics Advanced Analytics - Introduction.

Organic Evolution and Problem Solving Je-Gun Joung.
Advanced elements for transforming networks. VLADISLAV SKORPIL Department of Telekommunications, Brno University of Technology, Purkynova 118,
Load Balancing : The Goal Given a collection of tasks comprising a computation and a set of computers on which these tasks may be executed, find the mapping.
Robot Intelligence Technology Lab. 10. Complex Hardware Morphologies: Walking Machines Presented by In-Won Park
Evolutionary Programming A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 5.
A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Evolutionary Programming.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
Evolving robot brains using vision Lisa Meeden Computer Science Department Swarthmore College.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
Haploid-Diploid Evolutionary Algorithms
Selected Topics in CI I Genetic Programming Dr. Widodo Budiharto 2014.
Evolutionary Algorithms Jim Whitehead
Pengyuan Du, Mario Gerla Department of Computer Science, UCLA, USA
MIS2502: Data Analytics Advanced Analytics - Introduction
HyperNetworks Engın denız usta
Daniil Chivilikhin and Vladimir Ulyantsev
Who cares about implementation and precision?
Haploid-Diploid Evolutionary Algorithms
Evolving Multimodal Networks for Multitask Games
Advanced Artificial Intelligence Evolutionary Search Algorithm
Genetic Algorithms and TSP
Genetic Algorithms overview
Centre for Emergent Computing
Faustino J. Gomez, Doug Burger, and Risto Miikkulainen
Introduction to Artificial Intelligence Lecture 11: Machine Evolution
Dr. Unnikrishnan P.C. Professor, EEE
CHAPTER I. of EVOLUTIONARY ROBOTICS Stefano Nolfi and Dario Floreano
Coevolutionary Automated Software Correction
Presentation transcript:

Comparative Reproduction Schemes for Evolving Gathering Collectives A.E. Eiben, G.S. Nitschke, M.C. Schut Computational Intelligence Group Department of Computer Science, Faculty of Sciences De Boelelaan 1081a, 1081 HV Amsterdam The Netherlands

Introduction Research theme: Emergent Collective Intelligence Investigating artificial evolution for adaptability at local level, and desired emergent behaviors at global level Comparing agent reproduction schemes under two types of evolvable controllers: heuristic and neural-net Results from a collective gathering simulation

Background Emergent behavior in collective gathering: Nolfi et al. (2003): Cooperative transport by s-bots Drogoul et al. (1995): Emergent functionality, division of labor in a simulated ant colony gathering task Perez-Uribe et al. (2003):Emergent cooperative behavior for gathering by artificial ants, based on colony type (heterogeneous vs. homogenous)

Experimental Setup JAWAS simulator: simulating collective gathering - potentially thousands of agents (swarm scape) Initially 1000 agents, 3 resource types (different values and cooperation needed to gather) Agent goal: to gather the highest value of resources possible during lifetime Cooperation needed for ‘good’ solutions – gathering of highest value of resources

Task domain: Minesweeping Capacity Extraction Transport Fitness Threshold Cost Cost Reward Mine type A Mine type B Mine type C Fitness rewards given to agents for successful gathering (delivery to the home area). Collective evaluation: Total value gathered – taken at end of Simulation and as average of 100 runs

Comparative Agent Reproduction Schemes Temporal Dimension SREL : Single Reproduction at End of Lifetime MRDL: Multiple Reproduction during an Agents Lifetime Spatial Dimension Locally restricted: Reproduction only with agents in adjacent cells Panmictic: Reproduction with agents anywhere in the environment

Agent Controllers: Heuristic Controller

Agent Controllers: Neural Network Controller

Evolutionary setup For both heuristic and NN : –Gathering and transport parameter values evolved Heuristic controller static throughout evolutionary process Neural network controller dynamic over evolutionary process – i.e. NN weights evolved NN controllers evolved under a neuro-evolution process

Experimental Results

Experimental Results: Evolution Control

Conclusions SREL/Local – the most effective scheme – under given behavior evaluation - validated under two approaches Not the case under MRDL – where agents may not be given sufficient time to adapt to their task before reproducing Fitness saved by agents until end of lifetime – successful agents pass on fitness – especially effective under NE – where recombined mutated weights are passed on