Control Data Scheduling over Shared Communication Channels: A Sparse and Collision-Free Mechanism

arXiv:2609.33592 · eess.SY, cs.SY · Submitted 2026-09-27 · Read on arXiv

eess.SY, cs.SY

Submitted: 2026-09-27

Updated: 2026-09-29

Terminology

• Sparsity — 11× in this paper · explained in 4 episodes
• Convergence Guarantees — 3× in this paper · explained in 3 episodes
• Number of Transmissions — 2× in this paper
• Regularization — 2× in this paper · explained in 3 episodes
• Adaptive Algorithm — 1× in this paper · explained in 1 episode
• Alternating Direction Method of Multipliers (ADMM) — 1× in this paper · explained in 2 episodes
• Computational overhead — 1× in this paper · explained in 2 episodes
• Objective Function — 1× in this paper · explained in 2 episodes
• Resource Constraints — 1× in this paper · explained in 3 episodes
• Theoretical Guarantees — 1× in this paper · explained in 2 episodes

Sources

• An Empirical Study of ADMM for Nonconvex Problems

Related papers

• One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
• A Geometric Decision Procedure for STL Feasibility and Repair
• Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems
• Policy-Level Recursive Self-Improvement for Embodied AI with a Criticality World Model
• Minimal Experiments for Robust Stabilization: Information, Spectral Geometry, and Duration
• Decentralized Power-Optimal Coordination for Spacecraft Swarms Using Time-Varying Magnetorquer Actuation