DDRE/DTU AUGUST 2007 1 Decision Support System for Fighter Pilots Lars Rosenberg Randleff Danish Defence Research Establishment / Technical University.

Slides:



Advertisements
Similar presentations
1 Integration of Artificial Intelligence and Operations Research Techniques for Combinatorial Problems Carla P. Gomes Cornell University
Advertisements

H EURISTIC S OLVER  Builds and tests alternative fuel treatment schedules (solutions) at each iteration  In each iteration:  Evaluates the effects of.
Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.
Simulated Annealing Premchand Akella. Agenda Motivation The algorithm Its applications Examples Conclusion.
IS Theories & Practices Systems Architecture & Infrastructure IS 655: Supplementary Note 1 CSUN Information Systems.
Synthetic Teammates for Realtime Anywhere Training & Assessment POC: Dr. Benjamin Bell, CHI Systems
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
ISQED’2015: D. Seemuth, A. Davoodi, K. Morrow 1 Automatic Die Placement and Flexible I/O Assignment in 2.5D IC Design Daniel P. Seemuth Prof. Azadeh Davoodi.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
Content-Based Image Retrieval (CBIR) Student: Mihaela David Professor: Michael Eckmann Most of the database images in this presentation are from the Annotated.
21st European Conference on Operational Research Algorithms for flexible flow shop problems with unrelated parallel machines, setup times and dual criteria.
Task Assignment and Transaction Clustering Heuristics.
Simulated-Annealing-Based Solution By Gonzalo Zea s Shih-Fu Liu s
A Comparative Study Of Deterministic And Stochastic Optimization Methods For Integrated Design Of Processes Mario Francisco a, Silvana Revollar b, Pastora.
1 Protocols are programs too The meta-heuristic search for security protocols By John A. Clark.
Carmine Cerrone, Raffaele Cerulli, Bruce Golden GO IX Sirmione, Italy July
Introduction to Simulated Annealing 22c:145 Simulated Annealing  Motivated by the physical annealing process  Material is heated and slowly cooled.
By Rohit Ray ESE 251.  Most minimization (maximization) strategies work to find the nearest local minimum  Trapped at local minimums (maxima)  Standard.
DAT/SEN Mar 22, The Junior Woodchucks Guidebook for Fighter Pilots Lars Rosenberg Randleff Ph.D. student Danish Defence Research Establishment.
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Elements of the Heuristic Approach
DETECTING NEAR-DUPLICATES FOR WEB CRAWLING Authors: Gurmeet Singh Manku, Arvind Jain, and Anish Das Sarma Presentation By: Fernando Arreola.
The BioAnalytics Group LLC Global Optimization Toolkit Project First Prototype Delivery.
Decision Support System for Fighter Pilots
DAT/SEN May 4, Decision Support for Fighter Pilots Lars Rosenberg Randleff Ph.D. student Danish Defence Research Establishment.
DAT/SEN April 21, Optimising Fighter Pilot Survivability Lars Rosenberg Randleff Ph.D. student Danish Defence Research Establishment.
Search Methods An Annotated Overview Edward Tsang.
Heuristic Optimization Methods
1 Simulated Annealing Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
1 Exploring Custom Instruction Synthesis for Application-Specific Instruction Set Processors with Multiple Design Objectives Lin, Hai Fei, Yunsi ACM/IEEE.
Simulated Annealing.
1 Sensor Deployment –Sequential Deployment 1. Sequential Deployment Deploy one or more sensors Get Feedback from them Deploy another set And, so on Disadvantage.
ELECTRONIC WARFARE AIAA Team 5 Robert Speer Craig Searles.
How Much Randomness Makes a Tool Randomized? Petr Fišer, Jan Schmidt Faculty of Information Technology Czech Technical University in Prague
Evaluation of the XL Routing Algorithm in Multiple Failure Conditions Nguyen Cao Julie Morris Khang Pham.
© 2005 Prentice Hall, Decision Support Systems and Intelligent Systems, 7th Edition, Turban, Aronson, and Liang 2-1 Chapter 2 Decision-Making Systems,
C OMPARING T HREE H EURISTIC S EARCH M ETHODS FOR F UNCTIONAL P ARTITIONING IN H ARDWARE -S OFTWARE C ODESIGN Theerayod Wiangtong, Peter Y. K. Cheung and.
S ystems Analysis Laboratory Helsinki University of Technology Automated Solution of Realistic Near-Optimal Aircraft Trajectories Using Computational Optimal.
Using Information Technology to Reduce Traffic Jam in a Highly Traffic Congested City Sayed Ahmed and Rasit Eskicioglu We propose a cost effective and.
FORS 8450 Advanced Forest Planning Lecture 5 Relatively Straightforward Stochastic Approach.
G5BAIM Artificial Intelligence Methods
Introduction to Simulated Annealing Study Guide for ES205 Xiaocang Lin & Yu-Chi Ho August 22, 2000.
Simulated Annealing. Difficulty in Searching Global Optima starting point descend direction local minima global minima barrier to local search.
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
L10 – Map labeling algorithms NGEN06(TEK230) – Algorithms in Geographical Information Systems L10- Map labeling algorithms by: Sadegh Jamali (source: Lecture.
Heuristic Methods for the Single- Machine Problem Chapter 4 Elements of Sequencing and Scheduling by Kenneth R. Baker Byung-Hyun Ha R2.
1 Simulated Annealing Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
A field of study that encompasses computational techniques for performing tasks that require intelligence when performed by humans. Simulation of human.
Simulated Annealing To minimize the wire length. Combinatorial Optimization The Process of searching the solution space for optimum possible solutions.
Intro. ANN & Fuzzy Systems Lecture 37 Genetic and Random Search Algorithms (2)
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Simulated Annealing (SA)
Ondřej Přibyl L3: System Development Life Cycle page 1 Lecture 3: System Development Life Cycle Doc.Ing. Ondřej Přibyl, Ph.D. Department of applied mathematics.
VIEWS b.ppt-1 Managing Intelligent Decision Support Networks in Biosurveillance PHIN 2008, Session G1, August 27, 2008 Mohammad Hashemian, MS, Zaruhi.
INTELLIGENT TEST SCHEDULING TE-MPE Technical Meeting Michael Galetzka.
NYS Virtual Learning Space Phase I and Beyond. Goals of NYSVLS Through the New York State Virtual Learning Space, NYSED-defined learning standards, teacher.
Scheduling for Trinity School at Meadow View
Scientific Research Group in Egypt (SRGE)
Heuristic Optimization Methods
Particle Swarm Optimization
Constructing Robust Crew Schedules with Bicriteria Optimisation
Parallel Cooperative Optimization Research Group
Release Presentation – January 2017
By Rohit Ray ESE 251 Simulated Annealing.
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
Heuristic search INT 404.
Multi-Objective Optimization
Introduction to Simulated Annealing
Xin-She Yang, Nature-Inspired Optimization Algorithms, Elsevier, 2014
Introduction to Modeling
Chapter 12 Analyzing Semistructured Decision Support Systems
Presentation transcript:

DDRE/DTU AUGUST Decision Support System for Fighter Pilots Lars Rosenberg Randleff Danish Defence Research Establishment / Technical University of Denmark

DDRE/DTU AUGUST Agenda Project Description The Four Approaches Prolog Bayesian Net Integer Programming Metaheuristics Comparing Approaches Conclusion

DDRE/DTU AUGUST Agenda Project Description The Four Approaches Prolog Bayesian Net Integer Programming Metaheuristics Comparing Approaches Conclusion

DDRE/DTU AUGUST Hostile Environment

DDRE/DTU AUGUST Project Description To explorer a number of technologies within AI and OR that may be used in designing a DSS for fighter pilots. The DSS is to be used in finding a response to ground based threats.

DDRE/DTU AUGUST Requirements Real-time Hardware Updateable Trustworthy Useful User Interface

DDRE/DTU AUGUST Agenda Project Description The Four Approaches Prolog Bayesian Net Integer Programming Metaheuristics Comparing Approaches Conclusion

DDRE/DTU AUGUST A Prolog Example % % Find appropriate countermeasures. % proper_cm(Angle, jammer) :- ( warning(rwr, (Angle, _)), warning(mws, (Angle, _)), jammer_mode(auto) );( warning(rwr, (Angle, _)), warning(mws, (DiffAngle, _)), Angle \== DiffAngle );( warning(rwr, (Angle, _)), not(warning(mws, (_, _))) ). ”When the jammer is jamming it may influence the RWR and jammers of other aircraft.” “When the jammer is in 'auto' mode, it will jam the RF sources detected.” If the MWS indicates a missile in a given direction, and the RWR does not, the missile is IR guided.

DDRE/DTU AUGUST Some Results ”Use flares, chaff, jammer, or towed decoy. Do not use chaff to counter SA-5 and SA-10. Use jammer in auto mode.”

DDRE/DTU AUGUST Agenda Project Description The Four Approaches Prolog Bayesian Net Integer Programming Metaheuristics Comparing Approaches Conclusion

DDRE/DTU AUGUST The Bayesian Net

DDRE/DTU AUGUST Semi-automatic Population Excel MATLAB desc. MATLAB prog. HUGIN Text file

DDRE/DTU AUGUST Structural Learning Fly-In HUGIN (SL) Text file Log file Perl Text file

DDRE/DTU AUGUST Some Results

DDRE/DTU AUGUST Agenda Project Description The Four Approaches Prolog Bayesian Net Integer Programming Metaheuristics Comparing Approaches Conclusion

DDRE/DTU AUGUST Parameters α ρ

DDRE/DTU AUGUST Lethality ScenarioLethality

DDRE/DTU AUGUST Deployment Scheme Jammer Decoy Chaff

DDRE/DTU AUGUST Reduction of Lethality (α)

DDRE/DTU AUGUST Reduction of Lethality (ρ)

DDRE/DTU AUGUST Deployment Phases IIIIIIIVV Time OtOt AtAt

DDRE/DTU AUGUST Constraints I Time OtOt AtAt Ot’Ot’ O t ’’ T start T end

DDRE/DTU AUGUST Constraints II Time AtAt T start OtOt CtCt

DDRE/DTU AUGUST Constraints III Time OtOt AtAt Ot’Ot’ O t ’’ T start T end

DDRE/DTU AUGUST Scenarios sc1sc2sc3sc4sc5sc6

DDRE/DTU AUGUST Running Time

DDRE/DTU AUGUST Results

DDRE/DTU AUGUST Agenda Project Description The Four Approaches Prolog Bayesian Net Integer Programming Metaheuristics Comparing Approaches Conclusion

DDRE/DTU AUGUST Three Metaheuristics Steepest Ascent Local Search Simulated Annealing

DDRE/DTU AUGUST Parameters in SA Algorithm Cooling Schedule Start Temperature End Temperature Acceptance Stopping Criteria Objective Function Neighbourhood Initial Solution

DDRE/DTU AUGUST

DDRE/DTU AUGUST Results

DDRE/DTU AUGUST Comparing Metaheuristics

DDRE/DTU AUGUST Agenda Project Description The Four Approaches Prolog Bayesian Net Integer Programming Metaheuristics Comparing Approaches Conclusion

DDRE/DTU AUGUST Comparing Approaches I Prolog is easy to use, and easy to model BN is not categorical; it treats probabilities IP ensures the optimal solutions; but is too slow for a real-time DSS A metaheuristic will not necessarily give an optimal solution; but it will find a solution fast

DDRE/DTU AUGUST Comparing Approaches II Prolog Bayesian Net Mathematical Model Metaheuristic

DDRE/DTU AUGUST Agenda Project Description The Four Approaches Prolog Bayesian Net Integer Programming Metaheuristics Comparing Approaches Conclusion

DDRE/DTU AUGUST Conclusion Four approaches to a DSS for fighter pilots have been implemented All approaches have pros and cons None of the approaches fulfil all requirements More research may find the best technology for developing a DSS for fighter pilots

DDRE/DTU AUGUST Decision Support System for Fighter Pilots Lars Rosenberg Randleff Danish Defence Research Establishment / Technical University of Denmark