On-Orbit Space AI: Federated, Multi-Agent, and Collaborative Algorithms for Satellite Constellations
Abstract
Satellite constellations are transforming space systems from isolated spacecraft into networked, software-defined platforms capable of on-orbit perception, decision making, and adaptation. Yet much of the existing AI studies remains centered on single-satellite inference, while constellation-scale autonomy introduces fundamentally new algorithmic requirements: learning and coordination under dynamic inter-satellite connectivity, strict SWaP-C limits, radiation-induced faults, non-IID data, concept drift, and safety-critical operational constraints. This survey consolidates the emerging field of on-orbit space AI through three complementary paradigms: (i) {federated learning} for cross-satellite training, personalization, and secure aggregation; (ii) {multi-agent algorithms} for cooperative planning, resource allocation, scheduling, formation control, and collision avoidance; and (iii) {collaborative sensing and distributed inference} for multi-satellite fusion, tracking, split/early-exit inference, and cross-layer co-design with constellation networking. We provide a system-level view and a taxonomy that unifies collaboration architectures, temporal mechanisms, and trust models. To support community development and keep this review actionable over time, we continuously curate relevant papers and resources at https://github.com/ziyangwang007/AI4Space.
Figures & tables
| Property | Ground-centric centralized AI | Single-satellite onboard AI | Federated learning | Collaborative sensing | Distributed inference | Multi-agent autonomous constellation |
|---|---|---|---|---|---|---|
| Communication burden | Very high | Low | Moderate | High | Moderate | Moderate |
| Inter-satellite link dependence | Low | Low | Moderate | Moderate | High | High |
| End-to-end latency | Very high | Low | Moderate | Moderate | Low | Low |
| Privacy / data sovereignty | Very low | High | High | Moderate | High | High |
| Onboard compute & energy pressure | Low | Very high | High | Moderate | Moderate | Moderate |
| Scalability to large constellations | Moderate | Moderate | High | High | High | High |
| Survey | Year | Primary scope | On-orbit/Edge | FL | Multi-agent | Collab. Inf./Fusion | Trust/Safety | Bench./Twin |
|---|---|---|---|---|---|---|---|---|
| Liu et al. [ 39 ] | 2018 | SAGIN architecture, resource mgmt., integration | P | – | – | – | P | – |
| Shen et al. [ 43 ] | 2023 | Computing tech in SAGIN (cloud/edge synergy, enabling tools) | Y | P | – | – | P | P |
| Mahboob & Liu [ 40 ] | 2024 | AI-enabled satellite-based NTN for 6G (networking-centric) | P | P | – | – | P | – |
| Fontanesi et al. [ 41 ] | 2025 | AI/ML for SATCOM (use cases, architectures, hardware notes) | P | – | – | – | P | – |
| Yin et al. [ 11 ] (Wu et al. [ 12 ] ) | 2025 (2023) | Orbital edge computing: systems, offloading, scheduling | Y | P | P | P | P | P |
| Matthiesen et al. [ 16 ] | 2024 | Federated learning in satellite constellations | P | Y | – | – | P | P |
| Symbol | Meaning | Where used |
|---|---|---|
| Set of satellites, | Sec. 2.1 | |
| Set of ground nodes/stations, (note: also denotes the time-varying graph) | Sec. 2.1 | |
| Node set of the communication graph, | Sec. 2.1 | |
| Edge set at time (available links) | Sec. 2.1 | |
| Time-varying communication graph | Sec. 2.1 | |
| Link capacity between nodes and at time | Sec. 2.1 |
| Constraint | Algorithmic implications | Typical design levers | Evaluation signals |
|---|---|---|---|
| SWaP-C (compute/energy/memory) [ 11 , 10 ] | Limits model size, training frequency, and allowable on-orbit optimization; training competes with payload ops and comm sessions | Lightweight updates (adapters/heads), mixed precision, early-exit, split inference, sparse/quantized updates | Energy (J/orbit), FLOPs, memory, latency, duty cycle |
| Intermittent connectivity / long delay [ 48 , 45 ] | No persistent end-to-end paths; partial participation; stale information | Async protocols, staleness-aware weighting, contact-plan scheduling, DTN-aware routing/aggregation | Staleness, participation rate, time-to-update, timeliness |
| Limited bandwidth / short contact windows [ 48 , 11 ] | Update payload size dominates feasibility; large models hard to synchronize | Quantization/sparsification, low-rank deltas, distillation/logits, feature/tracklet sharing | Bytes/contact, throughput, accuracy-vs-bytes curve |
| Radiation-induced faults / SDC [ 55 , 56 , 15 , 57 ] | Corrupted updates/messages; node resets; unreliable compute | Sanity checks, redundancy, robust aggregation/fusion, conservative filters (e.g., CI) | Fault-injection robustness, recovery time, consistency |
| Safety-critical operations [ 32 , 61 ] | Hard constraints must never be violated; updates must be governed | Safety filters/RTA, staged rollout/rollback, audit logs, conservative fallbacks | Constraint violations, intervention rate, rollback triggers |
| Non-IID across satellites [ 16 , 60 ] | Global model bias; slower convergence; fairness issues | Personalization, clustering, heterogeneity-aware objectives (FedProx/SCAFFOLD/FedNova) | Per-node accuracy, fairness, convergence speed |
| Dimension | Categories | Implications for design and evaluation |
|---|---|---|
| Architecture | Centralized; Hierarchical; Decentralized (often hybrid) | Determines orchestration/aggregation points, failure modes, governance, and communication hotspots; affects latency and resilience under ground outages [ 16 , 62 , 63 ] . |
| Timing | Synchronous; Asynchronous; Event-triggered; Orbit-periodic | Controls tolerance to intermittency and staleness; enables contact-aware scheduling (orbit-periodic) and value-driven messaging (event-triggered) [ 33 , 64 , 65 ] . |
| Trust | Benign faults; Honest-but-curious; Byzantine/compromised | Dictates whether privacy-preserving and robust aggregation/fusion are required; impacts update validation, authentication, and anomaly filtering [ 20 , 21 ] . |
| What is shared | Raw data; Features/statistics; Model updates; Decisions/intents | Directly determines message size and feasibility under SWaP-C/contact windows; links to split/early-exit inference, distributed tracking, and coordination messaging [ 28 , 36 , 37 , 35 ] . |
| Work | Arch. | Timing | Main on-orbit focus | Trust / privacy model | Shared artifact |
|---|---|---|---|---|---|
| Ground-assisted FL [ 66 ] | Centralized (GS) | Async (staleness-aware) | Designs an asynchronous procedure based on FedAvg to cope with sporadic satellite–GS visibility and heterogeneous system conditions; improves convergence under partial participation. | Benign faults / intermittency (no explicit adversary model). | Model updates / deltas |
| Energy-aware scheduling for satellite FL [ 73 ] | Centralized/Hybrid | Orbit-/schedule-aware | Schedules local computation time to minimize battery usage (e.g., eclipse periods) while preserving convergence speed; targets long mission lifetime and SWaP-C constraints. | Benign (resource reliability and aging). | Model updates (standard FL payload) |
| FedSN [ 69 ] | Centralized (GS) | Pseudo-sync (staleness compensation) | Addresses three LEO-specific bottlenecks: heterogeneous compute/memory, limited uplink rate, and model staleness; uses sub-structure scheme for heterogeneous local training and pseudo-synchronous aggregation. | Benign (system heterogeneity / staleness). | Structured/partial model updates |
| FedLEO [ 74 ] | Decentralized (ISL/P2P) | Async / contact-driven | Offloading-assisted decentralized FL to mitigate central-server bottlenecks; targets straggler effects and statistical heterogeneity under LEO topology and intermittent contacts. | Benign (no explicit adversary). | Neighbor model mixing + local updates |
| HiSatFL [ 62 ] | Hierarchical | Contact-/cluster-aware | Hierarchical FL tailored to dynamic satellite networks; emphasizes cross-domain adaptation and privacy-preserving collaboration under resource constraints. | Privacy-preserving (honest-but-curious assumptions are typical). | Privacy-protected model updates |
| RAFL [ 75 ] | Hierarchical | Contact-aware (reduces GS interaction) | Uses aerial networking + hierarchical aggregation to reduce satellite–GS communication; introduces self-adaptive reputation evaluation for leader selection and robustness; improves convergence and resists poisoning. | Byzantine/compromised nodes considered (poisoning defense via reputation). | Aggregated regional updates + global update |
| Challenge | Representative techniques | Satellite-oriented instantiation | Key refs. |
|---|---|---|---|
| Intermittency / staleness | Async FL; buffered async; staleness-aware weighting | Contact-driven uploads; pseudo-synchrony aligned with visibility; bounded-delay update admission | [ 67 , 68 , 66 , 69 ] |
| Communication bottleneck | Quantization; sparsification; periodic averaging + quantization; non-IID-aware compression | Transmit deltas/partial modules; quick-to-verify payloads for short windows | [ 77 , 79 , 80 , 78 , 81 ] |
| System heterogeneity (compute/memory) | Partial/structured training; split/federated hybrids | Train client-side sub-models; aggregate only trainable subsets; match onboard capability | [ 69 , 64 ] |
| Statistical heterogeneity (non-IID) | Proximal regularization; control variates; normalized aggregation | Stabilize local drift when long gaps exist; improve fairness across orbital planes/domains | [ 87 , 88 , 89 ] |
| Personalization | Global-base + local layers; bilevel personalization; robust personalization | Per-orbit/plane local specialization with safe baselines and limited adaptation scope | [ 90 , 91 , 92 ] |
| Robustness to faulty/Byzantine updates | Byzantine-robust aggregation; outlier filtering | Fault-induced abnormal updates treated similarly to malicious outliers; hierarchical reputation | [ 21 , 86 , 75 ] |
| Method family | Representative algorithms | Typical constellation tasks | What is shared | Fit to orbital constraints | Key refs. |
|---|---|---|---|---|---|
| CTDE MARL (value/actor-critic) | MADDPG; COMA; VDN/QMIX | Scheduling/coverage; routing policies; reactive tasking | Learned messages / local obs summaries | Strong in simulation; execution decentralized; needs robustness to delay and non-stationarity | [ 103 , 104 , 105 , 106 ] |
| Learned communication in MARL | CommNet; DIAL; IC3Net; TarMAC; MAGIC | Distributed coordination under partial observability | Differentiable messages; gated communication | Enables “what/when/to whom” policies; aligns with bandwidth limits (event-trigger) | [ 108 , 109 , 110 , 111 , 112 , 65 ] |
| Auction / market-based allocation | CBBA; distributed auction scheduling | Observation tasking; downlink allocation | Bids/utilities; local plans | Interpretable; works with sparse comm; good for heterogeneity and auditable ops | [ 35 , 24 ] |
| DCOP (distributed constraint optimization) | ADOPT; DCOP frameworks | Constraint-heavy scheduling/resource allocation | Constraint messages / cost tables | Explicit constraints; can trade optimality for comm; supports auditability | [ 114 , 113 ] |
| Distributed control / consensus / DMPC | Consensus control; (D)MPC surveys | Formation flying; reconfiguration | State/trajectory/constraints | Predictable + constraint handling; sensitive to delays; may need simplified models | [ 100 , 115 , 116 , 117 ] |
| Safety layers & runtime assurance | Safe RL; CPO; shielding; predictive safety filters; RTA | Maneuver planning; risk-limited autonomy | Safety monitors / filters | Enforces hard constraints; supports staged autonomy and fallbacks | [ 118 , 119 , 120 , 121 , 122 , 123 ] |
| Method family | Core idea | What is shared | Contact/timing sensitivity | Typical use cases | Key refs. |
|---|---|---|---|---|---|
| Conservative fusion (CI) | Fuse without cross-correlation knowledge; ensure consistency | Information pairs / covariances | Low iteration; robust under intermittent contacts | SSA track fusion; reliable estimation under uncertain correlation | [ 130 , 131 ] |
| Information-theoretic averaging (KL-average) | Consensus on probability densities with stability guarantees | Density/summary statistics | Needs exchanges but can be bounded; stable under partial graphs | Distributed state estimation / tracking | [ 129 ] |
| Consensus Kalman / information filters | Distributed filtering via consensus iterations | Measurements/information vectors | Sensitive to rounds per contact window; requires bounded-round design | Cooperative tracking; orbit estimation | [ 132 , 133 , 134 , 135 ] |
| RFS-based distributed multi-object tracking | Bayesian multi-object tracking; consensus variants | Tracklets / labeled RFS representations | Exchange compact track summaries; handles association uncertainty | Debris/RSO tracking; SSA multi-target tracking | [ 136 , 28 , 26 ] |
| Split inference / partitioned computation | Compute early layers onboard; transmit embeddings | Intermediate features / embeddings | Very contact-aware; choose split point based on latency/bandwidth | EO event detection; cooperative analytics | [ 141 , 70 ] |
| Early-exit / multi-exit inference | Exit early for easy samples; trigger collaboration on uncertainty | Decisions + optional features for hard cases | Naturally event-driven; reduces comm and compute | Time-critical detection; bandwidth-limited verification | [ 36 , 37 , 143 , 142 ] |
| Resource | Modality | Primary task | Relevance to this survey |
|---|---|---|---|
| EuroSAT [ 144 ] | Sentinel-2 optical | Land-use / land-cover classification | Lightweight EO perception benchmarks for onboard or distributed classification |
| BigEarthNet [ 145 ] | Sentinel-2 (and later Sentinel-1/2 variants) | Large-scale multi-label scene understanding | Useful for non-IID remote-sensing splits and federated perception studies |
| SEN12MS [ 146 ] | Sentinel-1 + Sentinel-2 | Multimodal classification / fusion | Natural benchmark for collaborative sensing and multimodal distributed inference |
| So2Sat LCZ42 [ 147 ] | Sentinel-1 + Sentinel-2 | Urban/local climate zone classification | Representative benchmark for multimodal global-scale classification under domain variation |
| AID [ 148 ] / RESISC45 [ 149 ] | High-resolution optical | Scene classification | Standard remote-sensing vision benchmarks for onboard perception baselines |
| PatternNet [ 150 ] | High-resolution optical | Image retrieval | Useful for communication-efficient representation learning and retrieval tasks |
| Direction | Priority class | Why it matters now | Main actors | Suggested evaluation signals |
|---|---|---|---|---|
| Communication-efficient collaboration | Near-term tractable | Directly improves feasibility under limited contacts and message budgets; can be tested with existing simulators and prototypes | Individual research groups + mission AI teams | Bytes/contact, staleness, utility per bit, energy/latency trade-off |
| Cross-layer AI/network co-design | Near-term tractable | Networking already constrains collaboration; utility-aware scheduling can deliver immediate system gains | AI + networking researchers | End-to-end latency, throughput, delivery timeliness, uncertainty reduction per bit |
| Collaborative perception and distributed inference | Near-term tractable | Supports practical EO/SSA workloads and can be benchmarked before full autonomy certification | AI/vision groups + onboard computing teams | Accuracy vs latency/energy, early-exit rate, feature-sharing cost, robustness under drops |
| Verification, validation, and runtime assurance | Deployment blocker | Determines whether learning-enabled autonomy can be trusted in safety- or mission-critical loops | Flight software, assurance, autonomy teams | Constraint violations avoided, intervention rate, regression coverage, fault-injection robustness |
| Fault tolerance and silent-corruption resilience | Deployment blocker | Radiation and transient failures can invalidate distributed updates and fusion results | Hardware/software reliability + autonomy teams | Recovery time, safe fallback rate, consistency under injected faults |
| Safe model lifecycle management | Deployment blocker | In-orbit updates require governance, rollback, and monitoring before operational adoption | Mission operators + MLOps/flight software teams | Update success/failure rate, rollback triggers, post-update regression signals |
Multi-Agent Coordination
Multi-agent coordination studies how autonomous agents align actions, share information, and divide work to achieve individual or collective goals.
See all 516 papers