Routing Autonomous Emergency Vehicles in Smart Cities Using Real Time Systems Analogy: A Conceptual Model

Authors: Subash Humagain, Roopak Sinha

Proceedings of the 17th International Conference on Industrial Informatics (INDIN2019). Helsinki, Finland, IEEE Computer Society Press, pp.1097-1102
Conference paper, 6 pages, 3 figures, 1 table

Abstract: Emergency service vehicles like ambulance, fire, police etc. should respond to emergencies on time. Existing barriers like increased congestion, multiple signalized intersections, queued vehicles, traffic phase timing etc. can prevent emergency vehicles (EVs) achieving desired response times. Existing solutions to route EVs have not been successful because they do not use dynamic traffic parameters. Real time information on increased congestion, halts on road, pedestrian flow, queued vehicles, real and adaptive speed, can be used to properly actuate pre-emption and minimise the impact that EV movement can have on other traffic. Smart cities provide the necessary infrastructure to enable two critical factors in EV routing: real-time traffic data and connectivity. In addition, using autonomous vehicles (AVs) in place of normal emergency service vehicles can have further advantages in terms of safety and adaptability in smart city environments. AVs feature several sensors and connectivity that can help them make real-time decisions. We propose a novel idea of using autonomous emergency vehicles (AEVs) that can meet the critical response time and drive through a complex road network in smart cities efficiently and safely. This is achieved by considering traffic network analogous to real-time systems (RTS) where we use mixed-criticality real-time system (MCRTS) task scheduling to schedule AEVs for meeting response time.

Submitted to arXiv on 17 Jul. 2021

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.