Relational Trajectory-Entropy Augmented MADRL for Truck-Drone Collaborative Deliver With Mobile Charging Optimization

The truck-drone collaborative delivery problem, modeled as a Traveling Salesman Problem with Drones (TSP-D), presents critical challenges in coordinating heterogeneous vehicles with distinct operational constraints. A key optimization opportunity lies in using trucks as mobile charging stations, enabling extended drone operations beyond battery limitations. While existing approaches struggle with scalability and inefficient exploration of this mobile charging paradigm, we propose a relational trajectory-entropy augmented (R-TEA) Multi-Agent Deep Reinforcement Learning (MADRL) framework that synergizes Relational Graph Convolutional Networks (R-GCN) with Trajectory-Entropy Reward (TER). Our method addresses three core challenges: 1) modeling spatiotemporal dependencies between trucks and drones via R-GCN’s relational inductive biases, including critical charging coordination; 2) escaping local optima via trajectory exploration that considers dynamic charging opportunities; and 3) balancing time-cost trade-offs via a compound reward design that accounts for charging efficiency. Extensive experiments on TSPLib and synthetic benchmarks demonstrate R-TEA’s superiority over heuristic, attention-based RL, and evolutionary baselines.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Intelligent Transportation Systems
Published
2025-09-25
DOI
https://doi.org/10.1109/tits.2025.3607709
Citations
1
Primary Topic
UAV Applications and Optimization
Type
article
Field-Weighted Citation Impact
4.99
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Relational Trajectory-Entropy Augmented MADRL for Truck-Drone Collaborative Deliver With Mobile Charging Optimization

Zheng Luo, Huixian Qiu, Chengwen Luo, Jianqiang Li et al.
1 citations
IEEE Transactions on Intelligent Transportation Systems
UAV Applications and Optimization
4.99
article

Relational Trajectory-Entropy Augmented MADRL for Truck-Drone Collaborative Deliver With Mobile Charging Optimization

Zheng Luo, Huixian Qiu, Chengwen Luo, Jianqiang Li, Yijing Huang
article en
1 citations

Abstract

The truck-drone collaborative delivery problem, modeled as a Traveling Salesman Problem with Drones (TSP-D), presents critical challenges in coordinating heterogeneous vehicles with distinct operational constraints. A key optimization opportunity lies in using trucks as mobile charging stations, enabling extended drone operations beyond battery limitations. While existing approaches struggle with scalability and inefficient exploration of this mobile charging paradigm, we propose a relational trajectory-entropy augmented (R-TEA) Multi-Agent Deep Reinforcement Learning (MADRL) framework that synergizes Relational Graph Convolutional Networks (R-GCN) with Trajectory-Entropy Reward (TER). Our method addresses three core challenges: 1) modeling spatiotemporal dependencies between trucks and drones via R-GCN’s relational inductive biases, including critical charging coordination; 2) escaping local optima via trajectory exploration that considers dynamic charging opportunities; and 3) balancing time-cost trade-offs via a compound reward design that accounts for charging efficiency. Extensive experiments on TSPLib and synthetic benchmarks demonstrate R-TEA’s superiority over heuristic, attention-based RL, and evolutionary baselines.

IEEE Transactions on Intelligent Transportation SystemsVol. 27(3)
Shenzhen Technology University (CN), University of Hong Kong (HK)
Openalex Percentile: Top 5%
UAV Applications and Optimization
4.99
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.