Multi-agent
More than one vehicle changes what flight software has to decide. State that a single spacecraft holds locally becomes shared state, held on several processors that talk over links that are slow, narrow, noisy or absent, and some agent must decide what the team does next when the network splits. The questions are who allocates work, what is shared and at what cost in bandwidth, how maps and plans are merged, and what each vehicle does when it hears nothing. The classification of collective-behavior algorithms into ten mathematical classes finds that, apart from artificial potential functions, no single technique generalizes across both of the application areas it compares, and its scalability and bandwidth ratings are the authors’ judgment, not benchmark results [3].
Design space
Section titled “Design space”Local rules with no coordination channel are the oldest family. Reynolds’s boids produce flock motion from separation, velocity matching and centering applied to nearby neighbors only, and the paper found that a global central force made a scattered flock converge on its centroid, which does not resemble a flock [1]. The work was a graphics simulation with no sensing error, actuator limit or communication model, so space swarm and formation work inherits the idea of locality and none of its numbers [1]. The same locality appears in the TERMES construction system, where an offline compiler turns a target structure into movement rules that three climbing robots follow using only local sensing, with no global map and no central controller [15]. Distributed sampling-based motion planning for spacecraft swarms is a space-specific variant: agents exchange node positions and sphere radii with neighbors and a distributed assignment step settles which agent takes which target. The reported evidence is two simulation figures with no metrics [14].
Broadcast-state task allocation without negotiation is the second family. ALLIANCE gives each robot a motivation for each task that grows with impatience and resets when a teammate is heard taking the task, so a teammate that stops broadcasting is treated as failed and its task is reallocated by the same mechanism. It ran on three heterogeneous robots in a laboratory with a radio limited to about one message per three seconds, and reported no completion times [2]. A robot taking over a failed teammate’s task there paused 5 to 8 s, a figure set by hand-chosen parameters [2].
Central planning with distributed execution is the third. The JPL rover-team line pairs a central planner that divides science goals among rovers with a CASPER planner on each rover that repairs its own plan when execution deviates [4]. The same prototype fed clustering of spectrometer readings into goal generation for three simulated rovers [5]. A later evaluation of goal interdependency used a geologist-derived reward model and randomly generated problems, with no rover or terrain in the loop [6]. ShAC coordinates shared activities during execution between two simulated Mars Exploration Rovers and the Odyssey orbiter over a simple master/slave protocol, on one scenario with three agents [7]. All four are simulation. The spacecraft analog is the TechSat 21 Autonomous Sciencecraft design, a cluster of SAR satellites with onboard planning; the program was canceled and never flew, so its timing figures are estimates [11].
Physical coupling is a fourth family, in which the carried object is the communication channel. CAMPOUT, a three-layer behavior-based architecture, was run with two Sample Return Rovers carrying an extended payload over natural terrain in the Arroyo Seco, with a single unreplicated traverse of 40 to 50 m on slopes up to 9 degrees and a final heading error under 1 degree [8]. A companion paper designed coordination to avoid inter-rover radio traffic by sensing force and yaw at the instrumented gimbals; its body contains no hardware experiment and its results are simulation [9]. A distributed model-predictive controller has since carried a 475 kg mock cargo with two 800 kg rovers on Earth analog terrain at 0.5 m/s, over three loop repeats of one route [10].
Formation flying is the orbital counterpart. SPHERES, designed at MIT and flown on the ISS, was validated first in laboratory and KC-135 tests, and its prototype hardware numbers do not describe the flown satellite [12]. In the March 2007 ISS session two satellites starting back to back with pointing errors of 150 to 167 degrees reacquired each other with limited-field-of-view ultrasound sensors; multipath off the station walls delayed convergence by 55 to 58 s [13].
Outside the space branches, the same coordination problems have been solved with fewer constraints. JPL’s CARACaS ran four full-size unmanned surface vessels with no human in the tasking loop, allocating Patrol, Track, Inspect and Trail tasks; the environment is two-dimensional and obstacle sparse and nothing in it bounds behavior under flight communication delay [16]. A planning formulation for underwater gliders that must surface periodically to bound dead-reckoning error treats synchronization as a decision, which is the shape of the planetary relay problem; the transfer is by analogy and the results are a case study [17].
What changed and what it enabled
Section titled “What changed and what it enabled”Field teams showed how little supervision a communication-degraded team needs. In one Safety Research Mine run, Team CoSTAR’s operator issued 16 missions to two Vanguard robots and one Support robot, 4 of them communication node drops each taking 1 to 3 minutes, and the evidence is a single run [18]. Multi-robot SLAM scaled by computing only the loop closures predicted to reduce uncertainty most, tested on underground competition data and not on planetary terrain [19]. Learned and communication-aware methods are the newest strand: a flying scout that chooses where to transmit to a specialist by signal strength [29], and behavior-adaptive hazard mapping for heterogeneous robots without communication [30]. Both are simulation only, with modeled signal maps or assumed failure rates.
The CADRE technology demonstration, three rovers and a base station, is the first multi-agent autonomy stack built for flight on the Moon. Its architecture elects a leader, which plans for the team, while each agent runs its own motion planner and surface mobility stack [20]. A leader elected every ten seconds bounds the idle time after leader loss at 10 s, with planning state held on a designated survivor [21]. The election algorithm starts from Gallager-Humblet-Spira spanning-tree construction and ranks candidates by battery state of charge and CPU temperature; it was demonstrated with four software processes and not on the radio mesh [22]. Exploration is semi-centralized: the leader partitions unexplored area by k-means and each rover then explores its own region frontier by frontier, which removes inter-robot traffic. Analog testing covered 2724 m^2 at 1 g under flood lighting [23]. The shared database, MoonDB, rides a mesh radio with 1 Mbps aggregate bandwidth and motor interference that restricts transfer to time windows, and the paper reports no measured utilization or loss under that link [24]. Federated mapping would send neural map parameters instead of maps, but was validated on a glacier dataset and simulated Martian terrain, not CADRE data [25]. Assembly scheduling for the proposed Lunar Crater Radio Telescope is posed as a mixed integer program with time-varying travel times; the solver is stopped before certifying optimality [26]. A JPL infusion survey lists Mars PUFFER, DASHER, SWARMS and CADRE among the multi-agent efforts, with no performance data [31].
What has flown
Section titled “What has flown”Flown: CADRE launched on IM-3 for Reiner Gamma, and SPHERES formation acquisition ran aboard the ISS [20][13]. Flight results from CADRE are not in the held record; the sources above predate flight [21]. Demonstrated on Earth hardware: CAMPOUT cooperative transport [8], the shared-cargo controller [10], TERMES [15], and the CoSTAR heterogeneous team [18]. Simulation or proposal only: the CASPER rover-team planners [4][5][6], ShAC [7], TechSat 21 [11], federated mapping [25], and the communication-aware planners [29][30].
The relay problem is the multi-agent system already operating on Mars. Perseverance relay planning precomputes data volume for each orbiter overflight and filters against passes per sol and latency to the next decisional pass [27]. Mars surface-to-surface radio propagation is terrain-dominated, shown by ray tracing over Jezero Crater terrain with no surface measurement to check it against [28].
What is not established
Section titled “What is not established”No source in the held record reports CADRE flight performance: election latency, convergence time and message counts are not given for the leader election [22], and the database design is argued rather than measured under the EMI-limited link [24]. Most task-allocation work for rover teams has been run in simulation with no quantitative result, including the central-plus-onboard planners [4][5] and the coordination protocols [7]. The behavior-based and motivation-based architectures were tested on a few robots in benign settings, and no scaling study of swarm size exists in the planning papers [2][14]. The broadcast-state assumption has no test under the lossy, contended links a planetary team would see [2]. Partition behavior, meaning what a team does when the leader and members cannot hear each other, is argued in the CADRE design papers and not measured [21][22]. Results from maritime, underwater and underground teams [16][17][19] bound the algorithms and not the radiation, delay or processor limits of flight.
References
- Reynolds, C. W. (1987). Flocks, Herds, and Schools: A Distributed Behavioral Model
. annual conference on Computer graphics and interactive techniques, 4. Source
BibTeX
@inproceedings{reynolds1987flocks, title = {Flocks, Herds, and Schools: A Distributed Behavioral Model}, author = {Reynolds, Craig W.}, booktitle = {annual conference on Computer graphics and interactive techniques}, volume = {21}, number = {4}, pages = {25-34}, publisher = {ACM}, year = {1987}, doi = {10.1145/37401.37406}, abstract = {The aggregate motion of a flock of birds, a herd of land animals, or a school of fish is a beautiful and familiar part of the natural world. But this type of complex motion is rarely seen in computer animation. This paper explores an approach based on simulation as an alternative to scripting the paths of each bird individually. The simulated flock is an elaboration of a particle system, with the simulated birds being the particles. The aggregate motion of the simulated flock is created by a distributed behavioral model much like that at work in a natural flock; the birds choose their own course. Each simulated bird is implemented as an independent actor that navigates according to its local perception of the dynamic environment, the laws of simulated physics that rule its motion, and a set of behaviors programmed into it by the "animator." The aggregate motion of the simulated flock is the result of the dense interaction of the relatively simple behaviors of the individual simulated b...} } - Parker, L. E. (1994). ALLIANCE: An Architecture for Fault Tolerant, Cooperative Control of Heterogeneous Mobile Robots
. IEEE/RSJ/GI International Conference on Intelligent Robots and Systems. Source
BibTeX
@inproceedings{parker1994alliance, title = {ALLIANCE: An Architecture for Fault Tolerant, Cooperative Control of Heterogeneous Mobile Robots}, author = {Parker, Lynne E.}, booktitle = {IEEE/RSJ/GI International Conference on Intelligent Robots and Systems}, volume = {2}, pages = {776-783}, institution = {Oak Ridge National Laboratory}, address = {Munich, Germany}, year = {1994}, doi = {10.1109/iros.1994.407550}, abstract = {This research addresses the problem of achieving fault tolerant cooperation within small- to medium-sized teams of heterogeneous mobile robots. We describe a novel behavior-based, fully distributed architecture, called ALLIANCE, that utilizes adaptive action selection to achieve fault tolerant cooperative control in robot missions involving loosely coupled, largely independent tasks. The robots in this architecture possess a variety of high-level functions that they can perform during a mission, and must at all times select an appropriate action based on the requirements of the mission, the activities of other robots, the current environmental conditions, and their own internal states. The software architecture allows the team members to respond robustly and reliably to unexpected environmental changes and modifications in the robot team that may occur due to mechanical failure, the learning of new skills, or the addition or removal of robots from the team by human intervention. After presenting ALLIANCE, we describe in detail our experimental results of an implementation of this architecture on a team of physical mobile robots performing a cooperative box pushing demonstration.>} } - Rossi, F., Bandyopadhyay, S., Wolf, M. T. and Pavone, M. (2021). Multi-Agent Algorithms for Collective Behavior: A structural and application-focused atlas
. arXiv preprint arXiv:2103.11067. Source
BibTeX
@article{rossi2021multi, title = {Multi-Agent Algorithms for Collective Behavior: A structural and application-focused atlas}, author = {Rossi, Federico and Bandyopadhyay, Saptarshi and Wolf, Michael T. and Pavone, Marco}, journal = {arXiv preprint arXiv:2103.11067}, year = {2021}, doi = {10.48550/arxiv.2103.11067}, abstract = {The goal of this paper is to provide a survey and application-focused atlas of collective behavior coordination algorithms for multi-agent systems. We survey the general family of collective behavior algorithms for multi-agent systems and classify them according to their underlying mathematical structure. In doing so, we aim to capture fundamental mathematical properties of algorithms (e.g., scalability with respect to the number of agents and bandwidth use) and to show how the same algorithm or family of algorithms can be used for multiple tasks and applications. Collectively, this paper provides an application-focused atlas of algorithms for collective behavior of multi-agent systems, with three objectives: 1. to act as a tutorial guide to practitioners in the selection of coordination algorithms for a given application; 2. to highlight how mathematically similar algorithms can be used for a variety of tasks, ranging from low-level control to high-level coordination; 3. to explore the state-of-the-art in the field of control of multi-agent systems and identify areas for future research.} } - Estlin, T., Rabideau, G., Mutz, D. and Chien, S. (2000). Using Continuous Planning Techniques to Coordinate Multiple Rovers. ntrs.nasa.gov/citations/20060032546
BibTeX
@misc{estlin2000planning, title = {Using Continuous Planning Techniques to Coordinate Multiple Rovers}, author = {Estlin, T. and Rabideau, G. and Mutz, D. and Chien, S.}, year = {2000}, url = {https://ntrs.nasa.gov/citations/20060032546}, abstract = {This paper describes a dynamic planning system for coordinating multiple rovers in collecting planetary surface data.} } - Estlin, T. A., Castano, R., Davies, A., Rabideau, G., Mutz, D., Chien, S. and Mjolsness, E. (2001). Goal-directed scientific exploration using multiple rovers
. The International FLAIRS Conference. Source
BibTeX
@inproceedings{estlin2001exploration, title = {Goal-directed scientific exploration using multiple rovers}, author = {Estlin, T. A. and Castano, R. and Davies, A. and Rabideau, G. and Mutz, D. and Chien, S. and Mjolsness, E.}, booktitle = {The International FLAIRS Conference}, year = {2001}, url = {https://ntrs.nasa.gov/citations/20060031297}, abstract = {This paper describes an integrated system for coordinating multiple rover behavior with the overall goal of collecting planetary surface data.} } - Estlin, T., Gaines, D., Fisher, F. and Castano, R. (2004). Onboard planning for geological investigations using a rover team
. International Workshop on Planning and Scheduling for Space. Source
BibTeX
@inproceedings{estlin2004onboard, title = {Onboard planning for geological investigations using a rover team}, author = {Estlin, Tara and Gaines, Daniel and Fisher, Forest and Castano, Rebecca}, booktitle = {International Workshop on Planning and Scheduling for Space}, publisher = {JPL Open Repository}, year = {2004}, url = {https://dataverse.jpl.nasa.gov/dataset.xhtml?persistentId=hdl:2014/38088} } - Clement, B. J. and Barrett, A. (2002). Continual coordination of shared activities
. National Conference on Artificial Intelligence. Source
BibTeX
@inproceedings{clement2002bcontinual, title = {Continual coordination of shared activities}, author = {Clement, B. J. and Barrett, A.}, booktitle = {National Conference on Artificial Intelligence}, year = {2002}, url = {https://ntrs.nasa.gov/citations/20060029546}, abstract = {Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. For domains with varying degrees of interaction and different constraints on communication and computation, agents will require different coordination protocols in order to efficiently achieve their goals. ShAC (Shared Activity Coordination) is a framework for designing coordination protocols and an algorithm for continually coordinating agents using these protocols during execution. We show how a variety of protocols can be constructed using this framework and describe how ShAC coordinates two rovers and an orbiter in a simulated Mars scenario.} } - Huntsberger, T., Pirjanian, P., Trebi-Ollennu, A., Das, H., Aghazarian, H., Ganino, A., Garrett, M., Joshi, S. S. and Schenker, P. (2001). Tightly-coupled coordination of multi-robot systems for mars exploration
. IEEE Transactions on Robotics and Automation. Source
BibTeX
@article{huntsberger2001tightly, title = {Tightly-coupled coordination of multi-robot systems for mars exploration}, author = {Huntsberger, T. and Pirjanian, P. and Trebi-Ollennu, Ashitey and Das, H. and Aghazarian, Hrand and Ganino, Anthony and Garrett, Mike and Joshi, Sanjay S. and Schenker, P.}, journal = {IEEE Transactions on Robotics and Automation}, publisher = {JPL Open Repository}, year = {2001}, url = {https://dataverse.jpl.nasa.gov/dataset.xhtml?persistentId=hdl:2014/12588} } - Schenker, P. S., Huntsberger, T. L., Pirjanian, P., Trebi-Ollennu, A., Das, H., Joshi, S. S., Aghazarian, H., Ganino, A. J., Kennedy, B. A. and Garrett, M. S. (2001). Robot work crews for planetary outposts: close cooperation and coordination of multiple mobile robots
. Sensor Fusion and Decentralized Control in Robotic Systems III. Source
BibTeX
@inproceedings{schenker2001robot, title = {Robot work crews for planetary outposts: close cooperation and coordination of multiple mobile robots}, author = {Schenker, Paul S. and Huntsberger, Terrance L. and Pirjanian, P. and Trebi-Ollennu, Ashitey and Das, H. and Joshi, Sanjay S. and Aghazarian, Hrand and Ganino, A. J. and Kennedy, Brian A. and Garrett, M. S.}, booktitle = {Sensor Fusion and Decentralized Control in Robotic Systems III}, publisher = {JPL Open Repository}, year = {2001}, url = {https://dataverse.jpl.nasa.gov/dataset.xhtml?persistentId=hdl:2014/12772} } - Krawciw, A., Antonyshyn, L., Lilge, S., Olmedo, N., Rehmatullah, F., Desjardins-Goulet, M., Toupin, P. and Barfoot, T. D. (2025). Sharing the Load: Autonomous Multi-Rover Cargo Transport. arxiv.org/abs/2510.18766v2
BibTeX
@misc{krawciw2025sharing, title = {Sharing the Load: Autonomous Multi-Rover Cargo Transport}, author = {Krawciw, Alexander and Antonyshyn, Luka and Lilge, Sven and Olmedo, Nicolas and Rehmatullah, Faizan and Desjardins-Goulet, Maxime and Toupin, Pascal and Barfoot, Timothy D.}, year = {2025}, url = {https://arxiv.org/abs/2510.18766v2} } - Sherwood, R. L., Chien, S., Castano, R. and Rabideau, G. (2003). The Autonomous Sciencecraft Constellation
. Annual AAS Guidance and Control Conference. Source
BibTeX
@inproceedings{sherwood2003autonomous, title = {The Autonomous Sciencecraft Constellation}, author = {Sherwood, Robert L. and Chien, S. and Castano, Rebecca and Rabideau, Gregg}, booktitle = {Annual AAS Guidance and Control Conference}, publisher = {JPL Open Repository}, year = {2003}, url = {https://dataverse.jpl.nasa.gov/dataset.xhtml?persistentId=hdl:2014/10609} } - Saenz-Otero, A. (2000). The SPHERES Satellite Formation Flight Testbed: Design and Initial Control. Source
BibTeX
@mastersthesis{saenzotero2000spheres, title = {The SPHERES Satellite Formation Flight Testbed: Design and Initial Control}, author = {Saenz-Otero, Alvar}, school = {Massachusetts Institute of Technology}, type = {M.Eng. thesis}, year = {2000}, url = {https://dspace.mit.edu/handle/1721.1/86730} } - Mandy, C. P., Sakamoto, H., Saenz-Otero, A. and Miller, D. W. (2007). Implementation of Satellite Formation Flight Algorithms Using SPHERES Aboard the International Space Station
. AIAA Guidance, Navigation, and Control Conference, 20080012634. Source
BibTeX
@inproceedings{mandy2007implementation, title = {Implementation of Satellite Formation Flight Algorithms Using SPHERES Aboard the International Space Station}, author = {Mandy, Christophe P. and Sakamoto, Hiraku and Saenz-Otero, Alvar and Miller, David W.}, booktitle = {AIAA Guidance, Navigation, and Control Conference}, number = {20080012634}, institution = {NASA}, year = {2007}, url = {https://ntrs.nasa.gov/citations/20080012634}, abstract = {The MIT's Space Systems Laboratory developed the Synchronized Position Hold Engage and Reorient Experimental Satellites (SPHERES) as a risk-tolerant spaceborne facility to develop and mature control, estimation, and autonomy algorithms for distributed satellite systems for applications such as satellite formation flight. Tests performed study interferometric mission-type formation flight maneuvers in deep space. These tests consist of having the satellites trace a coordinated trajectory under tight control that would allow simulated apertures to constructively interfere observed light and measure the resulting increase in angular resolution. This paper focuses on formation initialization (establishment of a formation using limited field of view relative sensors), formation coordination (synchronization of the different satellite s motion) and fuel-balancing among the different satellites.} } - Bandyopadhyay, S., Baldini, F., Foust, R., Rahmani, A., de la Croix, J.-P., Chung, S.-J. and Hadaegh, F. Y. (2017). Distributed Fast Motion Planning for Spacecraft Swarms in Cluttered Environments using Spherical Expansions and Sequence of Convex Optimization Problems
. VIRTUAL AAAS Annual Meeting. Source
BibTeX
@inproceedings{bandyopadhyay2017distributed, title = {Distributed Fast Motion Planning for Spacecraft Swarms in Cluttered Environments using Spherical Expansions and Sequence of Convex Optimization Problems}, author = {Bandyopadhyay, Saptarshi and Baldini, Francesca and Foust, Rebecca and Rahmani, Amir and de la Croix, Jean-Pierre and Chung, Soon-Jo and Hadaegh, Fred Y}, booktitle = {VIRTUAL AAAS Annual Meeting}, publisher = {JPL Open Repository}, year = {2017}, url = {https://dataverse.jpl.nasa.gov/dataset.xhtml?persistentId=hdl:2014/46249} } - Werfel, J., Petersen, K. and Nagpal, R. (2014). Designing Collective Behavior in a Termite-Inspired Robot Construction Team
. Science. Source
BibTeX
@article{werfel2014designing, title = {Designing Collective Behavior in a Termite-Inspired Robot Construction Team}, author = {Werfel, Justin and Petersen, Kirstin and Nagpal, Radhika}, journal = {Science}, volume = {343}, pages = {754-758}, year = {2014}, doi = {10.1126/science.1245842}, abstract = {Robots programmed with simple construction rules can work independently but collectively to build a complex structure. [Also see Perspective by Korb ]} } - Wolf, M. T., Rahmani, A., de la Croix, J.-P., Woodward, G., Vander Hook, J., Brown, D., Schaffer, S., Lim, C., Bailey, P., Tepsuporn, S., Pomerantz, M., Nguyen, V., Sorice, C. and Sandoval, M. (2017). CARACaS multi-agent maritime autonomy for unmanned surface vehicles in the Swarm II harbor patrol demonstration
. Unmanned Systems Technology XIX. Source
BibTeX
@inproceedings{wolf2017caracas, title = {CARACaS multi-agent maritime autonomy for unmanned surface vehicles in the Swarm II harbor patrol demonstration}, author = {Wolf, Michael T. and Rahmani, Amir and de la Croix, Jean-Pierre and Woodward, Gail and Vander Hook, Joshua and Brown, David and Schaffer, Steve and Lim, Christopher and Bailey, Philip and Tepsuporn, Scott and Pomerantz, Marc and Nguyen, Viet and Sorice, Cristina and Sandoval, Michael}, booktitle = {Unmanned Systems Technology XIX}, series = {SPIE Proceedings}, volume = {10195}, pages = {101950O}, publisher = {SPIE}, year = {2017}, doi = {10.1117/12.2262067}, abstract = {This paper describes new autonomy technology that enabled a team of unmanned surface vehicles (USVs) to execute cooperative behaviors in the USV Swarm II harbor patrol demonstration and provides a description of autonomy performance in the event. The new developments extend the NASA Jet Propulsion Laboratory’s CARACaS (Control Architecture for Robotic Agent Command and Sensing) autonomy architecture, which provides foundational software infrastructure, core executive functions, and several default robotic technology modules. In Swarm II, CARACaS demonstrated higher levels of autonomy and more complex cooperation than previous on-water exercises, using full-sized vehicles and real-world sensing and communication. The core autonomous behaviors to support the harbor patrol scenario included Patrol, Track, Inspect, and Trail, providing the capability of finding all vessels entering the patrol area, keeping track of them, inspecting them to infer intent, and trailing suspect vessels. Significantly, CARACaS assumed responsibility for not only executing tasks safely and efficiently but also recognizing what tasks needed to be accomplished, given the current state of the world. Since the heterogeneous USV teams shared world model that evolved, such as due to (dis)appearance of vessels in the area or a change in health or availability of a USV, CARACaS replanned to generate and reallocate the new task list. Thus, human intervention was never required in the loop to task USVs during mission execution, though a supervisory role was supported in the autonomy system for mission monitoring and exception handling. Finally, CARACaS also ensured the USVs avoided hazards and obeyed the applicable rules of the road, using its local motion planning modules.} } - Zhong, P., Rossi, F. and Shell, D. A. (2024). Planning for actively synchronized multi-robot systems
. Distributed Autonomous Robotic Systems. Source
BibTeX
@inproceedings{zhong2024planning, title = {Planning for actively synchronized multi-robot systems}, author = {Zhong, Patrick and Rossi, Federico and Shell, Dylan A.}, booktitle = {Distributed Autonomous Robotic Systems}, publisher = {JPL Open Repository}, year = {2024}, doi = {10.48577/jpl.smzjik}, abstract = {We describe an approach for planning under uncertainty for multiple robots when robots must proactively plan perception and communication acts, and decide whether the cost needed to obtain a state estimate is justified by the benefit of the information obtained. The approach is suitable for settings where observations are of high quality and they —either alone or along with communication— recover the system’s joint state, but that happens only infrequently owing to the costs incurred. Such cases allow one to sidestep the construction of the full joint belief space, a well known source of intractability in planning. After formulating the multi-robot problem as a class of MDP to be solved over joint states, albeit specific structure allowing decentralized execution, we give a suitable Bellman recurrence using macro-actions which points to a means of direct solution. We solve for plans which can, after appropriate projection, be executed effectively by individual robots. We provide a simulation-based case study and report on our a physical robot implementation. On the basis of our experience with hardware, we examine enhancements of the model that address nonidealities we have identified in practice.} } - Otsu, K., Tepsuporn, S., Thakker, R., Vaquero, T. S., Edlund, J. A., Walsh, W., Miles, G., Heywood, T., Wolf, M. T. and Agha-mohammadi, A.-A. (2020). Supervised Autonomy for Communication-Degraded Subterranean Exploration by a Robot Team
. IEEE Aerospace Conference. Source
BibTeX
@inproceedings{otsu2020supervised, title = {Supervised Autonomy for Communication-Degraded Subterranean Exploration by a Robot Team}, author = {Otsu, Kyohei and Tepsuporn, Scott and Thakker, Rohan and Vaquero, Tiago Stegun and Edlund, Jeffrey A. and Walsh, William and Miles, Gregory and Heywood, Tristan and Wolf, Michael T. and Agha-mohammadi, Ali-akbar}, booktitle = {IEEE Aerospace Conference}, pages = {1-9}, publisher = {IEEE}, year = {2020}, doi = {10.1109/aero47225.2020.9172537}, abstract = {The importance of autonomy in robotics is magnified when the robots need to be deployed and operated in areas that are too dangerous or not accessible for humans, ranging from disaster areas (to assist in emergency situations) to Mars exploration (to uncover the mystery of our neighboring planet). The DARPA Subterranean (SubT) Challenge presents a great opportunity and a formidable robotics challenge to foster such technological advancement for operations in extreme and underground environments. Robot teams are expected to rapidly map, navigate, and search underground environments including natural cave networks, tunnel systems, and urban underground infrastructure. Subterranean environments pose significant challenges for manned and unmanned operations due to limited situational awareness. In the first phase of the DARPA Subterranean Challenge (held in August 2019; targeting underground tunnels and mines), Team CoSTAR, led by NASA JPL, placed second among 11 teams across the world, accurately mapping several kilometers of two mine systems and localizing 17 target objects in the course of four one-hour missions. While the main goal of Team CoSTAR at the end of this three-year challenge (August 2021) is a fully autonomous robotic solution, this paper describes Team CoSTAR's results in the first phase of the challenge (August 2019), focusing on supervised autonomy of a multi-robot team under severe communication constraints. This paper also presents the design and initial results obtained from field test campaigns conducted in various tunnel-like environments, leading to the competition.} } - Denniston, C. E., Chang, Y., Reinke, A., Ebadi, K., Sukhatme, G. S., Carlone, L., Morrell, B. and Agha-mohammadi, A.-A. (2022). Loop Closure Prioritization for Efficient and Scalable Multi-Robot SLAM
. IEEE International Conference on Robotics and Automation. Source
BibTeX
@inproceedings{denniston2022loop, title = {Loop Closure Prioritization for Efficient and Scalable Multi-Robot SLAM}, author = {Denniston, Christopher E. and Chang, Yun and Reinke, Andrzej and Ebadi, Kamak and Sukhatme, Gaurav S. and Carlone, Luca and Morrell, Benjamin and Agha-mohammadi, Ali-akbar}, booktitle = {IEEE International Conference on Robotics and Automation}, year = {2022}, doi = {10.48577/jpl.9emoms}, abstract = {Multi-robot SLAM systems in GPS-denied environments require loop closures to maintain a drift-free centralized map. With increasing number of robots and size of the environment, checking and computing the transformation for all the loop closure candidates becomes computationally infeasible. In this work, we describe a loop closure module that is able to prioritize which loop closures to compute based on the underlying pose graph, the proximity to known beacons, and the characteristics of the point clouds. We validate this system in the context of the DARPA Subterranean Challenge and on numerous challenging underground datasets and demonstrate the ability of this system to generate and maintain a map with low error. We find that our proposed techniques are able to select effective loop closures which results in 51% mean reduction in median error when compared to an odometric solution and 75% mean reduction in median error when compared to a baseline version of this system with no prioritization.} } - de la Croix, J.-P., Rossi, F., Brockers, R., Aguilar, D., Albee, K., Boroson, E., Cauligi, A., Delaune, J., Hewitt, R., Kogan, D., Lim, G., Morrell, B., Nakka, Y., Nguyen, V., Proença, P., Rabideau, G., Russino, J., da Silva, M. S., Zohar, G. and Comandur, S. (2024). Multi-Agent Autonomy for Space Exploration on the CADRE Lunar Technology Demonstration
. IEEE Aerospace Conference. Source
BibTeX
@inproceedings{delacroix2024multi, title = {Multi-Agent Autonomy for Space Exploration on the CADRE Lunar Technology Demonstration}, author = {de la Croix, Jean-Pierre and Rossi, Federico and Brockers, Roland and Aguilar, Dustin and Albee, Keenan and Boroson, Elizabeth and Cauligi, Abhishek and Delaune, Jeff and Hewitt, Robert and Kogan, Dima and Lim, Grace and Morrell, Benjamin and Nakka, Yashwanth and Nguyen, Viet and Proença, Pedro and Rabideau, Gregg and Russino, Joseph and da Silva, Maira Saboia and Zohar, Guy and Comandur, Subha}, booktitle = {IEEE Aerospace Conference}, pages = {1-14}, publisher = {IEEE}, year = {2024}, doi = {10.1109/aero58975.2024.10521425} } - Rabideau, G., Russino, J., Branch, A., Dhamani, N., Vaquero, T. S., Chien, S., de la Croix, J.-P. and Rossi, F. (2025). Planning, scheduling, and execution on the Moon: the CADRE technology demonstration mission
. arXiv preprint. Source
BibTeX
@article{rabideau2025planning, title = {Planning, scheduling, and execution on the Moon: the CADRE technology demonstration mission}, author = {Rabideau, Gregg and Russino, Joseph and {Branch, Andrew} and Dhamani, Nihal and Vaquero, Tiago Stegun and Chien, Steve and de la Croix, Jean-Pierre and Rossi, Federico}, journal = {arXiv preprint}, pages = {1727-1735}, year = {2025}, doi = {10.65109/ilfn7216}, abstract = {NASA's Cooperative Autonomous Distributed Robotic Exploration (CADRE) mission, slated for flight to the Moon's Reiner Gamma region in 2025/2026, is designed to demonstrate multi-agent autonomous exploration of the Lunar surface and sub-surface. A team of three robots and a base station will autonomously explore a region near the lander, collecting the data required for 3D reconstruction of the surface with no human input; and then autonomously perform distributed sensing with multi-static ground penetrating radars (GPR), driving in formation while performing coordinated radar soundings to create a map of the subsurface. At the core of CADRE's software architecture is a novel autonomous, distributed planning, scheduling, and execution (PS&E) system. The system coordinates the robots' activities, planning and executing tasks that require multiple robots' participation while ensuring that each individual robot's thermal and power resources stay within prescribed bounds, and respecting ground-prescribed sleep-wake cycles. The system uses a centralized-planning, distributed-execution paradigm, and a leader election mechanism ensures robustness to failures of individual agents. In this paper, we describe the architecture of CADRE's PS&E system; discuss its design rationale; and report on verification and validation (V&V) testing of the system on CADRE's hardware in preparation for deployment on the Moon.} } - Albee, K., Bhamidipati, S., Rossi, F. and de la Croix, J.-P. (2024). Lunar Leader: Persistent, Optimal Leader Election for Multi-Agent Exploration Teams
. International Conference on Autonomous Agents and Multiagent Systems. Source
BibTeX
@inproceedings{albee2024lunar, title = {Lunar Leader: Persistent, Optimal Leader Election for Multi-Agent Exploration Teams}, author = {Albee, Keenan and Bhamidipati, Sriramya and Rossi, Federico and de la Croix, Jean-Pierre}, booktitle = {International Conference on Autonomous Agents and Multiagent Systems}, address = {Auckland, New Zealand}, year = {2024}, url = {https://dl.acm.org/doi/10.5555/3635637.3662967} } - Nayak, S., Lim, G., Rossi, F., Otte, M. and de la Croix, J.-P. (2024). Multi-Robot Exploration for the CADRE Mission
. Autonomous Robots. Source
BibTeX
@article{nayak2024multirobot, title = {Multi-Robot Exploration for the CADRE Mission}, author = {Nayak, Sharan and Lim, Grace and Rossi, Federico and Otte, Michael and de la Croix, Jean-Pierre}, journal = {Autonomous Robots}, volume = {49}, year = {2024}, doi = {10.1007/s10514-025-10199-3} } - Saboia, M., Rossi, F., Nguyen, V., Lim, G., Aguilar, D. and de la Croix, J.-P. (2024). CADRE MoonDB: Distributed Database for Multi-Robot Information-Sharing and Map-Merging for Lunar Exploration
. International Conference on Autonomous Agents and Multiagent Systems. Source
BibTeX
@inproceedings{saboia2024cadre, title = {CADRE MoonDB: Distributed Database for Multi-Robot Information-Sharing and Map-Merging for Lunar Exploration}, author = {Saboia, Maíra and Rossi, Federico and Nguyen, Viet and Lim, Grace and Aguilar, Dustin and de la Croix, Jean-Pierre}, booktitle = {International Conference on Autonomous Agents and Multiagent Systems}, address = {Auckland, New Zealand}, year = {2024}, doi = {10.48577/jpl.vnepa2}, abstract = {We introduce MoonDB, a distributed database designed to support cooperative robotic exploration and distributed measurements for NASA’s upcoming Cooperative Autonomous Distributed Exploration Rovers (CADRE) mission. MoonDB stores, shares, and fuses information from multiple robots, providing multi-agent planning algorithms with a consistent view of the robotic team. It does so without assuming continuous communication, and significantly limiting bandwidth use through judicious selection of the state variables to share and of the sharing policy and frequency. Further, MoonDB integrates with a pose graph optimization module, allowing mapping information collected by individual robots to be re-localized a posteriori based on refined localization information. Map-merging and reconciliation of inconsistent mapping information uses OpenGL acceleration, resulting in excellent performance on embedded systems. Overall, MoonDB provides a spaceflight-quality solution to the problem of information-sharing for CADRE, addressing one of the key challenges in coordination of multi-agent systems.} } - Szatmari, T.-I. and Cauligi, A. (2026). Federated Multi-Agent Mapping for Planetary Exploration
. arXiv preprint. Source
BibTeX
@article{szatmari2026federated, title = {Federated Multi-Agent Mapping for Planetary Exploration}, author = {Szatmari, Tiberiu-Ioan and Cauligi, Abhishek}, journal = {arXiv preprint}, pages = {268-274}, year = {2026}, doi = {10.1109/cai68641.2026.11536243}, abstract = {Multi-agent robotic exploration stands to play an important role in space exploration as the next generation of robotic systems ventures to far-flung environments. A key challenge in this new paradigm will be to effectively share and utilize the vast amount of data generated onboard while operating in bandwidth-constrained regimes typical of space missions. Federated learning (FL) is a promising tool for bridging this gap. Drawing inspiration from the upcoming CADRE Lunar rover mission, we propose a federated multi-agent mapping approach that jointly trains a global map model across agents without transmitting raw data. Our method leverages implicit neural mapping to generate parsimonious, adaptable representations, reducing data transmission by up to 93.8% compared to raw maps. Furthermore, we enhance this approach with meta-initialization on Earth-based traversability datasets to significantly accelerate map convergence—reducing iterations required to reach target performance by 80% compared to random initialization. We demonstrate the efficacy of our approach on Martian terrains and glacier datasets, achieving downstream path planning F1 scores as high as 0.95 while outperforming on map reconstruction losses.} } - Culbertson, P., Bandyopadhyay, S., Goel, A., McGarey, P. and Schwager, M. (2022). Multi-Robot Assembly Scheduling for the Lunar Crater Radio Telescope on the Far-Side of the Moon
. IEEE Aerospace Conference. Source
BibTeX
@inproceedings{culbertson2022multi, title = {Multi-Robot Assembly Scheduling for the Lunar Crater Radio Telescope on the Far-Side of the Moon}, author = {Culbertson, Preston and Bandyopadhyay, Saptarshi and Goel, Ashish and McGarey, Patrick and Schwager, Mac}, booktitle = {IEEE Aerospace Conference}, volume = {69}, pages = {1-9}, publisher = {IEEE}, year = {2022}, doi = {10.1109/aero53065.2022.9843304}, abstract = {The Lunar Crater Radio Telescope (LCRT) is a proposed ultra-long-wavelength radio telescope to be constructed on the far side of the moon. The proposed telescope will be constructed by deploying a 1km wire mesh in a 3-5km crater using a team of wall-climbing DuAxel robots. In this work, we consider the problem of generating minimum-time assembly sequences for LCRT, using realistic models of travel speed and lighting. We pose the assembly sequencing problem as a mixed-integer linear program (MILP), which we solve to global optimality using commercial solvers. We present methods for modeling time-varying travel and assembly times, based on variable lighting conditions (including crater shadowing), and show how such time-varying parameters can be incorporated into the MILP. Finally, we present numerical studies of our method, showing how makespan varies with the number of assembly robots.} } - Young, E., Yang, G., Wagner, T., Ridenhour, F., Lawler, C. and Cox, N. (2023). Relay Planning in the Perseverance Rover's First 600 Solar Days on Mars
. IEEE Aerospace Conference. Source
BibTeX
@inproceedings{young2023relay, title = {Relay Planning in the Perseverance Rover's First 600 Solar Days on Mars}, author = {Young, Emma and Yang, Genevie and Wagner, Travis and Ridenhour, Flora and Lawler, Christopher and Cox, Nagin}, booktitle = {IEEE Aerospace Conference}, publisher = {JPL Open Repository}, year = {2023}, doi = {10.48577/jpl.f9zcgz}, abstract = {Since landing in Jezero Crater on Mars on February 18, 2021, the Mars 2020 mission’s Perseverance rover has been performing daily operations on the Martian surface and has been collecting samples that may one day be returned to Earth. The majority of science and engineering data from the Perseverance rover is returned through the Mars orbiters operated by the National Aeronautics and Space Administration (NASA) and the European Space Agency (ESA) that make up the Mars Relay Network: Mars Reconnaissance Orbiter (MRO), Mars Odyssey (ODY), Mars Atmosphere and Volatile Evolution (MAVEN), and Trace Gas Orbiter (TGO). Prior to the rover’s landing, the Mars 2020 team joined the Mars Relay Network to begin planning relay through the coordinated, multi-mission process that is the cornerstone of relay planning. The Perseverance rover has now been on the Martian surface for more than 600 Martian solar days (“sols”) with several UHF relay sessions planned and executed per sol. The Mars 2020 relay planning team has established and improved upon the recurring process and tool suite to enable both data return and forward link of rover uplink products, and continues to coordinate and negotiate relay asset usages and constraints with the Mars Science Laboratory and Insight relay planning teams. Among many accomplishments, the relay planning team has supported checkouts and commissioning of Low-Density Parity-Check (LDPC) relay link configurations, the mission’s first solar conjunction period, and several rover flight software transitions.The Mars 2020 team has also been performing a checkout and commissioning campaign for the use of bitstream, or “unreliable”, relay sessions. Nominal use of bitstream relay is a new operational capability intended for the Perseverance rover that will allow specific science or engineering activities to run in parallel with the relay session, rather than pausing all other activities during relay, enabling additional and more timely data return. Pending the completion of the checkout and commissioning campaign, the operations team plans to approve and begin regular scheduling and use of bitstream UHF relay sessions beginning in 2023. This paper describes the Mars 2020 relay planning processes and tool architecture, key accomplishments (including progress for the bitstream checkout and commissioning campaign), and lessons learned and ongoing challenges during the first 600 sols of the Mars 2020 surface mission.} } - Koktas, E. and Basar, E. (2024). Communications for the Planet Mars: Past, Present, and Future
. IEEE Aerospace and Electronic Systems Magazine, 5. Source
BibTeX
@article{koktas2024communications, title = {Communications for the Planet {Mars}: Past, Present, and Future}, author = {Koktas, Enes and Basar, Ertugrul}, journal = {IEEE Aerospace and Electronic Systems Magazine}, volume = {39}, number = {5}, pages = {216--258}, year = {2024}, doi = {10.1109/maes.2024.3396117}, abstract = {Space exploration has been on the rise since the 1960s and Mars plays a significant role in the history of space exploration. As the amount of data collected from science instruments around and on Mars increased, the need for fast and reliable communication between Earth and space probes has emerged. However, communicating over deep space has always been a big challenge due to the propagation characteristics of radio waves. Nowadays, the collaboration of private companies like SpaceX with space agencies to make Mars colonization a reality, introduces even more challenges, such as providing high data rate, low-latency, energy-efficient, and mobility-resistant communication infrastructures in the Martian environment. Propagation medium and wireless channel characteristics of Mars should be extensively studied to achieve these goals. This survey article presents a comprehensive overview of the Mars missions and channel modeling studies of the near-Earth, interstellar, and near-planet links. Studies featuring three-dimensional (3d) channel modeling simulations on the Martian surface are reviewed. Novel computer simulations considering various scenarios based on realistic 3D Martian terrains using the Wireless Insite software are presented. Path loss exponent, power delay profile, and root-mean-square delay spread for these scenarios are calculated and tabularized in this study.} } - Achey, L., Crockett, B., Heckman, C. and Hayes, B. (2026). RF-Modulated Adaptive Communication Improves Multi-Agent Robotic Exploration. arxiv.org/abs/2602.12074v1
BibTeX
@misc{achey2026rf, title = {RF-Modulated Adaptive Communication Improves Multi-Agent Robotic Exploration}, author = {Achey, Lorin and Crockett, Breanne and Heckman, Christoffer and Hayes, Bradley}, year = {2026}, url = {https://arxiv.org/abs/2602.12074v1} } - Srivastava, A. K., Suresh, A. and Nieto-Granda, C. (2025). Behaviorally Adaptive Multi-Robot Hazard Localization in Failure-Prone, Communication-Denied Environments. arxiv.org/abs/2508.04537
BibTeX
@misc{srivastava2025behaviorally, title = {Behaviorally Adaptive Multi-Robot Hazard Localization in Failure-Prone, Communication-Denied Environments}, author = {Srivastava, Alkesh K. and Suresh, Aamodh and Nieto-Granda, Carlos}, year = {2025}, url = {https://arxiv.org/abs/2508.04537} } - Carpenter, K. (2024). Infusion Paths and Opportunities in Multi-Agent Space Robotics
. Root. doi.org/10.48577/jpl.rjehkv
BibTeX
@misc{carpenter2024infusion, title = {Infusion Paths and Opportunities in Multi-Agent Space Robotics}, author = {Carpenter, Kalind}, journal = {Root}, year = {2024}, doi = {10.48577/jpl.rjehkv}, abstract = {No abstract available.} }