Search Results (75)

Unmanned aerial vehicles (UAVs) provide a highly flexible platform for synthetic aperture radar (SAR), enabling efficient, high-quality imaging in remote sensing applications. In realistic imaging missions, regions of interest (ROIs) usually have different sizes and spatial distributions. While deploying SAR-UAVs with heterogeneous flight and imaging capabilities can improve mission time efficiency, realizing this improvement depends critically on task assignment and path planning. In this paper, the joint task assignment and path planning problem for heterogeneous SAR-UAVs in multi-region imaging missions is addressed. First, flight and imaging models of SAR-UAVs are established, and a constrained optimization problem is formulated to minimize the mission completion time. Then, an improved clustering strategy based on area-density and cost prediction (ADCP) is proposed to align ROI-dependent imaging workloads with heterogeneous SAR-UAV capabilities, thereby leveraging capability advantages and reducing the mission completion time. Finally, a discrete secretary bird optimization algorithm (DSBOA) is developed to generate feasible, high-quality paths. To accelerate convergence, UAV paths are encoded as waypoint sequences, and a mutation-based operator is introduced to update the population. Extensive Monte Carlo simulations show that the proposed approach consistently outperforms the baselines in mission completion time, demonstrating its effectiveness in improving time efficiency for multi-region SAR imaging missions. Ablation experiments further confirm the independent contributions of the proposed ADCP method and DSBOA algorithm. Full article

The rapid advancement of unmanned aerial vehicle (UAV) technology has led to its widespread adoption in military reconnaissance, disaster monitoring, environmental inspection, and related fields. However, a single UAV often faces limitations when executing large-scale and complex missions. UAV swarm technology, which employs multi-agent collaboration, can significantly improve task execution efficiency and overall system performance, representing an area of considerable research importance. Current studies on task allocation and path planning for UAV swarms exhibit certain shortcomings, particularly the high computational complexity and insufficient real-time performance of existing path planning methods when applied to highly dynamic, multi-objective, and large-scale complex scenarios. To address the above challenge, this paper proposes a Gale-Shapley-based Genetic Algorithm (GSGA) for UAV swarm task allocation and path planning. First, a multi-UAV data inspection system model is formulated based on an energy consumption model, analyzing the influence of factors including geographical fairness, data utility, and energy consumption. The proposed GSGA integrates the Gale-Shapley stable matching algorithm for one-to-one task assignment between UAVs and sub-regions with a genetic algorithm optimized for intra-region path planning. Dynamic programming is further employed to refine the flight paths. The results show that the GSGA strategy can effectively improve the balance of task allocation, optimize path length and inspection quality. The proposed method demonstrated robust performance in complex scenarios characterized by numerous task targets and intricate regional partitions, consistently enabling UAVs to complete inspection tasks with high collaborative efficiency. Full article

The cooperative airdrop of UAV swarms by multiple transport aircraft creates a large-scale multi-agent planning problem. The mission involves heterogeneous aircraft, multi-visit airdrop areas, strict time windows, and threat-aware flight paths. To address these challenges, this work develops an integrated framework for both global task allocation and real-time replanning in complex three-dimensional operational environments. First, for the combinatorial optimization of task execution sequences across multiple aircraft, a static task assignment method is proposed. This method employs a Hybrid-encoding Constrained Black-winged Kite Algorithm (HCBKA), which incorporates optimization metrics such as mission execution time, completion rate, and load-balancing symmetry among aircraft. The HCBKA aims to find a task assignment scheme that achieves a comprehensive optimum across multiple objectives through efficient model solving. Second, to handle potential real-time dynamic changes during mission execution, a rapid-response and generalizable replanning mechanism is developed. This mechanism utilizes an event-triggered strategy based on a Time-window aware Dynamic Auction Algorithm (TDAA). It ensures that the system can promptly initiate and execute online task reallocation in response to contingencies such as changing mission requirements or losses within its own drone swarm, thus maintaining the adaptability and robustness of the overall plan. Simulation results show that the proposed framework produces high-quality global solutions and maintains strong robustness under dynamic changes. The approach provides an effective and scalable solution for coordinated multi-aircraft swarm airdrop missions. Full article

