Oct 2026· IEEE Robotics and Automation Letters· Vol 11, pp. 12104-12111· 0 citations· 19 references
Abstract
We present a tractable approach to grid-based multi-agent path planning for inspection tasks that minimizes task completion time. We require all agents to collectively inspect all targets while (i) maintaining a user-defined separation distance, (ii) returning to charging stations as needed, and (iii) avoiding obstacles. We decompose the constraints into per-agent constraints and team-level constraints, and propose a tour-based formulation where each tour satisfies per-agent constraints. We also introduce a notion of separation boxes which allows enforcing inter-agent separation constraints without costly pairwise distance evaluation. Numerical experiments show that the proposed algorithm can efficiently solve the grid-based planning problem compared with a baseline MILP formulation. Drone-based physical experiments further demonstrate integration of the resulting high-level discrete plans with off-the-shelf controllers via waypoint tracking.
To enable real-time computation, a heuristic-based solver framework is developed: an extended sequential greedy algorithm provides a quick baseline, while a reinforcement learning approach using an attention model and long short-term memory aims to overcome the local optimality of the greedy method.
Beomjin Gwon, Euihyeon Choi, Jeonghun Lee et al.· International Journal of Aer...· 0 citations
A hierarchical, reservation-based, multi-resolution planner for discrete-time grid environments, including deadline-aware priority guidelines to resolve reservation contention, boundary-based validation of abstract connectivity to avoid phantom links, and a wait-and-retry fallback when planning temporarily fails are pr...
Gicu Rata, Liviu Octavian Mafteiu-Scai· SAR Journal - Science and Re...· 0 citations
The Colored Traveling Salesman Problem (CTSP) is a seminal generalization of the Multiple TSP, where colors represent the heterogeneity of salesmen and their city visits. This work presents a time-critical extension, termed the Time-Critical CTSP (T-CTSP). By emphasizing the timing of visits, T-CTSP explicitly captures...
Y. Duan, Jun Li· IEEE Transactions on Automat...· 0 citations
A two-stage framework that explicitly couples task-cluster generation with route-level feasibility verification is developed, providing algorithm-level evidence for coordinated marine-UAV task assignment and route-sequence planning, but do not establish real-world flight readiness or field-deployment performance.
This work proposes an alternative formulation for the Service Agent Transport Problem (SATP), a widely studied problem in autonomous transportation that incorporates acceleration techniques such as problem-specific valid inequalities, warm-start strategies, node reduction, and lower bounds from approximation algorithms...
J. Sefair, Truong Mai Anh Tran· IISE Annual Conference &...· 0 citations
This work investigates the use of flow-based connectivity maintenance constraints in mixed-integer linear programming (MILP) trajectory planning and decision-making models for networked multi-agent systems (MAS). We integrate flow-based encodings for standard and k-hop connectivity into MILP multi-vehicle maneuvering m...
Angelo Caregnato-Neto, Paul-Louis Delacour, R. Van de Plas et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.