Search Results (905)

Unmanned aerial vehicles (UAVs) play an increasingly vital role in wilderness search and rescue (SAR) operations by enhancing situational awareness and extending the capabilities of human teams. Yet, a lack of standardized benchmarks has impeded the systematic evaluation of single- and multi-agent path-planning algorithms. This paper introduces an open-source dataset and evaluation framework to address this gap. The framework comprises 60 geospatial scenarios across four distinct European environments, featuring high-resolution probability maps. We present a lost person probabilistic model derived from statistical models of lost person behavior. We provide a suite of tools for evaluating search paths against four baseline methods: Concentric Circles, Pizza Zigzag, Greedy, and Random Exploration, using three quantitative metrics: Accumulated probability of detection, time-discounted probability of detection, and lost person discovery score. We provide an evaluation framework to facilitate the comparative analysis of single- and multi-agent path-planning algorithms, supporting both the baseline methods presented and custom user-defined path generators. By providing a structured and extensible framework, this work establishes a foundation for the rigorous and reproducible assessment of UAV search strategies in complex wilderness environments. Full article

To address the issues of low efficiency, insufficient coverage, and high energy consumption in wheat sowing path planning for large-scale irregular farmland, this study proposes an improved hybrid particle swarm optimization algorithm (TLG-PSO) for autonomous operational path planning. Building upon the standard PSO, the proposed method introduces a Tent chaotic mapping initialization mechanism, a Logistic-based dynamic inertia weight adjustment strategy, and adaptive Gaussian perturbation optimization to achieve precise control of the agricultural machinery’s driving orientation angle. A comprehensive path planning model is constructed with the objectives of minimizing the effective operation path length, reducing turning frequency, and maximizing coverage rate. Furthermore, cubic Bézier curves are employed for path smoothing, effectively controlling path curvature and ensuring the safety and stability of agricultural operations. The simulation experiment results demonstrate that the TLG-PSO algorithm achieved exceptional full-coverage operation performance across four categories of typical test fields. Compared to conventional fixed-direction path planning strategies, the algorithm reduced average total path length by 6228 m, improved coverage rate by 1.31%, achieved average labor savings of 96.32%, and decreased energy consumption by 6.45%. In large-scale comprehensive testing encompassing 1–27 field plots, the proposed algorithm reduced average total path length by 8472 m (a 5.45% decrease) and achieved average energy savings of 44.21 kW (a 5.48% reduction rate). Comparative experiments with mainstream intelligent optimization algorithms, including GA, ACO, PSO, BreedPSO, and SecPSO, revealed that TLG-PSO reduced path length by 0.16%–0.74% and decreased energy consumption by 0.53%–2.47%. It is worth noting that for large-scale field operations spanning hundreds of acres, even an approximately 1% path reduction translates to substantial fuel and operational time savings, which holds significant practical implications for large-scale agricultural production. Furthermore, TLG-PSO demonstrated exceptional performance in terms of algorithm convergence speed and computational efficiency. The improved TLG-PSO algorithm provides a feasible and efficient solution for autonomous operation of large-scale agricultural machinery. Full article

Autonomous navigation for unmanned vehicles in complex, unstructured environments remains challenging, especially in GPS-denied or obstacle-dense scenarios, limiting their practical deployment in logistics, inspection, and emergency response applications. To overcome these limitations, this paper presents a tightly integrated air-ground collaborative system comprising three key components: (1) an aerial perception module employing a YOLOv8-based vision system onboard the UAV to generate real-time global obstacle maps; (2) a low-latency communication module utilizing FAST DDS middleware for reliable air-ground data transmission; and (3) a ground navigation module implementing an A* algorithm for optimal path planning coupled with closed-loop control for precise trajectory execution. The complete system was physically implemented using cost-effective hardware and experimentally validated in cluttered environments. Results demonstrated successful UGV autonomous navigation and obstacle avoidance relying exclusively on UAV-provided environmental data. The proposed framework offers a practical, economical solution for enabling robust UGV operations in challenging real-world conditions, with significant potential for diverse industrial applications. Full article

