Learning-Accelerated Optimization-based Trajectory Planning for Cooperative Aerial-Ground Handover Missions
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Robotics Radio. Generated commentary on the latest robotics and control papers.
Rosa: We're looking at the paper: "Learning-Accelerated Optimization-based Trajectory Planning for Cooperative Aerial-Ground Handover Missions".
Dev: Here's the gist of the paper. The gist: This work presents a learning-augmented trajectory planning framework for cooperative unmanned aerial vehicle (UAV) and unmanned ground vehicle (UGV) handover missions.
Rosa: Problem Context Planning kinematically and dynamically feasible trajectories for multiple robots in cooperative missions, while simultaneously optimizing task-related objectives such as completion time and control effort, remains highly challenging.
Dev: A widely adopted paradigm is to first compute collision-free paths or waypoints at a geometric or symbolic level, and then generate time-parameterized trajectories that interpolate these waypoints.
Rosa: However, in such hierarchical schemes, system dynamics and constraints are often not enforced from the outset, so the resulting trajectories may not be systematically guaranteed to be dynamically feasible, which can complicate subsequent tracking by low-level controllers.
Paper summary: Rosa: So to recap this paper, "Learning-Accelerated Optimization-based Trajectory Planning for Cooperative Aerial-Ground Handover Missions," they are looking at the challenge of planning trajectories for cooperative UAV and UGV handover missions.
Dev: The thesis is that while centralized optimization gives you the best possible result in terms of task optimality and dynamic feasibility, its computational cost limits how often you can use it in real-time.
Rosa: So, they propose a learning-augmented trajectory planning framework to bypass that bottleneck. They use a neural surrogate planner to generate informed warm starts for the downstream centralized optimizer.
Dev: The claim is that these predictions accelerate convergence to dynamically feasible solutions, and benchmark evaluations show this learning-augmented planning framework achieves more than a threefold speedup and one hundred percent optimization success rate compared to cold start optimization.
Taro: It matters because it suggests we can get high-quality, optimized cooperative paths much faster than the traditional method allows when we need to react to changing conditions.
Rosa: Right. It moves the planning process from being purely computationally bound to being informed by learned knowledge, making it viable for more complex scenarios.
Conclusion: Dev: Thinking about the authors, Jingshan Chen, Bochen Yu, Henrik Ebel, and Peter Eberhard developed this framework using LSTM networks for the surrogate planning part of their work.
Rosa: It’s really interesting how they managed to decouple the agents—the UAV and UGV—and use separate subnetworks for each robot instead of one big policy.
Dev: That decoupling is key because it lets each agent learn its specific trajectory prediction while still coordinating through the shared task specification input vector tau.
Taro: For someone who just listens to the show, this means that when you need a complex handover plan, the AI can generate a strong initial guess almost instantly instead of starting from scratch.
Rosa: That's right. It’s about combining what we know about how these robots move with a learning mechanism to speed up the mathematically intensive part of mission planning.
Dev: The implication is that for future multi-robot systems, you don't have to choose between having the absolute best optimization and having a system that can actually react quickly in dynamic environments.
Taro: So, it’s about achieving both feasibility and speed simultaneously through this learning augmentation approach for cooperative tasks.
Jingshan Chen, Bochen Yu, Henrik Ebel, Peter Eberhard
Institute of Engineering and Computational Mechanics, University of Stuttgart · LUT University
cs.RO, cs.LG, math.OC
Submitted: 2026-05-19
Updated: 2026-05-19
Comments: Preprint of a contribution accepted for publication in the RoManSy 2026 Springer proceedings
Journal ref: ROMANSY 26 - Robot Design, Dynamics and Control, Mechanisms and Machine Science, vol. 218, pp. 191-203, Springer, Cham (2027)
DOI: 10.1007/978-3-032-34511-0_19
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 77/100
The gist: The gist: This work presents a learning-augmented trajectory planning framework for cooperative unmanned aerial vehicle (UAV) and unmanned ground vehicle (UGV) handover missions.
Key concepts
- Centralized Trajectory Optimization
- This is the main method where a single mathematical solver tries to find the best path for all robots together. It ensures that all robots move safely and efficiently while meeting mission goals, but it is very slow and computationally expensive for real-time use.
- Neural Surrogate Planner
- Instead of using the slow optimizer directly, this uses a neural network (specifically LSTM networks) to quickly predict good handover trajectories based on the task requirements. This prediction acts as a 'warm start' or informed guess for the main optimizer.
- Agent-Decoupled Architecture
- The surrogate planner uses separate, identical neural networks for each robot (UAV and UGV). Each network takes the global task goal but learns to predict its specific robot's trajectory independently. This allows for tailored predictions rather than one single plan for both robots.
- Warm Start
- A warm start is a good initial guess provided to a complex optimization algorithm. By using the neural network's prediction as this starting point, the main optimizer doesn't have to search from scratch, allowing it to find a feasible solution much faster and more reliably.
Terminology
Summary
The gist: This work presents a learning-augmented trajectory planning framework for cooperative unmanned aerial vehicle (UAV) and unmanned ground vehicle (UGV) handover missions.
Problem Context
Planning kinematically and dynamically feasible trajectories for multiple robots in cooperative missions, while simultaneously optimizing task-related objectives such as completion time and control effort, remains highly challenging. A widely adopted paradigm is to first compute collision-free paths or waypoints at a geometric or symbolic level, and then generate time-parameterized trajectories that interpolate these waypoints. However, in such hierarchical schemes, system dynamics and constraints are often not enforced from the outset, so the resulting trajectories may not be systematically guaranteed to be dynamically feasible, which can complicate subsequent tracking by low-level controllers. Moreover, trajectories obtained from hand-crafted or heuristically designed paths are rarely optimal for the overall mission, often resulting in conservative solutions that do not fully utilize the system’s capabilities and reduce overall task efficiency.
Proposed Solution Overview
The proposed method addresses the high computational cost of centralized trajectory optimization by introducing a neural surrogate planner to generate informed warm starts. This learning-based warm start generator approximates the mapping from task specifications to cooperative trajectories, enabling rapid generation of decent coordinated trajectories. These predictions serve as informed warm starts for the downstream centralized optimizer, thereby accelerating convergence to dynamically feasible solutions. The overall framework makes several novel contributions, including presenting a surrogate planner based on an artificial neural network that maps task specifications to cooperative trajectories as informed warm starts, using separately trained per-agent networks rather than a single monolithic policy to generate both UAV and UGV trajectories.
Learning-Augmented Pipeline Details
The learning-augmented planning workflow involves an offline training phase followed by an online deployment phase. The pipeline is structured as follows:
-
Offline training data trajectories generated by the planner Eq. for expert demonstrations.
-
Surrogate planner given start and goal states and training for predicted handover trajectories.
-
Online trajectory planner described in Eq. using predicted handover trajectories as warm starts.
The surrogate architecture is based on an agent-decoupled framework, comprising two structurally identical encoder–decoder LSTM subnetworks, one for the UAV and one for the UGV. Given a global task specification as input, each subnetwork shares the same encoder initialization and recurrently produces a sequence of future predicted states for its corresponding robot. The input vector of our surrogate planner is constructed by concatenating the relative start and goal states τ = [x rel ugv,0⊤ x rel uav,0⊤ x rel ugv,N⊤ x rel uav,N⊤]T. Correspondingly, the joint expert trajectory Y ∈ R17×N is defined as a sequence of state vectors over N = 40 steps.
Surrogate Architecture and Training
The surrogate architecture predicts robot-specific trajectories for their corresponding UAV or UGV, denoted as Yˆuav = yˆuav,0 yˆuav,1... yˆuav,39 ∈ R13×40 and Yˆugv = yˆugv,0 yˆugv,1... yˆugv,39 ∈ R5×40. The encoder E: R32 → R2×L×dhid in our framework is implemented as a deep multi-layer perceptron (MLP) to handle the static nature of the task specification. Given the standardized task specification, the encoder initializes the decoder’s hidden dynamical states by predicting the optimal initial hidden states h0 ∈ R L×dhid and the cell states c0 ∈ R L×dhid for each robot agent via. The recurrent state update is given by (hk, ck) = D(ink, hk−1, ck−1) and the subsequent output projection is computed as yˆk = Wouthk + bout. The model minimizes a mean squared error (MSE) loss with time-dependent weights in the form L = 1/BN Σ i=1 N X−1 k=0 wk∥yi,k − yˆi,k∥2 2, where B = 256 is the batch size and N = 40 the horizon.
Performance Evaluation
Benchmark evaluations demonstrate that the learning-augmented planning framework achieves more than a threefold speedup and 100% optimization success rate compared to cold start optimization. Table 1 shows a statistical comparison with and without learning-based warm starts, where the average computation time drops from 4.38 s to 1.44 s. The learning-based warm start framework reduces the average number of optimization-algorithm iterations by approximately 36% and yields a 3.04× speedup in computation time from 4.38 s to 1.44 s, while maintaining comparable solution quality. Furthermore, the success rate increases from 96.0% to 100.0% when using warm starts. The learning-based warm start increases the success rate from 96.0% to 100.0% and improves the solver success rate to 100.0% compared to a standard cold start procedure.
Conclusion
In this work, we introduce a learning-augmented pipeline to accelerate centralized trajectory optimization for heterogeneous robotic handover tasks. Using these initial guesses, our approach achieves a more than 60% reduction in computational overhead and improves the solver success rate to 100% compared to a standard cold start procedure, all while preserving solution quality. As far as we are aware, this is the first work that combines agent-wise learned surrogates with a centralized trajectory optimization framework in a cooperative setting to generate dynamically feasible and optimally coordinated UAV-UGV handover trajectories. Future research will extend this framework to complex environments with dynamic obstacles and include real-world experimental validation.
Acknowledgements This research was supported by the German Research Foundation under Grants 433183605 and 501890093, and through Germany’s Excellence Strategy under Grant EXC 2075-390740016.
References
-
Agarwal, S., Alonso-Mora, J., Sun, S.: Decentralized real-time planning for multi-uav cooperative manipulation via imitation learning. arXiv preprint (2025). https://doi.org/10.48550/ARXIV.2510.17143
-
Andersson, J.A.E., Gillis, J., Horn, G., Rawlings, J.B., Diehl, M.: CasADi: a software framework for nonlinear optimization and optimal control. Mathematical Programming Computation 11(1), 1–36 (2018). https://doi.org/10.1007/s12532-018-0139-4
-
Banerjee, S., Cauligi, A., Pavone, M.: Deep learning warm starts for trajectory optimization on the international space station. arXiv preprint (2025). https://doi.org/10.48550/ARXIV.2505.05588
-
Cao, P., Hwang, J.T., Bewley, T., Kuester, F.: Mission-oriented trajectory optimization for search-and-rescue multirotor UAVs in cluttered and GPS-denied environments. In: AIAA AVIATION 2022 Forum. American Institute of Aeronautics and Astronautics (2022). https://doi.org/10.2514/6.2022-3999
-
Chen, J., Luo, W., Ebel, H., Eberhard, P.: Optimization-based trajectory planning for transport collaboration of heterogeneous systems. at - Automatisierungstechnik 72(2), 80–90 (2024). https://doi.org/10.1515/auto-2023-0078
-
Chen, J., Xu, L., Ebel, H., Eberhard, P.: An online optimization-based trajectory planning approach for cooperative landing tasks. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 12108–12114 (2025). https://doi.org/10.1109/iros60139.2025.11245920
-
Diaz, M., Fevens, T., Paull, L.: Uncertainty-aware policy sampling and mixing for safe interactive imitation learning. In: Conference on Robots and Vision (CRV). pp. 72–78 (2021). https://doi.org/10.1109/crv52889.2021.00018
-
Ebel, H.: Distributed control and organization of communicating mobile robots. Ph.D.
Improvements for AI systems
-
Neural Surrogate Planner Integration: The improved system can generate
informed warm starts for the downstream centralized optimizer,
which accelerates convergence to dynamically feasible solutions by providing a high-quality initial guess derived from task specifications. -
Decoupled Agent Network Architecture: By using
separate trained per-agent networks rather than a single monolithic policy,
the system can specialize in theheterogeneous dynamics of each robot
while receiving the same global mission context, leading to more efficient and specialized trajectory predictions. -
Learning-Augmented Pipeline for Optimization: The framework can achieve a
threefold speedup
in computation time and a100% optimization success rate
compared to cold start optimization, enabling fast and reliable trajectory generation for heterogeneous multirobot systems.
Sources
- Decentralized Real-Time Planning for Multi-UAV Cooperative Manipulation via Imitation Learning
- Deep Learning Warm Starts for Trajectory Optimization on the International Space Station
Related papers
- FMT x: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning
- MPCFormer: A physics-informed data-driven approach for explainable socially-aware autonomous driving
- RoboLab: A High-Fidelity Simulation Benchmark for Analysis of Task Generalist Policies
- ARC: A Reasoning Recipe for Robot Foundation Models
- HRDexDB: A 4D Dexterous Grasping Dataset Across Human and Multiple Robot Embodiments
- APT: Action Expert Pretraining Improves Instruction Generalization of Vision-Language-Action Policies