Skip to content
DraconiticResearch
Search Sources API
197,788 studies31 sourcesUpdated 27 min ago
Peer-reviewedCC BY 4.0Mathematics

Centralized Multi-Objective UAV–UGV Task Allocation for Disaster Relief Material Distribution with Mobile UAV Bases

  • Yupeng Zhang1
  • Shaoxun Liu1
  • Chengxin Wen2
  1. 1Endogenous Security Research Center, Purple Mountain Laboratories, Nanjing 211111, China
  2. 2Beijing Institute of Astronautical Systems Engineering, Beijing 100076, China
Open at sourceDOICite

Abstract

Coordinating unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) for post-disaster emergency material distribution requires joint decisions on task allocation, routing, delivery quantities, and rendezvous scheduling. Mobile UGV bases and split deliveries increase operational flexibility but introduce strong dependencies between aerial and ground operations. This paper investigates a centralized multi-objective multi-robot task allocation problem with static, known demands, in which UGVs transport supplies and support UAV launch, recovery, and battery replacement. A three-objective model is formulated to minimize weighted demand completion time, operating cost, and maximum normalized workload, subject to accessibility, payload, inventory, energy, and synchronization constraints. To solve the resulting constrained combinatorial optimization problem, we propose HV-ADEA, a hypervolume-guided adaptive evolutionary algorithm. A hybrid representation jointly encodes UGV stop sequences, UAV–interval task assignments, and split delivery quantities, while a synchronized decoder derives execution times and evaluates feasibility. A bounded iterative repair mechanism addresses coupled constraint violations. Domain-specific variation operators perform joint mobile base–sortie adjustment, aerial–ground quantity transfer, delivery splitting and merging, and synchronization bottleneck reduction to explore alternative allocation and routing plans. An experimental protocol is established using six test configurations of increasing scale and five baseline algorithms: NSGA-II, CCMO, BiCo, EMCMO, and C3M. The test results show that the algorithm we propose is competitive in most of the test cases.

Related

  1. Allocation Before the Clock: Graph, Set and Game Theory of Professional League of Legends Objective Setups
    Zheng Gao, Zhenyu Liu, Yifan Yang +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Proof of Stake economy under centralized exchanges--a mean field model
    Wenpin Tang
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  3. Relaxed Centralized Circumcentered-Reflection Methods for Convex Feasibility: Convergence and Finite Termination
    Vincent Guigues, Roger Behling, Adriana Henarejos
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Centralized Fault-Location and PMU Placement Strategies in Weakly Observable Grids: A Comprehensive Review
    Mihail Senyuk, Svetlana Beryozkina, Andrey Pazderin +2
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  5. Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
    Lishang Xu, Guodong Ma, Pengcheng Weng +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv

Cite

BibTeXRIS
BibTeX
@article{zhang2026centralized,
  title = {{Centralized Multi-Objective UAV–UGV Task Allocation for Disaster Relief Material Distribution with Mobile UAV Bases}},
  author = {Yupeng Zhang and Shaoxun Liu and Chengxin Wen},
  journal = {Mathematics},
  year = {2026},
  month = oct,
  doi = {10.3390/math14213946},
  url = {https://www.mdpi.com/2227-7390/14/21/3946},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - Centralized Multi-Objective UAV–UGV Task Allocation for Disaster Relief Material Distribution with Mobile UAV Bases
AU  - Yupeng Zhang
AU  - Shaoxun Liu
AU  - Chengxin Wen
PY  - 2026
DA  - 2026/10/29
JO  - Mathematics
DO  - 10.3390/math14213946
UR  - https://www.mdpi.com/2227-7390/14/21/3946
AB  - Coordinating unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) for post-disaster emergency material distribution requires joint decisions on task allocation, routing, delivery quantities, and rendezvous scheduling. Mobile UGV bases and split deliveries increase operational flexibility but introduce strong dependencies between aerial and ground operations. This paper investigates a centralized multi-objective multi-robot task allocation problem with static, known demands, in which UGVs transport supplies and support UAV launch, recovery, and battery replacement. A three-objective model is formulated to minimize weighted demand completion time, operating cost, and maximum normalized workload, subject to accessibility, payload, inventory, energy, and synchronization constraints. To solve the resulting constrained combinatorial optimization problem, we propose HV-ADEA, a hypervolume-guided adaptive evolutionary algorithm. A hybrid representation jointly encodes UGV stop sequences, UAV–interval task assignments, and split delivery quantities, while a synchronized decoder derives execution times and evaluates feasibility. A bounded iterative repair mechanism addresses coupled constraint violations. Domain-specific variation operators perform joint mobile base–sortie adjustment, aerial–ground quantity transfer, delivery splitting and merging, and synchronization bottleneck reduction to explore alternative allocation and routing plans. An experimental protocol is established using six test configurations of increasing scale and five baseline algorithms: NSGA-II, CCMO, BiCo, EMCMO, and C3M. The test results show that the algorithm we propose is competitive in most of the test cases.
SN  - 2227-7390
ER  -