Collaborative Task and Path Planning for Heterogeneous Robotic Teams using Multi-Agent PPO

arXiv cs.RO / 4/2/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper addresses how heterogeneous multi-robot teams can coordinate effectively for extraterrestrial/planetary exploration where robots have diverse capabilities (e.g., science instruments vs. locomotion).
  • It frames the core problem as target allocation and scheduling, emphasizing that classical planning methods scale poorly due to combinatorial growth in robot–target assignments and trajectories.
  • The authors propose a collaborative planning strategy using Multi-Agent Proximal Policy Optimization (MAPPO) to shift computational scaling from inference-time to training-time for more practical real-time replanning.
  • They benchmark against single-objective optimal solutions derived from exhaustive search and test performance in an online replanning setting within a planetary exploration scenario.

Abstract

Efficient robotic extraterrestrial exploration requires robots with diverse capabilities, ranging from scientific measurement tools to advanced locomotion. A robotic team enables the distribution of tasks over multiple specialized subsystems, each providing specific expertise to complete the mission. The central challenge lies in efficiently coordinating the team to maximize utilization and the extraction of scientific value. Classical planning algorithms scale poorly with problem size, leading to long planning cycles and high inference costs due to the combinatorial growth of possible robot-target allocations and possible trajectories. Learning-based methods are a viable alternative that move the scaling concern from runtime to training time, setting a critical step towards achieving real-time planning. In this work, we present a collaborative planning strategy based on Multi-Agent Proximal Policy Optimization (MAPPO) to coordinate a team of heterogeneous robots to solve a complex target allocation and scheduling problem. We benchmark our approach against single-objective optimal solutions obtained through exhaustive search and evaluate its ability to perform online replanning in the context of a planetary exploration scenario.