Abstract

Accurate vehicle position is crucial to vehicular Ad-Hoc network (VANET) applications. The wildly used global navigation satellite systems (GNSS) have limited localization accuracy, especially when GNSS signals are blocked or contaminated with reflected signals. Cooperative localization based on multi-vehicle information fusion will be the core component in VANET in the near future. This paper strives to enhance the localization accuracy using the fusion of GNSS and relative range information in static scenes. The formulation following the Maximum-Likelihood strategy is a quadratic non-convex programming, which is NP-hard. An iterative localization algorithm is proposed, where an approximate quadratic programming with linear constraints is solved in each iteration. Additional inspection steps and correction step are designed to ensure the convergence and feasibility of the proposed algorithm. The theoretical analysis shows that the limit of the proposed algorithm must be a global optimal solution of the formulated problem and the mean squared error can reach the Cramér-Rao lower bound. In terms of localization accuracy, the proposed method outperforms the existing linearized weighted least-squares method and semidefinite relaxation method, while exhibiting moderate computational complexity.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call