The implementation of autonomous rovers in agriculture could be a promising solution to ensure, at the same time, productivity and sustainability. One of the key points of this kind of vehicle concerns their autonomous driving strategy. Generally, the strategy should include the path planning and path following algorithms. In this paper, an autonomous driving strategy assessing both is presented. To evaluate the effectiveness of this strategy, a case study of an agricultural rover is presented. A co-simulation model, including a multibody model of the rover, is developed in Matlab/Simulink R2021b and Hexagon Adams 2024 environments to virtually test the rover capabilities and the effects of its dynamics on the robustness of the algorithm. Given different orchard configurations, common but critical work scenarios are investigated, namely a 180° turn and an obstacle avoidance manoeuvre. The actual trajectory obtained during simulations are compared to the ideal trajectory defined in the path planning stage. Furthermore, the torque demand at the electric motors is evaluated. To consider a wide range of possible operating conditions, additional tests with different terrains, payloads and road slopes are included. Results showed that the rover managed to accomplish the considered manoeuvres on loam soil with a maximum trajectory deviation of 0.58 m, but a temporary overload of the motors is needed. On the contrary, in case of difficult terrains, such as muddy soil, the rover was not able to perform the manoeuvre. To limit tire slip, a traction control algorithm is developed and implemented, and the results are compared with the case without control. Full article

Path planning is a complex task in robotics, requiring an efficient and adaptive algorithm to find the shortest path in a dynamic environment. The traditional path planning methods, such as graph-based algorithms, sampling-based algorithms, reaction-based algorithms, and optimization-based algorithms, have limitations in computational efficiency, real-time adaptability, and obstacle avoidance. To address these challenges, hybrid path planning algorithms combine the strengths of multiple techniques to enhance performance. This paper includes a comprehensive review of hybrid approaches based on graph-based algorithms, sampling-based algorithms, reaction-based algorithms, and optimization-based algorithms. Also, this article discusses the advantages and limitations, supported by a comparative evaluation of computational complexity, path optimization, and finding the shortest path in a dynamic environment. Finally, we propose an AI-driven adaptive path planning approach to solve the difficulties. Full article

Autonomous Mobile Robots (AMRs) are increasingly important in Industry 4.0 intralogistics but creating path planning systems that adapt to dynamic and uncertain Flexible Manufacturing Systems (FMS), especially managing conflicts among multiple AMRs with a need for scalable decentralised solutions, remains a significant challenge. This research introduces a dynamic path planning system for AMRs designed for reactive adaptation to FMS disturbances and generalisation across factory layouts, incorporating support for multiple AMRs with integrated conflict avoidance. The system is built on a Multi-Agent Systems (MAS) architecture, where software AMR agents independently calculate their paths using a hybrid Genetic Algorithm (GA) that employs Cell-Based Decomposition (CBD) and optimises path length, smoothness, and overlap via a multi-objective fitness function. Multi-AMR conflict avoidance is implemented using the Iterative Exclusion Principle (IEP), which facilitates priority-based planning, knowledge sharing through Predictive Collision Avoidance (PCA), and iterative replanning among agents communicating via a blackboard agent. Verification demonstrated the system’s ability to successfully avoid deadlocks for up to nine AMRs and exhibit good scalability. Validation in a simulated FMS environment confirmed robust adaptation to various disturbances, including static and dynamic obstacles, while maintaining stable run times and consistent path quality. These results affirm the practical feasibility of this hybrid GA and MAS-based approach for dynamic AMR control in complex industrial settings. Full article

