This paper proposes a directional bounded-confidence variant of the discrete-time Vicsek multiagent model, in which pairwise heading alignment is modulated by a state-dependent, positive semidefinite matrix that independently gates orthogonal radial and tangential components in the instantaneous line-of-sight frame. We analyze the normalized, matrix-weighted system dynamics, proving a uniform non-vanishing bound on proposal vectors that guarantees global well-posedness across arbitrary network states. For local small-spread states under complete metric interaction, we prove linear geometric contraction of the heading diameter and establish an offline-verifiable spatial bootstrap condition that guarantees metric contact preservation and coincidence avoidance a priori. A counterexample demonstrates invariant polarized states on connected matrix graphs, delineating systemic structural limits. Numerical experiments against unfiltered Vicsek averaging, scalar tied confidence, trace-matched scalar baselines, and restricted-angle rules demonstrate component-selective filtering without rejected-channel leakage, along with improved fixed-bound alignment on multi-seed benchmarks across varying population densities.
Figures & tables
Fig. 1: Schematic of the state-dependent directional-confidence alignment mechanism. (a) Relative heading vector wij=uj−ui decomposed into orthogonal radial ( Pijrwij ) and tangential ( Pijtwij ) components in the instantaneous LOS frame eij=rij/∥rij∥ . (b) Independent gating functions hϵr and hϵt yield anisotropic edge matrix Bij , illustrated here for a tangential-only filtering scenario ( ϵr=ϵt=0.85 ) where the radial correction is completely suppressed. (c) Filtered relative corrections enter the metric-masked residual sum, followed by state normalization Ni(yik) , uniform angular noise rotation R(ξik) , and spatial streaming. All geometric projections and confidence matrices are evaluated synchronously at step k ; superscript + denotes the updated state at k+1 .
Fig. 2: Validation of theoretical diagnostics with independent initial conditions. (a) Local heading contraction for n=100 agents ( Δ0=0.2988763,δ=0.3 ) versus the linear envelope qkΔ0 predicted by Theorem 1 . (b) Exact four-agent invariant polarized trajectory ( R=∞ ). (c) Evolution of the mean heading norm Pk under state normalization ( n=100 ).
Fig. 3: Matched 100-agent benchmark trajectories and alignment residual evolution. The dotted horizontal line marks the alignment threshold ( 0.02 ); residuals below 10−12 are floored for display.
n
Directional
Tied
Matched
Restricted
10
20
0
20
0
50
20
0
20
0
100
20
0
20
0
200
20
0
20
0
TABLE II: Aligned Trials Out of 20 Matched Seeds per Population
Fig. 4: Population density sweep over 20 matched seeds per size n∈{10,50,100,200} : (a) fraction aligned by update 300; (b) median terminal RMS disagreement, floored at 10−12 for display. Increasing n within a fixed footprint increases network density.
This paper introduces a directional bounded-confidence extension of the Cucker--Smale (CS) flocking model that decomposes pairwise relative velocities into independent radial and tangential channels within the instantaneous line-of-sight frame. Gating these components via compactly supported kernels creates a time-varying, state-dependent, matrix-weighted interaction that strictly generalizes classical scalar CS alignment. We establish an exact energy-dissipation identity with conserved mean velocity and prove exponential velocity consensus under a sliding-window persistent excitation (PE) condition formulated directly on the disagreement subspace. Furthermore, we derive a CS bounded-diameter criterion separating metric decay from aggregate directional coercivity, along with a cluster convergence guarantee. Simulations validate the exact dissipation balance and demonstrate that directional gating successfully restores global alignment in scenarios where traditional isotropic tied-confidence laws remain polarized.
Hossein B. Jond
Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, 121 35 Prague 2, Czech Republic
Coordinated collective motion in bird flocks and fish schools inspires algorithms for cohesive swarm robotics. This paper presents a position-based flocking model that achieves persistent velocity alignment without velocity sensing. By approximating relative velocity differences from changes between current and initial relative positions and incorporating a time- and density-dependent alignment gain with a non-zero minimum threshold to maintain persistent alignment, the model sustains coherent collective motion over extended periods. Simulations with a collective of 50 agents demonstrate that the position-based flocking model attains faster and more sustained directional alignment and results in more compact formations than a velocity-alignment-based baseline. This position-based flocking model is particularly well-suited for real-world robotic swarms, where velocity measurements are unreliable, noisy, or unavailable. Experimental results using a team of nine real wheeled mobile robots are also presented.
Hossein B. Jond, Veli Bakırcıoğlu, Logan E. Beaver +3
Department of Cybernetics, Czech Technical University in Prague, Prague, Czechia · Aksaray University, 68100, Aksaray, Türkiye · Mechanical and Aerospace Engineering, Old Dominion University, Norfolk, VA, USA +4
This paper studies non-trivial consensus--a relatively novel and unexplored convergence behavior--on directed signed matrix-weighted networks subject to both additive and multiplicative measurement noises under time-varying topologies. Building upon grounded matrix-weighted Laplacian properties, a stochastic dynamic model is established that simultaneously captures inter-dimensional cooperative and antagonistic interactions, compound measurement noises and time-varying network structures. Based on stochastic differential equations theory, protocols that guarantee mean square and almost sure non-trivial consensus are proposed. Specifically, for any predetermined non-trivial consensus state, all agents are proven to converge toward this non-zero value in the mean-square and almost-sure senses. The design of control gain function in our protocols highlights a balanced consideration of the cumulative effect over time, the asymptotic decay property and the finite energy corresponding to measurement noises. Notably, the conditions on time-varying topologies in our protocols only require boundedness of elements in edge weight matrices, which facilitate the practicality of concept "time-varying topology" in matrix-weighted network consensus algorithms. Furthermore, the proposed protocols operate under milder connectivity conditions and no requirements on structural (un)balance properties. The work in this paper demonstrates that groups with both cooperative and antagonistic inter-dimensional interactions can achieve consensus even in the presence of compound measurement noises and time-varying topologies, challenging the conventional belief that consensus is attainable only in fully cooperative settings.
Tianmu Niu, Xiaoqun Wu
School of Mathematics and Statistics, Wuhan University, Wuhan, 430072, China · College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, 518060, China