Task allocation for heterogeneous unmanned aerial vehicle (UAV) swarms requires complex spatiotemporal coordination. While traditional algorithms struggle to interpret abstract semantic intents, general large language models (LLMs) often suffer from physical hallucinations and superficial tactical reasoning. To address these limitations, we propose a generative task allocation paradigm augmented by a heterogeneous toolchain, shifting the approach from rigid numerical optimization toward tool-grounded semantic planning. To implement this and overcome domain data scarcity, we design a decoupled dual-model architecture. This architecture is optimized through an execution-manifold-anchored orthogonal evolution training method. By utilizing simulated self-play within a stable execution environment, this approach prevents gradient conflicts and autonomously generates abundant training data. Furthermore, to resolve the credit assignment problem in long-horizon scenarios, we develop a Recursive Causal Probe (RCP) algorithm. By tracing failures backward through the simulation, RCP synthesizes counterfactual preference data, effectively translating tactical mistakes into precise corrections for the planning model. Extensive simulations demonstrate that our method achieves an 82.34% mission success rate in complex scenarios, requiring significantly fewer interactive corrections than general LLMs, fully verifying its physical feasibility and practical robustness. Full article

Outdoor ecological practice is essential for cultivating ecological literacy; however, there is currently a relative lack of comprehensive outdoor practical teaching case designs for class-based teaching. This study describes the design of an experimental teaching case for ecological education involving UAV-based field data collection. For the scheme, we selected the Xinhui Tangerine Peel Germplasm Resources Conservation Center in Jiangmen City, Guangdong Province as the study area, utilizing the DJI Phantom 4 RTK drone, which serves as the equipment for experimental teaching. The experiment is structured into three phases: indoor preparation, field execution, and data processing. Students from four groups collaboratively conducted aerial surveys across 24 partitioned plots, with flight altitudes stratified between groups to ensure safety and data integrity. (1) In the indoor preparation phase, appropriate single-flight operational units were defined. QGIS software (version 3.26.2) was employed for zonal mission planning, and suitable flight altitudes were estimated using contour data. (2) Field experiment phase. This involved conducting a comprehensive survey of the on-site environment, selecting suitable takeoff and landing points, dividing students into teams to carry out UAV-image-acquisition tasks, and assigning different altitudes for flight routes among the teams. (3) After the fieldwork, students processed imagery using Agisoft Metashape (version 2.0.1) to generate orthomosaics and digital surface models, and engaged in ecological interpretation of the results. The experimental design ensured orderly execution, complete data coverage, and active student participation. The results indicate the approach effectively enhanced students’ UAV operational skills, outdoor problem-solving abilities, and teamwork capabilities, while deepening their ecological understanding through real-world inquiry. This case provides a replicable model for integrating UAV technology into ecological education, contributing to the transformation of ecological awareness into actionable practice. Full article

As UAV popularity soars, so does the mission planning associated with it. Classical planning approaches suffer from the triple problems of decoupling of task assignment and path planning, poor real-time and scalability, and limited adaptability. Aiming at these challenges, this paper proposes a multi-UAV real-time collaborative mission planning method based on UAV states. First, the employed Dubins path accurately represents the distance between tasks and satisfies curvature constraints without smoothing, thus achieving a coupled solution for task assignment and path planning. Then, a series of acceleration techniques are applied to guarantee the real-time performance of the method, including task clustering to reduce the decision space, allocation strategies with fewer iterations, and efficient distance cost calculation methods. To enhance robustness and adaptability, real-time assignment of new tasks and task reassignment due to the reduction of available UAVs are appropriately handled. Finally, simulations highlight that the proposed method only increases the path length by 9.57% compared to benchmark method, while achieving a 4–5 orders-of-magnitude improvement in planning speed, with a single mission planning of about 0.0003 s. Moreover, it easily scales to large-scale scenarios (0.0029 s, with 1000 UAVs and 25,000 tasks). Full article

The Food Bank of Bogotá is a non-profit organization whose primary mission is to provide food aid to economically vulnerable people and others. One of its key operations is the distribution of food to over 600 beneficiaries. In this research, we present the design and implementation of a computer application that calculates the delivery schedule of the Food Bank vehicles. Firstly, the beneficiaries of the Food Bank are clustered into four delivery zones, and their orders are assigned to specific weeks of the month. Next, a variant of the Capacitated Periodic Vehicle Routing Problem (CPVRP) is solved with an open-source tool. Lastly, routes are assigned to days of the week depending on the traffic conditions. The numerical results showed significant improvements in terms of total time reduction with respect to the business-as-usual practice. This tool is essentially for the monthly planning of the distribution of routes. These routes eventually will need adjustments because of changes in the beneficiaries’ demand, traffic conditions, fleet availability, and so forth. At the time of writing, the model is being integrated with another application that records and tracks the orders in the Food Bank. The users of this application would handle the daily operation and will make manual adjustments if needed. Finally, we discuss the main limitations of the application, which lie primarily in the need to educate both the Food Bank staff and the beneficiaries’ management, who are accustomed to last-minute orders, very tight time windows, and reactive delivery schedules that are highly inefficient. Full article

