Case Injected Genetic Algorithms for Affordable Human Modeling Start Date: 11/15/02 Sushil J. Louis University of Nevada, Reno John McDonnell SPAWAR San.

Slides:



Advertisements
Similar presentations
Rolls-Royce supported University Technology Centre in Control and Systems Engineering UK e-Science DAME Project Alex Shenfield
Advertisements

Department of Electronic Engineering NUIG Direct Evolution of Patterns using Genetic Algorithms By: John Brennan Supervisor: John Maher.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Alternate Software Development Methodologies
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Genetic Algorithms Sushil J. Louis Evolutionary Computing Systems LAB Dept. of Computer Science University of Nevada, Reno
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
TEMPLATE DESIGN © Genetic Algorithm and Poker Rule Induction Wendy Wenjie Xu Supervised by Professor David Aldous, UC.
Case Injected Genetic Algorithms Sushil J. Louis Genetic Algorithm Systems Lab (gaslab) University of Nevada, Reno
Case Injected Genetic Algorithms Sushil J. Louis Genetic Algorithm Systems Lab (gaslab) University of Nevada, Reno
Computational Approaches to Space Layout Planning Presented By Hoda Homayouni Final project for ARCH 588.
Presenter : Shih-Tung Huang Tsung-Cheng Lin Kuan-Fu Kuo 2015/6/15 EICE team Model-Level Debugging of Embedded Real-Time Systems Wolfgang Haberl, Markus.
Optimization via Search CPSC 315 – Programming Studio Spring 2009 Project 2, Lecture 4 Adapted from slides of Yoonsuck Choe.
Genetic Algorithms and Their Applications John Paxton Montana State University August 14, 2003.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Learning from Experience: Case Injected Genetic Algorithm Design of Combinational Logic Circuits Sushil J. Louis Genetic Algorithm Systems Lab(gaslab)
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Genetic Learning from Experience Sushil J. Louis Evolutionary Computing Systems LAB Department of Computer Science University of Nevada, Reno
Genetic Algorithms Sushil J. Louis Evolutionary Computing Systems LAB Dept. of Computer Science University of Nevada, Reno
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Image Registration of Very Large Images via Genetic Programming Sarit Chicotay Omid E. David Nathan S. Netanyahu CVPR ‘14 Workshop on Registration of Very.
Genetic Algorithms: A Tutorial
Software Engineering Muhammad Fahad Khan
Genetic Algorithm.
Evolutionary Computing Systems Lab (ECSL), University of Nevada, Reno 1 Authors : Siming Liu, Sushil Louis and Monica Nicolascu
Evolutionary Computing Systems Lab (ECSL), University of Nevada, Reno 1 Authors : Christopher Ballinger, Sushil Louis
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Placement of Entities in Object-oriented Systems by means of a Single-objective Genetic Algorithm Margaritis Basdavanos Alexander Chatzigeorgiou University.
Genetic Algorithms Michael J. Watts
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
Design & Analysis of Algorithms Combinatory optimization SCHOOL OF COMPUTING Pasi Fränti
Fuzzy Genetic Algorithm
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Chapter 10 Analysis and Design Discipline. 2 Purpose The purpose is to translate the requirements into a specification that describes how to implement.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
Search Engine Optimization © HiTech Institute. All rights reserved. Slide 1 What is Solution Assessment & Validation?
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
Chapter 4 Decision Support System & Artificial Intelligence.
Schreiber, Yevgeny. Value-Ordering Heuristics: Search Performance vs. Solution Diversity. In: D. Cohen (Ed.) CP 2010, LNCS 6308, pp Springer-
Evolutionary Computing Systems Lab (ECSL), University of Nevada, Reno 1 Authors : Siming Liu, Sushil Louis and Monica Nicolascu
Genetic Algorithms. 2 Overview Introduction To Genetic Algorithms (GAs) GA Operators and Parameters Genetic Algorithms To Solve The Traveling Salesman.
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #12 2/20/02 Evolutionary Algorithms.
1 Knowledge Acquisition and Learning by Experience – The Role of Case-Specific Knowledge Knowledge modeling and acquisition Learning by experience Framework.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
Evolution of Complex Behavior Controllers using Genetic Algorithms Title.
Waqas Haider Bangyal 1. Evolutionary computing algorithms are very common and used by many researchers in their research to solve the optimization problems.
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
Authors: Soamsiri Chantaraskul, Klaus Moessner Source: IET Commun., Vol.4, No.5, 2010, pp Presenter: Ya-Ping Hu Date: 2011/12/23 Implementation.
A field of study that encompasses computational techniques for performing tasks that require intelligence when performed by humans. Simulation of human.
Principles in the Evolutionary Design of Digital Circuits J. F. Miller, D. Job, and V. K. Vassilev Genetic Programming and Evolvable Machines.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Resource Optimization for Publisher/Subscriber-based Avionics Systems Institute for Software Integrated Systems Vanderbilt University Nashville, Tennessee.
Genetic Algorithms. Solution Search in Problem Space.
Evolutionary Computing Systems Lab (ECSL), University of Nevada, Reno 1 Authors : Siming Liu, Christopher Ballinger, Sushil Louis
Genetic Algorithm(GA)
GENETIC ALGORITHM By Siti Rohajawati. Definition Genetic algorithms are sets of computational procedures that conceptually follow steps inspired by the.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Optimization Of Robot Motion Planning Using Genetic Algorithm
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
HATS – Hierarchical Automated Test Sequencer Platform
MANAGING KNOWLEDGE FOR THE DIGITAL FIRM
Software Testing “If you can’t test it, you can’t design it”
Case Injected Genetic Algorithms
Traveling Salesman Problem by Genetic Algorithm
Presentation transcript:

