Emily Shaeffer and Shena Cao

Slides:



Advertisements
Similar presentations
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.
Advertisements

Artificial Bee Colony Algorithm
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.
Swarm Intelligence (sarat chand) (naresh Kumar) (veeranjaneyulu) (kalyan raghu)‏
Ant colonies for the traveling salesman problem Eliran Natan Seminar in Bioinformatics (236818) – Spring 2013 Computer Science Department Technion - Israel.
Artificial Bee Colony Algorithm
Bio-Inspired Optimization. Our Journey – For the remainder of the course A brief review of classical optimization methods The basics of several stochastic.
Ant Colony Optimization. Brief introduction to ACO Ant colony optimization = ACO. Ants are capable of remarkably efficient discovery of short paths during.
Ant Colony Optimization An adaptative nature inspired algorithm explained, concretely implemented, and applied to routing protocols in wired and wireless.
Biologically Inspired Computation Lecture 10: Ant Colony Optimisation.
Visual Navigation in Modified Environments From Biology to SLAM Sotirios Ch. Diamantas and Richard Crowder.
Path Planning with the humanoid robot iCub Semester Project 2008 Pantelis Zotos Supervisor: Sarah Degallier Biologically Inspired Robotics Group (BIRG)
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.
Presented by: Martyna Kowalczyk CSCI 658
The Context of Forest Management & Economics, Modeling Fundamentals Lecture 1 (03/30/2015)
Ant Colony Optimization (ACO): Applications to Scheduling
FORS 8450 Advanced Forest Planning Lecture 19 Ant Colony Optimization.
Ant colony optimization algorithms Mykulska Eugenia
L/O/G/O Ant Colony Optimization M1 : Cecile Chu.
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.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
Swarm intelligence Self-organization in nature and how we can learn from it.
CSM6120 Introduction to Intelligent Systems Other evolutionary algorithms.
“Microbotics”. Introduction INSPIRED by the biology of a bee and the insect’s hive behavior... we aim to push advances in miniature robotics and the design.
Swarm Computing Applications in Software Engineering By Chaitanya.
-Abhilash Nayak Regd. No. : CS1(B) “The Power of Simplicity”
Collaborative Mobile Robots for High-Risk Urban Missions Report on Timeline, Activities, and Milestones P. I.s: Leonidas J. Guibas and Jean-Claude Latombe.
(Particle Swarm Optimisation)
Kavita Singh CS-A What is Swarm Intelligence (SI)? “The emergent collective intelligence of groups of simple agents.”
2010 IEEE International Conference on Systems, Man, and Cybernetics (SMC2010) A Hybrid Particle Swarm Optimization Considering Accuracy and Diversity.
Ant Colony Optimization. Summer 2010: Dr. M. Ameer Ali Ant Colony Optimization.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
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.
By Balaji Prabhakar, Katherine N. Dektar, Deborah M. Gordon Presented by Anusha Reddy Guntakandla Net Id: agunta2 April 9, 2015.
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
Optimal Self-placement of Heterogeneous Mobile Sensors in Sensor Networks Lidan Miao AICIP Research Oct. 19, 2004.
Emergent Behavior in Biological Swarms Stephen Motter.
Technical Seminar Presentation Presented By:- Prasanna Kumar Misra(EI ) Under the guidance of Ms. Suchilipi Nepak Presented By Prasanna.
Particle Swarm Optimization † Spencer Vogel † This presentation contains cheesy graphics and animations and they will be awesome.
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.
Ant Colony Optimization Andriy Baranov
The Ant System Optimization by a colony of cooperating agents.
Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems International Conference on Mechatronics and Automation.
By Eric Han, Chung Min Kim, and Kathryn Tarver Investigations of Ant Colony Optimization.
DRILL Answer the following question’s about yesterday’s activity in your notebook: 1.Was the activity an example of ACO or PSO? 2.What was the positive.
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 李长河,计算机学院
4/22/20031/28. 4/22/20031/28 Presentation Outline  Multiple Agents – An Introduction  How to build an ant robot  Self-Organization of Multiple Agents.
Scientific Research Group in Egypt (SRGE)
Scientific Research Group in Egypt (SRGE)
Scientific Research Group in Egypt (SRGE)
Scientific Research Group in Egypt (SRGE)
Marco Mamei Franco Zambonelli Letizia Leonardi ESAW '02
BIOLOGICALLY MOTIVATED SYSTEMS
DRILL Answer the following in your notebook: What is a swarm?
Advanced Artificial Intelligence Evolutionary Search Algorithm
Computational Intelligence
Overview of SWARM INTELLIGENCE and ANT COLONY OPTIMIZATION
Ant Colony Optimization
Path Planning using Ant Colony Optimisation
traveling salesman problem
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
Artificial Bee Colony Algorithm
Computational Intelligence
Speaker: Ao Weng Chon Advisor: Kwang-Cheng Chen
Presentation transcript:

