In this paper
Abstractmain_robot-2.pdfIntroductionRelation to Existing MetricsContributionsMulti-robot system and operational modelCoupled Fleet Trajectory ObservationManeuver Resource and Operational InterpretationSafety SemanticsFleet-Level Finite-Horizon BenchmarkCoupled Fleet Log-DeterminantFinite-Horizon Mobility ModesOperational Interpretation of the Finite-Horizon BenchmarkLong-Horizon Mobility CapacityFrom Finite-Horizon to Stationary Mobility ModesLong-Horizon Capacity LawSystem ImplicationsSafety-Aware Maneuver DesignPer-Codeword Safe-Constrained CapacitySafety-Aware Maneuver DesignSafety-Aware Maneuver DesignPer-Codeword Safe-Constrained CapacityFrom Physical Chance Constraints to Covariance ConstraintsSafety-Aware Gaussian Covariance AllocationWater-Filling under Safety ConstraintsFinite Per-Codeword Safe Mobility CodebookAerial-Robot Case StudyConclusionSupplemental Material for Mobility Information Capacity of Multi-Robot Systems: Safety-Aware Maneuver DesignProof of the Long-Horizon Capacity TheoremFrom Finite-Horizon Gains to Spectral GainsConvergence of the Water LevelConvergence of the Mobility InformationReferencesWorksComputer Science
Mobility Information Capacity of Multi-Robot Systems: Safety-Aware Maneuver Design
Abstract
Multiple robots operating in shared workspaces must adjust their speed, direction, and trajectories to coordinate with one another and respond to changing tasks and disturbances. The available maneuver freedom depends on the dynamics, uncertainty, and safety margins, even for a fixed fleet size and workspace. However, robot count, workspace occupancy, and task throughput do not quantify how much the fleet can vary its motion or how reliably these variations can be observed. We develop a mobility information capacity (MIC) framework that jointly characterizes these two aspects. Mobility information is defined as the mutual information between a joint maneuver sequence and its noisy trajectory observation, and MIC maximizes this quantity under maneuver-resource constraints. For a linear Gaussian maneuver-to-observation model with feedback dynamics, we characterize the finite-horizon information benchmark and derive its stationary long-horizon spectral limit, accounting for heterogeneous mobility gains, colored uncertainty, and temporally coupled maneuver costs. We further map workspace-boundary, inter-robot separation, and actuator chance constraints into coupled maneuver-covariance restrictions and derive conditions under which covariance optimization reduces to resource allocation across mobility modes. Finite joint maneuver codebooks are then constructed through individual risk screening and noise-whitened trajectory separation, with bounds linking sequence recovery error and achieved information to the capacity benchmarks. An aerial-robot simulation study evaluates spectral convergence, safety-aware allocation, finite-codebook identification, and fleet-size scaling. The resulting framework complements occupancy and task-throughput measures by quantifying the maximum observable maneuver freedom supported by a mobility system.
main_robot-2.pdf
Introduction
Multi-robot systems increasingly operate in shared, spatially constrained environments, where changing tasks, disturbances, and neighboring robots require continual motion adjustments [1]. Even with the same workspace and fleet size, systems with different dynamics, uncertainty, and safety margins may support different sets of safe maneuvers, including acceleration, deceleration, direction changes, and rerouting. Robot count measures occupancy, while task throughput measures completed work. Although both are important for task planning, neither fully characterizes the maneuver flexibility available to the fleet. Such a characterization must account for both physical maneuverability and trajectory observability: a constrained workspace may allow little safe maneuver variation despite accurate observations, while observation uncertainty may make otherwise feasible maneuvers difficult to distinguish. Aerial-robot fleets illustrate this distinction. Unmanned aerial vehicles (UAVs) combine mobility, sensing, communication, and control in low-altitude applications [2, 3, 4] [5, 6]. As shown in Figure 1, two corridors can accommodate the same number of aerial robots while permitting different lateral and vertical maneuvers. A wide corridor may allow lateral passing, altitude exchange, and several coordinated avoidance patterns, whereas a narrow corridor may permit only ordered forward motion. The information conveyed by these maneuvers also depends on the accuracy of the trajectory observations. Physical constraints determine the maneuver variation that can be generated, while observation uncertainty determines how much of that variation remains distinguishable. This leads to the following question: how much mobility information can a multi-robot system convey through its trajectories under prescribed maneuver-resource and safety constraints?