Monocular depth estimation (MDE) is a cornerstone of computer vision and is applied to diverse practical areas such as autonomous vehicles, robotics, etc., yet even the latest methods suffer substantial errors in high-dynamic-range (HDR) scenes where over- or under-exposure erases critical texture. To address this challenge in real-world autonomous driving scenarios, we propose the Exposure-Aware Single-Step Diffusion Framework for Monocular Depth Estimation (EASD). EASD leverages a pre-trained Stable Diffusion variational auto-encoder, freezing its encoder to extract exposure-robust latent RGB and depth representations. A single-step diffusion process then predicts the clean depth latent vector, eliminating iterative error accumulation and enabling real-time inference suitable for autonomous vehicle perception pipelines. To further enhance robustness under extreme lighting conditions, EASD introduces an Exposure-Aware Feature Fusion (EAF) module—an attention-based pyramid that dynamically modulates multi-scale features according to global brightness statistics. This mechanism suppresses bias in saturated regions while restoring detail in under-exposed areas. Furthermore, an Exposure-Balanced Loss (EBL) jointly optimises global depth accuracy, local gradient coherence and reliability in exposure-extreme regions—key metrics for safety-critical perception tasks such as obstacle detection and path planning. Experimental results on NYU-v2, KITTI, and related benchmarks demonstrate that EASD reduces absolute relative error by an average of 20% under extreme illumination, using only 60,000 labelled images. The framework achieves real-time performance (<50 ms per frame) and strikes a superior balance between accuracy, computational efficiency, and data efficiency, offering a promising solution for robust monocular depth estimation in challenging automotive lighting conditions such as tunnel transitions, night driving and sun glare. Full article

Efficient cleaning of floating waste using an intelligent unmanned surface vehicle is an important development trend in inland water governance. Path planning is the core of the decision-making module for unmanned surface vehicle waste cleaning and is key to achieving autonomous operation of the unmanned surface vehicle. However, due to the complexity and dynamic changes of the water surface environment, unmanned surface vehicle path planning methods for floating waste face challenges such as small size, uncertainty, and uneven distribution of floating waste. In response to the above issues, this article studies the problem of insufficient integration and low efficiency between existing path planning algorithms and target-perception modules, and designs an efficient overall path planning method for floating-waste cleaning by an unmanned surface vehicle. This method transforms the path planning problem of floating-waste cleaning unmanned surface vehicle into a Traveling Salesman Problem by setting global patrol points and tracking local targets, and proposes an improved ant colony algorithm, IACO, to solve the Traveling Salesman Problem. This article is based on the TSPLIB dataset and practical applications for experiments. The experimental results show that the proposed method has average optimal path lengths of 75.930 m, 446.555 m, and 703.759 m on the Ulysses22, eil51, and st70 datasets, respectively, which are reduced by 0.355 m, 4.108 m, and 13.575 m compared to the benchmark. Full article

Sustainable path-planning algorithms are essential for executing complex user-defined missions by mobile robots. Addressing various scenarios with a unified criterion during the design phase is often impractical due to the potential for unforeseen situations. Therefore, it is important to incorporate the concept of adaptive autonomy for path planning. This approach allows the system to autonomously select the best path-planning strategy. The technique utilizes dynamic programming with an adaptive memory size, leveraging a cellular decomposition technique to divide the map into convex cells. The path is divided into three segments: the first segment connects the starting point to the center of the starting cell, the second segment connects the center of the goal cell to the goal point, and the third segment connects the center of the starting cell to the center of the goal cell. Since each cell is convex, internal path planning simply requires a straight line between two points within a cell. Path planning uses an improved $A^{\ast }$ (I-$A^{\ast }$) algorithm, which evaluates the feasibility of a direct path to the goal from the current position during execution. When a direct path is discovered, the algorithm promptly returns and saves it in memory. The memory size is proportional to the square of the total number of cells, and it stores paths between the centers of cells. By storing and reusing previously calculated paths, this method significantly reduces redundant computation and supports long-term sustainability in mobile robot deployments. The final phase of the path-planning process involves pruning, which eliminates unnecessary waypoints. This approach obviates the need for repetitive path planning across different scenarios thanks to its compact memory size. As a result, paths can be swiftly retrieved from memory when needed, enabling efficient and prompt navigation. Simulation results indicate that this algorithm consistently outperforms other algorithms in finding the shortest path quickly. Full article

