Indoor localization has long been a challenging task due to the complexity and dynamism of indoor environments. This paper proposes ULG-SLAM, a novel unsupervised learning and geometric-based visual SLAM algorithm for robot localizability estimation to improve the accuracy and robustness of visual SLAM. Firstly, a dynamic feature filtering based on unsupervised learning and moving consistency checks is developed to eliminate the features of dynamic objects. Secondly, an improved line feature extraction algorithm based on LSD is proposed to optimize the effect of geometric feature extraction. Thirdly, geometric features are used to optimize localizability estimation, and an adaptive weight model and attention mechanism are built using the method of region delimitation and region growth. Finally, to verify the effectiveness and robustness of localizability estimation, multiple indoor experiments using the EuRoC dataset and TUM RGB-D dataset are conducted. Compared with ORBSLAM2, the experimental results demonstrate that absolute trajectory accuracy can be improved by 95% for equivalent processing speed in walking sequences. In fr3/walking_xyz and fr3/walking_half, ULG-SLAM tracks more trajectories than DS-SLAM, and the ATE RMSE is improved by 36% and 6%, respectively. Furthermore, the improvement in robot localizability over DynaSLAM is noteworthy, coming in at about 11% and 3%, respectively.

Utilizing heterogeneous mobile sensors to actively gather information improves adaptability and reliability in extended environments. This paper presents a cooperative multi-robot multi-target search and tracking framework aimed at enhancing the efficiency of the heterogeneous sensor network and, consequently, improving overall target tracking accuracy. The concept of normalized unused sensing capacity is introduced to quantify the information a sensor is currently gathering relative to its theoretical maximum. This measurement can be computed using entirely local information and is applicable to various sensor models, distinguishing it from previous literature on the subject. It is then utilized to develop a heuristics distributed coverage control strategy for a heterogeneous sensor network, adaptively balancing the workload based on each sensor's current unused capacity. The algorithm is validated through a series of ROS and MATLAB simulations, demonstrating superior results compared to standard approaches that do not account for heterogeneity or current usage rates.

Distributed multi-target tracking is a canonical task for multi-robot systems, encompassing applications from environmental monitoring to disaster response to surveillance. In many situations the unknown distribution of the targets in a search area is non-uniform, e.g., herds of animals moving together. This paper develops a novel distributed multi-robot multi-target tracking algorithm to effectively search for and track clustered targets. There are two key features. First, there are two parallel estimators, one to provide the best guess of the current states of targets and a second to provide a coarse, long-term distribution of clusters. Second, robots use the power diagram to divide the search space between agents in a way that effectively trades off between tracking detected targets within high density areas and searching for other potential targets. Extensive simulation experiments demonstrate the efficacy of the proposed method and show that it outperforms other approaches in tracking accuracy of clustered targets while maintain good performance for uniformly distributed targets.

Modern agricultural intelligent manufacturing faces critical challenges including low automation levels, safety hazards in high-temperature processing, and insufficient production data integration. Digital twin technology and 3D printing offer promising solutions through real-time virtual–physical synchronization and customized equipment manufacturing, respectively. However, existing research exhibits significant limitations: inadequate real-time synchronization mechanisms causing delayed response, poor environmental adaptability in unstructured agricultural settings, and limited human–machine collaboration capabilities. To address these deficiencies, this study develops a digital twin-driven intelligent sorting system for 3D-printed agricultural tools, integrating an Articulated Robot Arm, 16 industrial-grade 3D printers, and the Unity3D 2024.x platform to establish a complete “printing–sorting–warehousing” digitalized production loop. Unlike existing approaches, our system achieves millisecond-level bidirectional physical–virtual synchronization, implements an adaptive grasping algorithm combining force control and thermal sensing for safe high-temperature handling, employs improved RRT-Connect path planning with ellipsoidal constraint sampling, and features AR/VR/MR-based multimodal interaction. Validation testing in real agricultural production environments demonstrates a 98.7% grasping success rate, a 99% reduction in burn accidents, and a 191% sorting efficiency improvement compared to traditional methods, providing breakthrough solutions for sustainable agricultural development and smart farming ecosystem construction.

Active information gathering is a fundamental task in multi-robot systems in agriculture, with applications in precision planting and sowing, field management and inspection, intelligent weeding and pest control, etc. Traditional distributed strategies often struggle to adapt to environments where information of interest are unevenly clustered, leading to slow detection and inefficient coverage. In this paper, we reformulate the information gathering problem as a multi-armed bandit (MAB) problem and propose a novel distributed Bernoulli Thompson Sampling algorithm. Our approach enables robots to make exploration-exploitation decisions while sharing probabilistic information across the team, thus improving global coordination without centralized control. We further combine the distributed Bernoulli Thompson Sampling policy with Lloyd’s algorithm for dynamic target tracking and introduce a goal swapping strategy to improve task allocation efficiency. Extensive simulations demonstrate that our method significantly outperforms baseline approaches in terms of search speed and target coverage, particularly in scenarios with clustered target distributions.