Design of Autonomous Navigation Controllers for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Gregory J. Barlow March 19, 2004.

Slides:



Advertisements
Similar presentations
CS6800 Advanced Theory of Computation
Advertisements

Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Evolutionary Computing A Practical Introduction Presented by Ben Paechter Napier University with thanks to the EvoNet Training Committee and its “Flying.
Parallelized Evolution System Onur Soysal, Erkin Bahçeci Erol Şahin Dept. of Computer Engineering Middle East Technical University.
1 Autonomous Controller Design for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Choong K. Oh and Gregory J. Barlow U.S. Naval Research.
1 Incremental Evolution of Autonomous Controllers for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Gregory J. Barlow, Choong K. Oh,
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Integrating POMDP and RL for a Two Layer Simulated Robot Architecture Presented by Alp Sardağ.
1 Autonomous Controller Design for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Gregory J. Barlow North Carolina State University.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
1 Robustness Analysis of Genetic Programming Controllers for Unmanned Aerial Vehicles Gregory J. Barlow 1,2 and Choong K. Oh 2 1 The Robotics Institute,
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Genetic Algorithm.
Genetic Algorithms and Ant Colony Optimisation
Multiple Autonomous Ground/Air Robot Coordination Exploration of AI techniques for implementing incremental learning. Development of a robot controller.
Evolving a Sigma-Pi Network as a Network Simulator by Justin Basilico.
Introduction to Genetic Algorithms and Evolutionary Computation
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
Tracking with Unreliable Node Sequences Ziguo Zhong, Ting Zhu, Dan Wang and Tian He Computer Science and Engineering, University of Minnesota Infocom 2009.
Study on Genetic Network Programming (GNP) with Learning and Evolution Hirasawa laboratory, Artificial Intelligence section Information architecture field.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Patch Based Mobile Sink Movement By Salman Saeed Khan Omar Oreifej.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Arindam K. Das CIA Lab University of Washington Seattle, WA MINIMUM POWER BROADCAST IN WIRELESS NETWORKS.
L ECTURE 3 Notes are modified from EvoNet Flying Circus slides. Found at: www2.cs.uh.edu/~ceick/ai/EC1.ppt.
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
1 Machine Learning: Lecture 12 Genetic Algorithms (Based on Chapter 9 of Mitchell, T., Machine Learning, 1997)
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
Artificial Intelligence Chapter 4. Machine Evolution.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Controlling the Behavior of Swarm Systems Zachary Kurtz CMSC 601, 5/4/
Evolving the goal priorities of autonomous agents Adam Campbell* Advisor: Dr. Annie S. Wu* Collaborator: Dr. Randall Shumaker** School of Electrical Engineering.
1 Genetic Algorithms and Ant Colony Optimisation.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
Speeding Up Warehouse Physical Design Using A Randomized Algorithm Minsoo Lee Joachim Hammer Dept. of Computer & Information Science & Engineering University.
2/29/20121 Optimizing LCLS2 taper profile with genetic algorithms: preliminary results X. Huang, J. Wu, T. Raubenhaimer, Y. Jiao, S. Spampinati, A. Mandlekar,
Local Search. Systematic versus local search u Systematic search  Breadth-first, depth-first, IDDFS, A*, IDA*, etc  Keep one or more paths in memory.
Overview Last two weeks we looked at evolutionary algorithms.
Robot Intelligence Technology Lab. 10. Complex Hardware Morphologies: Walking Machines Presented by In-Won Park
Robot Intelligence Technology Lab. Evolutionary Robotics Chapter 3. How to Evolve Robots Chi-Ho Lee.
제 9 주. 응용 -4: Robotics Artificial Life and Real Robots R.A. Brooks, Proc. European Conference on Artificial Life, pp. 3~10, 1992 학습목표 시뮬레이션 로봇과 실제 로봇을.
An application of the genetic programming technique to strategy development Presented By PREMKUMAR.B M.Tech(CSE) PONDICHERRY UNIVERSITY.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Genetic Algorithm (Knapsack Problem)
Selected Topics in CI I Genetic Programming Dr. Widodo Budiharto 2014.
Genetic Algorithms.
Advanced Computing and Networking Laboratory
Evolutionary Algorithms Jim Whitehead
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
An evolutionary approach to solving complex problems
Artificial Intelligence Chapter 4. Machine Evolution
Methods and Materials (cont.)
Artificial Intelligence Chapter 4. Machine Evolution
EE368 Soft Computing Genetic Algorithms.
Beyond Classical Search
Coevolutionary Automated Software Correction
Presentation transcript:

Design of Autonomous Navigation Controllers for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Gregory J. Barlow March 19, 2004

Overview Background Unmanned Aerial Vehicle Control Evolution and Fitness Evaluation Experiments and Results Conclusions and Future Work