Aiming at the cooperative path-planning problem of multiple autonomous underwater vehicles in underwater three-dimensional terrain and dynamic ocean current environments, a hybrid algorithm based on the Improved Multi-Objective Particle Swarm Optimization (IMOPSO) and Dynamic Window (DWA) is proposed. The traditional particle swarm optimization algorithm is prone to falling into local optimization in high-dimensional and complex marine environments. It is difficult to meet multiple constraint conditions, the particle distribution is uneven, and the adaptability to dynamic environments is poor. In response to these problems, a hybrid initialization method based on Chebyshev chaotic mapping, pre-iterative elimination, and boundary particle injection (CPB) is proposed, and the particle swarm optimization algorithm is improved by combining dynamic parameter adjustment and a hybrid perturbation mechanism. On this basis, the Dynamic Window Method (DWA) is introduced as the local path optimization module to achieve real-time avoidance of dynamic obstacles and rolling path correction, thereby constructing a globally and locally coupled hybrid path-planning framework. Finally, cubic spline interpolation is used to smooth the planned path. Considering factors such as path length, smoothness, deflection Angle, and ocean current kinetic energy loss, the dynamic penalty function is adopted to optimize the multi-AUV cooperative collision avoidance and terrain constraints. The simulation results show that the proposed algorithm can effectively plan the dynamic safe path planning of multiple AUVs. By comparing it with other algorithms, the efficiency and security of the proposed algorithm are verified, meeting the navigation requirements in the current environment. Experiments show that the IMOPSO–DWA hybrid algorithm reduces the path length by 15.5%, the threat penalty by 8.3%, and the total fitness by 3.2% compared with the traditional PSO algorithm. Full article

Recent advances in vision–language models (VLMs) have transformed the field of robotics. Researchers are combining the reasoning capabilities of large language models (LLMs) with the visual information processing capabilities of VLMs in various domains. However, most efforts have focused on terrestrial robots and are limited in their applicability to volatile environments such as ocean surfaces and underwater environments, where real-time judgment is required. We propose a system integrating the cognition, decision making, path planning, and control of autonomous marine surface vehicles in the ROS2–Gazebo simulation environment using a multimodal vision–LLM system with zero-shot prompting for real-time adaptability. In 30 experiments, adding the path plan mode feature increased the success rate from 23% to 73%. The average distance increased from 39 m to 45 m, and the time required to complete the task increased from 483 s to 672 s. These results demonstrate the trade-off between improved reliability and reduced efficiency. Experiments were conducted to verify the effectiveness of the proposed system and evaluate its performance with and without adding a path-planning step. The final algorithm with the path-planning sub-process yields a higher success rate, and better average path length and time. We achieve real-time environmental adaptability and performance improvement through prompt engineering and the addition of a path-planning sub-process in a limited structure, where the LLM state is initialized with every application programming interface call (zero-shot prompting). Additionally, the developed system is independent of the vision–LLM archetype, making it scalable and adaptable to future models. Full article

The primary challenge that robots face in disaster rescue is to precisely and efficiently construct disaster maps and achieve autonomous navigation. This paper proposes a method for air–ground collaborative map construction. It utilizes the flight capability of an unmanned aerial vehicle (UAV) to achieve rapid three-dimensional space coverage and complex terrain crossing for rapid and efficient map construction. Meanwhile, it utilizes the stable operation capability of an unmanned ground vehicle (UGV) and the ground detail survey capability to achieve precise map construction. The maps constructed by the two are accurately integrated to obtain precise disaster environment maps. Among them, the map construction and positioning technology is based on the FAST LiDAR–inertial odometry 2 (FAST-LIO2) framework, enabling the robot to achieve precise positioning even in complex environments, thereby obtaining more accurate point cloud maps. Before conducting map fusion, the point cloud is preprocessed first to reduce the density of the point cloud and also minimize the interference of noise and outliers. Subsequently, the coarse and fine registrations of the point clouds are carried out in sequence. The coarse registration is used to reduce the initial pose difference of the two point clouds, which is conducive to the subsequent rapid and efficient fine registration. The coarse registration uses the improved sample consensus initial alignment (SAC-IA) algorithm, which significantly reduces the registration time compared with the traditional SAC-IA algorithm. The precise registration uses the voxelized generalized iterative closest point (VGICP) algorithm. It has a faster registration speed compared with the generalized iterative closest point (GICP) algorithm while ensuring accuracy. In reinforcement learning navigation, we adopted the deep deterministic policy gradient (DDPG) path planning algorithm. Compared with the deep Q-network (DQN) algorithm and the A* algorithm, the DDPG algorithm is more conducive to the robot choosing a better route in a complex and unknown environment, and at the same time, the motion trajectory is smoother. This paper adopts Gazebo simulation. Compared with physical robot operation, it provides a safe, controllable, and cost-effective environment, supports efficient large-scale experiments and algorithm debugging, and also supports flexible sensor simulation and automated verification, thereby optimizing the overall testing process. Full article

