A majority of the routing algorithms for unmanned vehicles rely on Global Positioning System (GPS) information for localization. However, disruption of GPS signals, by intention or otherwise, can render these algorithms ineffective. Known landmark information can aid localization in GPS-denied environments and cooperative localization can add more benefits to multiple vehicles. As resource constraints usually exist in practical applications, this article provides a way to optimally place additional landmarks to aid cooperative localization. Specifically, given a fleet of vehicles, a set of targets and a set of pre-planned paths for each of the vehicles, we aim to optimally place landmarks such that each of the vehicles can estimate its position and orientation by obtaining relative measurement information from at least two landmarks, and the landmark placement cost is minimized. Based on the relative position measurement graph, an integer linear program and its relaxations are presented. The performance of the proposed methodology is evaluated and compared through extensive simulation results.
Landmark Placement for Cooperative Localization and Routing of Unmanned Vehicles
2019-06-01
1728024 byte
Conference paper
Electronic Resource
English
Autonomous target detection and localization using cooperative unmanned aerial vehicles
Tema Archive | 2009
|Cooperative Localization of Unmanned Aerial Vehicles in Time-Invariant Formation
Springer Verlag | 2024
|Cooperative target localization using heterogeneous unmanned ground and aerial vehicles
Tema Archive | 2010
|Robust cooperative visual localization with experimental validation for unmanned aerial vehicles
Online Contents | 2013
|