Integrated Multi-Drone Task Allocation, Sequencing, and Optimal Trajectory Generation in Obstacle-Rich 3D Environments

arXiv cs.AI / 3/27/2026

💬 OpinionSignals & Early TrendsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper proposes IMD-TAPP, an end-to-end framework that jointly performs multi-drone task allocation, tour sequencing, and time-parameterized trajectory generation in obstacle-rich 3D environments.
  • It discretizes space into a 3D navigation graph and computes obstacle-aware travel costs using graph-search pathfinding to support coupled assignment and ordering decisions.
  • IMD-TAPP uses an Injected Particle Swarm Optimization (IPSO) approach guided by multiple linear assignment to explore assignment/sequencing alternatives and reduce overall mission makespan.
  • The method converts waypoint tours into dynamically feasible minimum-snap trajectories with iterative validation of obstacle clearance and inter-robot separation, triggering re-planning when safety margins are violated.
  • MATLAB simulations and a two-drone case study show collision-free, dynamically feasible execution with a reported minimum mission time of 136 seconds.

Abstract

Coordinating teams of aerial robots in cluttered three-dimensional (3D) environments requires a principled integration of discrete mission planning-deciding which robot serves which goals and in what order -- with continuous-time trajectory synthesis that enforces collision avoidance and dynamic feasibility. This paper introduces IMD-TAPP (Integrated Multi-Drone Task Allocation and Path Planning), an end-to-end framework that jointly addresses multi-goal allocation, tour sequencing, and safe trajectory generation for quadrotor teams operating in obstacle-rich spaces. IMD--TAPP first discretizes the workspace into a 3D navigation graph and computes obstacle-aware robot-to-goal and goal-to-goal travel costs via graph-search-based pathfinding. These costs are then embedded within an Injected Particle Swarm Optimization (IPSO) scheme, guided by multiple linear assignment, to efficiently explore coupled assignment/ordering alternatives and to minimize mission makespan. Finally, the resulting waypoint tours are transformed into time-parameterized minimum-snap trajectories through a generation-and-optimization routine equipped with iterative validation of obstacle clearance and inter-robot separation, triggering re-planning when safety margins are violated. Extensive MATLAB simulations across cluttered 3D scenarios demonstrate that IMD--TAPP consistently produces dynamically feasible, collision-free trajectories while achieving competitive completion times. In a representative case study with two drones serving multiple goals, the proposed approach attains a minimum mission time of 136~s while maintaining the required safety constraints throughout execution.
広告