Emily Shaeffer and Shena Cao Comparing Effectiveness of Bioinspired Approaches to Search and Rescue Scenarios Hi I’m Shena and this is Emily and we are doing our final project on the use of Bioinspired swarming behavior to navigate through search and rescue scenarios Emily Shaeffer and Shena Cao Shaeffer and Cao- ESE 313 2/28/2011

C3.4 The Idea Hypothesis: A functional search and rescue algorithm can be found combining ant, bee, and cockroach swarming behaviors Ant Colony Optimization Algorithm Possible use: Search area, find optimal route back to base camp Bees Algorithm Possible use: Locate areas demanding imminent attention Cockroach Swarming  Possible use: Dispersion and continued searching We will first give you an idea of what we are planning to do, talk about the need for a good search and rescue algorithm, and talk about a few specific algorithms we plan to work off of. To start, we hypothesize that a well functioning search and rescue navigation algorithm can be found combining components of ant colony, bee colony, and cockroach swarming algorithms. Some benefits of each of these algorithms in a search and rescue setting are finding an optimal route back to a base camp with the ant colony optimization algorithm, locate areas demanding the most or most imminent attention using a bee swarming algorithm with their dancing, and a grouping dispersion system based on the cockroach swarming behavior which could be useful if a robot gets trapped or breaks down. Now Emily will tell you a bit more on the motivations for our hypothesis as well as more about the actual algorithms. Shaeffer and Cao- ESE 313 2/28/2011

C3.1 Desired Behavior or Capability: Swarming for Improved Search and Rescue What is Swarming? Large groups to accomplish large tasks Algorithms for ants, bees, cockroaches Use of Swarming for Search and Rescue “Foraging Task”- Can be performed by robots independently, multiple improve performance Sept 11- robots found nothing, swarming robots could have covered more ground Focus on searching and mapping, not rubble removal or extraction Examples of swarming: ants lifting or deconstructing large objects (youtube video of ants eating a gecko), bees maximizing amount of honey they bring back to the hive, cockroaches following each other to foodDefinition of foraging: splitting up to cover large areas to find food (or another desired target)September 11: had 48 hours in which they needed to find victims but robots were unable to locate anyone withing the first 48 hours, swarm behavior could help in a divide and conquer sense, helping robots to communicate which areas had already been traversed (like cockroaches ruthless behavior) References: Cao, Y. U., Fukunaga, A. S., & Kahng, A. B. (1997). Cooperative mobile robotics: Antecedents and directions. Autonomous Robots, 4(1), 7-27. Trivedi, Bijal P. (2001). Search-and-Rescue Robots Tested at New York Disaster Site. http://news.nationalgeographic.com/news/2001/09/0914_TVdisasterrobot.html Shaeffer and Cao- ESE 313 2/28/2011

C3.2 Present Unavailability: Where Robots are Lacking Current Technology Separate algorithms modeling the behavior of each type of insect Using just the cooperative collaboration model of ants, improved navigating Ability to change between tasks increases efficiency Missing Technology A combination of all three techniques for most efficient possible navigation in different scenarios There are many swarming algorithms available and they have been available for decades. Some of the most widely used ones is the ant colony optimization, but also bee and to a lesser extent the cockroach swarming. There are various other algorithms for the behavior of other insects and biological organisms. Shaeffer and Cao- ESE 313 2/28/2011

C3.3 Desirability of Bioinspiration: 3 Different Insect Inspired Algorithms Ant colony optimization algorithm Ants go any direction, pheromone trail strength indicates shortest path Artificial bee colony Bees scout new sources, return, dance based on amount of nectar at site Cockroach Swarming Chase-swarming behavior, dispersing behavior, ruthless behavior Ants: N is nest, F is food1) Randomly disperse from base, find food2) Randomly retract back to base, leave pheromone trail3) Step proportionate evaporation of pheromone trail4) Probabilistic following of pheromone trail5) Positive feedback leads to optimizationBees: 1) Start with base2) Each bee finds neighboring source, respond with “wiggle dance” based on nectar amount3) Onlookers evaluate response, change sources accordingly4) Best sources found5) Positive Feedback EffectCockroaches: chase (used like buddy system, will follow each other to food), disperse (splitting up to traverse more area, better for searching large grids), ruthless (if not enough resources one will leave, good for taking advantage of dispersion when resources are low and chasing when high, like wisdom to know which is better)Sent at 1:34 PM on Tuesday  Shaeffer and Cao- ESE 313 2/28/2011

