2021IEEE Transactions on Intelligent Transportation SystemsRequires access

Controllable Path Planning and Traffic Scheduling for Emergency Services in the Internet of Vehicles

Van-Linh Nguyen, Ren‐Hung Hwang, Po‐Ching Lin

Open publisher page 57 citations

Abstract

Dispatching emergency vehicles (EVs) to fatal accidents or fires as fast as possible is vital to save lives; however, minimizing an EV’s travel time to the rescue spot is still an open challenge. This work presents a path planning and traffic clear-out scheduling scheme to lessen the EV’s travel time in the vision of the Internet of Vehicles (IoV). Initially, the system searches a list of candidate paths to the rescue spot with the estimated time of arrival (ETA) at the EVs’ maximum speed, regardless of the traffic conditions. After that, a vehicle clear-out process evaluates the delay time of clearing out the traffic obstacles on each path to identify the fastest driving path. Finally, the system estimates and issues the signal preemption schedules for the junctions of the selected route to coordinate the traffic flows and let the EV pass through smoothly. From the macro perspective, this work seeks tocontrol the dynamic traffic proactively to reserve a lane for the EV– a feasible approach in the future of connected vehicles. This controllable model apparently contrasts with the conventional techniques of finding the least-cost paths with the uncertainty of traffic state prediction or traffic light preemption alone at the intersections. The simulation shows that our approach can outperform the state-of-the-art solutions in terms of the EV’s travel time reduction, particularly if the congestion or heavy load road segments appear on the selected route but far from the departure location of the EV.

About this research paper

What this paper is about

Dispatching emergency vehicles (EVs) to fatal accidents or fires as fast as possible is vital to save lives; however, minimizing an EV’s travel time to the rescue spot is still an open challenge. This work presents a path planning and traffic clear-out scheduling scheme to lessen the EV’s travel time in the vision of the Internet of Vehicles (IoV). Initially, the system searches a list of candidate paths to the rescue spot with the estimated time of arrival (ETA) at the EVs’ maximum speed, regardless of the traffic conditions. After that, a vehicle clear-out process evaluates the delay time of clearing out the traffic obstacles on each path to identify the fastest driving path. Finally, the system estimates and issues the signal preemption schedules for the junctions of the selected route to coordinate the traffic flows and let the EV pass through smoothly. From the macro perspective, this work seeks tocontrol the dynamic traffic proactively to reserve a lane for the EV– a feasible approach in the future of connected vehicles. This controllable model apparently contrasts with the conventional techniques of finding the least-cost paths with the uncertainty of traffic state prediction or traffic light preemption alone at the intersections. The simulation shows that our approach can outperform the state-of-the-art solutions in terms of the EV’s travel time reduction, particularly if the congestion or heavy load road segments appear on the selected route but far from the departure location of the EV.

Why it matters

OpenAlex reports 57 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Dispatching emergency vehicles (EVs) to fatal accidents or fires as fast as possible is vital to save lives; however, minimizing an EV’s travel time to the rescue spot is still an open challenge. This work presents a path planning and traffic clear-out scheduling scheme to lessen the EV’s travel time in the vision of the Internet of Vehicles (IoV). Initially, the system searches a list of candidate paths to the rescue spot with the estimated time of arrival (ETA) at the EVs’ maximum speed, regardless of the traffic conditions. After that, a vehicle clear-out process evaluates the delay time of clearing out the traffic obstacles on each path to identify the fastest driving path. Finally, the system estimates and issues the signal preemption schedules for the junctions of the selected route to coordinate the traffic flows and let the EV pass through smoothly. From the macro perspective, this work seeks tocontrol the dynamic traffic proactively to reserve a lane for the EV– a feasible approach in the future of connected vehicles. This controllable model apparently contrasts with the conventional techniques of finding the least-cost paths with the uncertainty of traffic state prediction or traffic light preemption alone at the intersections. The simulation shows that our approach can outperform the state-of-the-art solutions in terms of the EV’s travel time reduction, particularly if the congestion or heavy load road segments appear on the selected route but far from the departure location of the EV.

Key concepts: Scheduling (production processes), The Internet, Computer science, Transport engineering, Motion planning, Computer network, Engineering, Operations management

Related papers

Back to paper searchBrowse research topicsOriginal source
Controllable Path Planning and Traffic Scheduling for Emergency Services in the Internet of Vehicles — Research Paper | ScholarLens