Practical Approach to Evacuation Planning Via Network Flow and Deep Learning

Similar documents
Neural Networks II. Chen Gao. Virginia Tech Spring 2019 ECE-5424G / CS-5824

Attacking and defending neural networks. HU Xiaolin ( 胡晓林 ) Department of Computer Science and Technology Tsinghua University, Beijing, China

Lecture 39: Training Neural Networks (Cont d)

Performance of Fully Automated 3D Cracking Survey with Pixel Accuracy based on Deep Learning

Lecture 5. Optimisation. Regularisation

Traffic circles. February 9, 2009

Available online at ScienceDirect. Procedia Engineering 112 (2015 ) 40 45

Optimizing Cyclist Parking in a Closed System

EVACUATION SIMULATION FOR DISABLED PEOPLE IN PASSENGER SHIP

DEVELOPMENT OF TSUNAMI REFUGE PETRI-NET SIMULATION SYSTEM UTILIZABLE IN INDEPENDENCE DISASTER PREVENTION ORGANIZATION

FORECASTING OF ROLLING MOTION OF SMALL FISHING VESSELS UNDER FISHING OPERATION APPLYING A NON-DETERMINISTIC METHOD

Mathematics of Pari-Mutuel Wagering

Basketball field goal percentage prediction model research and application based on BP neural network

knn & Naïve Bayes Hongning Wang

Mixture Models & EM. Nicholas Ruozzi University of Texas at Dallas. based on the slides of Vibhav Gogate

Uninformed search methods

Evacuation Time Minimization Model using Traffic Simulation and GIS Technology

Available online at ScienceDirect. Transportation Research Procedia 2 (2014 )

Fun Neural Net Demo Site. CS 188: Artificial Intelligence. N-Layer Neural Network. Multi-class Softmax Σ >0? Deep Learning II

Decision Trees. Nicholas Ruozzi University of Texas at Dallas. Based on the slides of Vibhav Gogate and David Sontag

Deformable Convolutional Networks

Open Research Online The Open University s repository of research publications and other research outputs

ARTIFICIAL NEURAL NETWORK BASED DESIGN FOR DUAL LATERAL WELL APPLICATIONS

Autodesk Moldflow Communicator Process settings

Predicting the Total Number of Points Scored in NFL Games

Uninformed search methods

A Chiller Control Algorithm for Multiple Variablespeed Centrifugal Compressors

ComfRide - A Smartphone based Comfortable Public Route Recommendation

In memory of Dr. Kevin P. Granata, my graduate advisor, who was killed protecting others on the morning of April 16, 2007.

CSE 3401: Intro to AI & LP Uninformed Search II

Introduction to Machine Learning NPFL 054

Urban OR: Quiz 2 Solutions (2003) ( 1 ρ 1 )( 1 ρ 1 ρ 2 ) ( 1 12 )( ) σ S ] 24 [ 2 = 60, 2 2 ] ( 2 ) 3

Journal of Chemical and Pharmaceutical Research, 2014, 6(3): Research Article

Pre-Plan Consultation Summary

THe rip currents are very fast moving narrow channels,

Designing a Traffic Circle By David Bosworth For MATH 714

Polynomial DC decompositions

Gdynia s bicycle model

A Nomogram Of Performances In Endurance Running Based On Logarithmic Model Of Péronnet-Thibault

CENG 466 Artificial Intelligence. Lecture 4 Solving Problems by Searching (II)

Write these equations in your notes if they re not already there. You will want them for Exam 1 & the Final.

Can Wind Energy Be Captured in New York City? Case Study on Urban Wind based on a Feasibility Study by Orange Line Studio. Spark 101 Educator Resource

Calculation of Trail Usage from Counter Data

Neural Nets Using Backpropagation. Chris Marriott Ryan Shirley CJ Baker Thomas Tannahill

Product Decomposition in Supply Chain Planning

Idea-66: Westbound I-66 Inside the Beltway

Applying Bi-objective Shortest Path Methods to Model Cycle Route-choice

LOCOMOTION CONTROL CYCLES ADAPTED FOR DISABILITIES IN HEXAPOD ROBOTS

Global Journal of Engineering Science and Research Management

When it is 80 degrees he will sell about 42 ice creams.

A Fault Diagnosis Monitoring System of Reciprocating Pump

