Search arXivSearch

arXiv · 2601.22912

Feedback Control via Integrated Sensing and Communication: Uncertainty Optimisation

Abstract

This paper studies integrated sensing and communication (ISAC) coordination for feedback control tasks under shared platform constraints. We consider a cyber-physical system in which a remote dynamical process (i.e., remote source) is regulated with the support of an ISAC-enabled base station that alternates between sensing the source state and communicating control-relevant information to the source, with the two operations semantically intertwined rather than serving separate targets and users. For a Gauss-Markov source with Bernoulli-distributed sensing and communication links and a finite-horizon linear-quadratic-Gaussian (LQG) cost, we derive the optimal ISAC and control policies. Under a Bellman-operator condition, we prove that the optimal ISAC policy at the base station follows an order-threshold structure in terms of the source and base-station estimation covariances, while the optimal control policy at the source follows a certainty-equivalent structure in terms of the source state estimate. We show that the threshold region, defined as the set of estimation covariance pairs for which communication is preferred over sensing, expands with increasing source uncertainty and contracts with increasing base-station uncertainty. Our numerical analysis validates the theoretical findings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Touraj Soleymani, Mohamad Assaad, John S. Baras. 2026-07-03. Feedback Control via Integrated Sensing and Communication: Uncertainty Optimisation. https://arxiv.org/abs/2601.22912

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT