A Cutting-Edge Approach to Multi-UAV Mission Planning Using Enhanced Constraint Satisfaction
Guardado en:
| Publicado en: | Journal of Intelligent & Robotic Systems vol. 111, no. 3 (Sep 2025), p. 95 |
|---|---|
| Autor principal: | |
| Otros Autores: | , |
| Publicado: |
Springer Nature B.V.
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Resumen: | Multi-task planning for diverse UAVs and missions can be approached as a Constraint Satisfaction Problem (CSP) where the Temporal CSP (TCSP) method adds time-based sequential task modeling. The Enhanced Temporal Constraint Satisfaction Problem (ETCSP) method innovatively merges dynamic domain features with a MIQP (Mixed Integer Quadratic Programming) based scoring system to optimally assign UAVs to tasks, moving beyond traditional greedy algorithms. This approach includes an enhanced forward checking method that evaluates task suitability and UAV compatibility in real-time using dynamic programming, thus refining search precision. The ETCSP model was tested in two phases, initially assigning various tasks and then employing CSP methods to monitor task changes over time. Results show that the generic TCSP method requires 61 UAVs to complete 70 tasks, while the Enhanced TCSP achieves the same with only 48 UAVs—which is roughly a 21% reduction in UAV usage. Similarly, the Enhanced method completes the task package in about 3800 min and with 1142 L of fuel, compared to 4855 min and 1615 L for the TCSP method, translating to approximately a 22% reduction in time and a 29% reduction in fuel consumption. |
|---|---|
| ISSN: | 0921-0296 1573-0409 |
| DOI: | 10.1007/s10846-025-02279-4 |
| Fuente: | Advanced Technologies & Aerospace Database |