Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNon-Centralized Navigation for Source Localization by Cooperative UAVs
97
0
0.0
(
0
)
Added by
Anna Guerra
Publication date
2019
fields
Electronic Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, we propose a distributed solution to the navigation of a population of unmanned aerial vehicles (UAVs) to best localize a static source. The network is considered heterogeneous with UAVs equipped with received signal strength (RSS) sensors from which it is possible to estimate the distance from the source and/or the direction of arrival through ad-hoc rotations. This diversity in gathering and processing RSS measurements mitigates the loss of localization accuracy due to the adoption of low-complexity sensors. The UAVs plan their trajectories on-the-fly and in a distributed fashion. The collected data are disseminated through the network via multi-hops, therefore being subject to latency. Since not all the paths are equal in terms of information gathering rewards, the motion planning is formulated as a minimization of the uncertainty of the source position under UAV kinematic and anti-collision constraints and performed by 3D non-linear programming. The proposed analysis takes into account non-line-of-sight (NLOS) channel conditions as well as measurement age caused by the latency constraints in communication.
rate research
Read More
In this paper, we propose a joint indoor localization and navigation algorithm to enable a swarm of unmanned aerial vehicles (UAVs) to deploy in a specific spatial formation in indoor environments. In the envisioned scenario, we consider a static user acting as a central unit whose main task is to acquire all the UAV measurements carrying position-dependent information and to estimate the UAV positions when there is no existing infrastructure for positioning. Subsequently, the user exploits the estimated positions as inputs for the navigation control with the aim of deploying the UAVs in a desired formation in space (formation shaping). The user plans the trajectory of each UAV in real time, guaranteeing a safe navigation in the presence of obstacles. The proposed algorithm guides the UAVs to their desired final locations with good accuracy.
Localization is a fundamental function in cooperative control of micro unmanned aerial vehicles (UAVs), but is easily affected by flip ambiguities because of measurement errors and flying motions. This study proposes a localization method that can avoid the occurrence of flip ambiguities in bounded distance measurement errors and constrained flying motions; to demonstrate its efficacy, the method is implemented on bilateration and trilateration. For bilateration, an improved bi-boundary model based on the unit disk graph model is created to compensate for the shortage of distance constraints, and two boundaries are estimated as the communication range constraint. The characteristic of the intersections of the communication range and distance constraints is studied to present a unique localization criterion which can avoid the occurrence of flip ambiguities. Similarly, for trilateration, another unique localization criterion for avoiding flip ambiguities is proposed according to the characteristic of the intersections of three distance constraints. The theoretical proof shows that these proposed criteria are correct. A localization algorithm is constructed based on these two criteria. The algorithm is validated using simulations for different scenarios and parameters, and the proposed method is shown to provide excellent localization performance in terms of average estimated error. Our code can be found at: https://github.com/QingbeiGuo/AFALA.git.
Scalable and decentralized algorithms for Cooperative Self-localization (CS) of agents, and Multi-Target Tracking (MTT) are important in many applications. In this work, we address the problem of Simultaneous Cooperative Self-localization and Multi-Target Tracking (SCS-MTT) under target data association uncertainty, i.e., the associations between measurements and target tracks are unknown. Existing CS and tracking algorithms either make the assumption of no data association uncertainty or employ a hard-decision rule for measurement-to-target associations. We propose a novel decentralized SCS-MTT method for an unknown and time-varying number of targets under association uncertainty. Marginal posterior densities for agents and targets are obtained by an efficient belief propagation (BP) based scheme while data association is handled by marginalizing over all target-to-measurement association probabilities. Decentralized single Gaussian and Gaussian mixture implementations are provided based on average consensus schemes, which require communication only with one-hop neighbors. An additional novelty is a decentralized Gibbs mechanism for efficient evaluation of the product of Gaussian mixtures. Numerical experiments show the improved CS and MTT performance compared to the conventional approach of separate localization and target tracking.
We present a deep learning solution to the problem of localization of magnetoencephalography (MEG) brain signals. The proposed deep model architectures are tuned for single and multiple time point MEG data, and can estimate varying numbers of dipole sources. Results from simulated MEG data on the cortical surface of a real human subject demonstrated improvements against the popular RAP-MUSIC localization algorithm in specific scenarios with varying SNR levels, inter-source correlation values, and number of sources. Importantly, the deep learning models had robust performance to forward model errors and a significant reduction in computation time, to a fraction of 1 ms, paving the way to real-time MEG source localization.
Source localization plays a key role in many applications including radar, wireless and underwater communications. Among various localization methods, the most popular ones are Time-Of-Arrival (TOA), Time-Difference-Of-Arrival (TDOA), and Received Signal Strength (RSS) based. Since the Cram{e}r-Rao lower bounds (CRLB) of these methods depend on the sensor geometry explicitly, sensor placement becomes a crucial issue in source localization applications. In this paper, we consider finding the optimal sensor placements for the TOA, TDOA and RSS based localization scenarios. We first unify the three localization models by a generalized problem formulation based on the CRLB-related metric. Then a unified optimization framework for optimal sensor placement (UTMOST) is developed through the combination of the alternating direction method of multipliers (ADMM) and majorization-minimization (MM) techniques. Unlike the majority of the state-of-the-art works, the proposed UTMOST neither approximates the design criterion nor considers only uncorrelated noise in the measurements. It can readily adapt to to different design criteria (i.e. A, D and E-optimality) with slight modifications within the framework and yield the optimal sensor placements correspondingly. Extensive numerical experiments are performed to exhibit the efficacy and flexibility of the proposed framework.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
