School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Genetic Algorithm.

Slides:



Advertisements
Similar presentations
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Advertisements

Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
CS6800 Advanced Theory of Computation
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Lateral Potentials.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Rahul Kala, Department of Information Technology Indian Institute of Information Technology and Management Gwalior
Robot Motion Planning: Approaches and Research Issues
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Literature.
A Survey of Artificial Intelligence Applications in Water-based Autonomous Vehicles Daniel D. Smith CSC 7444 December 8, 2008.
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
Randomized Kinodynamics Motion Planning with Moving Obstacles David Hsu, Robert Kindel, Jean-Claude Latombe, Stephen Rock.
Evolving Driving Controllers using Genetic Programming Marc Ebner and Thorsten Tiede.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Presenter: Robin van Olst. Prof. Dr. Dirk Helbing Heads two divisions of the German Physical Society of the ETH Zurich Ph.D. Péter Molnár Associate Professor.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Genetic Algorithm for Variable Selection
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
Christoph F. Eick: Applying EC to TSP(n) Example: Applying EC to the TSP Problem  Given: n cities including the cost of getting from on city to the other.
Genetic Algorithms and Ant Colony Optimisation
Chapter 1 Basic Car Control.
Telerik Software Academy academy.telerik.com. 1. Heuristics 2. Greedy 3. Genetic algorithms 4. Randomization 5. Geometry 2.
Chapter 10. Rural Driving What is the difference between posted speeds and safe speeds? Posted are the maximum allowed under ideal conditions, while safe.
Real Time Motion Planning. Introduction  What is Real time Motion Planning?  What is the need for real time motion Planning?  Example scenarios in.
HOW TO MAKE A TIMETABLE USING GENETIC ALGORITHMS Introduction with an example.
Bill Payment Optimization Algorithms. Purpose To find and/or construct algorithms that will optimize the decision process of paying bills from an account.
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
GENETIC ALGORITHMS FOR THE UNSUPERVISED CLASSIFICATION OF SATELLITE IMAGES Ankush Khandelwal( ) Vaibhav Kedia( )
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
Behavior Control of Virtual Vehicle
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Conclusions.
Motion Planning for Multiple Autonomous Vehicles
Driving in City Traffic.  This chapter discusses the skills necessary to navigate driving situations in city traffic.
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Results.
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Multi-Level.
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Rapidly-exploring.
CIS 2011 rkala.99k.org 1 st September, 2011 Planning of Multiple Autonomous Vehicles using RRT Rahul Kala, Kevin Warwick Publication of paper: R. Kala,
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Logic Based.
SP1 – Meeting April 23 rd Schieberdingen Electronic Systems Page 1 of 13 Integrated Project Co-operative Systems for Road Safety “Smart Vehicles.
Regulatory Signs Must be obey Prohibited Examples:
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
IV 2012, Spain rkala.99k.org 5 th June, 2012 Planning Autonomous Vehicles in the Absence of Speed Lanes using Lateral Potentials Rahul Kala, Kevin Warwick.
Section III Day 4 Passing SOL’s
Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems International Conference on Mechatronics and Automation.
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Congestion.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
An Exact Algorithm for Difficult Detailed Routing Problems Kolja Sulimma Wolfgang Kunz J. W.-Goethe Universität Frankfurt.
Traffic Signs Part Two. What do these 2 signs tell you?
Post Graduate Seminar rkala.99k.org 14 November 2012 Motion Planning of Autonomous Vehicles Rahul Kala Presentation of the paper: Kala, K. Warwick (2013)
Motion and Force Chapter Three: Motion 3.1 Position and Velocity 3.2 Graphs of Motion 3.3 Acceleration.
Beard & McLain, “Small Unmanned Aircraft,” Princeton University Press, 2012, Chapter 12: Slide 1 Chapter 12 Path Planning.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
An application of the genetic programming technique to strategy development Presented By PREMKUMAR.B M.Tech(CSE) PONDICHERRY UNIVERSITY.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Multi-objective Motion Planning Presented by Khalafalla Elkhier Supervised by Dr. Yasser Fouad.
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Example: Applying EC to the TSP Problem
Motion Planning for Multiple Autonomous Vehicles
Motion Planning for Multiple Autonomous Vehicles
Motion Planning for Multiple Autonomous Vehicles
Spline-Based Multi-Level Planning for Autonomous Vehicles
Example: Applying EC to the TSP Problem
Sampling based Mission Planning for Multiple Robots
Presentation transcript:

School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Genetic Algorithm Presentation of the paper: R. Kala, K. Warwick (2014) Heuristic based evolution for the coordination of autonomous vehicles in the absence of speed lanes, Applied Soft Computing, 19: 387–402.

Motion Planning for Multiple Autonomous Vehicles Key Contributions The design of a GA which gives results within low computational times for traffic scenarios. Employment of the developed GA for constant path adaptation to overcome actuation uncertainties. The GA assesses the current scenario and takes the best measures for rapid trajectory generation. The use of traffic rules as heuristics to coordinate between vehicles. The use of heuristics for constant adaptation of the plan to favour overtaking, once initiated, but to cancel it whenever infeasible. The approach is tested for a number of diverse behaviours including obstacle avoidance, blockage, overtaking and vehicle following. rkala.99k.org