C3.4 The Idea Hypothesis: A functional search and rescue algorithm can be found combining ant, bee, and cockroach swarming behaviors Ant Colony Optimization Algorithm Possible use: Search area, find optimal route back to base camp Bees Algorithm Possible use: Locate areas demanding imminent attention Cockroach Swarming  Possible use: Dispersion and continued searching Just a recap on what I said in the beginning, our idea is to combine the three algorithms, to make a better functional algorithm specific for search and rescue scenarios. We propose to use the shortest path optimization portion of the ant colony optimization algorithm based oh pheromone trails and pheromone evaporation to locate the shortest path between a danger site the robot locates and a base camp where rubble clearing robots, paramedics, people monitoring are located. We propose to use a bee colony optimization to judge the allocation of resources. If there are a limited amount of rubble clearing resources or paramedics, we want these to be directed to the areas where they are most needed, not say a small pile of stones that just happened to be there. Lastly, we wanted to use the cockroach swarming behavior to get good coverage while having the robots follow each other to a certain extent so that they maintain visual contact with other robots incase complications arise. Shaeffer and Cao- ESE 313 2/28/2011

C3.6 Necessary Means Create Basic Obstacle Grid Maze Problem Areas-Various Degrees Base Camp  Test refutability parameters So how are we going to do this? The key to implementing and evaluating our resulting algorithm is to create a basic obstacle grid. This will have a maze to simulate urban environments such as builidings, streets, etc which robots have to navigate through, have areas with varing characteristics and various degrees of danger and to be able to locate and keep contact with a base camp. To evaluate, we will test our refutability parameters Shaeffer and Cao- ESE 313 2/28/2011

C3.5 Refutability Speed of Response (minimize detection time) Order of Response (high danger zones first) Comparative behaviors with three original algorithms Consider Alternative Algorithms So the areas that we are testing would be the speed of response, key is first 48hrs after a disaster. We also need to worry about order of response so that we can target the most important areas first and try to rescue the most amount of people, and finally, to evalute the effectiveness of our algorithm, we will compare it to the individual algorithms, the ant, bee and cockroach as well as additional swarming algorithms such as fish, bacteria, particle etc and see how it fares in comparison with the goal being to out perform the others. Thank you, we would now like to open it up to questions. Shaeffer and Cao- ESE 313 2/28/2011

Ant Colony Optimization Details 1) Randomly disperse from base, find food 2) Randomly retract back to base, leave pheromone trail 3) Step proportionate evaporation of 4) Probabilistic following of pheromone trail 5) Positive feedback leads to optimization 3 Shaeffer and Cao- ESE 313 2/28/2011

Artificial Bee Colony Details 1) Start with base 2) Each bee finds neighboring source, respond     with “wiggle dance” based on nectar amount 3) Onlookers evaluate response, change sources accordingly 4) Best sources found 5) Positive Feedback Effect 3 Shaeffer and Cao- ESE 313 2/28/2011

Cockroach Swarming Details 1) Chase-Swarming behavior     Each individual X(i) will chase individual P(i) within its visual scope      or global individual Pg 2) Dispersing behavior     At intervals of certain time, each individual may disperse randomly             X ′(i) = X (i) + rand(1, D),i = 1,2,..., N         3) Ruthless behavior     Current best replaces an individual selected at random             X (k)=Pg          3 Reference: Chen ZH, Tang HY (2010) 2nd International Conference on Computer Engineering and Technology. 6, 652-5 Shaeffer and Cao- ESE 313 2/28/2011

Obstacle Grid Details Incorporate: 1) Degree of rubble (indicates scale of damage-     assume proportionate to degree of emergency) 2) Randomly dispersed rubble 3) Maze setting (roads, buildings, etc.-urban setting) 4) Disaster clearance rate 5) Simple 2D structure      3 Shaeffer and Cao- ESE 313 2/28/2011