# A Genetic Algorithm for Mid-Air Target Interception

Save this PDF as:

Size: px
Start display at page:

## Transcription

2 olume 14 No.1, January 011 constructing the fitness function the aim is to minimize the above two parameters. The adjustment of value for the navigation constant (C N can provide us with minimized flight time, so it must be determined. The missile time-to-launch (M-launch will be computed according to the position. M-launch will be computed in order to minimize the flight time. The research work is divided into three sections, where the first and second section contains dynamics of missile and, while third section provides details of the proposed genetic algorithm and the data to be used as input..1 Target Dynamics Modeling: Figure 1 describes the overall scenario; it shows a guarding or defending zone within a three dimensional coordinates system. It further displays the boundary of defending zone, having missile launch point situated at its origin while a can enter from any point. The maximum and minimum altitudes are defined by the z-axis, and the negative z-axis is ignored. In agreement with the proportional navigation law, a line of sight angle will be maintained as soon as enters the defending zone. This defending zone is calculated and fixed depending on the missile range. The intruding object, also termed as the will have it dynamics recorded as it enters the defending zone mentioned above. Where t is the time, θ 1 is the angle of velocity projected on to x-axis, while θ is the angle of velocity with respect to y-axis. The change in velocity and the change in angles θ 1 and θ can be computed using equations.4,.5 and.6 respectively. (t 1 stδ (.4 θ 1 1 θ1(t 1 stδθ (.5 θ θ(t 1 stδθ (.6 Where st indicates the sampling time, which is the time consumed to track the position of. The Δ shows the change in parameters values. Figure- illustrates the dynamics of with respect to the coordinates system as it enters point of defending zone. Figure-: Target Dynamics The motion path is computed through equations (.1 to (.6, this path describes the entrance and exit points of the in the defending zone. Equation (.7 provides the range of within the defending zone at any time t. Figure-1: Defending Zone The dynamics are extracted according to the motion laws [11], where the initial tracking data that is required for computation are the initial position (x, y, z, its velocity (, and angles according to x- and y-axes. The motion path points are calculated using the equations below. X X (t 1 cosθ 1cosθ (.1 Y Y (t 1 sinθ 1cosθ (. Z Z (t 1 sinθ (.3 R (X (Y (Z (.7. Missile Dynamics Modeling: As shown in figure-1, the missile launch point is placed at the origin of defending zone. The dynamics of missile should include the missile motion, acceleration, and its thrust power. In accordance with the proportional navigation law, the line of sight angles should be used to find a interception point. Therefore the extraction of missile acceleration commands to intercept the required [1], equations (.8 to (.11 will be used to compute the velocity of missile ( missile and angles of acceleration. 39

3 olume 14 No.1, January 011 (t 1 stac missile missile missile (.8 Where Ac missile is actual acceleration of missile and st is sampling time for measuring the acceleration. (Thrust Drag A 1missile (.9 Mass The first acceleration command A 1 missile is dependent on the values of thrust, drag and mass values of. This acceleration command works parallel to the velocity of missile ( missile. A 1 missile CNΦ (.10 A 3 missile CNΦ (.11 A missile and A 3 missile are the second and third acceleration commands which work perpendicular to the missile velocity ( missile. Here C N is the proportional navigation constant, which value needs to be examined for accurate interception, while Φ 1 and Φ are the projection angles of line of sight with respect to x- and y-axis. It should be noted here that since the Proportional Navigation law dictates that two vehicles are on a collision course when their direct Line-of-Sight (LOS does not change direction. Hence the missile velocity vector should rotate at a rate proportional to the rotation rate of the LOS-rate, and in the same direction. This will give rise to acceleration components perpendicular to the missile velocity. Figure-3 shows the details of angles, velocity and the acceleration commands of missile with respect to the origin point. The missile line of sight angle should be maintained with respect to the motion of, according to the proportional navigation law and the navigation constant can have constant value or it may vary according to situation. In our scenario, its value will vary. The value will be chosen such that it is best fitted in given scenario, providing minimized miss distance and flight time after optimization. Figure-3: Missile Dynamics.3 Modified Genetic Algorithm: In order to find an optimized solution to the problem, within a very short period of time the use of Genetic Algorithms (GAs is one of the best approaches that can provide a near optimal solution. For the GA to compute an optimized solution to a certain level there is a need to modify the algorithm to get better results. Due to the non-linearity of interception problem, a simple genetic algorithm can optimize values, but the interception error rate is too high. Therefore a heuristic crossover approach is embedded in our proposed solution having the following steps. i. Generate the initial population of individuals using the uniform function. During this M individuals will be created. ii. Calculation of fitness of individuals will be done through a fitness function. iii. To select individuals for reproduction or mating half of the individuals will be selected using roulette selection. iv. The reproduction will be done by exchanging the offspring of two individuals with a fraction rate of 0.8. While the crossover will be performed using heuristic function with a ratio of 1.. v. The mutation operation will be applied for more accuracy, and uniform mutation will be applied over new individuals with a ratio of vi. Repeat the steps from (ii to (v to obtain a best value. The above steps are repeated for a number of generations which will provide us optimal value of navigation constant (C N and the missile time-to-launch according to the computations. The fitness function for minimizing the miss distance and flight time is given in equation (.1. 1 missile (W Dmiss K min (W F (.1 Where W 1 and W are the weights to balance the values obtained through optimization. The minimum value of K is considered as end of iteration according to the step (vi of the proposed algorithm. In optimization of miss distance and flight time, the dynamics are the population for genetic algorithm. Where the whole path points obtained using equations (.1 to (.6 are the population. A chromosome of population is the set of nine values as genes which includes X, Y, Z,, θ 1, θ, Δ, Δθ 1, Δθ. The real format values of these variables are used for optimization. Total M number of population take part as input to modified genetic algorithm. The computation of fitness function is calculated by giving different values of navigation constant (C N which varies from 1 to 50. The missile dynamics is computed by deploying equations (.8 to (.11. The reproduction of new off springs from M/ selected chromosomes is done using heuristic crossover. Two fitted chromosomes are taken and mated according to heuristic 40

4 olume 14 No.1, January 011 crossover to produce two new off springs. The heuristic crossover is illustrated as follows. Offspring-1 = BestParent + r*(bestparent WorstParent (.13 Offspring- = BestParent (.14 One of the offspring is created using the best parent (chromosome while the second offspring is based over the formula in equation (.14. The value of r varies from 0 to 1. After a number of defined iteration, if some solution is not found for Offspring-1 then worst parent is taken as Offspring-1. After reproduction of new off springs, we have again M populations that have more fitted chromosomes as compared to the initial population. This heuristic crossover is termed a greedy approach in this research, and if it finds a best value early then it moves there, which on the whole can save a lot of critical computation time. The time takes to reach boundary of defending zone, the maximum time to stay in range, minimum and maximum altitude is calculated using the following equations. purposes, the should be within the defending zone range and altitudes. Third, entry point of in defending zone that point is to be taken as initial point to perform computations and optimization. The optimization with respect to the proportional navigation laws will follow the above scenario as illustrated in figure-4 [1]. The line of sight will be maintained to calculate an interception point, and for that interception point, a GA is optimizing the values of miss distance and flight time of missile. The miss distance and flight time is calculated according to the scenario derived from examining points of motion, and where a less miss distance and flight time is involved, genetic algorithm will take it as optimal point, and last point is replaced by this one. This scenario is depicted in figure-5. The results of optimization is providing values for the navigation constant that is best fitted according to the scenario and also the missile time-to-launch depending on selected interception point. R max Y (Z 1 sin(θ sin(θ cos(θ / X cos(θ cos(θ 1 (.15 (Zmax Z Alt max (.16 sin(θ (Zmin Z Altmin (.17 sin(θ Where Alt max and Alt min are maximum altitude and minimum altitude respectively, while the Z max and Z min are the values of maximum and minimum of the z-axis. Figure-5: Miss Distance Scenario 3. RESULTS A scenario for the missile interception is constructed with values that are gained from real environment. It was assumed that is entering in defending zone with initial position Pos (X= 3780, Y= 13860, Z= 4314 with respect to the origin. The origin of the defending zone is the point from where a missile is to be launched. The velocity is 0 miles/second, while the angle θ 1 is 184 o and the θ is 7 o. The scan time for radar is 0.05 second, while the maximum flight time for missile is given as MF max= 50 seconds. The thrust, drag and mass are taken 0 m/s, and kg respectively. The change in the velocity and the angles of the radar was then updated according to the scan time. The following table (Table 1 gives the initial change velocity and angles. St (sampling time Table 1: Change in Motion Δ Δθ 1 Δθ m/sec 4 o o Figure-4: Pursuit path with line of sight [13] There are some conditions that have to be met by this overall scenario. First, the missile owns flight time should be greater than the computed time flight time. Second, for computation The computation results show, will remains within defending zone for 17.1 seconds according to equation.15, while the calculated value of maximum altitude using equation.16 is , where the negative sign indicates that is 41

5 olume 14 No.1, January 011 unable to gain maximum altitude. The equation.17 provides a time for reaching the minimum altitude which is 7.1 seconds The next step of the proposed approach is to determine the position of the using the change in velocity and angles. The change in position along with angles provides the path of the in the defending zone. The missile trajectory and point of interception depends on the scan time along with the path of. Furthermore, computations are made using the dynamics equations.1 to.6 to gain the point of interception with the missile dimensions along with selection of value for navigation constant. The scan time is taken as 0.05 second, while the maximum missile flight time is 50 seconds. A population of total 540 chromosomes were generated to find an optimized solution. The optimization results obtained through simulation contains: the best miss distance of 1.56m corresponding to flight time of 49 seconds; the navigation constant value which ranges from 1 to 50, obtained through GA optimization is 49 and the time to launch for missile is 77 seconds after the enters into defending zone. These results are as shown in table. C N (Navigation constant Table : Optimization results T launch (Time launch to Dm (Miss distance F missile (Missile flight time sec 1.56 m 49 sec 4. CONCLUSIONS This paper has presented a modified genetic algorithm that provides near optimal results for the mid-air interception in the three-dimensional coordinate system. The results shown miss distance error of 1.56m, which needs some improvements, but that does not mean, this approach provides same error rate for all situations. The miss distance error can be minimized for maneuvering s but it cannot be zero. The future work will include the neural network based approach for mid-air interception, which will increase the performance of overall system through faster computations. [3] P. Zarchan (1999, "Ballistic Missile Defense Guidance and Control Issues," SCIENCE AND GLOBAL SECURITY, vol. 8, pp [4] D. MacKenzie,(1988 The Soviet Union and Strategic Missile Guidance, International Security, vol. 13, pp [5] Dyer, W. R. (004. Modern Missile Analysis Guidance, Control, Seekers, and Technology, U.S. Department of Defense, Slides [6] Hughes, E. J. (00. Evolutionary guidance for multiple missiles, 15th Triennial World Congress, Barcelona, Spain, IFAC, pp. (no-paging. [7] Song, E. J. (00. Three-dimensional midcourse guidance using neural networks for interception of ballistic s, IEEE Transactions on Aerospace and Election Systems, ol. 38, No., pp [8] Gomez, F. J. and R. Miikkulainen. (003. Active guidance for a finless rocket using neuroevolution, Genetic Evolutionary Computation Conference 003, GECCO Neural Network Research Group, ( 7 pp. (no paging. [9] Yang, Z. H., J. C. Frang and Z. Q. Qi. (005. Flight midcourse guidance control based on genetic algorithm, GECCO 05, Washington, DC, USA, ACM, pp [10] Madkour, A. A. M., M. A. Hossain and K. P. Dahal. (005. Evolutionary missile guidance algorithms for interception of maneuvering s in 3D environment, IEEE, 4 pp. (no paging. [11] Madkour, A. A. M., M. A. Hossain and K. P. Dahal. (006. Evolutionary optimization approach for missile guidance algorithms to achieve accurate interception of maneuvering s in 3D, IEEE Control, Automation and Signals Processing Professional Network, pp [1] L. Lin, T. Kirubarajan, and Y. Bar-Shalom, (005. Pursuer identification and time-to-go estimation using passive measurements from an evader, IEEE Transactions on, Aerospace and Electronic Systems vol. 41, pp [13] Szypula, (005. Guidance and control principles. US Navall Weapons Systems, Guidance_and_Control_Principles.PPT, Slides REFERENCES [1] P.R Mahapatra and U. S. Shuk (1989, Indian Institute of Science, Accurate Solution of Proportion Navigation for Maneuvering Targets,IEEE Transactions On Aerospace And Electronic Systems ol. Aes-5. [] K. Becker (1990, "Closed-form solution of pure proportional navigation," IEEE Transactions on Aerospace and Electronic Systems, vol. 6, pp

### Keywords: UAV, Formation flight, Virtual Pursuit Point

DESIGN THE GUIDANCE LAW FOR FORMATION FLIGHT OF MULTIPLE UAVS Heemin Shin*, Hyungi Kim*, Jaehyun Lee*, David Hyunchul Shim* *Korea Advanced Institute of Science and Technology (KAIST) Keywords: UAV, Formation

### Introduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell

Introduction to Genetic Algorithms Based on Chapter 10 of Marsland Chapter 9 of Mitchell Genetic Algorithms - History Pioneered by John Holland in the 1970s Became popular in the late 1980s Based on ideas

### Zero Launch Angle. since θ=0, then v oy =0 and v ox = v o. The time required to reach the water. independent of v o!!

Zero Launch Angle y h since θ=0, then v oy =0 and v ox = v o and based on our coordinate system we have x o =0, y o =h x The time required to reach the water independent of v o!! 1 2 Combining Eliminating

### A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2

Chapter 5 A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Graph Matching has attracted the exploration of applying new computing paradigms because of the large number of applications

### AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING

International Journal of Latest Research in Science and Technology Volume 3, Issue 3: Page No. 201-205, May-June 2014 http://www.mnkjournals.com/ijlrst.htm ISSN (Online):2278-5299 AN EVOLUTIONARY APPROACH

### Projectile Trajectory Scenarios

Projectile Trajectory Scenarios Student Worksheet Name Class Note: Sections of this document are numbered to correspond to the pages in the TI-Nspire.tns document ProjectileTrajectory.tns. 1.1 Trajectories

### Midterm Examination CS 540-2: Introduction to Artificial Intelligence

Midterm Examination CS 54-2: Introduction to Artificial Intelligence March 9, 217 LAST NAME: FIRST NAME: Problem Score Max Score 1 15 2 17 3 12 4 6 5 12 6 14 7 15 8 9 Total 1 1 of 1 Question 1. [15] State

### Evolutionary Design of a Collective Sensory System

From: AAAI Technical Report SS-03-02. Compilation copyright 2003, AAAI (www.aaai.org). All rights reserved. Evolutionary Design of a Collective Sensory System Yizhen Zhang 1,2, Alcherio Martinoli 1, and

### GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM

Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain

### Time Complexity Analysis of the Genetic Algorithm Clustering Method

Time Complexity Analysis of the Genetic Algorithm Clustering Method Z. M. NOPIAH, M. I. KHAIRIR, S. ABDULLAH, M. N. BAHARIN, and A. ARIFIN Department of Mechanical and Materials Engineering Universiti

### PATH PLANNING OF ROBOT IN STATIC ENVIRONMENT USING GENETIC ALGORITHM (GA) TECHNIQUE

PATH PLANNING OF ROBOT IN STATIC ENVIRONMENT USING GENETIC ALGORITHM (GA) TECHNIQUE Waghoo Parvez 1, Sonal Dhar 2 1 Department of Mechanical Engg, Mumbai University, MHSSCOE, Mumbai, India 2 Department

### Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization

Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization Lana Dalawr Jalal Abstract This paper addresses the problem of offline path planning for

### Neural Network Weight Selection Using Genetic Algorithms

Neural Network Weight Selection Using Genetic Algorithms David Montana presented by: Carl Fink, Hongyi Chen, Jack Cheng, Xinglong Li, Bruce Lin, Chongjie Zhang April 12, 2005 1 Neural Networks Neural networks

### VIBRATION ISOLATION USING A MULTI-AXIS ROBOTIC PLATFORM G.

VIBRATION ISOLATION USING A MULTI-AXIS ROBOTIC PLATFORM G. Satheesh Kumar, Y. G. Srinivasa and T. Nagarajan Precision Engineering and Instrumentation Laboratory Department of Mechanical Engineering Indian

### A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery

A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery Monika Sharma 1, Deepak Sharma 2 1 Research Scholar Department of Computer Science and Engineering, NNSS SGI Samalkha,

### Genetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem

etic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem R. O. Oladele Department of Computer Science University of Ilorin P.M.B. 1515, Ilorin, NIGERIA

### Scheduling in Multiprocessor System Using Genetic Algorithms

Scheduling in Multiprocessor System Using Genetic Algorithms Keshav Dahal 1, Alamgir Hossain 1, Benzy Varghese 1, Ajith Abraham 2, Fatos Xhafa 3, Atanasi Daradoumis 4 1 University of Bradford, UK, {k.p.dahal;

### GENETIC ALGORITHM with Hands-On exercise

GENETIC ALGORITHM with Hands-On exercise Adopted From Lecture by Michael Negnevitsky, Electrical Engineering & Computer Science University of Tasmania 1 Objective To understand the processes ie. GAs Basic

### An Introduction to Evolutionary Algorithms

An Introduction to Evolutionary Algorithms Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical Information Technology Karthik.sindhya@jyu.fi http://users.jyu.fi/~kasindhy/

### Path Planning Optimization Using Genetic Algorithm A Literature Review

International Journal of Computational Engineering Research Vol, 03 Issue, 4 Path Planning Optimization Using Genetic Algorithm A Literature Review 1, Er. Waghoo Parvez, 2, Er. Sonal Dhar 1, (Department

### Generation of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms

Generation of Ultra Side lobe levels in Circular Array Antennas using Evolutionary Algorithms D. Prabhakar Associate Professor, Dept of ECE DVR & Dr. HS MIC College of Technology Kanchikacherla, AP, India.

### CHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION

131 CHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION 6.1 INTRODUCTION The Orthogonal arrays are helpful in guiding the heuristic algorithms to obtain a good solution when applied to NP-hard problems. This

### Spatial Alignment of Passive Radar and Infrared Image Data on Seeker

Available online at www.sciencedirect.com Procedia Engineering 4 (011) 649 653 011 International Conference on Advances in Engineering Spatial Alignment of Passive Radar and Infrared Image Data on Seeker

### Genetic Algorithms. Kang Zheng Karl Schober

Genetic Algorithms Kang Zheng Karl Schober Genetic algorithm What is Genetic algorithm? A genetic algorithm (or GA) is a search technique used in computing to find true or approximate solutions to optimization

### Modeling Evaporating Liquid Spray

Tutorial 17. Modeling Evaporating Liquid Spray Introduction In this tutorial, the air-blast atomizer model in ANSYS FLUENT is used to predict the behavior of an evaporating methanol spray. Initially, the

### An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid

An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid Demin Wang 2, Hong Zhu 1, and Xin Liu 2 1 College of Computer Science and Technology, Jilin University, Changchun

### Introduction to Genetic Algorithms

Advanced Topics in Image Analysis and Machine Learning Introduction to Genetic Algorithms Week 3 Faculty of Information Science and Engineering Ritsumeikan University Today s class outline Genetic Algorithms

### GENETIC ALGORITHM METHOD FOR COMPUTER AIDED QUALITY CONTROL

3 rd Research/Expert Conference with International Participations QUALITY 2003, Zenica, B&H, 13 and 14 November, 2003 GENETIC ALGORITHM METHOD FOR COMPUTER AIDED QUALITY CONTROL Miha Kovacic, Miran Brezocnik

### GA is the most popular population based heuristic algorithm since it was developed by Holland in 1975 [1]. This algorithm runs faster and requires les

Chaotic Crossover Operator on Genetic Algorithm Hüseyin Demirci Computer Engineering, Sakarya University, Sakarya, 54187, Turkey Ahmet Turan Özcerit Computer Engineering, Sakarya University, Sakarya, 54187,

### Automata Construct with Genetic Algorithm

Automata Construct with Genetic Algorithm Vít Fábera Department of Informatics and Telecommunication, Faculty of Transportation Sciences, Czech Technical University, Konviktská 2, Praha, Czech Republic,

() Miscellaneous Exercise on Chapter 10 Question 1: Find the values of k for which the line is (a) Parallel to the x-axis, (b) Parallel to the y-axis, (c) Passing through the origin. Answer 1: The given

### Genetic Algorithm for Finding Shortest Path in a Network

Intern. J. Fuzzy Mathematical Archive Vol. 2, 2013, 43-48 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 26 August 2013 www.researchmathsci.org International Journal of Genetic Algorithm for Finding

### Genetic algorithm based on number of children and height task for multiprocessor task Scheduling

Genetic algorithm based on number of children and height task for multiprocessor task Scheduling Marjan Abdeyazdan 1,Vahid Arjmand 2,Amir masoud Rahmani 3, Hamid Raeis ghanavati 4 1 Department of Computer

### Preprocessing of Stream Data using Attribute Selection based on Survival of the Fittest

Preprocessing of Stream Data using Attribute Selection based on Survival of the Fittest Bhakti V. Gavali 1, Prof. Vivekanand Reddy 2 1 Department of Computer Science and Engineering, Visvesvaraya Technological

### Projectile Motion. Honors Physics

Projectile Motion Honors Physics What is projectile? Projectile -Any object which projected by some means and continues to moe due to its own inertia (mass). Projectiles moe in TWO dimensions Since a projectile

### Hardware Neuronale Netzwerke - Lernen durch künstliche Evolution (?)

SKIP - May 2004 Hardware Neuronale Netzwerke - Lernen durch künstliche Evolution (?) S. G. Hohmann, Electronic Vision(s), Kirchhoff Institut für Physik, Universität Heidelberg Hardware Neuronale Netzwerke

### EVOLVING ENGINEERING DESIGN TRADE-OFFS. Yizhen Zhang Collective Robotics Group

Proceedings of DETC 3 ASME 23 Design Engineering Technical Conferences and Computers and Information in Engineering Conference Chicago, Illinois USA, September 2-6, 23 DETC23/DTM-48676 EVOLVING ENGINEERING

### Comparison of TSP Algorithms

Comparison of TSP Algorithms Project for Models in Facilities Planning and Materials Handling December 1998 Participants: Byung-In Kim Jae-Ik Shim Min Zhang Executive Summary Our purpose in this term project

### Evolutionary Computation Algorithms for Cryptanalysis: A Study

Evolutionary Computation Algorithms for Cryptanalysis: A Study Poonam Garg Information Technology and Management Dept. Institute of Management Technology Ghaziabad, India pgarg@imt.edu Abstract The cryptanalysis

### Kanban Scheduling System

Kanban Scheduling System Christian Colombo and John Abela Department of Artificial Intelligence, University of Malta Abstract. Nowadays manufacturing plants have adopted a demanddriven production control

### The Parallel Software Design Process. Parallel Software Design

Parallel Software Design The Parallel Software Design Process Deborah Stacey, Chair Dept. of Comp. & Info Sci., University of Guelph dastacey@uoguelph.ca Why Parallel? Why NOT Parallel? Why Talk about

### Application of a Genetic Algorithm to a Scheduling Assignement Problem

Application of a Genetic Algorithm to a Scheduling Assignement Problem Amândio Marques a and Francisco Morgado b a CISUC - Center of Informatics and Systems of University of Coimbra, 3030 Coimbra, Portugal

### Thresholds Determination for Probabilistic Rough Sets with Genetic Algorithms

Thresholds Determination for Probabilistic Rough Sets with Genetic Algorithms Babar Majeed, Nouman Azam, JingTao Yao Department of Computer Science University of Regina {majeed2b,azam200n,jtyao}@cs.uregina.ca

### Regression Test Case Prioritization using Genetic Algorithm

9International Journal of Current Trends in Engineering & Research (IJCTER) e-issn 2455 1392 Volume 2 Issue 8, August 2016 pp. 9 16 Scientific Journal Impact Factor : 3.468 http://www.ijcter.com Regression

### Offspring Generation Method using Delaunay Triangulation for Real-Coded Genetic Algorithms

Offspring Generation Method using Delaunay Triangulation for Real-Coded Genetic Algorithms Hisashi Shimosaka 1, Tomoyuki Hiroyasu 2, and Mitsunori Miki 2 1 Graduate School of Engineering, Doshisha University,

### A Decomposition Approach to Multi-vehicle Cooperative Control

SUBMITTED TO THE IEEE TRANSACTIONS ON ROBOTICS 1 A Decomposition Approach to Multi-vehicle Cooperative Control Matthew G. Earl and Raffaello D Andrea Abstract We present methods to synthesize cooperative

### CMPUT 412 Motion Control Wheeled robots. Csaba Szepesvári University of Alberta

CMPUT 412 Motion Control Wheeled robots Csaba Szepesvári University of Alberta 1 Motion Control (wheeled robots) Requirements Kinematic/dynamic model of the robot Model of the interaction between the wheel

### CT79 SOFT COMPUTING ALCCS-FEB 2014

Q.1 a. Define Union, Intersection and complement operations of Fuzzy sets. For fuzzy sets A and B Figure Fuzzy sets A & B The union of two fuzzy sets A and B is a fuzzy set C, written as C=AUB or C=A OR

### Graphs, Search, Pathfinding (behavior involving where to go) Steering, Flocking, Formations (behavior involving how to go)

Graphs, Search, Pathfinding (behavior involving where to go) Steering, Flocking, Formations (behavior involving how to go) Class N-2 1. What are some benefits of path networks? 2. Cons of path networks?

### Engineers and scientists use instrumentation and measurement. Genetic Algorithms for Autonomous Robot Navigation

Genetic Algorithms for Autonomous Robot Navigation Theodore W. Manikas, Kaveh Ashenayi, and Roger L. Wainwright Engineers and scientists use instrumentation and measurement equipment to obtain information

### A New Approach for Representing Photonic Crystal Fiber Index Profile to Determine their Optical Characteristics

Vol.7 No.1, 011 مجلد 7, العدد 1, 011 Proc. 1st International Conf. Energy, Power and Control Basrah University, Basrah, Iraq 30 Nov. to Dec. 010 A New Approach for Representing Photonic Crystal Fiber Index

### Modified Order Crossover (OX) Operator

Modified Order Crossover (OX) Operator Ms. Monica Sehrawat 1 N.C. College of Engineering, Israna Panipat, Haryana, INDIA. Mr. Sukhvir Singh 2 N.C. College of Engineering, Israna Panipat, Haryana, INDIA.

### What is GOSET? GOSET stands for Genetic Optimization System Engineering Tool

Lecture 5: GOSET 1 What is GOSET? GOSET stands for Genetic Optimization System Engineering Tool GOSET is a MATLAB based genetic algorithm toolbox for solving optimization problems 2 GOSET Features Wide

### Local Search (Greedy Descent): Maintain an assignment of a value to each variable. Repeat:

Local Search Local Search (Greedy Descent): Maintain an assignment of a value to each variable. Repeat: Select a variable to change Select a new value for that variable Until a satisfying assignment is

### Preview. Two-Dimensional Motion and Vectors Section 1. Section 1 Introduction to Vectors. Section 2 Vector Operations. Section 3 Projectile Motion

Two-Dimensional Motion and Vectors Section 1 Preview Section 1 Introduction to Vectors Section 2 Vector Operations Section 3 Projectile Motion Section 4 Relative Motion Two-Dimensional Motion and Vectors

### Grid Scheduling using PSO with Naive Crossover

Grid Scheduling using PSO with Naive Crossover Vikas Singh ABV- Indian Institute of Information Technology and Management, GwaliorMorena Link Road, Gwalior, India Deepak Singh Raipur Institute of Technology

### UAV Cooperative Multiple Task Assignments using Genetic Algorithms

005 American Control Conference June 8-0, 005. Portland, OR, USA ThC04.5 UAV Cooperative Multiple Task Assignments using Genetic Algorithms Tal Shima, Steven J. Rasmussen, and Andrew G. Sparks Abstract

### Outline. Motivation. Introduction of GAs. Genetic Algorithm 9/7/2017. Motivation Genetic algorithms An illustrative example Hypothesis space search

Outline Genetic Algorithm Motivation Genetic algorithms An illustrative example Hypothesis space search Motivation Evolution is known to be a successful, robust method for adaptation within biological

### A Novel Approach to Planar Mechanism Synthesis Using HEEDS

AB-2033 Rev. 04.10 A Novel Approach to Planar Mechanism Synthesis Using HEEDS John Oliva and Erik Goodman Michigan State University Introduction The problem of mechanism synthesis (or design) is deceptively

### A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP

A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP Wael Raef Alkhayri Fahed Al duwairi High School Aljabereyah, Kuwait Suhail Sami Owais Applied Science Private University Amman,

### METAHEURISTICS Genetic Algorithm

METAHEURISTICS Genetic Algorithm Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal ferland@iro.umontreal.ca Genetic Algorithm (GA) Population based algorithm

### Minimum Weight Optimization of a Gear Train by using Genetic Algorithm

International Journal of Current Engineering and Technology E-ISSN 2277 416, P-ISSN 2347 5161 216 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Minimum

### Multi-objective Evolutionary Design of Fuzzy Autopilot Controller

Multi-objective Evolutionary Design of Fuzzy Autopilot Controller Anna L. Blumel, Evan J. Hughes, and Brian A. White Department of Aerospace, Power, and Sensors, Cranfield University, Royal Military College

### Evolutionary Algorithms. CS Evolutionary Algorithms 1

Evolutionary Algorithms CS 478 - Evolutionary Algorithms 1 Evolutionary Computation/Algorithms Genetic Algorithms l Simulate natural evolution of structures via selection and reproduction, based on performance

### 3.6.2 Generating admissible heuristics from relaxed problems

3.6.2 Generating admissible heuristics from relaxed problems To come up with heuristic functions one can study relaxed problems from which some restrictions of the original problem have been removed The

### Mobile Robot Path Planning in Static Environment

Mobile Robot Path Planning in Static Environment A Thesis Submitted in Partial Fulfilment of the Requirements for the Degree of Bachelor of Technology in Computer Science & Engineering Submitted by: Raman

### Motion Control (wheeled robots)

Motion Control (wheeled robots) Requirements for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> speed control,

### A Genetic Algorithm-Based Approach for Energy- Efficient Clustering of Wireless Sensor Networks

A Genetic Algorithm-Based Approach for Energy- Efficient Clustering of Wireless Sensor Networks A. Zahmatkesh and M. H. Yaghmaee Abstract In this paper, we propose a Genetic Algorithm (GA) to optimize

### CONCEPT FORMATION AND DECISION TREE INDUCTION USING THE GENETIC PROGRAMMING PARADIGM

1 CONCEPT FORMATION AND DECISION TREE INDUCTION USING THE GENETIC PROGRAMMING PARADIGM John R. Koza Computer Science Department Stanford University Stanford, California 94305 USA E-MAIL: Koza@Sunburn.Stanford.Edu

### COLLISION-FREE TRAJECTORY PLANNING FOR MANIPULATORS USING GENERALIZED PATTERN SEARCH

ISSN 1726-4529 Int j simul model 5 (26) 4, 145-154 Original scientific paper COLLISION-FREE TRAJECTORY PLANNING FOR MANIPULATORS USING GENERALIZED PATTERN SEARCH Ata, A. A. & Myo, T. R. Mechatronics Engineering

### MINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS

Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 5 th, 2006 MINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS Richard

### Lecture 5. If, as shown in figure, we form a right triangle With P1 and P2 as vertices, then length of the horizontal

Distance; Circles; Equations of the form Lecture 5 y = ax + bx + c In this lecture we shall derive a formula for the distance between two points in a coordinate plane, and we shall use that formula to

### ANTICIPATORY VERSUS TRADITIONAL GENETIC ALGORITHM

Anticipatory Versus Traditional Genetic Algorithm ANTICIPATORY VERSUS TRADITIONAL GENETIC ALGORITHM ABSTRACT Irina Mocanu 1 Eugenia Kalisz 2 This paper evaluates the performances of a new type of genetic

### Expendable Countermeasure Effectiveness against Imaging Infrared Guided Threats

Expendable Countermeasure Effectiveness against Imaging Infrared Guided Threats Presentation Outline 1. Introduction 2. Imaging Infrared (IIR) Guided Threats 3. Infrared Countermeasures (IRCM) 4. IRCM

### Design of a Route Guidance System with Shortest Driving Time Based on Genetic Algorithm

Design of a Route Guidance System with Shortest Driving Time Based on Genetic Algorithm UMIT ATILA 1, ISMAIL RAKIP KARAS 2, CEVDET GOLOGLU 3, BEYZA YAMAN 2, ILHAMI MUHARREM ORAK 2 1 Directorate of Computer

### Lecture 17: Recursive Ray Tracing. Where is the way where light dwelleth? Job 38:19

Lecture 17: Recursive Ray Tracing Where is the way where light dwelleth? Job 38:19 1. Raster Graphics Typical graphics terminals today are raster displays. A raster display renders a picture scan line

### CHAPTER 4 GENETIC ALGORITHM

69 CHAPTER 4 GENETIC ALGORITHM 4.1 INTRODUCTION Genetic Algorithms (GAs) were first proposed by John Holland (Holland 1975) whose ideas were applied and expanded on by Goldberg (Goldberg 1989). GAs is

### Hybrid Adaptive Evolutionary Algorithm Hyper Heuristic

Hybrid Adaptive Evolutionary Algorithm Hyper Heuristic Jonatan Gómez Universidad Nacional de Colombia Abstract. This paper presents a hyper heuristic that is able to adapt two low level parameters (depth

### NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING. Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582

ROBOT ENGINEERING Dr. Stephen Bruder Course Information Robot Engineering Classroom UNM: Woodward Hall room 147 NMT: Cramer 123 Schedule Tue/Thur 8:00 9:15am Office Hours UNM: After class 10am Email bruder@aptec.com

### Internal vs. External Parameters in Fitness Functions

Internal vs. External Parameters in Fitness Functions Pedro A. Diaz-Gomez Computing & Technology Department Cameron University Lawton, Oklahoma 73505, USA pdiaz-go@cameron.edu Dean F. Hougen School of

### AUTOMATIC PARKING OF SELF-DRIVING CAR BASED ON LIDAR

AUTOMATIC PARKING OF SELF-DRIVING CAR BASED ON LIDAR Bijun Lee a, Yang Wei a, I. Yuan Guo a a State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University,

### Segmentation of Noisy Binary Images Containing Circular and Elliptical Objects using Genetic Algorithms

Segmentation of Noisy Binary Images Containing Circular and Elliptical Objects using Genetic Algorithms B. D. Phulpagar Computer Engg. Dept. P. E. S. M. C. O. E., Pune, India. R. S. Bichkar Prof. ( Dept.

### Flow Sim. Chapter 16. Airplane. A. Add-In. Step 1. If necessary, open your ASSEMBLY file.

Chapter 16 A. Add-In. Step 1. If necessary, open your ASSEMBLY file. Airplane Flow Sim Step 2. Click Tools Menu > Add-Ins. Step 3. In the dialog box, scroll down to Flow Simulation and place a check in

### Force Modeling, Quaternion PID, and Optimization

Cornell University Autonomous Underwater Vehicle Team Spring 2014 Force Modeling, Quaternion PID, and Optimization Technical Report Alex Spitzer (aes368) May 11, 2014 Contents 1 Abstract 2 2 Previous Designs

### An Evolutionary Algorithm for the Multi-objective Shortest Path Problem

An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China

### Combining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem

Combining Two Local Searches with Crossover: An Efficient Hybrid Algorithm for the Traveling Salesman Problem Weichen Liu, Thomas Weise, Yuezhong Wu and Qi Qi University of Science and Technology of Chine

### A Practical Adaptive Proportional-Derivative Guidance Law

Engineering Letters, 2:3, EL_2_3_15 A Practical Adaptive Proportional-Derivative Guidance Law Yongwei Zhang, Min Gao, Suochang Yang, Baochen Li, Xue Gao Abstract The well-known proportional navigation

### Genetic Algorithm For Fingerprint Matching

Genetic Algorithm For Fingerprint Matching B. POORNA Department Of Computer Applications, Dr.M.G.R.Educational And Research Institute, Maduravoyal, Chennai 600095,TamilNadu INDIA. Abstract:- An efficient

### PLANE TRIGONOMETRY Exam I September 13, 2007

Name Rec. Instr. Rec. Time PLANE TRIGONOMETRY Exam I September 13, 2007 Page 1 Page 2 Page 3 Page 4 TOTAL (10 pts.) (30 pts.) (30 pts.) (30 pts.) (100 pts.) Below you will find 10 problems, each worth

### DYNAMICS OF A VORTEX RING AROUND A MAIN ROTOR HELICOPTER

DYNAMICS OF A VORTEX RING AROUND A MAIN ROTOR HELICOPTER Katarzyna Surmacz Instytut Lotnictwa Keywords: VORTEX RING STATE, HELICOPTER DESCENT, NUMERICAL ANALYSIS, FLOW VISUALIZATION Abstract The main goal

### Purpose of the experiment

Projectile Motion PES 116 Advanced Physics Lab I Purpose of the experiment Measure the velocity of a ball using two photogates and Logger Pro. Apply the concepts of two-dimensional kinematics to predict

### EFFECT OF YAW-TILTED HINGE AXIS ON DEPLOYMENT ROBUSTNESS OF MARS AIRPLANE

EFFET OF YAW-TILTED HINGE AXIS ON DEPLOYMENT ROBUSTNESS OF MARS AIRPLANE Koji Fujita* Hiroki Nagai** and Akira Oyama* * Institute of Space and Astronautical Science Japan Aerospace Exploration Agency --

### A THREAD BUILDING BLOCKS BASED PARALLEL GENETIC ALGORITHM

www.arpapress.com/volumes/vol31issue1/ijrras_31_1_01.pdf A THREAD BUILDING BLOCKS BASED PARALLEL GENETIC ALGORITHM Erkan Bostanci *, Yilmaz Ar & Sevgi Yigit-Sert SAAT Laboratory, Computer Engineering Department,

### THE combination of Darwin s theory and computer graphics

Evolved Strokes in Non Photo Realistic Rendering Ashkan Izadi,Vic Ciesielski School of Computer Science and Information Technology RMIT University, Melbourne, 3000, VIC, Australia {ashkan.izadi,vic.ciesielski}@rmit.edu.au

### A Genetic Algorithm Framework

Fast, good, cheap. Pick any two. The Project Triangle 3 A Genetic Algorithm Framework In this chapter, we develop a genetic algorithm based framework to address the problem of designing optimal networks

### Binary Differential Evolution Strategies

Binary Differential Evolution Strategies A.P. Engelbrecht, Member, IEEE G. Pampará Abstract Differential evolution has shown to be a very powerful, yet simple, population-based optimization approach. The

### AMSC/CMSC 664 Final Presentation

AMSC/CMSC 664 Final Presentation May 9, 2017 Jon Dehn Advisor: Dr. Sergio Torres, Leidos Corporation Project Goal Build a framework for testing compute-intensive algorithms in air traffic management First

### Large Scale Test Simulations using the Virtual Environment for Test Optimization

Large Scale Test Simulations using the Virtual Environment for Test Optimization (VETO) S. E. Klenke, S. R. Heffelfinger, H. J. Bell and C. L. Shierling Sandia National Laboratories Albuquerque, New Mexico