29 September 2023 in IEEE Transactions on Automation Science and Engineering
This article investigates the autonomous exploration problem of an unmanned aerial vehicle (UAV) in a fully unknown three-dimensional (3D) space, subject to the constraints of collision avoidance, energy-saving, and computation consumption. To tackle this problem, a hybrid planning algorithm named FSHP is proposed. The algorithm consists of a novel local planner designed to explore unknown space within the onboard camera’s field of view (FoV) faster and less computationally. The local planner is a combination of the frontier-based and sampling-based methods, overcoming the bottlenecks of high computational time for the former and non-heuristics for the latter. Furthermore, the algorithm incorporates a global planner based on historical information to enhance performance in larger and more complex scenarios. The global planner includes a historical road map (HRM) using the rapidly-exploring random tree (RRT) and a historical tree (HST) based on the k-dimension (k-d) tree, built simultaneously. When no informative viewpoints are nearby, the planner replans trajectories globally to unexplored space. Finally, the proposed approach is evaluated in both simulations and real-world experiments, demonstrating the effectiveness and efficiency of the FSHP. Note to Practitioners —The motivation of this paper stems from the need to develop a fast and efficient autonomous exploration algorithm for a UAV for practical applications such as 3D reconstruction, search-and-rescue and military reconnaissance. Frontier-based and sampling-based methods are widely used to solve this problem due to their heuristics and low computational effort, respectively. However, either method can not meet the requirements related to exploration efficiency arising from increasingly complex and diverse tasks. To speed up the exploration process, reduce the exploration time and shorten the exploration path length, we propose this new method FSHP. It combines the advantages of global exploration (frontier-based methods) and local exploration (sampling-based methods) with random sampling in the frontiers. Furthermore, the replanning target selection and waypoints optimization schemes helps in reducing the path. Overall, this novel framework, FSHP, enables efficient and effective autonomous exploration tasks.
23 March 2026 in IEEE Transactions on Geoscience and Remote Sensing
This paper investigates the accurate positioning problem of a magnetic target in full space. The commonly used positioning approaches rely on the classical scalar triangulation and ranging (STAR) method based on the magnetic gradient tensor (MGT). In these STAR-based approaches, the MGT is approximated by the sensor differentials, which introduces ineliminable errors into the positioning results. To improve the localization accuracy, an iterative differential errors compensation positioning (DECP) method is proposed in this paper. The DECP method establishes the error compensation models for the MGT and the gradient of the tensor invariant, and iteratively updates the target’s position and magnetic moment to approach the true values. The proposed method is evaluated in both simulations and real-world experiments. The simulation results show that the positioning errors of the DECP method is much smaller than those of four STAR-based benchmark methods, and it is able to improve the positioning accuracy by 42.4% − 86.5% in different field experiments, which demonstrates the effectiveness and robustness of the proposed method.
12 November 2025 in IEEE/ASME Transactions on Mechatronics
This article investigates the positioning problem of a rotating permanent-magnet mechanical antenna (PMMA) in global-navigation-satellite-system-denied environments. The state-of-the-art positioning method for a PMMA is based on the particle swarm optimization (PSO) algorithm, which is only applicable to antennas in the first octant and would require much time for computation. To overcome this bottleneck, a linear single-point positioning (LSPP) method is proposed. The LSPP is capable of adequately utilizing both the amplitude and phase information of the measured data, thus enabling the localization in the half-space. Furthermore, the property of linear computation makes the positioning process faster and has superior real-time performance. Finally, the proposed method is evaluated in both simulation and real-world experiments. The results indicate that in the upper half-space, the average positioning error of the LSPP is 2-3% of that of the PSO-based method, and its average positioning time is 0.2–1.7% of that of the latter, demonstrating the effectiveness and efficiency of the LSPP method.
28 October 2025 in IEEE/ASME Transactions on Mechatronics
This article investigates the problem of 6-degree-of-freedom (6-DoF) pose estimation of a quadrotor unmanned aerial vehicle (UAV) based on a rotating permanent magnet mechanical antenna (PMMA) under constrained environments where traditional localization systems have failed. The state-of-the-art PMMA-based localization method requires that the axial direction of the mechanical antenna be vertical, and are, therefore, not suitable for UAVs with unknown attitudes during flight. To address this limitation, we propose a novel pose estimation method utilizing two parallel magnetometers. The amplitude and phase models of the magnetic field radiated by the PMMA in the sensor coordinate system are derived, and the position and axial direction constraints are defined based on the physical flight characteristics of the UAV. Based on this, the objective function is established, and the problem is solved using the particle swarm optimization algorithm. Finally, the proposed method is evaluated in simulations and real-world experiments. The simulations show that the proposed method has a mean estimation error of 0.1% under noise-free scenarios. Moreover, the mean position error is reduced by 93.69% over the benchmark Cui’s localization method in field experiments. These indicate that the proposed method is a powerful complement in multisource navigation for a UAV.
11 December 2025 in IEEE Transactions on Instrumentation and Measurement
This paper addresses the simultaneous localization problem of multiple magnetic dipole sources distributed at varying heights in space. To overcome the limitations of traditional optimization-based methods, which are time-consuming and prone to local optima, we propose a fast multi-dipole linear localization (MDLL) method. After performing 2D grid measurements, the MDLL method first determines the number of magnetic sources, their initial positions, and magnetic moments by calculating the magnetic gradient tensor and tilt angle. It then filters effective measurement points for each source using the Voronoi diagram and iteratively refines the results through a single-source linear localization scheme to approach the true values. The simulation and experimental results demonstrate that the MDLL method significantly outperforms the benchmark one-step localization (OSL) and differential evolution (DE) methods in both localization accuracy and computational efficiency. In noise-free simulations, the localization error of MDLL is reduced by over 99% compared to OSL and DE, and its computation speed is more than 20,000 times faster than DE in the scenario with 30 magnetic sources, with the advantage becoming more evident as the number of sources increases. In experiment, the average localization error of MDLL are only 4.55% and 36.94% of that of OSL and DE methods, respectively, and its computation time remains significantly shorter than that of the DE method.