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.
Figures & tables
Fig. 1: Directional bounded-confidence mechanism. (a) Pairwise relative velocity decomposition in the instantaneous line-of-sight frame. (b) Independent gating yielding full, radial-only, tangential-only, or rejected alignment interactions. (c) The resulting state-dependent, matrix-weighted alignment network. Active radial and tangential channels are blue and orange, respectively; dashed gray denotes rejected channels.
Fig. 2: Performance comparison of the five alignment laws under identical CS dynamics and initial conditions. Circles and triangles indicate initial and final spatial positions, respectively. The first panel tracks the global velocity disagreement Ev(t) , with the dotted line marking the alignment tolerance.
Fig. 3: Terminal velocity disagreement and final component count across the 4×4 grid of radial and tangential confidence bounds. The phase diagram illustrates that consensus requires sufficient complementary activation across both directional channels.
Fig. 4: Verification of Theorems 1 and 3 for the representative directional setting. Left: Velocity variance V(t) . Center: Energy-balance numerical residual for V(t)+∫0tD(s)ds=V(0) . Right: Sliding-window PE statistic ( 11 ) evaluated with T=5 s.
Fig. 5: Spearman correlations linking matching-window mode fractions to PE excitation λPE and measured RMS decay rates ρE . (a) Pooled windows across all sixteen directional confidence settings. (b) The representative setting. (c) Median within-run coefficients, where n denotes the number of runs with defined correlations.
Fig. 6: Extended empirical diagnostics. (a) Measured RMS decay rate ρE versus normalized PE excitation λPE/T across the confidence grid, with the representative trajectory highlighted. (b) Edge-time fractions per directional mode for q=2 . (c) Terminal RMS disagreement across distance and confidence-kernel exponents. Panels (b) and (c) fix both confidence bounds at 0.80 m/s.
Fig. 7: Cluster convergence under directional gating. (a) Longitudinal velocities converging to distinct conserved pair means. (b) Within-pair RMS disagreement decaying below 0.1e−0.3528t , while global disagreement approaches 1 m/s. (c) Three zero eigenvalues coexisting with a uniform positive gap on the complementary subspace, illustrating how rank-one cross-pair edges preserve a non-consensus null direction.
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.
Hossein B. Jond
Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, 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 study proposes a Cucker-Smale model incorporating dynamic networks and the discrete p-Laplacian (p∈(1,2)) and analyzes the relationship between flocking time constraints and graph connectivity from both theoretical and experimental perspectives. We establish that this model achieves flocking within finite time and derive a quantitative relationship between the lower bound of flocking time and graph volume. Based on these results, we observe that imposing sufficiently small flocking time induces an increase in network volume, and that larger initial velocity variance requires greater volume under the same time constraint. In our experiments, we trained a transformer-based PPO policy to select network structures at each time step. Under the most stringent time constraint, the maximum average number of connections increased sharply, confirming a threshold effect. The negative correlation between convergence time and average number of connections reflects the theoretical results well. This study provides quantitative evidence for the phenomenon that time constraints induce connection mobilization.
Sooyeon Song, Jea-Hyun Park
Department of Mathematics, Kunsan National University, 558 Daehak-ro, Gunsan-si, Jeollabuk-do 54150, Republic of Korea