High-accuracy localization is vital for many applications and is a fundamental prerequisite for enabling autonomous missions. Modern navigation systems often rely heavily on Global Navigation Satellite Systems (GNSS) for achieving high localization accuracy over extended periods of time, which has necessitated alternative localization methods that can be used in GNSS-disturbed environments. One popular alternative that has emerged is Collaborative Localization (CL), which is a method where agents of a swarm combine knowledge of their own state with relative measurements of other agents to achieve a localization accuracy that is better than what a single agent can achieve on its own. Performing this in a decentralized manner introduces the challenge of how to account for unknown inter-agent correlations, which typically leads to the need for using conservative fusion methods such as Covariance Intersection (CI) to preserve consistency. Many existing CL algorithms that utilize CI assume agents to have perception systems capable of identifying the relative position of other swarm members. These algorithms do therefore not work in systems where, e.g., agents are only capable of measuring range to each other. Other CI algorithms that support more generic measurement models can require large amounts of data to be exchanged when agents communicate, which could lead to issues in bandwidth-limited systems. This thesis develops a consistent decentralized collaborative localization algorithm based on CI that supports range-only measurements between agents and requires a communication effort that is constant in the number of agents in the swarm. The algorithm, referred to as the PSCI algorithm, was found to maintain satisfactory performance in various scenarios but exhibits slightly increased sensitivity to the measurement geometry compared to an already existing, more communication-heavy, CI-based algorithm. Moreover, the thesis highlights the impact of linearization errors in range-only CL systems and shows that performing CI-fusion before the range-observation measurement update, with a clever choice of CI cost function, can reduce linearization errors for the PSCI algorithm. A comparison between the PSCI algorithm and an already existing algorithm, referred to as the Cross-Covariance Approximation (CCA) algorithm, has further been conducted through a sensitivity analysis with respect to communication rate and the number of GNSS agents. The simulation results indicate that the PSCI algorithm exhibits diminishing improvement in Root Mean Square Error (RMSE) with increased communication rates, while the RMSE of the CCA algorithm reaches a local minimum, subsequently showing overconfidence with higher rates. Lastly, evaluation under a varying number of GNSS agents indicates that cooperative benefits for the PSCI filter are marginal when uncertainty levels are uniform across agents. However, the PSCI algorithm demonstrates superior performance improvements with an increased number of GNSS agents compared to the CCA algorithm, attributed to the overconfidence of the latter.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:liu-204900 |
| Date | January 2024 |
| Creators | Sjödahl Wennergren, Erik, Lundberg, Björn |
| Publisher | Linköpings universitet, Reglerteknik |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0026 seconds