Least squares (LS) estimation is simple yet effective for parameter estimation. Most real-world problems are nonlinear. In practice, nonlinear LS problems are linearized first and then solved by a linear LS estimator. However, since these methods solve a nonlinear LS problem by a linear way, there is room for improvement only if estimators being nonlinear in the original measurement. In this article, an LS approach is proposed for nonlinear LS problems, along with theoretical analysis and justification. First, for a general nonlinear measurement model with any form of noise, a unified linearization (UL) approach is proposed under certain assumptions and a linearized least squares (LLS) estimator is defined based on the UL model. Second, an augmented nonlinear least squares (ANLS) estimator is proposed based on LLS estimation. In the ANLS estimator, the original measurement is augmented by its nonlinear conversion intended to further utilize the nonlinear measurement. Moreover, we prove that the ANLS estimator outperforms LLS estimation-based estimators. Finally, the UL and the ANLS estimator are applied to source localization with time difference of arrival and/or frequency difference of arrival measurement, and a two-step ANLS localization algorithm is developed. The performance of the proposed algorithm is evaluated via simulation of some typical localization scenarios.
Cooperative localization is critical for UAV swarm operations in GNSS-denied environments. The backbone-listener scheme, using a small subset of agents as active backbone nodes and others as passive listeners, offers notable advantages in reducing communication overhead and enhancing swarm scalability. Building on this scheme, we propose a formation-constrained cooperative localization method to improve accuracy by integrating known formation geometry into the localization process. First, backbone node selection uses a formation-constrained greedy node activation (GNA) strategy with weighted distance fusion, combining measured and ideal formation distances to enable near-optimal selection aligned with formation structure. Second, listener node localization incorporates formation constraints into Chan’s algorithm, paired with angle-of-arrival (AOA) refinement, to ensure estimated positions match expected inter-agent distances. Third, global optimization uses a gradient descent-based refinement to enforce formation constraints across all agent positions. Our theoretical derivations and simulations are limited to the two-dimensional (2D) case. Simulation results validate the proposed method’s improved success rate, reliability, and stability. Its effectiveness is demonstrated across various formation types, with robust adaptability to asymmetric geometries shown to be a valuable feature for practical deployment.