Figure 1. Same occupancy can lead to substantially different operational mobility.
To address this question, we model the joint maneuver sequence as the input and the observed fleet trajectory as the output, with the feedback architecture fixed across maneuver alternatives. Execution disturbances affect the physical motion, while observation errors affect the trajectories available to the mobility monitor. For a prescribed maneuver distribution, mutual information quantifies how much the observed trajectory reveals about the underlying maneuver sequence. MIC maximizes this quantity over admissible maneuver distributions under a resource budget. It therefore characterizes the maximum observable maneuver information supported by the specified dynamics, uncertainty, and maneuver constraints.
Relation to Existing Metrics
MIC is related to existing information-theoretic and control-theoretic measures through its use of mutual information, but differs in its operational interpretation and system construction. Shannon capacity quantifies the reliably distinguishable alternatives supported by a channel under a resource constraint [7], [8]. Action-to-state mutual information has also been used to characterize control-to-state capacity [9]–[11]. A recent multi-agent formation model couples actions as an interference channel and applies iterative water-filling to study collective behavior [12]. MIC adopts this information-theoretic perspective to quantify the distinguishability of joint maneuvers supported by a specified mobility architecture. Its objective differs from that of stabilization-oriented information measures, which quantify the information required to maintain a control objective [13].
The aerial-robot application further connects MIC to studies of airspace capacity and mobile computing. Urban airspace studies address traffic assignment and route utilization, while UAV mobile computing studies optimize trajectories, communication, computation, and service resources [14]–[16]. MIC complements these application-level measures by quantifying the maneuver information recoverable from trajectory observations. For aerial workspaces, this provides a maneuver-information characterization of airspace use. More generally, MIC depends on robot dynamics, observation uncertainty, maneuver cost, and physical safety constraints.
Contributions
This paper extends the finite-horizon Gaussian MIC framework in our preliminary letter [17] to safety-aware multi-robot systems. We investigate how observable maneuver information grows with the horizon, how physical constraints reshape maneuver allocation, and how continuous covariance designs support finite codebooks with individually screened maneuvers. The main contributions are summarized as follows.
We derive a heterogeneous stationary spectral characterization of swarm MIC under stable closed-loop dynamics, colored uncertainty, and temporally coupled maneuver costs. This characterization identifies the maneuver components that sustain a nonzero information rate and determines resource allocation across frequencies and mobility modes.
We formulate safety-aware joint maneuver allocation by mapping workspace-boundary, inter-robot separation, and actuator chance constraints into coupled covariance restrictions. The design jointly accounts for trajectory observability and physical safety margins. We derive sufficient conditions for optimal allocation in a common mobility-mode basis and the corresponding water-filling rule. For general constraints, the formulation also optimizes correlations between mobility modes.
We construct finite joint maneuver codebooks through individual risk screening and noise-whitened trajectory packing. Every retained sequence satisfies the prescribed individual risk and deterministic maneuver-cost limits. We derive an identification-error bound and relate the achieved mutual information to the individually safe capacity and the unconstrained Gaussian benchmark.
An aerial-robot case study evaluates the predicted spectral convergence, the safety–information tradeoff, and the codeword error performance of individually risk-screened codebooks. It also examines how fleet-wide and per-robot information vary with fleet size. The remainder of this paper is organized as follows. Section II presents the operational system model. Sections III and IV derive the finite- and long-horizon capacity laws, respectively. Section V develops safe capacity, covariance allocation, and finite codebook construction. Section VI presents the aerial-robot case study, and Section VII concludes the paper.
Notation: Bold lowercase and uppercase letters denote vectors and matrices, respectively. For a real symmetric matrix , denotes positive semidefiniteness. The operators , , and denote transpose, trace, and rank, respectively. The superscript denotes conjugate transpose, denotes the Euclidean norm for vectors and the spectral norm for matrices, and denotes the Frobenius norm. The functions and denote the standard-normal cumulative distribution function and upper-tail function, respectively. All logarithms in information quantities are to base two.
Multi-robot system and operational model
Coupled Fleet Trajectory Observation
We consider mobile robots operating in a shared workspace over time steps of duration , with horizon , as illustrated in Figure 2. The state of robot may include planar (2D) or spatial (3D) position, velocity, orientation, and controller variables. We stack the fleet states and intentional maneuver commands at time as and , where . Each robot operates under the shared feedback architecture, while a mobility monitor observes the robots’ noisy trajectories to obtain information about the underlying joint maneuver sequence. We assume that the monitor knows the maneuver-to-observation model. Denoting the trajectory observation by at time , we write the joint linear model as
Figure 2. Multi-robot operational model.
The diagonal blocks of describe the closed-loop responses of individual robots, whereas its off-diagonal blocks capture coupling through the dynamics, formation control, or coordination. The matrix may also couple maneuver inputs across robots, and the process disturbances may be correlated across the swarm. Together, these matrices specify the motion. capabilities of the selected robot platforms, including their fixed feedback dynamics. For example, if the physical actuator command is , substituting it into the plant model yields (1). Thus, is a joint, mission-dependent mobility input applied outside the common feedback law; it is not a causal feedback policy adapted to past disturbances or observations. The vector denotes the noisy trajectory observation available to the mobility monitor, and denotes the additive observation error.
Define the transition matrix
Stacking and yields the lifted model
In (4), , denotes the lifted initial-state response, and is the maneuver-to-observation matrix. Its block is given by
Since the initial state is known, the first term on the right-hand side of (4) can be subtracted. The effective uncertainty comprises propagated process disturbances and observation error, which may be correlated across robots and time. Throughout the Gaussian analysis, we assume that is independent of and has positive-definite covariance .
Maneuver Resource and Operational Interpretation
To establish an operational coding interpretation, we introduce the index . When , the exogenous maneuver input is . From the observation , the monitor identifies the selected sequence and estimates the corresponding index as , with identification error
All maneuver alternatives use the same controller and differ only in their exogenous input sequences. Each physical trajectory is a random realization induced by and the disturbance.
We use as the maneuver-cost matrix and impose the resource constraint
The matrix weights intentional maneuver effort, such as acceleration variation or deviation from a nominal command sequence, and may penalize rapid changes between time steps. The scalar denotes the mobility-resource rate, and is the total resource budget over horizon .
Safety Semantics
For a given maneuver sequence , we assess safety through a collection of violation events. We consider three types of violations: a robot leaving its admissible region, a pair of robots approaching closer than , and a violation of prescribed actuator or other operational limits. Let denote the event that the -th constraint is violated. The union of these events is
For a given risk tolerance , we define the safe maneuver set as
where the probability is taken over the execution uncertainty for a fixed maneuver . Thus, characterizes the physical execution risk of an individual maneuver, and specifies the desired horizon-wise safety criterion. Section V develops a tractable chance-constrained formulation that incorporates this requirement into MIC optimization.
Fleet-Level Finite-Horizon Benchmark
Coupled Fleet Log-Determinant
We first extend the finite-horizon Gaussian benchmark in our preliminary letter to the multi-robot system. The resulting information objective underlies the subsequent spectral analysis and safety-aware design. For the centered channel , we define the uncertainty-whitened maneuver-to-trajectory mapping . For any admissible maneuver distribution , the mobility information over the -horizon quantifies the information that the observed trajectory carries about the underlying maneuver sequence. We define MIC as the maximum mobility information under the resource constraint, i.e.,
Thus, is measured in bits per realization over horizon . Relative to the differential entropy , mutual information removes the uncertainty that remains when the intentional input is known, i.e.,
Accurate observation alone therefore does not imply high mobility information when the admissible maneuver distribution contains little variation.
Proposition 1. (Finite-horizon Gaussian fleet benchmark). For the model in (4) under the constraint in (7), an optimal
input is zero-mean Gaussian. The maneuver-input covariance is . Under the Gaussian channel model, , where
Proof. The Gaussian-extremality argument extends [17, Prop. 1] to the fleet-matrix setting. A nonzero input mean consumes joint maneuver resources but only translates the output; hence, the optimal mean is zero. For fixed , the Gaussian maximum-entropy property provides an upper bound on , which is attained by a Gaussian fleet input. Independence across robots is not assumed, and the cross-robot covariance entries of remain optimization variables. ■
The determinant in (12) measures the extent to which admissible maneuver variation expands the uncertainty-whitened trajectory space. A high value requires both rich maneuver variation and distinguishable trajectory responses. This benchmark accounts for maneuver resources; physical safety constraints are incorporated in Section V.
Finite-Horizon Mobility Modes
To characterize the joint maneuver directions, we define the cost- and uncertainty-whitened channel
Let denote a unit eigenvector of associated with , where . We refer to as a cost-normalized mobility-mode vector specifying a normalized spatiotemporal maneuver pattern, and to as its mobility gain. Applying the singular-value decomposition of and Hadamard’s inequality diagonalizes the optimal covariance and gives
with
For the whitened channel , each right singular vector has an associated mobility gain
that measures the observable trajectory variation produced by one unit of normalized maneuver input relative to uncertainty. A mode can combine the motion of several robots with coordinated corrections over multiple time steps. It specifies a direction of joint maneuver variation rather than a selected mission or physical trajectory. The allocation in (15) assigns maneuver resources to patterns that the fleet can produce economically and the mobility monitor can distinguish reliably. The mobility modes therefore identify maneuver directions that yield the largest observable motion variation.
Operational Interpretation of the Finite-Horizon Benchmark
The finite-horizon quantity measures the mutual information between a complete joint maneuver over and its trajectory observation. To connect this quantity to reliable identification, we treat each -horizon maneuver-observation pair as one use of a vector channel. For independent uses, we have
where are independent copies of . An mobility code uses a random label . For a realization , the corresponding codeword consists of a deterministic sequence of joint fleet maneuvers , with for . The mobility monitor jointly estimates from . The rate measures the logarithmic number of reliably distinguishable joint maneuver codewords per -horizon block.
For , the code has average identification error and satisfies
The constraint averages resource consumption over the uniformly selected codewords and the maneuver blocks. Accordingly, the coding rate is bits per -horizon block. Let denote the largest code size satisfying these requirements.
Theorem 1 (Repeated-block operational capacity). For any fixed , the mobility channel subject to (18) satisfies
Thus, every rate below is achievable with vanishing average identification error, whereas no rate strictly above it is achievable with vanishing error.
Proof: Achievability follows from the standard random-coding theorem for a memoryless channel under an average cost constraint. For any , we can choose a zero-mean Gaussian input with average cost strictly below and mutual information exceeding . The usual expurgation argument establishes the existence of a deterministic codebook satisfying the empirical average-cost constraint. For the converse, let select an admissible codeword over independent horizon blocks. With , Fano’s inequality and the concavity of the Gaussian information objective give
The last inequality follows because the average input covariance satisfies the maneuver budget. Dividing by and taking followed by proves the result; see [8, Ch. 7]. ■
Theorem 1 establishes the operational meaning of the finite-horizon log-determinant: characterizes the asymptotic distinguishability per -horizon maneuver-observation block. For any , the number of reliably distinguishable joint maneuver codewords over independent horizon blocks can grow approximately as while the average identification error vanishes as . The repetition index counts independent uses of the entire -robot, -horizon mobility channel, rather than robots. For a small finite number of independent maneuver episodes, this asymptotic result does not specify the number of labels achievable at a given identification error; that question requires a finite-blocklength (FBL) analysis. The next section examines whether mobility information grows proportionally with the physical horizon.
Long-Horizon Mobility Capacity
Section III characterizes mobility information over a prescribed finite trajectory horizon. For any fixed , this formulation is exact: each gain corresponds to a complete spatiotemporal maneuver pattern over a horizon of , and quantifies the information carried by the corresponding trajectory segment. As increases, however, both the number and the structure of these modes change. The finite-horizon mobility-mode representation alone therefore does not establish whether mobility information continues to grow in proportion to physical time.
We therefore develop a long-horizon description of the same mobility information problem. Under a stationary operating regime, the growing set of finite-horizon modes admits a frequency-domain characterization independent of the chosen horizon length. This representation determines whether approaches a nonzero limit and, consequently, whether the system sustains a positive mobility information rate as the observation horizon grows.
From Finite-Horizon to Stationary Mobility Modes
To characterize the mobility modes independently of the horizon, we consider a stationary operating regime, such as steady reference tracking or formation motion. We set , , and , and assume that all eigenvalues of have modulus less than one, i.e., the dynamics are Schur-stable. The noise-free maneuver-to-observation map is then a stable causal convolution with transfer matrix
Thus, the lifted matrix in Section II and describe the same closed-loop mobility channel over a finite segment and in the frequency domain, respectively.
Let be a zero-mean stationary Gaussian output-uncertainty process with power spectral density matrix , where is measured in radians per time step. Its autocovariance matrices are
Here, denotes the angular frequency in radians per time step, and is an integer time lag. When the stationary process disturbance and observation noise are independent,
where . The matrices and denote the power spectral densities of and , respectively. Equation (23) separates uncertainty propagated through the dynamics from observation uncertainty introduced after the dynamics.
Similarly, we assume that the quadratic maneuver cost depends only on the time separation between inputs. Let characterize the cross term between maneuver inputs separated by time instants. Nonzero for allows the cost to penalize temporal variations in the maneuver sequence, such as rapid changes between consecutive acceleration commands. The finite-horizon cost matrix then takes the block-Toeplitz form [?]
Equivalently, the frequency-domain matrix specifies the maneuver cost associated with each frequency component, with
If the cost contains no cross-time terms, for all . Penalties on rapid maneuver variations, however, generally lead to a frequency-dependent . We define the maneuver-resource budget per time instant as . Thus, , consistent with the finite-horizon budget in (7).
Normalizing by both observation uncertainty and maneuver cost gives the frequency-domain mobility matrix
Let denote the eigenvalues of . These spectral gains characterize the same cost- and uncertainty-normalized maneuver observability as the finite-horizon gains in Section III, but at a different time scale. A finite-horizon gain corresponds to a complete spatiotemporal maneuver pattern over time instants and therefore depends on the chosen horizon. By contrast, characterizes a recurring maneuver component at temporal frequency in the stationary regime, independently of any particular .
Long-Horizon Capacity Law
We now examine whether the finite-horizon Gaussian benchmark under the stationary model grows linearly with the physical horizon. To this end, we characterize the limit of as . Theorem 2 expresses this limit in terms of the spectral mobility gains.
Theorem 2 (Long-horizon stationary mobility information capacity). Assume that and are continuous, uniformly positive definite Hermitian matrices, and that the finite normalized Gram matrices satisfy the finite-section regularity condition stated in Appendix A of the supplemental material.
Then, for every , the normalized finite-horizon capacity converges to
where and
If and has nonzero measure, the optimal allocation is
with zero allocation wherever and chosen to satisfy (28) with equality. If all branches are zero almost everywhere, then . The corresponding mobility information rate is bits/s.
Proof: See Appendix A of the supplemental material. ■
Together with Theorem 1, Theorem 2 characterizes the long-horizon scaling of the operational baseline. For every fixed , denotes the reliable information per maneuver block under independent block repetition. Normalizing this quantity by yields a limit of , which characterizes the mobility information per time instant as the physical horizon increases.
For , a positive long-horizon rate requires nonzero mobility gain on a set of frequencies with nonzero bandwidth. A longer trajectory can create distinguishable modes only when the closed-loop dynamics and the observation architecture continue to reveal new temporal structure. Reducing the time-step duration alone does not guarantee additional mobility degrees of freedom, since the dynamics, uncertainty, and maneuver cost change simultaneously.
System Implications
The spectral law provides the following implications for long-horizon mobility monitoring.
Corollary 1 (Flat-mode Shannon-like law). Suppose that exactly spectral mobility gains are positive almost everywhere on and share the constant value . With and ,
If the active-mode gains are nonflat and satisfy , the rate is bounded below and above by (30) with replaced by and , respectively.
Proof: Since the active modes have the same constant gain, symmetry and concavity yield the uniform allocation over the active modes. Substitution into (27) gives (30). ■
Equation (30) is the flat-mode special case of the spectral law. Here, denotes the number of effective real mobility modes per second, as determined by the dynamics and the trajectory-observation model.
Safety-Aware Maneuver Design
We now incorporate workspace boundary, inter-robot separation, and actuator constraints into the mobility information framework.
Per-Codeword Safe-Constrained Capacity
Using the safe maneuver set defined in (9), we express the MIC under per-codeword safety constraints as
The formulation in (33) requires each maneuver input to satisfy the same individual safety criteria. Direct optimization is difficult because the input distribution must be supported entirely on the safe set. To obtain a tractable formulation, we restrict the maneuver input to a zero-mean Gaussian distribution and impose chance constraints averaged over both maneuver selection and execution uncertainty. These constraints translate physical safety margins into limits on the maneuver-input covariance. However, the resulting Gaussian formulation does not ensure that each individual maneuver is safe.
Safety-Aware Maneuver Design
The spectral law provides the following implications for long-horizon mobility monitoring.
Corollary 2 (Terminal-only zero-rate condition). Suppose that the monitor observes only a fixed-dimensional terminal output. If the number of nonzero normalized modes satisfies and their gains are uniformly bounded by , then
and hence .
Proof: The finite-horizon representation and Jensen’s inequality give
Since is independent of , the bound scales as . Dividing by therefore yields a zero asymptotic rate. ■
Corollary 2 explains the value of trajectory observation. A fixed-dimensional terminal-state observation may suffice for endpoint-level tasks, but it discards the trajectory structure that distinguishes alternative avoidance, passing, and coordination maneuvers. Trajectory observation can instead sustain a nonzero asymptotic mobility information rate when it continues to provide new active modes as the horizon grows.
The spectral mobility gain depends jointly on the maneuver response and the output uncertainty spectrum . A stronger dynamic response to a maneuver therefore does not necessarily improve distinguishability, since the same dynamics may also amplify execution disturbances.
Safety-Aware Maneuver Design
We now incorporate workspace boundary, inter-robot separation, and actuator constraints into the mobility information framework.
Per-Codeword Safe-Constrained Capacity
Using the safe maneuver set defined in (9), we express the MIC under per-codeword safety constraints as
The formulation in (33) requires each maneuver input to satisfy the same individual safety criteria. Direct optimization is difficult because the input distribution must be supported entirely on the safe set. To obtain a tractable formulation, we restrict the maneuver input to a zero-mean Gaussian distribution and impose chance constraints averaged over both maneuver selection and execution uncertainty. These constraints translate physical safety margins into limits on the maneuver-input covariance. However, the resulting Gaussian formulation does not ensure that each individual maneuver is safe.
From Physical Chance Constraints to Covariance Constraints
Given the collision-free nominal trajectories , the position of robot at time can be written as
where maps the joint maneuver sequence to the displacement from the nominal position. The execution errors are jointly zero-mean Gaussian, with marginal covariance . To express the chance constraints in terms of the maneuver resource, we assume throughout this subsection that and that the maneuver input is independent of the execution errors. It follows that is Gaussian with mean and covariance .
We first consider a linear boundary of the admissible workspace, such as a wall. For constraint index , the permitted side is described by
where is a unit normal pointing toward the prohibited side and specifies the boundary location. This representation applies to corridor boundaries in two or three dimensions. For an aerial robot, the altitude limit is represented by and . A separating boundary can also constrain a robot to a prescribed obstacle-free side.
Since the nominal position lies on the permitted side, its distance to the boundary is
A violation occurs when the position deviation toward the prohibited side exceeds . Substituting (34) expresses this event as . Defining and , we write the total variance of as . Here, characterizes the contribution of the maneuver-input covariance to position fluctuations along the boundary normal, while is the fixed contribution from execution uncertainty. Together, this variance and the nominal distance determine the Gaussian boundary-crossing probability.
For a risk tolerance , the following result expresses the probability requirement as an explicit bound on the maneuver-induced variance [?].
Proposition 2 (Gaussian half-space covariance constraint). Under the Gaussian position model above, fix a nominal margin and a violation-probability limit . Define , where is the standard-normal cumulative distribution function. Then the chance constraint
is equivalent to
where
Here, the probability is averaged over both maneuver selection and execution uncertainty, and is the maximum permitted maneuver-induced variance along the boundary normal.
Proof. A boundary crossing occurs when . This projected position deviation is zero-mean Gaussian with variance . Standardization gives the Gaussian tail condition
Since both sides are nonnegative, squaring and rearranging yields (38).
(41) bounds the total position variance along the boundary normal. A smaller violation tolerance increases and reduces the variance budget. Execution uncertainty accounts for , leaving for maneuver variation. If , no maneuver-induced variance is permitted along that normal. If , execution uncertainty alone exceeds the permitted variance, and no can satisfy the constraint.
For inter-robot separation, the nominal margin is
Let denote the nominal separation direction from robot to robot . To ensure a separation of at least , we impose
Thus, (42) is sufficient to ensure the required Euclidean separation [20]. With , the corresponding covariance constraint is specified by and . This variance includes the cross-robot execution-error covariance.
Actuator limits can be treated similarly. Under the linear closed-loop model, each actuator-command component is an affine Gaussian function of and execution uncertainty. Its nominal distance to an upper or lower limit defines the corresponding safety margin. Proposition 2 then gives the associated covariance constraint.
Collecting the workspace boundary, pairwise distance, and actuator violation events over the horizon yields scalar risk events. If their risk budgets satisfy , Boole’s inequality bounds the probability of violating at least one constraint by .
Safety-Aware Gaussian Covariance Allocation
The maneuver covariance determines the magnitude and correlation of input variations across robots and time. Physical safety constraints limit the admissible maneuver variation, while observation uncertainty determines how clearly this variation can be distinguished on the observed trajectory. We therefore maximize mobility information subject to the maneuver-resource budget and physical safety margins.
With the maneuver budget and physical constraints on the maneuver-input covariance, the allocation problem is formulated as
The bound accounts for the available physical margin, execution uncertainty, and allocated violation probability.
Problem (43) is convex: the log-determinant objective is concave in , the maneuver-resource and safety constraints are affine, and the covariance satisfies . The optimization allocates maneuver variation according to its information gain, resource cost, and use of the available safety margins.
The solution specifies the optimal zero-mean Gaussian maneuver distribution under the average safety constraints. These constraints do not require every Gaussian draw to satisfy the individual risk tolerance; a maneuver with a small selection probability can still have a high execution risk. Replacing the individual safety requirement with an average-risk requirement relaxes the safety constraint, whereas the Gaussian assumption restricts the admissible input distributions. Consequently, the optimum of (43) is not generally an upper or lower bound on (33).
Water-Filling under Safety Constraints
To determine when the unconstrained modal interpretation remains applicable, define the cost-normalized maneuver-input covariance and transformed safety matrix as
The maneuver budget becomes , and the safety constraints become . Each is positive semidefinite and rank one because it originates from a scalar half-space event. The mobility modes are still the eigenvectors of . We next examine whether the transformed safety matrices can be diagonalized in the same basis, allowing the matrix optimization to reduce to resource allocation across these modes.
Proposition 3 (Mobility-mode allocation under safety constraints). Let diagonalize , with eigenvalues . If every is diagonal in this basis, an optimum of (43) can be chosen in the same mobility-mode basis:
For each positive-gain mode, define . The safety constraint becomes , and the optimal allocation is
where the nonnegative multipliers enforce the maneuver budget and the active safety constraints.
If the safety constraints further reduce to independent modal limits , then
where is chosen to meet the available total maneuver budget.
Proof. Let . By invariance of the trace, the maneuver-resource constraint is . Moreover,
so every safety constraint depends only on the diagonal entries of . Using Sylvester’s determinant identity and Hadamard’s inequality, an optimum can be chosen with , which gives (46).
With this diagonal representation, the matrix optimization reduces to allocating a nonnegative maneuver resource to each mobility mode. The reduced problem models (14) subject to and . The Karush–Kuhn–Tucker (KKT) conditions then yield the multi-price allocation in (47). In the scalar half-space model of Section V-B, every is rank one. Therefore, such a matrix has at most one positive diagonal entry and imposes an individual cap on one mode. Hence, the simpler capped water-filling rule (48) applies under the independent maneuver-cost limits . ▪
The allocation rule balances the observable gain of each mobility mode against its resource cost and its use of active safety margins. The gain describes how clearly a unit of normalized maneuver variation can be observed, while accounts for its effect on the active physical constraints. A highly observable mode can therefore receive little or no allocation when it strongly excites a restrictive constraint. A mode with a smaller observable gain can remain useful if it consumes less of the available safety margin.
The alignment between the physical constraints and the mobility modes determines the allocation structure. When the transformed safety matrices share the mobility-mode basis, the scalar allocation in Proposition 3 is optimal. For general coupled constraints, the full covariance optimization also determines the correlations between mobility modes.
Finite Per-Codeword Safe Mobility Codebook
A finite joint maneuver codebook consists of a set of deterministic joint maneuver sequences, with each serving as a codeword. Per-codeword safety requires each sequence to satisfy the prescribed risk threshold over execution uncertainty. The solution of the covariance allocation problem (43) specifies a continuous Gaussian maneuver distribution rather than a finite executable set. We use as a proposal distribution to generate candidate joint fleet maneuvers, screen each candidate for safety, and select codewords based on their trajectory separation.
For a fixed candidate , uncertainty arises only from execution error. For each scalar safety constraint indexed by , the corresponding safety margin is written as
where characterizes the maneuver-induced change in the margin and represents the projected execution uncertainty. Both the workspace boundary constraints and the pairwise-distance constraint in (42) admit this safety-margin representation. A violation occurs when the margin is negative, yielding
Each maneuver candidate is screened against all safety events and retained only if it satisfies
where is the per-codeword risk threshold. By Boole’s inequality, this condition guarantees
In addition to the probabilistic safety test, each candidate must satisfy the deterministic maneuver-cost constraint.
For two maneuver candidates indexed by and , define their noise-whitened trajectory distance as
This quantity is the Mahalanobis distance between the mean trajectory observations induced by the two candidates. A larger makes the corresponding maneuvers easier for the mobility monitor to distinguish. Starting from an initial codeword, we construct the codebook sequentially by selecting the remaining candidate with the largest distance to its nearest retained codeword, as described in Algorithm 1.
For the resulting codebook, let and let the realization select . Then
Hence, under equal codeword priors, the mobility monitor applies maximum-likelihood decoding. For a selected index and a competing index , define
Let denote the zero-mean Gaussian density with covariance . The mutual information achieved by the finite codebook is
This expression evaluates the actual finite codebook, whose input distribution is no longer Gaussian following safety screening and codeword selection.
Proposition 4 (Finite-codebook safety and identification bound). Suppose that the scalar Gaussian safety-margin model above holds for all . Every codeword , , generated by Algorithm 1 satisfies the maneuver-resource constraint and
For , define the minimum pairwise trajectory distance
Under equal codeword priors, the maximum-likelihood decoder satisfies
Proof. The safety result follows directly from (53) and the screening step of Algorithm 1, while Step 2 ensures that the maneuver-resource constraint is satisfied. After the observation noise is whitened, conditional on the selection of maneuver sequence , the probability that a competing codeword has a higher likelihood than is . Applying a union bound over the competing codewords gives (60).
For a codebook with , define
The first term follows from Proposition 4, and the second follows because maximum-likelihood decoding with equal priors performs at least as well as random guessing. Hence, . Applying Fano’s inequality and using the feasible-input characterization of the constructed codebook yields
The first upper bound holds because every retained codeword satisfies the per-codeword risk requirement and the maneuver-resource constraint. The uniform distribution over the codebook is therefore a feasible input distribution for . Removing the safety requirement enlarges the input class, yielding . Thus, (62) relates the information achieved by the finite codebook to an error-based achievable lower bound and the two capacity benchmarks. Since safety screening and distance-based selection modify the Gaussian proposal distribution, we evaluate the actual finite-codebook mutual information using (57).
Aerial-Robot Case Study
We evaluate the proposed framework using the aerial-robot fleet shown in Figure 3. For robot , the state consists of position and velocity, i.e., , with acceleration as the control input. The control update interval is s, and acceleration is held constant within each interval. A fixed stabilizing feedback controller governs the nominal closed-loop motion, while the intentional maneuver input is an additional exogenous acceleration sequence. Spatially correlated
Figure 3. Aerial-robot evaluation scenario. The mobility monitor observes position trajectories in a corridor with altitude and inter-robot separation constraints.
ends_mid=1
| Parameter | Symbol | Value / source |
| Fleet size | 1–6 robots | |
| Control update interval | 0.25 s | |
| Corridor / altitude | – | m; m |
| Minimum inter-robot distance | 2.5 m (risk) | |
| Acceleration-disturbance standard deviation | – | (0.08, 0.08, 0.05) m/s |
| Position-observation standard deviation | – | (0.15, 0.15, 0.10) m |
| Cross-robot correlation | 0.15 | |
| Maneuver budget per axis and instant | – | 0.04 (m/s) |
Table 1 (PDF p. 10). Simulation setup.
acceleration disturbances represent environmental uncertainty shared by the robots. The resulting model is
where
The aerial robots fly in parallel at 2 m/s through a bounded corridor. Their lateral lanes span m, and their altitudes alternate between 19.85 and 20.15 m. Nominal relative-position vectors define the pairwise half-spaces in (43). The maneuver design includes corridor, altitude, and pairwise-distance constraints, with the latter constructed using the relative-position directions in (43).
Table 1 summarizes the simulation parameters. Unless otherwise specified, the same configuration is used in all experiments.
| Algorithm 1: Safe Joint Mobility Codebook Construction |
| Input: , , , , , , per-codeword risk threshold , candidate count , and target codebook size . |
| 1) Generate joint maneuver candidates from . |
| 2) Reject every candidate with . |
| 3) For each remaining candidate, compute and retain only those satisfying (52). If no candidates remain, return and stop. |
| 4) Among the remaining candidates, initialize the codebook with , . |
| 5) While and unselected candidates remain, add the candidate satisfying , and update . |
| Output: The finite joint maneuver codebook with actual size . |
Table 1.
The simulations evaluate three aspects of the proposed MIC framework. First, we examine convergence from the finite-horizon gain distribution to its stationary spectral characterization and compare full-trajectory and terminal-only observations. Second, we assess how physical safety constraints affect mobility information by comparing equal allocation, unconstrained water-filling in (15), the general safety-aware solution of (44), and a modal-cap allocation based on capped water-filling.
We also evaluate the finite maneuver codebook constructed by Algorithm 1 in terms of achieved mutual information, maneuver-identification error, and per-codeword safety. Third, we examine fleet-wide and per-robot information as more aerial robots share the same corridor.
We first examine the long-horizon behavior predicted by Theorem 2 and the mobility information retained through full-trajectory observation. In Figure 4(a), the finite-horizon generalized-gain distributions approach the stationary spectral characterization as increases from 4 to 64. At , the finite-horizon distribution differs noticeably from its stationary counterpart. This difference decreases as the horizon grows, indicating that the spectral model captures the asymptotic mobility modes. Figure 4(b) compares the information rates obtained with full-trajectory and terminal-only observations. At ( s), the full-trajectory rate is close to the stationary spectral limit, whereas terminal-only observation incurs a substantial rate loss, consistent with Corollary 2. These trends are consistent with the sustained rate characterized by Theorem 2 and the terminal-observation scaling in Corollary 2, demonstrating the value of retaining trajectory history for mobility monitoring.
Figure 4. Spectral convergence. (a) Finite-horizon and stationary generalized-gain distributions. (b) Information rates with full-trajectory and terminal-state observations.
Figure 5(a) compares how maneuver allocation and the representation of physical constraints affect mobility information. The unconstrained Gaussian solution provides a reference without physical safety restrictions. The safety-aware design optimizes the full maneuver covariance, whereas the fixed-modal design restricts the cost-normalized covariance to while retaining the original coupled safety inequalities. The independent modal-cap design applies capped water-filling under separate modal limits. Equal feasible allocation uses , with the largest satisfying the maneuver-resource and safety constraints. The safety-aware covariance design achieves a substantially higher information rate than equal feasible allocation and retains most of the unconstrained reference. The fixed-modal design remains close to the full covariance solution, showing that allocation in the mobility-mode basis captures most of the available gain. Independent modal caps yield a lower rate because they restrict the tradeoffs permitted by the coupled safety inequalities. These results show that observable mobility gains and the structure of physical safety constraints jointly determine effective maneuver allocation.
Figure 5. Safety-aware maneuver allocation and finite-codebook performance. (a) Safety–information tradeoff under constraints. (b) ML identification error versus codebook size (error bars indicate two-sided 95% Clopper–Pearson confidence intervals).
Fig. 5(b) evaluates the identification reliability of the finite joint maneuver codebooks constructed by Algorithm 1. Across the tested codebook sizes, the empirical ML identification error remains below 0.5%. For the 32-codeword design, evaluating the finite-codebook mutual information (58) gives approximately 4.98 bits, close to the 5-bit entropy of a uniformly selected codeword. The trajectory observations therefore retain nearly all the information carried by the selected maneuver index. Increasing the codebook size introduces more maneuver alternatives within the same resource-constrained observation space and increases the identification error, illustrating the tradeoff between maneuver diversity and identification reliability.
Finally, Figure 6 identifies when additional robots begin to consume one another’s maneuver freedom in the fixed corridor. With the per-robot, per-step maneuver budget held constant, information per robot remains approximately constant up to and decreases when the pairwise-distance constraints become active from . The design without physical safety constraints remains close to the independent-robot reference, indicating that the reduction is primarily associated with the increasingly restrictive spatial safety margins. Aggregate mobility information continues to grow as additional robots introduce new joint maneuver dimensions. At , the safety-aware design retains about 90% of the independent-robot information, and its aggregate information exceeds five times the single-robot information. These results distinguish the fleet-wide information gained by adding robots from the maneuver freedom available to each robot. MIC captures both effects and identifies how shared-space constraints change the information supported by a given fleet size.
Figure 6. Aerial-robot fleet scaling in a fixed corridor. (a) Mobility information per robot. (b) Aggregate mobility information.
Conclusion
This paper established a mobility information capacity framework for quantifying observable maneuver freedom in multi-robot systems. Cost- and uncertainty-normalized mobility modes connect the fleet dynamics to the distinguishability of its trajectory observations. The stationary spectral characterization identifies when maneuver information grows proportionally with the observation horizon, while the terminal-observation analysis establishes conditions under which a fixed-dimensional endpoint cannot sustain a nonzero information rate. Physical safety margins enter maneuver design through coupled covariance constraints, determining the allocation across mobility modes and the role of correlations between them.
Individual risk screening and noise-whitened trajectory separation translate the covariance design into finite joint maneuver codebooks with explicit execution-risk and identification-error bounds. The aerial-robot study demonstrates the results for full-trajectory observation, safety-aware resource allocation, and fleet scaling in a shared corridor. Together, these results provide a quantitative basis for selecting maneuver variation according to its observability, resource cost, and use of physical safety margins.
Supplemental Material for Mobility Information Capacity of Multi-Robot Systems: Safety-Aware Maneuver Design
Weijie Yuan, Senior Member, IEEE
This supplemental material contains the proof of the long-horizon capacity theorem in the main manuscript. Section, figure, theorem, and unprefixed equation references refer to the main manuscript. Equations in this supplement are numbered with the prefix S.
Proof of the Long-Horizon Capacity Theorem
From Finite-Horizon Gains to Spectral Gains
For a horizon of time steps, define the normalized Gram matrix
Denote all eigenvalues of , including the positive eigenvalues and the zero eigenvalues, by . Since both the number and the values of these gains depend on , we characterize their long-horizon behavior through their distribution. Specifically, we show that the distribution of the finite-horizon gains approaches that of the spectral gains as increases. This distributional convergence is illustrated in Figure 4(a).
For a frequency-domain matrix function of , let
denote its Fourier coefficients. The corresponding -block Toeplitz section [1] is
Under the stationary model, and .
The finite-section regularity condition in Theorem 2 requires the finite-horizon matrix to have the same asymptotic spectral characterization as the Toeplitz matrix generated by . Specifically,
In the stable LTI setting of Section IV, this condition follows from standard finite-section results when the maneuver-to-observation impulse response is absolutely summable and and are continuous and uniformly positive definite [2].
Let denote the eigenvalues of , ordered consistently with those of . Since both matrices are Hermitian, the Hoffman–Wielandt inequality yields [3]
The uniform norm bound places both sets of eigenvalues in a common compact interval . Any continuous function is uniformly continuous on this interval. Together with (S6), this implies
Applying the block Szegő eigenvalue-distribution theorem [4 Th. 3] gives
(74) shows that, for any continuous function , the normalized sum of evaluated at the finite-horizon gains converges to the corresponding frequency-domain average over the spectral gains. Equivalently, after normalization by , the empirical distribution of the finite-horizon gains approaches the distribution generated by as the horizon grows.
Convergence of the Water Level
We next show that the finite-horizon water-filling allocation converges to the spectral allocation in (29). For a horizon of time steps, water-filling over all gains gives
where when .
Since the spectral gains are positive on a set of frequencies with nonzero bandwidth, there exist constants and such that, for sufficiently large , at least finite-horizon gains satisfy . It follows that
which establishes that the sequence is bounded.
To identify the possible subsequential limits of , let be any convergent subsequence and write
Define
For every finite , is continuous on . Moreover,
Thus, replacing with the fixed function in the normalized resource sum introduces an error that vanishes in the limit.
Using the finite-horizon resource equality (S9) and applying (S8) to the fixed continuous function yield
The function is continuous and nondecreasing in . Therefore, for every , there is a unique water level satisfying . Since every convergent subsequence of the bounded sequence has the same limit , we obtain
This water level defines the spectral water-filling allocation
with whenever .
Convergence of the Mobility Information
We now evaluate the information associated with the converging finite-horizon allocation. In terms of all gains, the normalized finite-horizon capacity is
Define
On the bounded interval , (S15) implies
We can therefore replace the -dependent function with its limit and apply (S8). Equation (S17) then yields
which gives in (27). By (S14), the allocation in (S16) satisfies the KKT conditions of the spectral optimization problem in (27) and (28). The concavity of this problem establishes global optimality. This proves (27) and (29) when the spectral mobility gains are positive on a set of frequencies with nonzero bandwidth.
It remains to consider the case where almost everywhere for every . For any , let denote the number of finite-horizon gains exceeding . Applying (S8) with gives
and hence for every fixed . Separating the contributions from gains below and above yields
Since ,
Letting and using the nonnegativity of mutual information yield
Thus, when all spectral mobility gains equal 0 almost everywhere.
Finally, the rate relation
completes the proof of Theorem 2.
References
- [1]Delsarte and Y. Genin, “Tridiagonal approach to the algebraic environment of toeplitz matrices, part I: Basic results,” SIAM Journal on Matrix Analysis and Applications, vol. 12, no. 2, pp. 220–238, 1991.DOI
- [2]J. Gutiérrez-Gutiérrez and P. M. Crespo, “Asymptotically equivalent sequences of matrices and hermitian block toeplitz matrices with continuous symbols: Applications to MIMO systems,” IEEE Transactions on Information Theory, vol. 54, no. 12, pp. 5671–5680, Dec. 2008.
- [3]A. J. Hoffman and H. W. Wielandt, “The variation of the spectrum of a normal matrix,” Duke Mathematical Journal, vol. 20, no. 1, pp. 37–39, 1953.
- [4]H. Gazzah, P. A. Regalia, and J.-P. Delmas, “Asymptotic eigenvalue distribution of block toeplitz matrices and application to blind simo channel identification,” IEEE transactions on information theory, vol. 47, no. 3, pp. 1243–1251, 2001.




