Cooperative relative navigation of anchorless network

How can network of mobile nodes cooperatively localize, synchronize and orient themselves? This is a fundamental challenge in various systems including, space-based arrays, under-water network deployments, indoor localization and drone swarms. The key challenge here is to exploit the two-way communication between the nodes, and to offer time-varying solutions for safe navigation of a network of mobile nodes. In this thesis, cooperative probabilistic algorithms will be developed, and both anchored (reference) and anchorless (reference-free, GPS-denied) scenarios could be explored.

Requirements

A self-motivated student with a strong background system design, linear algebra and statistical signal processing. Previous experience distributed algorithms and project related to navigation is an added plus. Advanced coding skills in MATLAB and Python (or R) is required. Strong written and verbal communication skills in English is mandatory. The expected project duration is 32 weeks.

Contact

Last modified: 2022-12-27