Evolutionary Computation Biologically inspired computational method of problem solving May be applied to a variety of structures (binary strings, real numbers, computer programs, hardware, neural networks, etc) because the algorithm operates on an encoding of the parameters, not the parameters themselves

Genetic Programming A population of random programs is created Each individual in the population undergoes a fitness test and is assigned a fitness value Genetic operators (crossover, mutation, etc) are performed on the population to form the next generation The process is repeated until a suitable individual is evolved

Evolutionary Process Population Selection Evaluation Parent(s) Genetic Operator Child(ren)

Representation Each individual is a program, which we represent as a tree Function set: for non-leaf nodes Terminal set: for leaf nodes

Crossover

Mutation

Unmanned Aerial Vehicle Control Create controllers that will fly a UAV toward a target radar and then circle the radar for jamming Make the UAV controller completely autonomous Be able to handle multiple radar types Be able to transfer evolve controllers to real UAVs

Simulation To test the fitness of a controller, the UAV is simulated for 4 hours of flight time in a 100 by 100 square nmi area The initial starting position of the UAV is randomly set along the bottom of the simulation space The position of the radar is also randomly set for each simulation UAVs can sense the AoA and amplitude of incoming radar signals

Simulation

Transference These controllers should be transferable to real UAVS. To encourage this: Only the sidelobes of the radar were modeled Noise is added to the modeled radar emissions The angle of arrival value from the sensor is only accurate within ±10°

Functions and Terminals Hard Left, Hard Right, Shallow Left, Shallow Right, Wings Level, No Change IfThen, IfThenElse, And, Or, Not,, >=, > 0, < 0, =, +, -, *, / Amplitude > 0, Amplitude Slope 0, AoA

Fitness Functions Normalized distance Circling distance Level time Turn cost

Normalized Distance

Circling Distance

Level Time

Turn Cost

Performance of Evolution Multi-objective genetic programming produces a Pareto-optimal front of solutions, not a single best solution. To gauge the performance of evolution, fitness values for each fitness measure were selected for a minimally successful controller.

Baseline Values Normalized Distance0.15 Circling Distance4 Level Time1000 Turn Cost0.05

Direct Evolution Experiments Continuously emitting, stationary radar Intermittently emitting, stationary radar with a regular period Intermittently emitting, stationary radar with an irregular period Continuously emitting, mobile radar Intermittently emitting, mobile radar with a regular period

Direct Evolution Radar Type RunsControllers TotalSucc.RateTotalAvg.Max. Continuous, Stationary %3, Intermittent, stationary (regular period) %1, Intermittent, stationary (irregular period) %2, Continuous, mobile %2, Intermittent, mobile (regular period) %

Continuously emitting, stationary radar

Circling Behavior

Intermittently emitting, stationary (regular)

Intermittently emitting, stationary (irregular)

Continuously emitting, mobile radar

Intermittently emitting, mobile radar

Incremental Evolution Continuously emitting, stationary radar (seed populations) Intermittently emitting, stationary radar Continuously emitting, mobile radar Intermittently emitting, stationary radar (multiple increments) Intermittently emitting, mobile radar (multiple increments)

Incremental Evolution Radar Type RunsControllers TotalSucc.RateTotalAvg.Max. Continuous, Stationary %2, Intermittent, stationary %2, Continuous, mobile %2, Intermittent, stationary (multiple increments) %2, Intermittent, mobile (multiple increments) %1,

Intermittent, mobile (multiple increments)

Transference to a wheeled mobile robot Controllers were designed for UAVs A UAV was not yet available for flight tests to evaluate transference Evolved controllers were tested on a wheeled mobile robot, the EvBot II A speaker was used in place of the radar, and an acoustic array in place of the radar sensor

EvBot II PC/104 processor Communications with a wireless network card Runs Linux On-board acoustic array

Transference considerations In simulation, the sensor accuracy was ±10°, but the acoustic array accuracy was approximately ±45° Wheeled robot not controlled by roll angle, must be turned and then moved The size of the maze environment was not equivalent to the simulation environment, instead the scale size of the maze environment was 1.13 by 0.9 nautical miles

Sensor accuracy Sensor accuracy of ± 10°Sensor accuracy of ± 45°

Controller 1

Controller 2

Conclusions Autonomous navigation controllers were evolved to fly to a radar and then circle around it while maintaining stable and efficient flight dynamics Multi-objective genetic programming was used to evolve controllers Controllers were evolved for five radar types using both direct evolution and incremental evolution

Conclusions Incremental evolution dramatically increased the success rates for the more difficult radar types Methods were used to aid in transference of controllers to real UAVs Controllers were tested on a wheeled mobile robot with good success Evolved controllers are capable of transference to real physical vehicles

Future Work Controllers will be tested on physical UAVs for several radar types Distributed multi-agent controllers will be evolved to handle cases of multiple UAVs against multiple radars Incremental evolution will be used to aid in the evolution of fit multi-agent controllers for complex radar types