arXiv Machine Learning

Communication Reduction via Semantic-Based Encoding in DMPC Using LSTMs

The paper proposes using encoder‑decoder networks based on LSTM cells to reduce communication in distributed model predictive control (DMPC). Agents transmit a compressed representation of their messages, which receivers reconstruct, thereby lowering the data exchanged each time step. Experiments with mobile robot formations show that the trained networks maintain performance even when full communication is unavailable, and they can adapt to different prediction horizons without retraining.

arXiv Computation and Language
Sep 23

CONCAT: Consensus- and Confidence-Driven Ad Hoc Teaming for Efficient LLM-Based Multi-Agent Systems

CONCAT is a training‑free framework that improves the efficiency of large language model (LLM) based multi‑agent systems by clustering agents according to their initial answers and selecting cluster leaders based on confidence. It uses a Theory‑of‑Mind‑inspired heuristic to predict collaboration benefits between leaders, then prunes communications to form an ad‑hoc network that reduces latency. Experiments on three LLMs and benchmarks show up to 2.02× higher accuracy/latency ratio than LLM‑Debate and a 50.1% latency reduction on Qwen2.5‑14B‑Instruct without task‑specific training.

By Ziyang Ma, Dingyi Zhang, Sichu Liang, Jiajia Chu, Pengfei Xia, Hui Zang, Deyu Zhou
arXiv Machine Learning
Sep 7

Coupled Control and Wireless World Models for Resilient Remote Robotic Control

The paper introduces a resilient remote robotic control framework that couples control and wireless world models using a Joint Embedding Predictive Architecture (JEPA). By learning latent representations from visual observations and radio frequency (RF) data, the system predicts future robot states and wireless conditions to schedule uplink transmissions efficiently. An adaptive resilience mechanism adjusts perception embeddings when prediction errors arise, enabling robust operation without retraining the entire control policy.

By H. P. Madushanka, Sumudu Samarakoon, Mehdi Bennis
arXiv AI
Sep 7

A Schema Bounded Language Model for Refining Robot Policies Without Destabilizing Local Learning

The paper presents a decentralized navigation framework for composite heterogeneous robots that integrates a large language model (LLM) policy agent, an Upper Confidence Bound (UCB) bandit, and a Double Deep Q-Network (Double DQN) controller. Each robot independently generates and refines policies at the round level using LLM inference, while the Double DQN handles tick-level action selection based on navigation variables and LLM priors. Across 30 rounds, the full configuration achieved all goals with the lowest median completion time (42 ticks) and a 25–39% improvement over other setups.

By Chongwen Dong, Mithun Paul Saint-Germain, Pinjari Asif, Carlo R. daCunha