Existing Simulator.

Slides:



Advertisements
Similar presentations
CSE 380 – Computer Game Programming Pathfinding AI
Advertisements

Fire Marshall Tool Box Training Jo Smith – Safety, Health and Environment Manager Claire Doran Paula Evans Room A132 Ext: 3334/3432 Mobile:
Cellular Automaton Evacuation Model Coupled with a Spatial Game Anton von Schantz, Harri Ehtamo
John S Gero Agents – Agent Simulations AGENT-BASED SIMULATIONS.
Brent Dingle Marco A. Morales Texas A&M University, Spring 2002
WATER FOR FIRE PROTECTION (Chapter 26) Basic factors of fire – Rapid oxidation of combustible materials – A combination of oxygen, fuel, and heat is required.
Company Enterprise Risk Management & Stress Testing Case Study.
Simulation Waiting Line. 2 Introduction Definition (informal) A model is a simplified description of an entity (an object, a system of objects) such that.
Emergency Preparedness Overview 550 West Jackson.
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
DARPA Mobile Autonomous Robot SoftwareLeslie Pack Kaelbling; March Adaptive Intelligent Mobile Robotics Leslie Pack Kaelbling Artificial Intelligence.
Changing Perspective From Structured to Object-oriented.
Regional Traffic Simulation/Assignment Model for Evaluation of Transit Performance and Asset Utilization April 22, 2003 Athanasios Ziliaskopoulos Elaine.
Penn ESE370 Fall DeHon 1 ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 26: October 31, 2014 Synchronous Circuits.
Group 8: Denial Hess, Yun Zhang Project presentation.
SD modeling process One drawback of using a computer to simulate systems is that the computer will always do exactly what you tell it to do. (Garbage in.
Wouter G. van Toll Atlas F. Cook IV Roland Geraerts Realistic Crowd Simulation with Density-Based Path Planning ICT.OPEN / ASCI October 22nd, 2012.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Behavioral Animation: Crowds.
1 Learning through Interactive Behavior Specifications Tolga Konik CSLI, Stanford University Douglas Pearson Three Penny Software John Laird University.
STAR Webinars Ontology driven diagram generator for health simulation models Andrew Sutcliffe.
Traffic Models Alaa Hleihel Daniel Mishne /32.
Chapter 6 technology institute of HAVC from usst INDUSTRIAL VENTILATION TUTORIAL 王丽慧.
+ Dynamic Routing Protocols 2 nd semester
Kapitel 19: Routing. Kapitel 21: Routing Protocols
Crowd Modelling & Simulation
Instructor Materials Chapter 5: Dynamic Routing
Introduction to Spatial Computing CSE 5ISC
Announcements Homework 1 Full assignment posted..
Data Structures: Disjoint Sets, Segment Trees, Fenwick Trees
Routing Protocols (RIP, OSPF, and BGP)
WORKSHOP 10 ANNULAR PLATE
What Are Routers? Routers are an intermediate system at the network layer that is used to connect networks together based on a common network layer protocol.
Artificial Intelligence and Society
Thrust IC: Action Selection in Joint-Human-Robot Teams
Theo Gutman-Solo.
Intelligent Agents Chapter 2.
Chapter 5: Dynamic Routing
Software Engineering Chapter 5 (Part 3) System Modeling Dr.Doaa Sami.
On Using Linearly Priced Timed Automata for Flow Analysis
Object-Oriented Analysis
Interactions.
Lecture Software Process Definition and Management Chapter 3: Descriptive Process Models Dr. Jürgen Münch Fall
The connected word recognition problem Problem definition: Given a fluently spoken sequence of words, how can we determine the optimum match in terms.
Modelling a Process using Process Flow Analysis
Navigation In Dynamic Environment
DrillSim July 2005.
إعداد المشرفة التربوية نجلاء الجارد
Stat 414 – Day 15 Exam 1 Review.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
The Shortest Augmenting Path Algorithm for the Maximum Flow Problem
Unified Modeling Language
15.082J & 6.855J & ESD.78J Visualizations
15.082J & 6.855J & ESD.78J Visualizations
Lecture 6 Shortest Path Problem.
Networks and Shortest Paths
Robot Motion Planning Project
NSIS Operation Over IP Tunnels draft-ietf-nsis-tunnel-04.txt
Evacuation Simulator Project
Primal-Dual Algorithm
Connected Word Recognition
Ch 7.1: Using a Spatial Database for Runtime Spatial Analysis
Character Strong—February 20
Dijkstra’s Algorithm for Shortest Paths
The Shortest Augmenting Path Algorithm for the Maximum Flow Problem
The Shortest Augmenting Path Algorithm for the Maximum Flow Problem
and 6.855J Dijkstra’s Algorithm
Visualizations Dijkstra’s Algorithm
15.082J & 6.855J & ESD.78J Visualizations
The Virtual Cell Project
15.082J & 6.855J & ESD.78J Visualizations
Presentation transcript:

Existing Simulator

Limitations Static Scenario, no crisis scenario Assumption: every agent knows everything No different roles No room for IT solutions No interaction between agents

Simeva: a testbed for IT solution A platform to test effectiveness of information technology solutions for crisis response Dynamic scenario, driven by Crisis simulation Multi-roles autonomous agents Floor Warden, General Public, Fire Fighter, … Information technology incorporated Agents could either be controlled by computer programs or alternatively by human participants.

Map representation

Agent’s Position It is necessary to keep trace of the Position of an Agent mainly in two situations: When the Agents starts the assigned Evacuation Plan, he could be everywhere inside a room, so the distance between the Agent and each door of the room has to be calculated In his way towards the Exit, the Agent could change his mind or he could receive an Information with an updated Evacuation Plan; also in this case the distance between the Agent and the new door he has to pass through has to be calculated

Example 1

Example 2

Alghoritms Which alghoritm should be used to compute the best path for an Agent? It is correct to consider not only the distance, but also the occupancy: a path could be longer but faster due to a different occupancy Possibilities: Shortest-path Min-Max Flow Shortest-path which works not with distances, but with a factor which combines both the aspects (e.g. the ratio between the occupancy and the distance)

Alghoritms In any case, different alghoritms should be assigned to different Agents: so an Agent could behave in a different way accordingly to the alghoritm through which his Evacuation Plan is calculated The choice of the alghoritm should also depend upon the environment: for a building full of people, it could be reasonable to follow a Min-max flow model

Static Structure

Static Structure