Pith. sign in

REVIEW 1 cited by

A natural-language team command is distilled into a small recurrent network that encodes the task as an automaton, while a graph-neural-network policy executes it in a decentralized, real-time manner.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

A natural-language team command is distilled into a small recurrent network that encodes the task as an automaton, while a graph-neural-network policy executes it in a decentralized, real-time manner.

T0 review reviewed 2026-08-04 challenge →

arxiv 2509.24575 v2 pith:LWSIE4N2 submitted 2025-09-29 cs.RO cs.LGcs.MA

Prompting Robot Teams with Natural Language

Eduardo Sebasti\'an , Nicolas Pfitzer , Ajay Shankar , Amanda Prorok This is my paper
classification cs.RO cs.LGcs.MA
keywords languagemodelmulti-robottasktasksbehaviordecentralizedframework
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Robot teams usually need either a human to program each step or a live connection to a powerful language model during the mission. This paper proposes a middle path. Before deployment, a language model reads a task description, such as 'find the purple flag, bring it to the switch, then reach your goal', and writes it down as a state-by-state plan called an automaton. The model also generates several differently worded versions of the command. These plans are collected into a training set.

A recurrent neural network, a small network with memory, is trained to reproduce these plans. It takes the command in the form of a sentence embedding plus the current event, and outputs which step of the plan the team is in. Because the network is small, each robot can carry a copy. A second component, a graph neural network, is trained with multi-agent reinforcement learning to control the robot: it receives the recurrent network's current step, the robot's observations, and messages from neighboring robots, and outputs an action. At run time the two components are frozen, so execution is decentralized and does not call the language model.

The paper tests the system on simulated and real RoboMaster robots: teams find flags, press switches, and reach goals while handling events such as losing the flag or humans physically moving a robot. The system also scales from 3 trained agents to 12 deployed agents. The main caveat is that the plans used for training come from the same language model whose reasoning the method is supposed to imitate, so the reported 100% state-prediction accuracy measures agreement with the model's own output rather than with an independent ground truth.

Core claim

The paper's central claim is that a single lightweight model, composed of an RNN distilled from LLM task decompositions and a GNN policy, can take a natural-language command and have a team of robots execute the task onboard, in real time, in a decentralized manner, while handling sequential sub-tasks and disruptions. Quote from Section VI: 'we effectively distill the reasoning capabilities of a large language model into a single, light-weight RNN. This model, paired with a graph neural network-based policy, allows robots to reason about task sequences and collaborate on sub-tasks in a fully distributed manner.'

Load-bearing premise

The LLM prompt in Section IV-A produces a correct formal decomposition (automaton) for each task, and the sentence embedding E_i^l correctly conditions the RNN to pick that automaton. The paper treats LLM output as ground truth: the RNN is trained and then scored against those same generated labels (Section V-A), and the paper's own failure examples in Section V-B show that ambiguous or incorrect expressions can map to the wrong automaton state. If this assumption fails, the distilled RNN encodes the wrong algorithm, and the policy acts on a wrong state machine.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Axiom & Free-Parameter Ledger

2 free parameters · 5 axioms · 0 invented entities

The system's correctness rests on purchased inputs: the LLM's decomposition ability and the trained neural weights. The paper provides no external ground truth for the automata, so the core 'reasoning' is validated only against the LLM's own output, and the disclosed pipeline leaves out many training details.

free parameters (2)
  • Neural network weights: RNN f_psi, decoder d_phi, GNN policy g_theta = not reported
    Trained end-to-end on LLM-generated labels (supervised) and RL rewards; they are the substrate of the claimed behavior, but their values and architecture details are not reported.
  • Dataset and training hyperparameters: number of random walks L, horizon K, scenario count M, embedding and hidden dimens = not reported
    Hand-chosen and not disclosed; these determine RNN capacity and training dynamics but are not justified or derivable from the text.
