Analytic Prediction of Emergent Dynamics for ANTS James Powell, Todd Moon and Dan Watson Utah State University.

Slides:



Advertisements
Similar presentations
Chapter 7 Managing Risk.
Advertisements

Lecture 2 Team Coordination 1 ICS 126 Team Coordination Team Formation and Organization Group Management Meeting Techniques Large software systems require.
Hadi Goudarzi and Massoud Pedram
Multi‑Criteria Decision Making
Sensitivity Analysis In deterministic analysis, single fixed values (typically, mean values) of representative samples or strength parameters or slope.
Chapter 5 Marketing Strategy Chapter 5 Mission, Goals, and Objectives.
AP Statistics Chapter 16. Discrete Random Variables A discrete random variable X has a countable number of possible values. The probability distribution.
An Approach to Evaluate Data Trustworthiness Based on Data Provenance Department of Computer Science Purdue University.
Towards Feasibility Region Calculus: An End-to-end Schedulability Analysis of Real- Time Multistage Execution William Hawkins and Tarek Abdelzaher Presented.
Staffing And Scheduling.
Monte Carlo Simulation and Risk Analysis James F. Wright, Ph.D.
Analytic Prediction of Emergent Dynamics for ANTs Systems Utah State University James Powell Todd Moon Dan Watson.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Clustering Ram Akella Lecture 6 February 23, & 280I University of California Berkeley Silicon Valley Center/SC.
Chapter 14 Risk and Uncertainty Managerial Economics: Economic Tools for Today’s Decision Makers, 4/e By Paul Keat and Philip Young.
The Pricing Decision and Customer Profitability Analysis
CHAPTER 10: Introducing Probability
Introduction to Monte Carlo Methods D.J.C. Mackay.
Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems David Goldschmidt, Ph.D.
By Paul Cottrell, BSc, MBA, ABD. Author Complexity Science, Behavioral Finance, Dynamic Hedging, Financial Statistics, Chaos Theory Proprietary Trader.
VOLTAGE SCHEDULING HEURISTIC for REAL-TIME TASK GRAPHS D. Roychowdhury, I. Koren, C. M. Krishna University of Massachusetts, Amherst Y.-H. Lee Arizona.
ASSESSMENT IN EDUCATION ASSESSMENT IN EDUCATION. Copyright Keith Morrison, 2004 PERFORMANCE ASSESSMENT... Concerns direct reality rather than disconnected.
Strategic Planning: Making Choices in a Dynamic Environment
Introduction to Discrete Event Simulation Customer population Service system Served customers Waiting line Priority rule Service facilities Figure C.1.
1 Lesson 3: Choosing from distributions Theory: LLN and Central Limit Theorem Theory: LLN and Central Limit Theorem Choosing from distributions Choosing.
Planning and Decission Making
Swarm Intelligence 虞台文.
1 Reading Report 5 Yin Chen 2 Mar 2004 Reference: Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications, Ion Stoica, Robert Morris, david.
EEX 3257 COOPERATIVE LEARNING. BENEFITS OF COOPERATIVE LEARNING Academic Benefits Increased achievement and increased retention of knowledge Improved.
Chapter 1 Introduction to Statistics. Statistical Methods Were developed to serve a purpose Were developed to serve a purpose The purpose for each statistical.
Delivering Integrated, Sustainable, Water Resources Solutions Monte Carlo Simulation Robert C. Patev North Atlantic Division – Regional Technical Specialist.
1 S ystems Analysis Laboratory Helsinki University of Technology Kai Virtanen, Tuomas Raivio and Raimo P. Hämäläinen Systems Analysis Laboratory Helsinki.
Advanced Decision Architectures Collaborative Technology Alliance An Interactive Decision Support Architecture for Visualizing Robust Solutions in High-Risk.
Sarosh Talukdar Jan. 29, 2004 Agent-based system planning tools.
Lecture V Probability theory. Lecture questions Classical definition of probability Frequency probability Discrete variable and probability distribution.
CHAPTER 10: Introducing Probability ESSENTIAL STATISTICS Second Edition David S. Moore, William I. Notz, and Michael A. Fligner Lecture Presentation.
O PTIMAL SERVICE TASK PARTITION AND DISTRIBUTION IN GRID SYSTEM WITH STAR TOPOLOGY G REGORY L EVITIN, Y UAN -S HUN D AI Adviser: Frank, Yeong-Sung Lin.
Essential Statistics Chapter 91 Introducing Probability.
CHAPTER 10 Introducing Probability BPS - 5TH ED.CHAPTER 10 1.
Chapter 10 Introducing Probability BPS - 5th Ed. Chapter 101.
DRILL Answer the following question’s in your notebook: 1.How does ACO differ from PSO? 2.What does positive feedback do in a swarm? 3.What does negative.
Change management control Sources of Change  Project scope changes  Implementation of contingency plans  Improvement changes ISE Ch. 6 1.
1 1 Slide Simulation Professor Ahmadi. 2 2 Slide Simulation Chapter Outline n Computer Simulation n Simulation Modeling n Random Variables and Pseudo-Random.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Virtual-Channel Flow Control William J. Dally
Learning for Physically Diverse Robot Teams Robot Teams - Chapter 7 CS8803 Autonomous Multi-Robot Systems 10/3/02.
Csci 418/618 Simulation Models Dr. Ken Nygard, IACC 262B
MGT-555 PERFORMANCE AND CAREER MANAGEMENT LECTURE NO
Chapter 4 Program Development. Health Promotion Program Development After completion of the needs assessment and the mission statement it is time to develop.
Dynamics of Competition Between Incumbent and Emerging Network Technologies Youngmi Jin (Penn) Soumya Sen (Penn) Prof. Roch Guerin (Penn) Prof. Kartik.
OPERATING SYSTEMS CS 3502 Fall 2017
CPU SCHEDULING.
Dan C. Marinescu Office: HEC 439 B. Office hours: M, Wd 3 – 4:30 PM.
Random Testing: Theoretical Results and Practical Implications IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2012 Andrea Arcuri, Member, IEEE, Muhammad.
Discrete Random Variables
Hypothesis Testing I The One-sample Case
Modeling and Simulation (An Introduction)
Measuring Service in Multi-Class Networks
Chapter 6: CPU Scheduling
Unit 6 Probability.
Chapter Six Training Evaluation.
CPU Scheduling G.Anuradha
Apollo Weize Sun Feb.17th, 2017.
CHAPTER 10: Introducing Probability
CPU SCHEDULING.
Spectrum Sharing in Cognitive Radio Networks
Chapter 4. Time Response I may not have gone where I intended to go, but I think I have ended up where I needed to be. Pusan National University Intelligent.
Probability.
Changing the Game The Logic Model
N-port Network Port reference Line Impedance Port Voltage & Current.
Presentation transcript:

