Journal article Open Access

Graph Laplacian Diffusion Localization of Connected and Automated Vehicles

Piperigkos, Nikos; Lalos S., Aris; Berberidis, Kostas

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Piperigkos, Nikos</dc:creator>
  <dc:creator>Lalos S., Aris</dc:creator>
  <dc:creator>Berberidis, Kostas</dc:creator>
  <dc:description>In this paper, we design distributed multi-modal localization approaches for Connected and Automated vehicles. We utilize information diffusion on graphs formed by moving vehicles, based on Adapt-then-Combine strategies coupled with the Least-Mean-Squares and the Conjugate Gradient algorithms. We treat the vehicular network as an undirected graph, where vehicles communicate with each other by means of Vehicle-toVehicle communication protocols. Connected vehicles perform cooperative fusion of different measurement modalities, including location and range measurements, in order to estimate both their positions and the positions of all other networked vehicles, by interacting only with their local neighborhood. The trajectories of vehicles were generated either by a well-known kinematic model, or by using the CARLA autonomous driving simulator. The proposed distributed and diffusion localization schemes significantly reduced the GPS error and do not only converged to the global solution, but they even outperformed it. Extensive simulation studies highlight the benefits of the various methods, which in turn outperform other state of the art approaches. The impact of the network connections and the network latency are also investigated.</dc:description>
  <dc:title>Graph Laplacian Diffusion Localization of Connected and Automated Vehicles</dc:title>
All versions This version
Views 4242
Downloads 5858
Data volume 303.5 MB303.5 MB
Unique views 2929
Unique downloads 5858


Cite as