axioms (5)
  • standard math RNNs can represent finite automata
    Invoked in Section IV-B via the cited theoretical connection [33]; no proof is repeated in this paper.
  • domain assumption LLM-generated decompositions are correct and sufficient for the task
    Section IV-A obtains automata from LLM prompts and uses them as supervised labels; no independent check is applied.
  • domain assumption Each task can be faithfully represented by a deterministic finite automaton with finite states and events
    The method models a task as a DFA cross product of Dec-POMDPs; tasks outside this class are not handled.
  • domain assumption Language embedding E_i^l uniquely identifies the intended automaton
    The RNN needs to separate tasks in hidden space; Section V-B acknowledges failures when expressions are sufficiently incorrect.
  • domain assumption Local observations plus neighbor messages over graph G_k are sufficient for cooperative execution
    The GNN policy and RNN event aggregation rely on local connectivity and shared event information; this is stated as a modeling choice in Sections III and IV-C.

reviewed 2026-08-04 · how reviews work

0 comments
Cite this review

Pith. "Pith review of Prompting Robot Teams with Natural Language." pith.science (2026). https://pith.science/paper/LWSIE4N2

@misc{pith2026250924575,
  author       = {Pith},
  title        = {Pith review of: Prompting Robot Teams with Natural Language},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LWSIE4N2}},
  note         = {Machine review of arXiv:2509.24575}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

This paper presents a framework to prompt multi-robot teams with high-level tasks using natural language expressions. Our objective is to use the reasoning capabilities of language models in understanding and decomposing multi-robot collaboration and decision-making tasks, but in settings where such models cannot be called at deployment time. However, it is hard to specify the behavior of an individual robot from a team instruction, and have it continuously adapt to actions from other robots. This necessitates a framework with the representational capacity required by the logic and semantics of a task, and yet supports decentralized, real-time operation. We solve this dilemma by recognizing that a task can be represented as a deterministic finite automaton, and that recurrent neural networks (RNNs) can encode numerous automata. This allows us to distill the logic and sequential decompositions of sub-tasks obtained from a language model into an RNN, and align its internal states with the semantics of a given task. This leads to a tiny model that encapsulates the reasoning of the language model and can be implemented onboard. To interpret the internal state of the RNN for a decentralized execution, we train a graph neural network control policy conditioned on the hidden states of the RNN and the language embeddings. We present evaluations on simulated and real-world multi-robot tasks that require sequential and collaborative behavior by the team, demonstrating scalable, robust, real-time performance -- sites.google.com/view/prompting-teams.

Figures

Figures reproduced from arXiv: 2509.24575 by Ajay Shankar, Amanda Prorok, Eduardo Sebasti\'an, Nicolas Pfitzer.