Autonomous UAV navigation in unknown and complex environments remains a core challenge, especially under limited sensing and computing resources. While most methods rely on modular pipelines involving mapping, planning, and control, they often suffer from poor real-time performance, limited adaptability, and high dependency on accurate environment models. Moreover, many deep-learning-based solutions either use RGB images prone to visual noise or optimize only a single objective. In contrast, this paper proposes a unified, model-free vision-based DRL framework that directly maps onboard depth images and UAV state information to continuous navigation commands through a single convolutional policy network. This end-to-end architecture eliminates the need for explicit mapping and modular coordination, significantly improving responsiveness and robustness. A novel multi-objective reward function is designed to jointly optimize path efficiency, safety, and energy consumption, enabling adaptive flight behavior in unknown complex environments. The trained policy demonstrates generalization in diverse simulated scenarios and transfers effectively to real-world UAV flights. Experiments show that our approach achieves stable navigation and low latency. Full article

Aiming at the complex construction environment and autonomous navigation challenges in underground coal mine roadways, this paper proposes a path navigation and deviation correction control method for tracked roadheaders in confined roadway spaces. First, a two-dimensional planar grid model of the working scenario was constructed, with dimensionality reduction in the roadway model achieved through a heading reference influence degree threshold of the tracked roadheaders. Based on the kinematics theory of tracked roadheaders, kinematic and dynamic models for deviation correction in fully mechanized excavation roadways were established. Subsequently, a path planning and tracking correction algorithm was developed, along with a heading deviation correction control algorithm based on fuzzy neural network PID. Online optimization of the particle swarm algorithm was realized through crossover-mutation operations, enabling optimal strategy solving for construction path planning and precise control of travel deviation correction. Finally, simulation experiments evaluating algorithm performance and comparative simulations of control algorithms validated the feasibility and superiority of the proposed method. This research provides strategic guidance and theoretical foundations for rapid precision deployment and intelligent deviation correction control of tracked engineering vehicles in confined underground coal mine spaces. Full article

With the growth of the global population and the increasing scarcity of arable land, traditional agricultural production is confronted with multiple challenges, such as efficiency improvement, precision operation, and sustainable development. The progressive advancement of artificial intelligence (AI) technology has created a transformative opportunity for the intelligent upgrade of agricultural equipment. This article systematically presents recent progress in computer vision, machine learning (ML), and intelligent sensing. The key innovations are highlighted in areas such as object detection and recognition (e.g., a K-nearest neighbor (KNN) achieved 98% accuracy in distinguishing vibration signals across operation stages); autonomous navigation and path planning (e.g., a deep reinforcement learning (DRL)-optimized task planner for multi-arm harvesting robots reduced execution time by 10.7%); state perception (e.g., a multilayer perceptron (MLP) yielded 96.9% accuracy in plug seedling health classification); and precision control (e.g., an intelligent multi-module coordinated control system achieved a transplanting efficiency of 5000 plants/h). The findings reveal a deep integration of AI models with multimodal perception technologies, significantly improving the operational efficiency, resource utilization, and environmental adaptability of agricultural equipment. This integration is catalyzing the transition toward intelligent, automated, and sustainable agricultural systems. Nevertheless, intelligent agricultural equipment still faces technical challenges regarding data sample acquisition, adaptation to complex field environments, and the coordination between algorithms and hardware. Looking ahead, the convergence of digital twin (DT) technology, edge computing, and big data-driven collaborative optimization is expected to become the core of next-generation intelligent agricultural systems. These technologies have the potential to overcome current limitations in perception and decision-making, ultimately enabling intelligent management and autonomous decision-making across the entire agricultural production chain. This article aims to provide a comprehensive foundation for advancing agricultural modernization and supporting green, sustainable development. Full article