This paper presents IB-DARP (Iteration Balancing—Divide Areas Routing Problem), an enhanced multi-vessel cooperative mission and path planning method designed to address the limitations of traditional approaches, including uneven task allocation, workload imbalance, and path conflicts. The proposed method integrates four key mechanisms to improve planning robustness and computational efficiency. A historical data mining mechanism is first employed to extract stable navigation patterns from accumulated vessel trajectories and construct a high-confidence maritime route network. Based on this network, a precomputation mechanism significantly reduces planning-stage computational complexity by calculating essential inter-node distances in advance. A heading-aware partitioning mechanism further decomposes the multi-vessel planning problem into tractable single-vessel subproblems, while an iterative auction–equilibrium mechanism dynamically adjusts task assignments to enhance global load balance and suppress conflicts. To evaluate the effectiveness of IB-DARP, comprehensive ablation studies and large-scale scenario experiments were conducted, demonstrating its advantages in mission allocation, conflict mitigation, and cooperative path optimization. The results confirm that IB-DARP provides a scalable and efficient solution for multi-vessel cooperative mission planning in complex maritime environments. Full article

This paper addresses the Multi-Target Reconnaissance (MTR) problem for heterogeneous Fixed-Wing Unmanned Aerial Vehicles (FW-UAVs), focusing on synchronized and time-optimal mission execution under stringent constraints. A two-stage coordinated assignment and planning framework is proposed. First, a time-balanced clustering algorithm is designed to minimize the overall mission duration while balancing individual UAV workloads by jointly employing a target reallocation strategy and an improved Genetic Algorithm (GA). Subsequently, an online trajectory planning method based on differential flatness is developed, integrating a robust replanning and flight-time synchronization strategy to ensure coordinated execution. Simulation results unequivocally demonstrate that the proposed approach enhances time optimality and temporal coordination in complex scenarios. Full article

In the dynamic marine environment, the high mobility of intrusion targets, complex interference, and insufficient multi-vessel coordination accuracy pose significant challenges to the cooperative interception mission of multiple unmanned surface vehicles (USVs). This paper proposes an adaptive dynamic prediction-based cooperative interception control algorithm and establishes a “mission planning—anti-interference control—phased coordination” system. Specifically, it ensures interception accuracy through threat-level-oriented target assignment and extended Kalman filter multi-step prediction, offsets environmental interference by separating the cooperative encirclement and anti-interference modules using an improved Two-stage architecture, and optimizes the movement of nodes to form a stable blockade through the “target navigation—cooperative encirclement” strategy. Simulation results show that in a 1000 m × 1000 m mission area, the node trajectory deviation is reduced by 40% and the heading angle fluctuation is decreased by 50, compared with the limit cycle encirclement algorithm, the average interception time is shortened by 15% and the average final distance between the intrusion target and the guarded target is increased by 20%, when the target attempts to escape, the relevant collision rates are all below 0.3%. The TFMUSV framework ensures the stable optimization of the algorithm and significantly improves the efficiency and reliability of multi-USV cooperative interception in complex scenarios. This paper provides a highly adaptable technical solution for practical tasks such as maritime security and anti-smuggling. Full article

This paper investigates a load-balanced pickup strategy for heterogeneous multi-UAV systems, where unmanned aerial vehicles (UAVs) with different flight speeds and payload capacities cooperatively collect spatially distributed parcels while avoiding no-fly zones. The goal is to minimize the maximum mission completion time among UAVs while ensuring balanced workload distribution according to their heterogeneous capabilities. The formulated problem is a mixed-integer nonlinear program that jointly optimizes pickup assignment, trajectory planning, and slot duration allocation under mobility, safety, and payload constraints. To address the nonconvexity of the optimization problem, the successive convex approximation and penalty convex–concave procedure are applied, leading to a two-stage iterative algorithm that efficiently derives practical UAV strategies for load-balanced parcel pickup. The first stage minimizes the maximum completion time, and the second stage further refines the trajectories to reduce the total travel distance. Simulation results demonstrate that the proposed scheme effectively adapts to UAV capability asymmetry and achieves superior time efficiency compared to benchmark schemes. The results also point to future research opportunities, such as incorporating energy models, communication constraints, or stochastic task dynamics to extend the applicability of the proposed framework. Full article

