Maximum likelihood localization of a network of moving agents from ranges, bearings and velocity measurements

Localization is a fundamental enabler technology for many applications, like vehicular networks, IoT, and even medicine. While Global Navigation Satellite Systems solutions offer great performance, they are unavailable in scenarios like indoor or underwater environments, and, for large networks, the instrumentation cost is prohibitive. We develop a localization algorithm from ranges and bearings, suitable for generic mobile networks. Our algorithm is built on a tight convex relaxation of the Maximum Likelihood position estimator. To serve positioning to mobile agents, a horizon-based version is developed accounting for velocity measurements at each agent. To solve the convex problem, a distributed gradient-based method is provided. This constitutes an advantage over centralized approaches, which usually exhibit high latency for large networks and present a single point of failure. Additionally, the algorithm estimates all required parameters and effectively becomes parameter-free. Our solution to the dynamic network localization problem is theoretically well-founded and still easy to understand. We obtain a parameter-free, outlier-robust and trajectory-agnostic algorithm, with nearly constant positioning error regardless of the trajectories of agents and anchors, achieving better or comparable performance to state-of-the-art methods, as our simulations show. Furthermore, the method is distributed, convex and does not require any particular anchor configuration. • Cooperative localization for mobile networks from range, bearing and velocity measurements. • Maximum Likelihood formulation followed by a convex relaxation maintains performance despite of initialization. • Distributed implementation makes the algorithm scalable for large networks. • Parameter estimation step avoids the need for a priori knowledge of noise terms. • The method does not rely on a dynamical model of the system.

Access paper here

Bibtex:

@article{Valdeira_2024,
    author = "Valdeira, Filipa and Soares, Cláudia and Gomes, João",
    title = "Maximum likelihood localization of a network of moving agents from ranges, bearings and velocity measurements",
    volume = "221",
    ISSN = "0165-1684",
    url = "http://dx.doi.org/10.1016/j.sigpro.2024.109471",
    DOI = "10.1016/j.sigpro.2024.109471",
    journal = "Signal Processing",
    publisher = "Elsevier BV",
    year = "2024",
    month = "Aug",
    pages = "109471",
    abstract = "Localization is a fundamental enabler technology for many applications, like vehicular networks, IoT, and even medicine. While Global Navigation Satellite Systems solutions offer great performance, they are unavailable in scenarios like indoor or underwater environments, and, for large networks, the instrumentation cost is prohibitive. We develop a localization algorithm from ranges and bearings, suitable for generic mobile networks. Our algorithm is built on a tight convex relaxation of the Maximum Likelihood position estimator. To serve positioning to mobile agents, a horizon-based version is developed accounting for velocity measurements at each agent. To solve the convex problem, a distributed gradient-based method is provided. This constitutes an advantage over centralized approaches, which usually exhibit high latency for large networks and present a single point of failure. Additionally, the algorithm estimates all required parameters and effectively becomes parameter-free. Our solution to the dynamic network localization problem is theoretically well-founded and still easy to understand. We obtain a parameter-free, outlier-robust and trajectory-agnostic algorithm, with nearly constant positioning error regardless of the trajectories of agents and anchors, achieving better or comparable performance to state-of-the-art methods, as our simulations show. Furthermore, the method is distributed, convex and does not require any particular anchor configuration. • Cooperative localization for mobile networks from range, bearing and velocity measurements. • Maximum Likelihood formulation followed by a convex relaxation maintains performance despite of initialization. • Distributed implementation makes the algorithm scalable for large networks. • Parameter estimation step avoids the need for a priori knowledge of noise terms. • The method does not rely on a dynamical model of the system."
}