A Novel Approach to Predicting the Results of NBA Matches

FIRE PROTECTION. In fact, hydraulic modeling allows for infinite what if scenarios including:

Midterm Exam 1, section 2. Thursday, September hour, 15 minutes

Intersection of Massachusetts Avenue and Maple Street in Lexington Signalized Intersection and Roundabout Comparison

The Incremental Evolution of Gaits for Hexapod Robots

Predicting Human Behavior from Public Cameras with Convolutional Neural Networks

Using sensory feedback to improve locomotion performance of the salamander robot in different environments

Massey Method. Introduction. The Process

Discrete-Event Simulation for Optimization and Planning of an Intersection

A Feasibility Study on a New Trimaran PCC in Medium Speed

Jasmin Smajic 1, Christian Hafner 2, Jürg Leuthold 2, March 16, 2015 Introduction to Finite Element Method (FEM) Part 1 (2-D FEM)

Wind Flow Model of Area Surrounding the Case Western Reserve University Wind Turbine

Outline. Wind Turbine Siting. Roughness. Wind Farm Design 4/7/2015

CS249: ADVANCED DATA MINING

The system design must obey these constraints. The system is to have the minimum cost (capital plus operating) while meeting the constraints.

Lesson 14: Modeling Relationships with a Line

DEEP LEARNING FOR LONG-TERM VALUE INVESTING

AUTHORS ABSTRACT. Changes in the step width, step length, and step frequency of the world s top sprinters during the 100 metres

Uninformed search methods II.

Below are the graphing equivalents of the above constraints.

Visual Traffic Jam Analysis Based on Trajectory Data

Gait Recognition. Yu Liu and Abhishek Verma CONTENTS 16.1 DATASETS Datasets Conclusion 342 References 343

Heart Rate Prediction Based on Cycling Cadence Using Feedforward Neural Network

Combined impacts of configurational and compositional properties of street network on vehicular flow

Cabrillo College Transportation Study

Mission-Geneva Transportation Study Community Workshop 2 July 8, 2006

The Mathematics of Gambling

Application of Simulation Technology to Mitsubishi Air Lubrication System

The Multilayer Temporal Network of Public Transport in Great Britain

Road Data Input System using Digital Map in Roadtraffic

Author s Name Name of the Paper Session. Positioning Committee. Marine Technology Society. DYNAMIC POSITIONING CONFERENCE September 18-19, 2001

Combined neural network and numerical modeling for extreme storm surges

Estimating the Probability of Winning an NFL Game Using Random Forests

TIME-ON-TIME SCORING

UAID: Unconventional Arterial Intersection Design

Navigate to the golf data folder and make it your working directory. Load the data by typing

Lesson 22: Average Rate of Change

Light Rail Transit in North Central Calgary Open House and Workshop Summary. Summer 2013

Problem Solving Agents

Bayesian Methods: Naïve Bayes

Lecture 10. Support Vector Machines (cont.)

BHATNAGAR. Reducing Delay in V2V-AEB System by Optimizing Messages in the System

ACCURATE PRESSURE MEASUREMENT FOR STEAM TURBINE PERFORMANCE TESTING

Introduction to Pattern Recognition

Use of Auxiliary Variables and Asymptotically Optimum Estimators in Double Sampling