Cooperative path planning for unmanned aerial vehicle (UAV) swarms has attracted considerable research attention, yet it remains challenging in complex, uncertain environments. To tackle this problem, we model the cooperative path planning task as a heterogeneous decentralized Markov Decision Process (MDP), emphasizing the symmetry-inspired role assignment between leader and wingmen UAVs, which ensures balanced and coordinated behaviors in dynamic settings. We address the problem using a Multi-Agent Soft Actor-Critic (MASAC) framework enhanced with a symmetry-aware reward mechanism designed to optimize multiple cooperative objectives: simultaneous arrival, formation topology preservation, dynamic obstacle avoidance, trajectory smoothness, and inter-agent collision avoidance. This design promotes behavioral symmetry among agents, enhancing both coordination efficiency and system robustness. Simulation results demonstrate that our method achieves efficient swarm coordination and reliable obstacle avoidance. Quantitative evaluations show that our MASAC-CA algorithm achieves a Mission Success Rate (MSR) of 99.0% with 2–5 wingmen, representing approximately 13% improvement over baseline MASAC, while maintaining Formation Keeping Rates (FKR) of 59.68–26.29% across different swarm sizes. The method also reduces collisions to near zero in cluttered environments while keeping flight duration, path length, and energy consumption at levels comparable to baseline algorithms. Finally, the proposed model’s robustness and effectiveness are validated in complex uncertain environments, underscoring the value of symmetry principles in multi-agent system design. Full article

This paper investigates perimeter defense strategies for multi-agent systems. Considering the complex scenario with multiple obstacles in the mission environment, a defense strategy based on prioritized path planning is proposed in this paper. The strategy employs a minimum weight matching method to solve the optimal task assignment for interception and determines the task priority based on the relative time window. Meanwhile, the swarm path planning is realized using particle swarm optimization with a designed cost function. Compared with the existing literature, the proposed method can handle large-scale agent-based perimeter defense while accounting for inter-defender collision avoidance and obstacle avoidance. The effectiveness of the strategy is verified through simulation in the mission scenario. Full article

Advancements in Unmanned Aerial Vehicle (UAV) technologies have increased exponentially in recent years, with UAV swarm being a key area of interest. UAV swarm overcomes the energy reserve, payload, and single-objective limitations of single UAVs, enabling broader mission scopes. Despite these advantages, UAV swarm has yet to see widespread application within global industry. A leading factor hindering swarm application within industry is the divide that currently exists between the functional capacity of modern UAV swarm systems and the functionality required by legislation. This paper investigates this divide through an overview of global legislative practice, contextualized via a case study of Australia’s UAV regulatory environment. The overview highlighted legislative objectives that coincided with open challenges in the UAV swarm literature. These objectives were then formulated into analysis criteria that assessed whether systems presented sufficient functionality to address legislative concern. A systematic review methodology was used to apply analysis criteria to multi-objective UAV swarm mission planning systems. Analysis focused on multi-objective mission planning systems due to their role in defining the functional capacity of UAV swarms within complex real-world operational environments. This, alongside the popularity of these systems within the modern literature, makes them ideal candidates for defining new enabling technologies that could address the identified areas of weakness. The results of this review highlighted several legislative considerations that remain under-addressed by existing technologies. These findings guided the proposal of enabling technologies to bridge the divide between functional capacity and legislative concern. Full article

Search and rescue (SAR) missions require reliable search methods to locate survivors, especially in challenging environments. Introducing unmanned aerial vehicles (UAVs) can enhance the efficiency of SAR missions while simultaneously increasing the safety of everyone involved. Motivated by this, we experiment with autonomous UAV search for humans in Mediterranean karst environment. The UAVs are directed using the Heat equation-driven area coverage (HEDAC) ergodic control method based on known probability density and detection function. The sensing framework consists of a probabilistic search model, motion control system, and object detection enabling to calculate the target’s detection probability. This paper focuses on the experimental validation of the proposed sensing framework. The uniform probability density, achieved by assigning suitable tasks to 78 volunteers, ensures the even probability of finding targets. The detection model is based on the You Only Look Once (YOLO) model trained on a previously collected orthophoto image database. The experimental search is carefully planned and conducted, while recording as many parameters as possible. The thorough analysis includes the motion control system, object detection, and search validation. The assessment of the detection and search performance strongly indicates that the detection model in the UAV control algorithm is aligned with real-world results. Full article