Routing Diverse Crowds in Emergency with Dynamic Grouping
Olumide J. Akinwande, Huibo Bi

TL;DR
This paper introduces a QoS-driven multi-path routing algorithm for emergency evacuation that dynamically groups evacuees based on their conditions, improving safety and adaptability in hazardous environments.
Contribution
It presents a novel dynamic grouping and routing algorithm inspired by Cognitive Packet Network principles, tailored for diverse evacuee needs during emergencies.
Findings
Better evacuation outcomes with multiple routing metrics.
Dynamic grouping improves adaptability to hazard changes.
Higher survival rates with the proposed method.
Abstract
Evacuee routing algorithms in emergency typically adopt one single criterion to compute desired paths and ignore the specific requirements of users caused by different physical strength, mobility and level of resistance to hazard. In this paper, we present a quality of service (QoS) driven multi-path routing algorithm to provide diverse paths for different categories of evacuees. This algorithm borrows the concept of Cognitive Packet Network (CPN), which is a flexible protocol that can rapidly solve optimal solution for any user-defined goal function. Spatial information regarding the location and spread of hazards is taken into consideration to avoid that evacuees be directed towards hazardous zones. Furthermore, since previous emergency navigation algorithms are normally insensitive to sudden changes in the hazard environment such as abrupt congestion or injury of civilians, evacuees…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOpportunistic and Delay-Tolerant Networks · Mobile Ad Hoc Networks · Evacuation and Crowd Dynamics