Case Injected Genetic Algorithms for Affordable Human Modeling Start Date: 11/15/02 Sushil J. Louis University of Nevada, Reno John McDonnell SPAWAR San Diego

2 Case Injected Genetic AlgoRithms (CIGARs) combine genetic algorithms and case-based reasoning to address three problems Affordability: saves moneyAffordability: The system will be used for both decision support and training. Dual use saves money and familiarizes trainees with battlefield systems Human Modeling:Human Modeling: CIGAR uses cases captured from humans during decision support, war-gaming, and training to bias genetic algorithm search toward human solutions Quality of opponent: reduces knowledge acquisition costQuality of opponent: CIGAR automatically acquires knowledge (generates cases) by playing against itself. This bootstrapping leads to better quality opponents and reduces knowledge acquisition cost

3 Human Case Injected Genetic AlgoRithms (CIGAR)s combine Genetic Algorithm (GA) search with Case-Based Memory Problem 1Problem 2 CIGAR Technical Objective: Technical Objective: Prototype and validate CIGAR techniques for more robust, more affordable human behavior modeling Problem 3 We think of CIGAR as an optimization engine that acquires cases from problem solving or from humans and learns to increase performance with experience GAs adapt solutions (cases) acquired from previously attempted problems to solve subsequent problems

4 Cigar achieves more affordable decision support and training for naval applications The Real-time Executive Decision Support (REDS) effort at SPAWAR will use CIGAR as an optimization engine in strike force weapon-target pairing. Transition objective: Transition objective: Generate multiple weapon-target pairing options in less than 4 minutes for 20 weapon-target pairs. Include SEAD support and METOC information Platforms Targets and Threats Decision Support Decision Support: Assist decision maker in configuration Training: Training: Provide trainee with quality opponent (strike planner) Decision Support Decision Support: Assist decision maker in time- critical strike Training: Training: Provide trainee with quality opponent ( target/threat configurator)

5 CIGAR is affordable The system uses the same graphical user interface for decision support and for training. Decision makers use the interface to specify solutions to decision problems – these solutions are cases and are acquired as a by- product of operational use. Trainees use the same interface for training/wargaming. This dual use translates into significant cost savings and acquires domain knowledge Fighting Training Motto: Fight as you train, train as you fight CIGAR