Figure 1
Figure 1. Figure 1: A deployment of our method on RoboMasters [15]. The robots are tasked with identifying and retrieving the purple flag. Once the flag has been placed on the yellow switch, the access to the second part of the arena is activated, and the robots navigate to their respective final destinations. for establishing one-to-one correspondences with algorithmic primitives [6], [7], and thus had limited reasoning capa… view at source ↗
Figure 2
Figure 2. Figure 2: A schematic overview of our framework. We begin with an offline generation phase that compiles a dataset D, composed of sequences of sub-tasks and associated language embeddings for different tasks. This is done by prompting an LLM with diverse natural-language specifications covering all the tasks. Next, two offline training stages follow: (left) an RNN is trained with a supervised loss, using D, to learn… view at source ↗
Figure 3
Figure 3. Figure 3: Supervised training pipeline for the RNN task model. network with sufficient capacity can represent any automa￾ton [33]. This connection can also be applied to classical recurrent models like gated recurrent units, long short-term memory models or attention-based networks [14]. Conse￾quently, we can train a sufficiently expressive recurrent model, in a supervised manner, to represent an automaton from D—th… view at source ↗
Figure 4
Figure 4. Figure 4: Rollouts of the same RNN on seven different tasks (T{0..6}) over the available sub-tasks (y-axis) with relevant/irrelevant events presented to it (x-axis). Training and test achieve 100% of accuracy. Absorbing states are denoted by . The model exhibits correct transitions while rejecting events that belong to a potentially different automaton. For instance, T1 requires the team to “Search for the green fla… view at source ↗
Figure 5
Figure 5. Figure 5: Analysis of the impact of reasoning and language initialization in a four-room scenario. Three robots are placed in any of the three leftmost rooms, which are divided by solid black walls. Each room has a differently coloured switch (• • •), and the robots need to hit them in order to open a passage and navigate to their goals (•). (left) Snapshots of different robot and RNN initializations, showing that o… view at source ↗
Figure 6
Figure 6. Figure 6: Evolution of team trajectories from an instance of ‘retrieve-the-flag’ scenario ( [PITH_FULL_IMAGE:figures/full_fig_p006_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Examples of zero-shot multi-robot deployments in the retrieve-the-flag scenario, on physical robots (a-c) and in simulations (d-f). Each task requires the team to locate the specified flag, and then ‘bring’ it to the switch (yellow) which opens a virtual gate separating their goal region. The team can handle a variety of natural-language expressions, objectives and even unmodeled disturbances (a person int… view at source ↗
Figure 8
Figure 8. Figure 8: Retrieve-the-flag scenario. The policy is trained with 3 agents but deployed with 6, 9, and 12 agents in simulation, while maintaining real-time inference (measured on a MacBook Air M3). The task is completed suc￾cessfully, though the team performance drops gradually at larger disparities. Finally, we evaluate how well the framework scales to larger teams. Because the policy uses a graph-based archi￾tectur… view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Is Inter-Seed Cross-Play Enough? Evaluating the Robustness of Zero-Shot Coordination Algorithms to Implementation Details

    cs.AI 2026-08 conditional novelty 5.0

    For Other-Play in Yokai, agents trained with different implementation details coordinate across implementations about as well as across seeds, supporting inter-seed cross-play as a proxy for cross-implementation evaluation.

Reference graph

Works this paper leans on

37 extracted references · 18 linked inside Pith · cited by 1 Pith paper

  1. [1]

    Long-horizon Multi-robot Rearrangement Planning for Construction Assembly,

    V . N. Hartmann, A. Orthey, D. Driess, O. S. Oguz, and M. Toussaint, “Long-horizon Multi-robot Rearrangement Planning for Construction Assembly,”IEEE Transactions on Robotics, vol. 39, no. 1, pp. 239– 252, 2022

    2022

  2. [2]

    On Collaborative Robot Teams for Environmental Monitoring: A Macro- scopic Ensemble Approach,

    V . Edwards, T. C. Silva, B. Mehta, J. Dhanoa, and M. A. Hsieh, “On Collaborative Robot Teams for Environmental Monitoring: A Macro- scopic Ensemble Approach,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2023, pp. 11 148–11 153

    2023

  3. [3]

    Multi-robot Multi-room Exploration with Geometric Cue Extraction and Circular Decomposition,

    S. Kim, M. Corah, J. Keller, G. Best, and S. Scherer, “Multi-robot Multi-room Exploration with Geometric Cue Extraction and Circular Decomposition,”IEEE Robotics and Automation Letters, vol. 9, no. 2, pp. 1190–1197, 2023

    2023

  4. [4]

    Multi- robot Target Tracking with Sensing and Communication Danger Zones,

    J. Liu, P. Li, Y . Wu, G. S. Sukhatme, V . Kumar, and L. Zhou, “Multi- robot Target Tracking with Sensing and Communication Danger Zones,”arXiv preprint arXiv:2404.07880, 2024

    Pith/arXiv arXiv 2024

  5. [5]

    A survey of robotic language grounding: tradeoffs between symbols and embeddings,

    V . Cohen, J. X. Liu, R. Mooney, S. Tellex, and D. Watkins, “A survey of robotic language grounding: tradeoffs between symbols and embeddings,” inInternational Joint Conference on Artificial Intelligence, 2024, pp. 7999–8009

    2024

  6. [6]

    Corpus-based Robotics: A Route Instruction Example,

    G. Bugmann, E. Klein, S. Lauria, and T. Kyriacou, “Corpus-based Robotics: A Route Instruction Example,” inProceedings of Intelligent Autonomous Systems, 2004, pp. 96–103

    2004

  7. [7]

    Toward Understanding Natural Language Directions,

    T. Kollar, S. Tellex, D. Roy, and N. Roy, “Toward Understanding Natural Language Directions,” inACM/IEEE International Conference on Human-Robot Interaction, 2010, pp. 259–266

    2010

  8. [8]

    Tell Me Where to Go: A Composable Framework for Context-Aware Embodied Robot Navigation,

    H. Biggie, A. N. Mopidevi, D. Woods, and C. Heckman, “Tell Me Where to Go: A Composable Framework for Context-Aware Embodied Robot Navigation,”arXiv preprint arXiv:2306.09523, 2023

    Pith/arXiv arXiv 2023

  9. [9]

    Language Grounded Multi-agent Reinforcement Learning with Human-interpretable Communication,

    H. Li, H. N. Mahjoub, B. Chalaki, V . Tadiparthi, K. Lee, E. Moradi- Pari, C. M. Lewis, and K. P. Sycara, “Language Grounded Multi-agent Reinforcement Learning with Human-interpretable Communication,” arXiv preprint arXiv:2409.17348, 2024

    Pith/arXiv arXiv 2024

  10. [10]

    Foundation Models to the Rescue: Deadlock Resolution in Connected Multi-Robot Systems,

    K. Garg, S. Zhang, J. Arkin, and C. Fan, “Foundation Models to the Rescue: Deadlock Resolution in Connected Multi-Robot Systems,” arXiv preprint arXiv:2404.06413, 2024

    Pith/arXiv arXiv 2024

  11. [11]

    Distilling On-device Language Models for Robot Planning with Minimal Human Intervention,

    Z. Ravichandran, I. Hounie, F. Cladera, A. Ribeiro, G. J. Pappas, and V . Kumar, “Distilling On-device Language Models for Robot Planning with Minimal Human Intervention,”arXiv preprint arXiv:2506.17486, 2025

    arXiv 2025

  12. [12]

    Language- Conditioned Offline RL for Multi-Robot Navigation,

    S. Morad, A. Shankar, J. Blumenkamp, and A. Prorok, “Language- Conditioned Offline RL for Multi-Robot Navigation,”arXiv preprint arXiv:2407.20164, 2024

    Pith/arXiv arXiv 2024

  13. [13]

    Learning to Discover Abstractions for LLM Reasoning,

    Y . Qu, A. Singh, Y . Lee, A. Setlur, R. Salakhutdinov, C. Finn, and A. Kumar, “Learning to Discover Abstractions for LLM Reasoning,” inWorkshop on Programmatic Representations for Agent Learning, International Conference on Machine Learning, 2025

    2025

  14. [14]

    LATMOS: Latent Automaton Task Model from Observation Sequences,

    W. Zhan, Q. Dong, E. Sebastián, and N. Atanasov, “LATMOS: Latent Automaton Task Model from Observation Sequences,”arXiv preprint arXiv:2503.08090, 2025

    Pith/arXiv arXiv 2025

  15. [15]

    The Cambridge RoboMaster: An Agile Multi-Robot Research Platform,

    J. Blumenkamp, A. Shankar, M. Bettini, J. Bird, and A. Prorok, “The Cambridge RoboMaster: An Agile Multi-Robot Research Platform,” arXiv preprint arXiv:2405.02198, 2024

    Pith/arXiv arXiv 2024

  16. [16]

    Interpretation of Spatial Language in a Map Navigation Task,

    M. Levit and D. Roy, “Interpretation of Spatial Language in a Map Navigation Task,”IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), vol. 37, no. 3, pp. 667–679, 2007

    2007

  17. [17]

    Walk the talk: connecting language, knowledge, and action in route instructions,

    M. MacMahon, B. Stankiewicz, and B. Kuipers, “Walk the talk: connecting language, knowledge, and action in route instructions,” in National Conference on Artificial Intelligence, vol. 2, 2006, pp. 1475– 1482

    2006

  18. [18]

    An Intelligence Architecture for Grounded Language Communication with Field Robots,

    T. M. Howard, E. Stump, J. Fink, J. Arkin, R. Paul, D. Park, S. Roy, D. Barber, R. Bendell, K. Schmeckpeper, J. Tian, J. Oh, M. Wigness, L. Quang, B. Rothrock, J. Nash, M. R. Walter, F. Jentsch, and N. Roy, “An Intelligence Architecture for Grounded Language Communication with Field Robots,”Field Robotics, vol. 2, pp. 468–512, 2022

    2022

  19. [19]

    Language models are few-shot learners,

    T. Brown, B. Mann, N. Ryder, M. Subbiah, J. D. Kaplan, P. Dhariwal, A. Neelakantan, P. Shyam, G. Sastry, A. Askell,et al., “Language models are few-shot learners,”Advances in Neural Information Pro- cessing Systems, vol. 33, pp. 1877–1901, 2020

    1901

  20. [20]

    Tidybot: Personalized Robot As- sistance with Large Language Models,

    J. Wu, R. Antonova, A. Kan, M. Lepert, A. Zeng, S. Song, J. Bohg, S. Rusinkiewicz, and T. Funkhouser, “Tidybot: Personalized Robot As- sistance with Large Language Models,”Autonomous Robots, vol. 47, no. 8, pp. 1087–1102, 2023

    2023

  21. [21]

    SPINE: Online Semantic Planning for Missions with Incomplete Natural Language Specifications in Unstructured Environments,

    Z. Ravichandran, V . Murali, M. Tzes, G. J. Pappas, and V . Kumar, “SPINE: Online Semantic Planning for Missions with Incomplete Natural Language Specifications in Unstructured Environments,”arXiv preprint arXiv:2410.03035, 2025

    Pith/arXiv arXiv 2025

  22. [22]

    Open X-embodiment: Robotic Learning Datasets and RT-X Models: Open x-embodiment Collaboration 0,

    A. O’Neill, A. Rehman, A. Maddukuri, A. Gupta, A. Padalkar, A. Lee, A. Pooley, A. Gupta, A. Mandlekar, A. Jain,et al., “Open X-embodiment: Robotic Learning Datasets and RT-X Models: Open x-embodiment Collaboration 0,” inIEEE International Conference on Robotics and Automation, 2024, pp. 6892–6903

    2024

  23. [23]

    Gemini Robotics: Bringing AI into the Physical World,

    G. R. Team, S. Abeyruwan, J. Ainslie, J.-B. Alayrac, M. G. Arenas, T. Armstrong, A. Balakrishna, R. Baruch, M. Bauza, M. Blokzijl, et al., “Gemini Robotics: Bringing AI into the Physical World,”arXiv preprint arXiv:2503.20020, 2025

    Pith/arXiv arXiv 2025

  24. [24]

    Co-NavGPT: Multi-Robot Cooperative Visual Semantic Navigation Using Vision Language Models,

    B. Yu, Q. Yuan, K. Li, H. Kasaei, and M. Cao, “Co-NavGPT: Multi-Robot Cooperative Visual Semantic Navigation Using Vision Language Models,”arXiv preprint arXiv:2310.07937, 2025

    Pith/arXiv arXiv 2025

  25. [25]

    SayNav: Grounding Large Language Models for Dy- namic Planning to Navigation in New Environments,

    A. Rajvanshi, K. Sikka, X. Lin, B. Lee, H.-P. Chiu, and A. Ve- lasquez, “SayNav: Grounding Large Language Models for Dy- namic Planning to Navigation in New Environments,”arXiv preprint arXiv:2309.04077, 2024

    Pith/arXiv arXiv 2024

  26. [26]

    HELM: Human-Preferred Exploration with Language Models,

    S. Liao, X. Lv, Y . Cao, J. Lew, W. Wu, and G. Sartoretti, “HELM: Human-Preferred Exploration with Language Models,”arXiv preprint arXiv:2503.07006, 2025

    Pith/arXiv arXiv 2025

  27. [27]

    Choices are More Important than Efforts: LLM Enables Efficient Multi-Agent Exploration,

    Y . Qu, B. Wang, Y . Jiang, J. Shao, Y . Mao, C. Wang, C. Liu, and X. Ji, “Choices are More Important than Efforts: LLM Enables Efficient Multi-Agent Exploration,”arXiv preprint arXiv:2410.02511, 2024

    Pith/arXiv arXiv 2024

  28. [28]

    Large Language Model Guided Reinforcement Learning Based Six-Degree-of-Freedom Flight Control,

    Y . Han, M. Yang, Y . Ren, and W. Li, “Large Language Model Guided Reinforcement Learning Based Six-Degree-of-Freedom Flight Control,”IEEE Access, vol. 12, pp. 89 479–89 492, 2024

    2024

  29. [29]

    Air- Ground Collaboration for Language-Specified Missions in Unknown Environments,

    F. Cladera, Z. Ravichandran, J. Hughes, V . Murali, C. Nieto-Granda, M. A. Hsieh, G. J. Pappas, C. J. Taylor, and V . Kumar, “Air- Ground Collaboration for Language-Specified Missions in Unknown Environments,”arXiv preprint arXiv:2505.09108, 2025

    Pith/arXiv arXiv 2025

  30. [30]

    ZeroCAP: Zero-Shot Multi-Robot Context Aware Pattern Formation via Large Language Models,

    V . L. N. Venkatesh and B.-C. Min, “ZeroCAP: Zero-Shot Multi-Robot Context Aware Pattern Formation via Large Language Models,”arXiv preprint arXiv:2404.02318, 2025

    Pith/arXiv arXiv 2025

  31. [31]

    LUMOS: Language-Conditioned Imitation Learn- ing with World Models,

    I. Nematollahi, B. DeMoss, A. L. Chandra, N. Hawes, W. Burgard, and I. Posner, “LUMOS: Language-Conditioned Imitation Learn- ing with World Models,”arXiv preprint arXiv:2503.10370, 2025, arXiv:2503.10370

    Pith/arXiv arXiv 2025

  32. [32]

    MARLIN: Multi-Agent Reinforcement Learning Guided by Language-Based Inter-Robot Ne- gotiation,

    T. Godfrey, W. Hunt, and M. D. Soorati, “MARLIN: Multi-Agent Reinforcement Learning Guided by Language-Based Inter-Robot Ne- gotiation,”arXiv preprint arXiv:2410.14383, 2025

    Pith/arXiv arXiv 2025

  33. [33]

    Connecting weighted automata, tensor networks and recurrent neural networks through spectral learn- ing,

    T. Li, D. Precup, and G. Rabusseau, “Connecting weighted automata, tensor networks and recurrent neural networks through spectral learn- ing,”Machine Learning, vol. 113, no. 5, pp. 2619–2653, 2024

    2024

  34. [34]

    Optimal Scene Graph Planning with Large Language Model Guidance,

    Z. Dai, A. Asgharivaskasi, T. Duong, S. Lin, M.-E. Tzes, G. Pap- pas, and N. Atanasov, “Optimal Scene Graph Planning with Large Language Model Guidance,” inIEEE International Conference on Robotics and Automation, 2024, pp. 14 062–14 069

    2024

  35. [35]

    AutoTAMP: Autoregressive task and motion planning with llms as translators and checkers,

    Y . Chen, J. Arkin, C. Dawson, Y . Zhang, N. Roy, and C. Fan, “AutoTAMP: Autoregressive task and motion planning with llms as translators and checkers,” inIEEE International Conference on Robotics and Automation, 2024, pp. 6695–6702

    2024

  36. [36]

    Language-Grounded Hierarchical Planning and Execution with Multi-Robot 3D Scene Graphs,

    J. Strader, A. Ray, J. Arkin, M. B. Peterson, Y . Chang, N. Hughes, C. Bradley, Y . X. Jia, C. Nieto-Granda, R. Talak, C. Fan, L. Carlone, J. P. How, and N. Roy, “Language-Grounded Hierarchical Planning and Execution with Multi-Robot 3D Scene Graphs,”arXiv preprint arXiv:2506.07454, 2025

    Pith/arXiv arXiv 2025

  37. [37]

    The Surprising Effectiveness of PPO in Cooperative Multi-Agent Games,

    C. Yu, A. Velu, E. Vinitsky, J. Gao, Y . Wang, A. Bayen, and Y . Wu, “The Surprising Effectiveness of PPO in Cooperative Multi-Agent Games,”Advances in Neural Information Processing Systems, vol. 35, pp. 24 611–24 624, 2022

    2022

This paper was first reviewed by deepseek-v4-flash on August 4, 2026.