Publications
Copyright information: personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the publisher.
Radio-Coverage-Aware Path Planning for Cooperative Autonomous Vehicles
| Publication type | Journal paper |
|---|
| Year of publication | In press |
|---|
| Authors | Giuseppe Baruffa, Luca Rugini, Francesco Binucci, Fabrizio Frescura, Paolo Banelli, and Renzo Perfetti |
|---|
| Title | Radio-Coverage-Aware Path Planning for Cooperative Autonomous Vehicles |
|---|
| Journal title | IEEE Access |
|---|
| Volume | |
|---|
| Issue | |
|---|
| Pages | |
|---|
| Editor | |
|---|
| Publisher | IEEE |
|---|
| Date | In press |
|---|
| Place | |
|---|
| ISSN number | 2169-3536 |
|---|
| ISBN number | |
|---|
| Key words | Autonomous vehicles, cooperative mapping, path planning, edge computing, task offloading, radio coverage |
|---|
| Abstract | Fleets of autonomous vehicles (AV) often are at the core of intelligent transportation scenarios for smart cities, and may require a wireless Internet connection to offload computer vision tasks to data centers located either in the edge or the cloud section of the network. Cooperation among AVs is successful when the environment is unknown, or changes dynamically, so as to improve coverage and trip time, and minimize the traveled distance.
The AVs, while mapping the environment with range-based sensors, move across the wireless coverage areas, with consequences on the experienced access bit rate, latency, and handover rate.
In this paper, we propose to modify the cost of common path planning algorithms such as Dijkstra and A*, so that the best path solution takes into account not only the traveled distance, but also the radio coverage experience. To this aim, several radio-related cost-weighting functions are introduced and tested, to assess the performance of the proposed approaches with extensive simulations. The proposed mapping algorithm can achieve a mapping error probability below $2\%$, while the proposed path-planning algorithms extend the radio coverage of the AVs, with only a limited increase in traveled distance with respect to shortest-path existing methods, such as conventional Dijkstra and A* algorithms. |
|---|
| URL | |
|---|
| DOI | |
|---|
| Other information | Also available as: G. Baruffa, L. Rugini, F. Binucci, F. Frescura, P. Banelli, and R. Perfetti, “Radio-Coverage-Aware Path Planning for Cooperative Autonomous Vehicles,” arXiv:2511.06874, Nov. 2025. |
|---|
| Paper | |
|---|