Motion Planning for Multiple Autonomous Vehicles Why GA? Optimality Probabilistic Completeness Iterative Concerns Computational Cost Cooperative Coordination rkala.99k.org

Motion Planning for Multiple Autonomous Vehicles Key Concepts Use Road Coordinate Axis system Optimize as the vehicle moves: – Tune plan – Overcome uncertainties – Compute feasibility of overtake Integration with route planning – Next road/segment becomes the goal as the vehicle is about to complete the previous rkala.99k.org

Motion Planning for Multiple Autonomous Vehicles Overall Algorithm rkala.99k.org Planning by Dijkstra’s Algorithm if coarser path is not built Map For each vehicle entered in scenario and not reached goal Finer Planning by Bezier Curves Genetic Algorithm Optimization Blockage? Yes Database of all Vehicle Trajectories Steering and Speed Control Operational Mode No Path Following Overtaking Vehicle Following

Motion Planning for Multiple Autonomous Vehicles GA Optimization rkala.99k.org

Motion Planning for Multiple Autonomous Vehicles Individual Representation rkala.99k.org Y’ Genotype Phenotype The genotype (optimized by GA) stores all control points of the spline curve Directional maintenance points Control points Goal Source Trajectory Mapping X’Y’

Motion Planning for Multiple Autonomous Vehicles Genetic Operators rkala.99k.org Sorts points in X’ axis (vehicle always drives forward) Deletes points behind the crossed position Deletes excess control points till trajectory gets better Repair Add random individuals Insert For variable length chromosome Crossover Randomly deviate points Mutation

Motion Planning for Multiple Autonomous Vehicles Fitness Function Contributors Length Length of trajectory in without safety distance Length in infeasible region rkala.99k.org

Motion Planning for Multiple Autonomous Vehicles Checking Granularity rkala.99k.org Trajectory Points of checking Finer at start Coarser at the end

Motion Planning for Multiple Autonomous Vehicles Coordination Priority based coordination Only vehicles ahead considered Cooperation added by traffic heuristics – Overtake – Vehicle Following Vehicle can request another vehicle to – Slow down – Turn right/left rkala.99k.org

Motion Planning for Multiple Autonomous Vehicles Determination of speed rkala.99k.org Path Optimization: GA Speed Optimization Increase by δ if feasible Decrease by δ if infeasible Genetic Algorithm Alternating optimization of path and speed

Motion Planning for Multiple Autonomous Vehicles Traffic Heuristics Two heuristics used: Overtaking and Vehicle Following Imparts cooperation to an else non-cooperative coordination rkala.99k.org

Motion Planning for Multiple Autonomous Vehicles Traffic Heuristics rkala.99k.org Assess Situation Overtaking Give initial turns to the other vehicles to best overtake Alter speeds of the other vehicles to best overtake Cancel overtake if it seems dangerous Vehicle Following Give initial turns to the other vehicles to best overtake Alter speeds of the other vehicles to best overtake Initiate overtake if it seems possible

Motion Planning for Multiple Autonomous Vehicles Overtaking rkala.99k.org R1R1 R2R2 Move Left R3R3 R1R1 R2R2 R3R3 R1R1 R2R2 R3R3 R1R1 R2R2 R3R3 R1R1 R2R2 R3R3 R1R1 R2R2 R3R3

Motion Planning for Multiple Autonomous Vehicles Overtaking rkala.99k.org R1R1 R2R2 R3R3 Too close, R 2 slows R1R1 R2R2 R3R3 Too close, R 3 slows R1R1 R2R2 R3R3 Not possible, abandon R1R1 R2R2 R3R3

Motion Planning for Multiple Autonomous Vehicles Vehicle Following rkala.99k.org R1R1 R2R2 R3R3 Move Left R1R1 R2R2 R3R3 Infeasible, slow down R1R1 R2R2 R3R3 R1R1 R2R2 R3R3 Feasible, speed up R1R1 R2R2 R3R3 R1R1 R2R2 R3R3

Motion Planning for Multiple Autonomous Vehicles Results rkala.99k.org Vehicle position at the time of blockage Blockage

Motion Planning for Multiple Autonomous Vehicles Results - 2 vehicle rkala.99k.org b

Motion Planning for Multiple Autonomous Vehicles Results - Overtaking rkala.99k.org

Motion Planning for Multiple Autonomous Vehicles Results – Vehicle Following rkala.99k.org

Motion Planning for Multiple Autonomous Vehicles Analysis rkala.99k.org

Motion Planning for Multiple Autonomous Vehicles Analysis rkala.99k.org

Motion Planning for Multiple Autonomous Vehicles Analysis rkala.99k.org

Motion Planning for Multiple Autonomous Vehicles Analysis rkala.99k.org

Motion Planning for Multiple Autonomous Vehiclesrkala.99k.org Thank You Acknowledgements: Commonwealth Scholarship Commission in the United Kingdom British Council