Analytic Prediction of Emergent Dynamics for ANTS James Powell, Todd Moon and Dan Watson Utah State University

APED Project Goals: Construct models reflecting the dynamics of multiple agents collaborating autonomously to accomplish missions Use dynamical systems techniques to characterize emergent behaviors in terms of design inputs and scenarios

APED Techniques (continuous setting) Use rate-equation modelling to develop differential equations for task completion Determine critical solutions which finish `just in time,’ bounding space into satisficing and non-satisficing regions Examine stability of critical solutions for desirable design traits

APED Techniques (discrete setting) Characterize discrete decisions in terms of costs (P R ) and benefits (P S ) Determine convergence to satisficing behavior using praxeic analysis (P S > b P R ) Evaluate emergent behaviors for desirability

Continuous Modelling – Digging Ditches A number of tasks (ditches) need to be accomplished, with differing start times (t j ), deadlines (D j ), work densities (r j (s) – man-hours required per foot), and projected lengths (L j ) Overseers negotiate among themselves for the services of a common pool of (M) `men’ to do the digging.

Rate Completion Modelling Man-hours required to dig a short distance, must equal fraction of men allocated to task for the amount of time the work took, fraction of time necessary for negotiation and communication fraction of total resources allocated to task j

Deriving a general model Passing to the continuous limit, If F j is the fraction of ditch j remaining un dug,

Illustrating a particular scenario… Constant work density – R j man-hours required, uniform distribution over entire ditch The end result of negotiation is to devote resources to those tasks nearest to completion: Real-time effect of negotiation is to add an overhead per allocated resource + a constant communcation overhead:

The differential model: weighted toward tasks closest to completion communication overhead per-resource cost of negotiation

Some dynamics consequences Summing all equations… total rate of task accomplishment can be no greater than this, accounting for real-time negotiation and communication overhead

Critical solutions – two dominant competitors Deadline for Task 1 Deadline for Task 2 Task 2 starts FjFj t Critical Trajectory Task 1 Fails Task 1 Succeeds

We hope to assess the efficacy of negotiation goals by: Characterizing the probability of successful completions in random environments Determining the sensitivity of task completions to additional tasks, unforseen difficulties, and changing deadlines/constraints

The efficacy of negotiation implementations can be predicted from How the likely negotiation overheads in real time affect task completions How overheads create barriers to overall accomplishment as tasks are added

We are testing the theory using simulations in random environments Differing allocation goals: democratic, socialistic, opportunistic, just in time… Random start times for new tasks Tasks are assigned with random difficulty Deadlines are assigned after start with random (not necessarily reasonable) frequency

Opportunistic Allocation Tasks with small remaining work loads get priority

Outcomes... Yardstick for success =? One meaningful measure involves the relative number of tasks completed successfully and the number that failed The “success ratio” is fairly consistent for most strategies over several runs:

Outcomes...