Assessment of Advanced GIS Tools for E-911 Services

Cole KelleherBenjamin PostCSCI 5980Assessment of Advanced GISTools for E-911 ServicesOutlineMotivationGoalsAssumptionsExisting GIS ApplicationsDijkstras AlgorithmFortunes AlgorithmSolutionValidity of GoalsIssues and LimitationsMotivationProliferation of location aware devicesIncrease in GIS analysisLarge potential for application of new GIS services and workflows for emergency respondersImproved response timeEfficient resource managementPost emergency response analysisGoalsIdentify potential value added GIS functionality for emergency responseIdentify infrastructure to support this functionalityVerify validity of GIS functionalityDoes it already exist?Would it be useful?AssumptionsEmergency calls collected via automated and manual methodsCall vs. triggered alarmFormal emergency types for multi-entity (Fire Dept., Police Dept., etc.) use.Use of location aware devices by emergency response personnelSmart-phones, GPS enabled laptops and receiversExisting GIS ApplicationsCrime StatPost crime analysis toolAutomatic Vehicle Location (AVL)Tracks emergency vehiclesCAD / GISESRI, AutoCADDisplay EMR locationsDisplay critical infrastructure

Dijkstras AlgorithmOverviewWell known search algorithm within CSciFinds the shortest path between two pointsCan be run on a variety of inputsGraphs both pure and weightedRastersSpeed dependent upon heap O(V) to O(E + V log V)

V = # of verticesE = # of edges

Original ran in O(V^2), fibonacci heap implementation is O(E + V log V)8Dijkstras ModificationGraphs are weighted by TimeRoad Network: road speed/distance = timeAlgorithm is modified to allow the search to run until a specified time value has been reached along each path.Once the search has reached its maxima of allowed travel time across all nodes, we receive that heap of all nodes which meet the time constraintUseful for determining time based suspect search perimeter and/or optimal route Nodes can then be placed into to buckets to prioritize search areas * fleeing vehicle * Amber Alert * Search and Rescue9Results

Results

Fortunes AlgorithmOverviewMaintain Voronoi polygons for emergency personnel to query for optimal responseFunctional for nearest entity/response team determinationThree separate sets of polygonsFire and EMTs, which are staticPolice, which would are dynamicOperates in O(n log n) timen = number of entities

AlgorithmAssumes point set is sortedRuns a sweep line across the setOnce a point is reached, calculates a parabola which forms the trailing beach lineAt the intersection of 3 beach lines, creates a vertex for one of the sets polygonsResults

Results

Results

Interview with Wayne BetcherDispatcher, Goodhue County SheriffCommittee, Sheriffs Assoc NG9-1-1Future Technology911 via text, VoIPSend/Receive videoSocial MediaUse of collected dataSpatio-Temporal analysis of patrol routes

Solution

Validity of GoalsUse of state-of-the-art technologies to support efficient emergency responseIncreased response time and delivery of spatial data relevent to the emergencyAble to meet the needs of multiple emergency entitiesRecording of spatial location data for post emergency response assessment and improvementCompatible with future crime reporting methods (text messages, social media, etc.)

Issues and LimitationsDifficult to Implement and testReal-world testing, infrastructure, input specifications, and delivery method will need to be addressedModified Dijkstras AlgorithmUnknown at this time, would likely be more useful once NG911 services are enabledCordons: Manhunts and Amber AlertsFortunes AlgorithmDifficult to assess, nature of patrol officer might prohibit closest officer from respondingExpressed need for polygons representing E911 areas, Fortunes might not be appropriate

SourcesDijkstras Algorithmhttp://en.wikipedia.org/wiki/Dijkstra's_algorithmFortunes Algorithmhttp://en.wikipedia.org/wiki/Fortune%27s_algorithmAutomatic Vehicle Locationhttp://en.wikipedia.org/wiki/Automatic_vehicle_locationNext Generation 911http://en.wikipedia.org/wiki/Next_generation_911