intended velocity ( u k arm movements

Planning and Acting in Partially Observable Stochastic Domains

Application of Dijkstra s Algorithm in the Evacuation System Utilizing Exit Signs

Real-time Analysis of Industrial Gases with Online Near- Infrared Spectroscopy

Transcription:

Practical Approach to Evacuation Planning Via Network Flow and Deep Learning Akira Tanaka Nozomi Hata Nariaki Tateiwa Katsuki Fujisawa Graduate School of Mathematics, Kyushu University Institute of Mathematics for industry, Kyushu University December 11, 2017 2017 BigGraphs Workshop at IEEE BigData17

Evacuation Map Yodogawa Area in Osaka City #nodes : 2,933 #edges : 8,924 Based on #evacuees : 50,000 ~ 80,000 midnight population #shelters with finite capacity : 36 (total volume:35,549) with infinite capacity : 50 (each volume: ) Higher Grounds Tall and Strong Buildings shelter without Capacity shelter with Capacity Higher Grounds Volume: Osaka City Yodogawa Area A Public Housing Volume : 77

Lexicographically Quickest Flow(LQF) Definition Minimizes the evacuation time Θ Greedily maximize the cumulative number of evacuees who have already completed evacuation at every time θθ in the order of θθ = 1,2,.., Θ Evacuation Completion (%) LQF Quickest Flow Time

Lexicographically Quickest Flow(LQF) Evacuation Completion (%) LQF Quickest Flow Time

Lexicographically Quickest Flow(LQF) Practical Property The LQF also has a high efficiency with respect to total pedestrian flow of all evacuees to the refuges To check this property, we decomposed the LQF into cyclic flow and cycle-free flow by solving the QP below: Flow Cyclic Flow (only 2 cycles remained) where is the total refuges that passed the arc

Visualization of LQF Spots will vanish when the corresponding evacuees reach shelters constant Movement of evacuees are expressed with HSV color model Hue direction of movement Saturation speed of movement Value congestion of arc

Lexicographically Quickest Flow (LQF) Cons Not practical(7h for the target area) Compute the maximum flow repeatedly for the time-expanted graph. Size of time-expanded graph is huge To utilize practical property of LQF, we combine it with Deep Learning

Normal Time Population Distribution LQF Movements of Each Evacuee Evacuation Completion Time(ECT)

Normal Time Population Distribution LQF Movements of Each Evacuee Evacuation Completion Time(ECT) Preprocessing Techniques = Training

Preprocessing Techniques = Predicting Evacuation Completion Time(ECT) Movements of Each Evacuee Cameras Censors Emergency

1 Preprocessing Techniques = 2 Predicting 3

Convolutional Neural Network(CNN) Input The number of evacuees moving in specific direction/pausing Output Evacuation Completion Time(ECT) = WW CC 4 Convolutional and 2 Fully Connected Layers Convolutional Layer Max Pooling Layer Fully Connected Layer

Optimizer and Output of CNN yy ii 2 Euclidean Loss (cost function) 1 NN 2NN ii=1 yy ii 1 yy ii 2 2 yy ii 1 :Accuare output(lqf_t) yy ii 2 :Predicting output NN:data size

Optimizer and Output of CNN yy ii 2 Euclidean Loss (cost function) 1 NN 2NN ii=1 yy ii 1 yy ii 2 2 yy ii 1 :Accuare output(lqf_t) yy ii 2 :Predicting output NN:data size Adam(optimizer) First-order gradient-based optimization feasible to compute in practice for high-dimensional data Storing exponentially decaying average of past gradient and squared gradient Large updates for infrequent and smaller updates for frequent accelerate learning

Optimizer and Output of CNN Accurate =2,716 Accurate =2,000 yy ii 2 Euclidean Loss (cost function) 1 NN 2NN ii=1 yy ii 1 yy ii 2 2 yy ii 1 :Accuare output(lqf_t) yy ii 2 :Predicting output NN:data size Predicting:2636 Error:80(2.9%) Accurate =1,700 Predicting:1741 Error:41(1.5%) Predicting:2036 Error:36(1.3%) Accurate =1,000 Predicting:1038 Error:38(1.4%) Error := Accurate Predicting (Error / 2,751) Note: 2,751 is the average evacuation time Adam(optimizer) First-order gradient-based optimization feasible to compute in practice for high-dimensional data Storing exponentially decaying average of past gradient and squared gradient Large updates for infrequent and smaller updates for frequent accelerate learning

Results of Our Model Data #Training Data: 43,200 #Test Data: 5,400 90% probability that we make prediction within 3.6% error 90% 99% 6.5% 3.6% Cumulative Probabilities

Results of Our Model Data #Training Data: 43,200 #Test Data: 5,400 Average error(55s 2%) is quite a small 90% probability that we make prediction within 3.6% error Prediction for the early stage is better than that for the final stage 90% 99% 6.5% 3.6% Cumulative Probabilities Average Error in Several Stages of Evacuation

Summary Previous Model(LQF) Not practical(7h) Compute max-flow repeatedly for time-expanded graph Time-expanded graph is huge Proposed Model Practical (less than 1s) Combing LQF and CNN Predict evacuation completion time immediately(less than 1s) and almost accurately(2%)