Kavita Singh CS-A 0509710047. What is Swarm Intelligence (SI)? “The emergent collective intelligence of groups of simple agents.”

Slides:



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

Computational Intelligence Winter Term 2011/12 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Computational Intelligence Winter Term 2013/14 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Comparing Effectiveness of Bioinspired Approaches to Search and Rescue Scenarios Emily Shaeffer and Shena Cao 4/28/2011Shaeffer and Cao- ESE 313.
Security Issues in Ant Routing Weilin Zhong. Outline Swarm Intelligence AntNet Routing Algorithm Security Issues in AntNet Possible Solutions.
Flocking Behaviors Presented by Jyh-Ming Lien. Flocking System What is flocking system? – A system that simulates behaviors of accumulative objects (e.g.
Swarm Intelligence (sarat chand) (naresh Kumar) (veeranjaneyulu) (kalyan raghu)‏
Swarm algorithms COMP308. Swarming – The Definition aggregation of similar animals, generally cruising in the same direction Termites swarm to build colonies.
Ant Colony Optimization. Brief introduction to ACO Ant colony optimization = ACO. Ants are capable of remarkably efficient discovery of short paths during.
Biologically Inspired Computation Lecture 10: Ant Colony Optimisation.
Swarm Intelligence Corey Fehr Merle Good Shawn Keown Gordon Fedoriw.
1 Sensor Networks and Networked Societies of Artifacts Jose Rolim University of Geneva.
Ant Colony Optimization Optimisation Methods. Overview.
By Stefan Rummel 05/05/2008 Prof. Rudowsky CIS 9.5 Brooklyn College.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Biologically Inspired Computation Ant Colony Optimisation.
Ant Colony Optimization: an introduction
L/O/G/O Ant Colony Optimization M1 : Cecile Chu.
Island Based GA for Optimization University of Guelph School of Engineering Hooman Homayounfar March 2003.
Distributed Systems 15. Multiagent systems and swarms Simon Razniewski Faculty of Computer Science Free University of Bozen-Bolzano A.Y. 2014/2015.
SWARM INTELLIGENCE IN DATA MINING Written by Crina Grosan, Ajith Abraham & Monica Chis Presented by Megan Rose Bryant.
Genetic Algorithms and Ant Colony Optimisation
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
Lecture Module 24. Swarm describes a behaviour of an aggregate of animals of similar size and body orientation. Swarm intelligence is based on the collective.
EE4E,M.Sc. C++ Programming Assignment Introduction.
By:- Omkar Thakoor Prakhar Jain Utkarsh Diwaker
Swarm Computing Applications in Software Engineering By Chaitanya.
Swarm Intelligence 虞台文.
Algorithms and their Applications CS2004 ( )
G5BAIM Artificial Intelligence Methods Graham Kendall Ant Algorithms.
SWARM INTELLIGENCE Sumesh Kannan Roll No 18. Introduction  Swarm intelligence (SI) is an artificial intelligence technique based around the study of.
-Abhilash Nayak Regd. No. : CS1(B) “The Power of Simplicity”
Design & Analysis of Algorithms Combinatory optimization SCHOOL OF COMPUTING Pasi Fränti
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Modern Heuristic Optimization Techniques and Potential Applications to Power System Control Mohamed A El-Sharkawi The CIA lab Department of Electrical.
Ant Colony Optimization. Summer 2010: Dr. M. Ameer Ali Ant Colony Optimization.
Object Oriented Programming Assignment Introduction Dr. Mike Spann
Introduction to Self-Organization
Biologically Inspired Computation Ant Colony Optimisation.
A Novel Multicast Routing Protocol for Mobile Ad Hoc Networks Zeyad M. Alfawaer, GuiWei Hua, and Noraziah Ahmed American Journal of Applied Sciences 4:
Modeling and Simulation. Warm-up Activity (1 of 3) You will be given a set of nine pennies. Let’s assume that one of the pennies is a counterfeit that.
Neural and Evolutionary Computing - Lecture 11 1 Nature inspired metaheuristics  Metaheuristics  Swarm Intelligence  Ant Colony Optimization  Particle.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
Emergent Behavior in Biological Swarms Stephen Motter.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Technical Seminar Presentation Presented By:- Prasanna Kumar Misra(EI ) Under the guidance of Ms. Suchilipi Nepak Presented By Prasanna.
AntNet: A nature inspired routing algorithm
5 Fundamentals of Ant Colony Search Algorithms Yong-Hua Song, Haiyan Lu, Kwang Y. Lee, and I. K. Yu.
Swarms MONT 104Q – Mathematical Journeys, November 2015.
M ulti m edia c omputing laboratory Biologically Inspired Cooperative Routing for Wireless Mobile Sensor Networks S. S. Iyengar, Hsiao-Chun Wu, N. Balakrishnan,
Biologically Inspired Computation Ant Colony Optimisation.
A field of study that encompasses computational techniques for performing tasks that require intelligence when performed by humans. Simulation of human.
Swarm Intelligence. An Overview Real world insect examples Theory of Swarm Intelligence From Insects to Realistic A.I. Algorithms Examples of AI applications.
Swarm Robotics Research Team A Robotic Application of the Ant Colony Optimization Algorithm The Ant Colony Optimization (ACO) algorithm is generally used.
Topic1:Swarm Intelligence 李长河,计算机学院
Ant Colony Optimisation. Emergent Problem Solving in Lasius Niger ants, For Lasius Niger ants, [Franks, 89] observed: –regulation of nest temperature.
A Sensitive Metaheuristic for Solving a Large Optimization Problem
School of Computing Clemson University Fall, 2012
Scientific Research Group in Egypt (SRGE)
DRILL Answer the following in your notebook: What is a swarm?
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
Genetic Algorithms and TSP
James Hobson Andrew Forth Josh Griffin
Computational Intelligence
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Overview of SWARM INTELLIGENCE and ANT COLONY OPTIMIZATION
Ant Colony Optimization
traveling salesman problem
Computational Intelligence
Presentation transcript:

Kavita Singh CS-A

What is Swarm Intelligence (SI)? “The emergent collective intelligence of groups of simple agents.”

 group foraging of social insects  cooperative transportation  division of labour  nest-building of social insects  collective sorting and clustering

The computer revolution changed human societies:  Communication  Transportation  Industrial production  Administration, writing and bookkeeping  Technological advances  Entertainment However, some problems cannot be tackled with traditional hardware and software!

Computing tasks have to be :-  Well-defined  Fairly predictable  Computable in reasonable time with serial computers.

Well-defined, but computational hard problems  NP hard problems (Travelling Salesman Problem)  Action-response planning (Chess playing)

 DNA based computing (chemical computation) is inspired by the human evolution.  Artificial neural network is a simplified model of human brain.  Bio-computing(simulation of biological mechanisms).

1. Self-Organization is based on:-  Positive feedback(amplification)  Negative feedback (for balancing)  Amplification of fluctuations(random walks, errors)  Multiple interactions 2. Stigmergy:- Indirect communication via interaction with environment.

 Species lay chemical substance pheromone while travelling from nest, to nest or possibly in both directions.  Pheromones evaporate.  Pheromones accumulate with multiple ants using same path.

The natural behavior of these ants and be programmed into an ant algorithm, which we can use to find the shortest path within graphs.

As ants move they leave behind a chemical substance called pheromone, which other ants can smell and identify that an ant has been there before.

 distributed system of interacting autonomous agents  goals: performance optimization and robustness  self-organized control and cooperation (decentralized)  division of labor and distributed task allocation  indirect interactions

It is a 3-step process. 1. Identification of analogies: in swarm biology and IT systems. 2. Understanding: computer modeling of realistic swarm biology. 3. Engineering: model simplification and tuning for IT applications.

 Complex NP complete problems.  Vehicle routing.  Network maintenance.  The traveling salesperson.  Computing the shortest route between two points.

 Learning algorithms developed with artificial intelligence systems such as neural networks but imperfections and inefficiencies in both the hardware and software have prevent reliable results.  Genetic algorithms also made an attempt at these problems, and had some success. The algorithms were considered too complex to re-implement.

1. Visit cities in order to make sales. 2. Save on travel costs. 3. Visit each city once (Hamiltonian circuit).

 If there are N cities, then the number of different paths among them is 1.2……(N-1).  Time to examine single path = N.  Total time to perform the search = (N-1)!  For 10 cities, time reqd. = 10! = 3,268,800.

 Use of agents for TSP problem.  They sense and dispense pheromone.  Memory to back step through the graph.  Each agent starts at a random starting city.  Once agent finishes a tour, it determines the size of the tour.  Then pheromone is added to the tour, the shorter the tour, the higher the pheromone level.

 No guarantee that the first tour the agents will converge the shortest path.  Agents explore other tours.  The “stray” agent finds a shorter path.  Adjusts the pheromone levels.  Plenty of computing time needed to converge on the optimal tour.  The ant algorithm approach will still solve faster than other algorithms.

 Vehicle routing is similar to the TSP problem.  Employee services the client by going to them.  Minimize cost.  Use the same optimal Hamiltonian circuit as in the TSP problem.

 The economy is an example of SI that most researchers forget to consider.  SI demonstrates complex behavior that arises from simple individual interactions.  No one can control the economy, as there are no groups that can consistently control the economy.

 The reaction of the population causes the the economy to slow down.  Simulating an economy using ant algorithms.  Makes it possible to control or predict the ebb and flow of this complex behavior.  Swarm intelligence, is still in its infancy.  A project such as simulating the economy is still far beyond the its capability.

 Scientists are realizing SI’s potential.  The use of ant algorithms within computing systems has helped to solidify swarm intelligence’s place in the computing world.  Already researchers are observing other social animals, such as bees and schools of fish in order to utilize it in future applications and algorithms.

      