Research on Autonomous and Collaborative Deployment of Massive Mobile Base Stations in High-Rise Building Fire Field.

High-rise building fires pose a serious threat to the lives and property safety of people. The lack of reliable and accurate positioning means is one of the main difficulties faced by rescuers. In the absence of prior knowledge of the high-rise building fire environment, the coverage deployment of mobile base stations is a challenging problem that has not received much attention in the literature. This paper studies the problem of the autonomous optimal deployment of base stations in high-rise building fire environments based on a UAV group. A novel problem formulation is proposed that solves the non-line-of-sight (NLOS) positioning problem in complex and unknown environments. The purpose of this paper is to realize the coverage and deployment of mobile base stations in complex and unknown fire environments. The NLOS positioning problem in the fire field environment is turned into the line-of-sight (LOS) positioning problem through the optimization algorithm. And there are more than three LOS base stations nearby at any point in the fire field. A control law which is formulated in a mathematically precise problem statement is developed that guarantees to meet mobile base stations' deployment goals and to avoid collision. Finally, the positioning accuracy of our method and that of the common method were compared under many different cases. The simulation result showed that the positioning error of a simulated firefighter in the fire field environment was improved from more than 10 m (the positioning error of the traditional method) to less than 1 m.

Fixed Point Iteration Based Algorithm for Asynchronous TOA-Based Source Localization.

This paper investigates the problem of source localization using signal time-of-arrival (TOA) measurements in the presence of unknown start transmission time. Most state-of-art methods are based on convex relaxation technologies, which possess global solution for the relaxed optimization problem. However, computational complexity of the convex optimization-based algorithm is usually large, and need CVX toolbox to solve it. Although the two stage weighted least squares (2SWLS) algorithm has very low computational complexity, its estimate performance is susceptible to sensor geometry and threshold phenomenon. A new algorithm that is directly derived from maximum likelihood estimator (MLE) is developed. The newly proposed algorithm is named as fixed point iteration (FPI); it only involves simple calculations, such as addition, multiplication, division, and square-root. Unlike state-of-the-art methods, there is no matrix inversion operation and can avoid the unstable performance incurred by singular matrix. The FPI algorithm can be easily extended to the scenario with sensor position errors. Finally, simulation results demonstrate that the proposed algorithm reaches a good balance between computational complexity and localization accuracy.

Majorization-Minimization Method for Elliptic Localization in the Absence of Transmitter Position.

This paper investigates the problem of elliptic localization in the absence of transmitter position. An efficient iterative method is developed to jointly evaluate the target and transmitter positions. Using the measurement information from the indirect paths reflected from the target and the direct paths between the transmitter and receivers, a non-convex maximum likelihood estimation (MLE) problem is formulated. Owing to the non-convex nature of the issue, we apply the majorization-minimization (MM) principle to address the MLE problem, which iteratively minimizes a convex surrogate function instead of the original objective function. Moreover, the proposed MM method is further extended to tackle a general scenario where both multiple unknown transmitters and receiver position errors are considered. Finally, numerical simulations demonstrate that the proposed MM method outperforms the state-of-the-art methods.

An Efficient NLOS Errors Mitigation Algorithm for TOA-Based Localization.

In time-of-arrival (TOA) localization systems, errors caused by non-line-of-sight (NLOS) signal propagation could significantly degrade the location accuracy. Existing works on NLOS error mitigation commonly assume that NLOS error statistics or the TOA measurement noise variances are known. Such information is generally unavailable in practice. The goal of this paper is to develop an NLOS error mitigation scheme without requiring such information. The core of the proposed algorithm is a constrained least-squares optimization, which is converted into a semidefinite programming (SDP) problem that can be easily solved by using the CVX toolbox. This scheme is then extended for cooperative source localization. Additionally, its performance is better than existing schemes for most of the scenarios, which will be validated via extensive simulation.

A Type-2 Block-Component-Decomposition Based 2D AOA Estimation Algorithm for an Electromagnetic Vector Sensor Array.

This paper investigates a two-dimensional angle of arrival (2D AOA) estimation algorithm for the electromagnetic vector sensor (EMVS) array based on Type-2 block component decomposition (BCD) tensor modeling. Such a tensor decomposition method can take full advantage of the multidimensional structural information of electromagnetic signals to accomplish blind estimation for array parameters with higher resolution. However, existing tensor decomposition methods encounter many restrictions in applications of the EMVS array, such as the strict requirement for uniqueness conditions of decomposition, the inability to handle partially-polarized signals, etc. To solve these problems, this paper investigates tensor modeling for partially-polarized signals of an L-shaped EMVS array. The 2D AOA estimation algorithm based on rank- ( L 1 , L 2 , · ) BCD is developed, and the uniqueness condition of decomposition is analyzed. By means of the estimated steering matrix, the proposed algorithm can automatically achieve angle pair-matching. Numerical experiments demonstrate that the present algorithm has the advantages of both accuracy and robustness of parameter estimation. Even under the conditions of lower SNR, small angular separation and limited snapshots, the proposed algorithm still possesses better performance than subspace methods and the canonical polyadic decomposition (CPD) method.