6 CIGAR produces high quality solutions System use or operation by humans acquires cases representing domain knowledge. CIGAR also acquires cases as it solves problems generated by a problem generator. This offline knowledge acquisition will lead to better performance for training and for decision support. Problem 1Problem 2 CIGAR Problem 3 Problem Generator Replacing the problem generator with CIGAR, we can evolve quality opponents CIGAR

7 CIGAR acquires knowledge during problem solving Periodically save members of the GA’s population to the case- base –A member of the population is a candidate solution to the problem Periodically inject appropriate cases into the GA’s population replacing low-fitness members Genetic Algorithm Case- base CBR module Preprocessor Candidate solutions Cases Save best individual Inject closest to the best

8 How does CIGAR operate ? Which cases do we inject? –Inject cases that are closest to the current best member of the population. Genetic algorithms usually use binary encodings. For these encodings, our distance metric is therefore Hamming Distance – the number of differing bits. GA theory points to other injection strategies –Probabilistic version: The probability of injection of a case in the case base is inversely proportional to distance from the current best member of the population relative to the distances of other cases. How often should we inject cases? –Takeover time – number of generations needed for an individual to take over the population. P(Case i ) = (l – d i )/∑(l – d j ) Sum over all cases Chromosome length Hamming distance from best member

9 Expected behavior versus actual behavior Number of problems attempted Learning system/CIGAR No learning Quality Number of problems attempted Learning system/CIGAR No learning Time Expected behavior of a learning systemCIGAR behavior on 50 design problems Avg. best fitness found within a max of 30 gener ations Avg. time taken to find best fitness RIGA = Randomly Initialized Genetic Algorithm This performance is with (1) a simple problem generator and (2) a case base that grows large few However, we need to deal with few cases captured from humans and obtain (1) human-like and (2) high-quality solutions

10 CIGAR solutions are similar to injected cases The graph below displays hamming distance as a function of chromosome location. –At a number of locations, CIGAR solutions are more similar to each other Other analysis shows that CIGAR solutions are descendants of injected cases  When injected cases come from humans, CIGAR will tend to produce solutions similar to humans Chromosome position (locus) Avg. hamming distance few and Can injecting a few cases captured from humans result in (1) high-quality and (2) timely solutions?

11 Performance on weapon-target pairing Objective function to maximize Given allocation X, U(X) depends on pilot proficiency with weapon & weapon’s effectiveness on target. V(X) describes marginal effect of using multiple weapons Y(X) depends on routing, SEAD, METOC… effectivenessvalue & risk Note that in this case CIGAR takes decreasing time but there is little difference in quality ?

12 We have built a foundation for delivering on research objectives. Year 1 deliverables: Deliverables related to technical objective –Affordability Deploy a prototype GUI for weapon-target pairing support on the web Demonstrate dual use for decision support and training/war- gaming –Human Modeling A set of tools for case-base analysis fewAnalysis of empirical results from injecting cases acquired from a human expert. Techniques for dealing with few human cases Techniques for combining CIGAR and human cases Deliverables related to transitioning objective –Provide an optimization engine that integrates into the REDS-KSA architecture

13 Years 2 and 3 Related to the technical objective –Prototype and deploy a CIGAR system as the red-force against weapon-target pairing –Demonstrate competent red-force scenario generation against weapon-target pairing –Demonstrate techniques for co-evolving blue-red forces –Test and validate approaches to combining human generated cases with automatically acquired cases Related to the transitioning objective –Demonstrate < 4 minutes for 20 weapon-target pairs with SEAD support/routing and METOC data –Other military applications

14 Simulation System Architecture Physics Gfx Battle Authoring Offense Planning Decision Support Defense Planning Decision Support Comm. Hub Defense CIGAR Offense CIGAR GUIs

15 Questions? Tools being developed

16

17 Solution distribution