Next Article in Journal
Multiaxial Fatigue Assessment of Railway Bogie Welded Joints: A Preliminary Study Based on Critical Plane Criterion
Previous Article in Journal
Enhancing Reliable Prostate Lesion Detection: Integrating Multi-Expert Annotations and Tailored nnU-Net Ensemble Learning Strategies
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Flocking Dynamics of Multi-Agent Systems Based on an Extended Cucker–Smale Model with Nonlinear Coupling and Binding Forces

by
Yimeng Li
,
Yinghua Jin
* and
Wenping Fan
School of Mathematics and Data Science, Jiangnan University, Wuxi 214122, China
*
Author to whom correspondence should be addressed.
Appl. Sci. 2026, 16(8), 3933; https://doi.org/10.3390/app16083933
Submission received: 13 March 2026 / Revised: 7 April 2026 / Accepted: 14 April 2026 / Published: 18 April 2026

Abstract

This paper develops an extended Cucker–Smale model that integrates nonlinear velocity alignment with state-dependent binding forces to achieve stable, collision-free flocking in multi-agent systems. Our framework introduces two dedicated control mechanisms: a velocity-dissipative term ( K 1 ) for accelerated convergence, and a distance-regulating term ( K 2 ) for formation cohesion and collision avoidance, which collectively ensure stable flocking. Rigorous Lyapunov analysis establishes provable guarantees for asymptotic velocity alignment and collision safety under verifiable initial energy conditions. Numerical simulations validate the theoretical predictions for a 20-agent swarm; scalability analysis demonstrates effective coordination in systems of up to 100 agents and reveals that velocity synchronization improves substantially—with errors decreasing by nearly two orders of magnitude—as K 2 increases from 0.05 to 0.50. A Pareto-optimal parameter region ( K 2 [ 0.15 , 0.30 ] ) is identified, which achieves sub-centimeter-per-second alignment accuracy while maintaining energy consumption below 35% of the baseline. The proposed framework provides a theoretically rigorous yet practically viable solution for applications demanding guaranteed safety and precise coordination, such as UAV formations, robotic swarms, and autonomous vehicle platoons.

1. Introduction

Flocking behaviour is observed in both natural systems, such as bird flocks [1] and fish schools [2], and engineered systems, such as UAV formations [3] and robotic swarms [4]. This collective behaviour enables coordination through local interactions without requiring global information. Multi-agent systems (MAS) are central to control theory and artificial intelligence, with applications spanning UAV coordination, transportation, and robotic collaboration [5,6,7,8,9,10,11,12,13,14,15]. Flocking represents a fundamental behaviour in MAS. The Cucker–Smale model [16] established the theoretical foundation for asymptotic velocity consensus under ideal communication topologies [17,18].
Key persistent challenges in flocking research include guaranteeing collision avoidance in dense formations and maintaining structural stability in dynamic or disturbed environments. Recent research advances to address these issues encompass the use of binding forces for conformational integrity [19], singular weight functions [20,21], the analysis of dynamic topologies under communication delays [22,23,24], nonlinear velocity coupling [25], cooperative-competition mechanisms [26], distributed delay tolerance conditions [27], hierarchical network structures [28], infinite graph models [29], and event-triggered control strategies [30]. However, a significant gap remains: existing models often lack a unified framework that seamlessly integrates velocity alignment with geometric formation control. Furthermore, they typically offer limited systematic parameter sensitivity analysis, which is crucial for practical implementation and tuning.
To clarify the distinct contributions of this work relative to the existing literature, we provide the following comparative positioning:
  • Nonlinear Cucker–Smale Extensions: While prior work [25] introduced nonlinear velocity coupling, it did not incorporate binding forces for formation control. Our model unifies nonlinear coupling with state-aware binding mechanisms, enabling simultaneous velocity alignment and geometric structure regulation.
  • Collision Avoidance Strategies: Methods such as artificial potential fields [19] provide empirical collision avoidance but frequently lack rigorous stability proofs. Our binding force formulation, particularly the K 2 term, delivers provable collision avoidance (Theorem 2) while preserving formation cohesion.
  • Energy-Aware Coordination: Most flocking models focus solely on convergence metrics, neglecting control effort. We introduce an energy-efficiency metric and conduct comprehensive parameter optimization to identify Pareto-optimal trade-offs between synchronization accuracy and energy consumption—an aspect largely unexplored in prior work.
  • Theoretical Analysis: In contrast to simulation-based studies, we furnish rigorous Lyapunov-based proofs for both velocity consensus and collision avoidance within a unified nonlinear framework. Our analysis explicitly relates the control parameters ( K 1 , K 2 ) to convergence rates and safety guarantees.
  • Parameter Sensitivity: Although parameter studies exist, they typically examine isolated effects. Our work provides a systematic multi-metric analysis (encompassing velocity error, spatial dispersion, collision rate, and heading stability) that reveals intricate parameter interactions and their practical implications for controller design.

1.1. Positioning Relative to Existing Literature

To clarify the distinct contribution of this work, we present a critical comparison with key related approaches. The primary contribution of this work is threefold: (1) the mathematical unification of nonlinear alignment and binding mechanisms with provable stability guarantees; (2) energy-aware optimization that bridges theory and practice; (3) comprehensive sensitivity analysis that provides actionable insights for parameter tuning.

1.2. Experimental Validation Strategy

To empirically validate the theoretical advantages outlined above, Section 4.4 provides a comprehensive quantitative comparison with the classical Cucker–Smale formulation. The comparative analysis demonstrates a 73.6% improvement in velocity alignment precision, a 54.2% reduction in spatial dispersion, and guaranteed collision avoidance—concrete metrics that substantiate the claimed advantages over existing approaches. This experimental validation bridges theoretical analysis with practical performance assessment, thereby addressing the need for benchmark comparisons highlighted in prior literature reviews.

1.3. Research Objective

Based on the identified gaps in the existing literature, this study aims to develop a provably stable flocking control framework that simultaneously ensures velocity alignment, formation cohesion, and collision avoidance through the synergistic action of nonlinear coupling and state-aware binding forces. The work establishes both theoretical guarantees (Theorems 1–3) and practical implementation guidelines derived from systematic parameter analysis.

2. Preliminaries

2.1. Nonlinear Velocity Coupling Function Properties

Assumption 1.
The nonlinear velocity coupling function Γ : R d R d satisfies the following properties:
1. 
Oddness and Semi-Positive Definiteness: For all v R d ,
Γ ( v ) = Γ ( v ) and Γ ( v ) , v 0 .
2. 
Growth Condition: There exist constants C 1 > 0 and γ ( 0.5 , 1.5 ) such that for all v R d ,
Γ ( v ) , v C 1 v 2 γ .

Physical Interpretation and Examples

The nonlinear operator Γ ( · ) governs the velocity alignment mechanism. Condition (1) ensures physical consistency: reversing the velocity difference reverses the direction of the coupling force. Condition (2) guarantees sufficient alignment strength to ensure convergence. Two admissible examples include:
  • Saturating nonlinearity: Γ sat ( v ) = v 1 + ϵ v 2 with ϵ > 0 , which models actuator saturation.
  • Power-law nonlinearity: Γ pow ( v ) = v p 1 v with p ( 1 , 3 ) , representing generalized damping.
The condition Γ ( v ) , v C 1 v 2 γ has a clear physical interpretation: it guarantees that the velocity alignment mechanism always performs positive work on the system, thereby dissipating kinetic energy associated with velocity disagreements. The exponent γ controls the growth rate of this dissipative effect. When γ > 1 , alignment strengthens super-linearly with velocity differences, potentially accelerating convergence. When γ < 1 , alignment is sub-linear, which can provide a smoother response and reduce sensitivity to measurement noise.
These examples demonstrate that the proposed framework encompasses both standard linear couplings ( Γ ( v ) = v ) and more complex nonlinear behaviors relevant to practical systems with saturation limits, actuator constraints, or non-Newtonian interaction dynamics.

2.2. Asymptotic Flocking Properties

Definition 1.
A multi-agent system 𝒫 = { ( x i , v i ) } i = 1 N is said to exhibit asymptotic flocking if the following conditions hold:
1. 
Velocity alignment:
lim t v j ( t ) v i ( t ) = 0 1 i , j N
2. 
Group formation:
sup t 0 x j ( t ) x i ( t ) < 1 i , j N

2.3. Barbalat’s Lemma

Lemma 1 (Barbalat’s Lemma).
If a differentiable function f ( t ) satisfies the following conditions:
1. 
f ( t ) is lower bounded,
2. 
f ˙ ( t ) is uniformly continuous,
3. 
lim t 0 t f ˙ ( τ ) d τ exists (i.e., the integral converges),
then lim t f ˙ ( t ) = 0 .

3. Model Construction and Theoretical Analysis

3.1. Construction of Extended Model

To enhance collision avoidance and structural stability in complex environments, the classical Cucker–Smale model is extended with nonlinear velocity coupling and state-aware mechanisms:
d x i d t = v i d v i d t = λ N j = 1 N ψ ( x j x i ) Γ ( v j v i ) + σ N j = 1 N K 1 v j v i , x j x i 2 r i j 2 ( x j x i ) + K 2 ( r i j 2 R ) 2 r i j ( x j x i )
where x i , v i are the position and velocity of the agent respectively, ψ ( · ) is the communication weight function, Γ ( · ) is the nonlinear velocity coupling function, λ and σ are the coupling strengths, R is the preset distance between particles, r i j = x j x i , K 1 is the dissipative force gain parameter, K 2 is the repulsive force gain parameter.

Physical Interpretation and Derivation of the Force Terms

To provide an intuitive physical foundation for the proposed model, the two newly introduced force terms governed by parameters K 1 and K 2 are described below.
1. 
The K 1 Term: Viscous Damping Force
  • Physical Role: This term acts as a viscous damper within the system. Its magnitude is proportional to the projection of the relative velocity onto the inter-agent axis, v j v i , x j x i , with K 1 serving as the damping coefficient. When agents approach each other ( v j v i , x j x i < 0 ), the force is repulsive, decelerating the approach. When they separate ( v j v i , x j x i > 0 ), it becomes attractive, inhibiting excessive swarm dispersion. Thus, K 1 primarily functions to dissipate internal kinetic energy, suppress oscillations, and expedite convergence to a stable relative configuration.
  • Physical Derivation: The K 1 term originates from Rayleigh’s dissipation function R = 1 2 K 1 v j v i , x j x i 2 2 r i j 2 , representing the power dissipated due to relative motion along the inter-agent direction. The corresponding dissipative force, F diss = R / v i , yields precisely the K 1 term in Equation (5). This derivation confirms K 1 as a genuine physical damping coefficient, not merely an empirical parameter.
2. 
The K 2 Term: Conservative Binding/Spring Force
  • Physical Role: This term behaves as an ideal spring that regulates the inter-agent distance r i j = x j x i towards a predefined safety distance 2 R . Here, K 2 is the spring constant (stiffness). For r i j > 2 R , the force is attractive, maintaining formation cohesion. For r i j < 2 R , it becomes strongly repulsive, forming the core collision avoidance mechanism. Consequently, K 2 dictates the “hardness” of the safety distance enforcement. A higher K 2 increases sensitivity to spacing deviations, enhancing collision prevention at the potential cost of induced oscillations due to stronger forces.
  • Physical Derivation: The K 2 term is derived from the conservative potential U bind ( r i j ) = K 2 4 ( r i j 2 R ) 2 , which models a harmonic spring with equilibrium length 2 R . The resulting force, F bind = x i U bind = K 2 2 ( r i j 2 R ) x j x i r i j , matches the K 2 term in Equation (5), establishing K 2 as a physical spring constant.
Theoretical Interplay Between K 1 and K 2
The parameters K 1 and K 2 govern distinct yet interacting physical processes that collectively determine the system’s behavior. Their relationship is elucidated from an energy perspective:
  • Dynamic Role of K 1 : From the energy derivative E ˙ ( t ) in Theorem 1, the K 1 term contributes σ K 1 4 N i , j v ^ i v ^ j , x i x j 2 r i j 2 0 , explicitly demonstrating its dissipative nature. Thus, K 1 controls the rate of kinetic energy dissipation and, consequently, the convergence speed.
  • Static Role of K 2 : The K 2 term appears in the potential energy E pot = σ K 2 8 N i , j ( r i j 2 R ) 2 , which dictates the equilibrium configuration. Theorem 2 provides the group formation bound x ^ i x ^ j 2 R + 8 N E ( 0 ) / ( σ K 2 ) , showing that K 2 fundamentally limits the maximum inter-agent distance.
  • Coupled Dynamics: The interplay between the dissipative ( K 1 ) and conservative ( K 2 ) forces creates a second-order dynamic system for each agent pair. The effective damping ratio is proportional to K 1 / K 2 , theoretically explaining the observed performance trade-off: high K 1 accelerates convergence but may induce overshoot; high K 2 enforces strict spacing at the potential cost of slower convergence. This is a direct consequence of the coupled dissipative-conservative dynamics, not merely an empirical observation.
In summary, K 1 and K 2 govern the dynamic convergence behavior and the static geometric configuration of the swarm, respectively. Strategic tuning of this parameter pair enables a balanced trade-off among swift synchronization (governed by K 1 ), formation stability and collision safety (governed by K 2 ), and control energy consumption. This understanding forms the basis for the parameter optimization study in subsequent sections. By introducing these two physically interpretable forces, the abstract algebraic model is bridged with a mechanical framework more aligned with practical systems (e.g., multi-robot teams, UAV swarms), thereby providing an intuitive foundation for real-world control applications.
Connection to Real-World Systems: This physically grounded model has direct mappings to practical domains:
  • UAV Swarms: K 1 represents the gains for aerodynamic damping and velocity tracking, while K 2 models the controllers for collision avoidance and formation-keeping.
  • Robotic Teams: K 1 corresponds to the damping inherent in actuators, and K 2 to the impedance control parameters that ensure safe physical interaction.
  • Autonomous Vehicles: K 1 governs the damping in braking/acceleration response, whereas K 2 implements the spacing control logic in adaptive cruise control systems.
The explicit decomposition into dissipative ( K 1 ) and conservative ( K 2 ) components aligns with fundamental analytical mechanics principles, thereby enhancing the model’s physical interpretability and engineering relevance.
Define system center point:
x c = 1 N i = 1 N x i , v c = 1 N i = 1 N v i
Then the relative movement volume:
x ^ i = x i x c , v ^ i = v i v c
The relative motion dynamics become:
d x ^ i d t = v ^ i d v ^ i d t = λ N j = 1 N ψ ( x ^ j x ^ i ) Γ ( v ^ j v ^ i ) + σ N j = 1 N K 1 v ^ i v ^ j , x ^ i x ^ j 2 r i j 2 ( x ^ j x ^ i ) + K 2 ( r i j 2 R ) 2 r i j ( x ^ j x ^ i )
The flocking behaviour depends solely on the relative motions between agents, rather than on the absolute motion of the center of mass. Therefore, the system is analyzed within the center-of-mass reference frame. Consequently, the system dynamics are reduced to examining a system of relative movements.

3.2. Energy Function Definition and System Properties

3.2.1. Total Energy Definition

The total energy of the system is defined as
E ( t ) = E k ( t ) + E p ( t ) = 1 2 i = 1 N v ^ i ( t ) 2 + σ K 2 8 N i , j = 1 N ( r i j ( t ) 2 R ) 2 .
Lemma 2 (Local Existence and A Priori Estimates).
Given initial conditions v ^ i ( 0 ) < , x ^ i ( 0 ) < with r i j ( 0 ) = x ^ i ( 0 ) x ^ j ( 0 ) > 0 for all i j , and parameters λ > 0 , σ > 0 , K 1 > 0 , K 2 > 0 , system (8) possesses a unique solution on a maximal time interval [ 0 , T max ) with T max > 0 . Moreover, there exist constants M v , M x , T 0 > 0 , depending only on the initial data and parameters, such that for all t [ 0 , T 0 ] :
v ^ i ( t ) M v , x ^ i ( t ) M x , i = 1 , , N ,
where T 0 = min ( T max , 1 ) is a guaranteed time of existence with a priori bounds.
Proof. 
Step 1. Local existence and uniqueness. Define the state vector
z = ( x ^ 1 , , x ^ N , v ^ 1 , , v ^ N ) R 2 d N .
The dynamics (8) can be written as z ˙ = f ( z ) .
The function f is smooth on the open domain
Ω = { z R 2 d N : r i j = x ^ i x ^ j > 0 for all i j } ,
because all terms in (8) are continuously differentiable when the denominators r i j are nonzero. By assumption, the initial configuration satisfies z ( 0 ) Ω .
By the Picard–Lindelöf theorem, there exists a unique maximal solution z ( t ) defined on [ 0 , T max ) with T max > 0 .
Step 2. A priori estimates via standard ODE theory. We now establish a priori bounds that do not rely on the energy dissipation property. Let
V 0 = max i v ^ i ( 0 ) , X 0 = max i x ^ i ( 0 ) , D 0 = max i , j x ^ i ( 0 ) x ^ j ( 0 ) .
Define T 0 = min ( T max , 1 ) . Consider the solution on [ 0 , T 0 ] . We will use a continuation argument to obtain bounds.
Since r i j ( 0 ) > 0 and the solution is continuous, there exists T 1 ( 0 , T max ] such that
r i j ( t ) D 0 2 > 0 for all t [ 0 , T 1 ] and all i j .
This follows from the continuity of the solution and the fact that r i j ( 0 ) = D 0 > 0 .
Now, on the interval [ 0 , T 1 ] , we can bound the right-hand side of (8). Let
M = max { v ^ i ( t ) : i = 1 , , N , t [ 0 , T 1 ] }
be the maximum velocity magnitude on this interval (which exists by continuity).
From the structure of Equation (8), we bound each term:
  • The communication weight ψ ( r i j ) is bounded since ψ is continuous and r i j D 0 / 2 :
    | ψ ( r i j ) | ψ max = max r D 0 / 2 ψ ( r ) .
  • The nonlinear coupling term satisfies, by Assumption 1 and the continuity of Γ ,
    Γ ( v ^ j v ^ i ) C 2 ( 2 M ) γ for some C 2 > 0 .
  • The K 1 and K 2 terms are bounded because:
    K 1 v ^ j v ^ i , x ^ j x ^ i 2 r i j 2 ( x ^ j x ^ i ) K 1 2 · ( 2 M ) ( 2 X 0 + 2 M T 1 ) ( D 0 / 2 ) 2 · ( 2 X 0 + 2 M T 1 ) , K 2 ( r i j 2 R ) 2 r i j ( x ^ j x ^ i ) K 2 2 · 2 X 0 + 2 M T 1 + 2 R ( D 0 / 2 ) · ( 2 X 0 + 2 M T 1 ) .
Combining these bounds, there exists a constant L > 0 , depending on V 0 , X 0 , D 0 , and the parameters, such that
d v ^ i d t L for all i = 1 , , N and t [ 0 , T 1 ] .
Step 3. Deriving explicit bounds. From the velocity derivative bound, we have by integration:
v ^ i ( t ) v ^ i ( 0 ) + 0 t L d τ V 0 + L t V 0 + L for t [ 0 , T 1 ] .
For positions, integrating the velocity bound gives:
x ^ i ( t ) x ^ i ( 0 ) + 0 t v ^ i ( τ ) d τ X 0 + ( V 0 + L ) t X 0 + V 0 + L .
Set M v = V 0 + L and M x = X 0 + V 0 + L + 2 R (the additional 2 R accounts for the maximum possible relative displacement).
Step 4. Determining the guaranteed existence time. The bounds derived in Step 3 are valid on [ 0 , T 1 ] . Set T 0 = min ( T 1 , 1 ) . Then for all t [ 0 , T 0 ] , we have:
v ^ i ( t ) M v , x ^ i ( t ) M x , i = 1 , , N .
The constant T 0 > 0 is guaranteed because T 1 > 0 (by continuity of the solution and the condition r i j ( 0 ) > 0 ) and we take the minimum with 1 to ensure a concrete time.
Step 5. Consistency with the overall proof structure. This lemma establishes the local well-posedness of the system using only standard ODE theory. The existence of T 0 and the bounds M v , M x are derived independently of any energy considerations. The global analysis will be completed in subsequent theorems. □

3.2.2. Energy Dissipation Theorem

Theorem 1 (Energy Dissipation Property).
Consider the multi-agent system governed by equations (8) with parameters λ > 0 , σ > 0 , K 1 > 0 , and a communication weight function satisfying ψ ( r ) > 0 for all r ( 0 , ) . Under Assumption 1, on the maximal interval of existence [ 0 , T max ) where the solution exists, the total energy E ( t ) defined in (9) satisfies:
d d t E ( t ) 0 for all t [ 0 , T * ) ,
where T * = min T max , inf { t 0 : r i j ( t ) = 0 for some i j } is the first potential collision time, and the inequality holds strictly whenever velocities are not aligned.
Proof of Theorem 1.
Step 1. Setup and definition of the collision-free interval. By Lemma 2, system (8) admits a unique solution on a maximal time interval [ 0 , T max ) with T max > 0 .
Define the first potential collision time as
T * = min T max , inf { t 0 : r i j ( t ) = 0 for some i j } .
If no collision occurs, then T * = T max . By definition, on the interval [ 0 , T * ) , we have r i j ( t ) > 0 for all i j , ensuring all denominators in the dynamics are well-defined.
Step 2. Energy derivative computation on the collision-free interval. On [ 0 , T * ) , we compute the time derivative of the total energy E ( t ) . From the definition
E ( t ) = 1 2 i = 1 N v ^ i ( t ) 2 + σ K 2 8 N i , j = 1 N ( r i j ( t ) 2 R ) 2 ,
we differentiate each component.
For the kinetic energy part:
d d t 1 2 i = 1 N v ^ i 2 = i = 1 N v ^ i · d v ^ i d t = λ N i , j = 1 N ψ ( r i j ) v ^ i · Γ ( v ^ j v ^ i ) + σ 2 N i , j = 1 N K 1 r i j 2 v ^ j v ^ i , x ^ j x ^ i v ^ i , x ^ i x ^ j + K 2 ( r i j 2 R ) r i j v ^ i , x ^ i x ^ j .
For the potential energy part:
d d t σ K 2 8 N i , j = 1 N ( r i j 2 R ) 2 = σ K 2 4 N i , j = 1 N ( r i j 2 R ) x ^ j x ^ i , v ^ j v ^ i r i j .
Step 3. Symmetry manipulation and simplification. Applying index symmetry i j to the velocity coupling term:
λ N i , j ψ ( r i j ) v ^ i · Γ ( v ^ j v ^ i ) = λ 2 N i , j ψ ( r i j ) [ v ^ i · Γ ( v ^ j v ^ i ) + v ^ j · Γ ( v ^ i v ^ j ) ] = λ 2 N i , j ψ ( r i j ) ( v ^ j v ^ i ) · Γ ( v ^ j v ^ i ) .
By Assumption 1, we have ( v ^ j v ^ i ) · Γ ( v ^ j v ^ i ) C 1 v ^ j v ^ i 2 γ , hence
λ 2 N i , j ψ ( r i j ) ( v ^ j v ^ i ) · Γ ( v ^ j v ^ i ) λ C 1 2 N i , j ψ ( r i j ) v ^ j v ^ i 2 γ .
Combining all terms and simplifying, we obtain the fundamental inequality:
d E d t λ C 1 2 N i , j ψ ( r i j ) v ^ j v ^ i 2 γ σ K 1 4 N i , j v ^ j v ^ i , x ^ j x ^ i 2 r i j 2 .
Step 4. Sign analysis and conclusion. For all t [ 0 , T * ) , since r i j ( t ) > 0 , the right-hand side of (10) is well-defined. Both terms on the right-hand side are non-positive:
  • The first term is non-positive because λ , C 1 > 0 , ψ ( r i j ) > 0 , and v ^ j v ^ i 2 γ 0 .
  • The second term is non-positive as a sum of squares.
Therefore, for all t [ 0 , T * ) ,
d E d t 0 ,
with strict inequality whenever there exists at least one pair ( i , j ) with v ^ i ( t ) v ^ j ( t ) .
Step 5. Energy bound. Integrating the inequality from 0 to t for any t < T * yields
E ( t ) = E ( 0 ) + 0 t d E d τ d τ E ( 0 ) .
Thus, on the collision-free interval [ 0 , T * ) , the energy is non-increasing and bounded above by its initial value.
Step 6. Scope of the theorem. This theorem establishes the energy dissipation property on the interval [ 0 , T * ) where collisions are absent. Whether T * = T max (i.e., collisions never occur) is a separate question that will be addressed by Theorem 2. The current theorem provides the foundation for that analysis. □

3.3. Collision Avoidance Analysis

Theorem 2 (Collision Avoidance Condition).
Consider the multi-agent system governed by Equation (8) with maximal existence time T max > 0 as guaranteed by Lemma 2. If the initial energy E ( 0 ) satisfies
E ( 0 ) < σ K 2 R 2 2 N ,
then for all t [ 0 , T max ) and all i j , the inter-agent distance satisfies r i j ( t ) > 0 . Moreover, T max = , i.e., the solution exists globally in time.
Proof of Theorem 2.
Step 1. Setup and contradiction argument. Assume, for the sake of contradiction, that there exists a first collision time T c ( 0 , T max ) such that lim t T c r i j ( t ) = 0 for some pair ( i , j ) , with r i j ( t ) > 0 for all t [ 0 , T c ) and all i j .
Step 2. Energy dissipation on [ 0 , T c ) . On the interval [ 0 , T c ) , the conditions of Theorem 1 are satisfied (since r i j ( t ) > 0 for all t [ 0 , T c ) ). Hence,
d E d t 0 and E ( t ) E ( 0 ) for all t [ 0 , T c ) .
Step 3. Potential energy bound. From the definition of the potential energy component, we have
E p ( t ) = σ K 2 8 N i , j = 1 N ( r i j ( t ) 2 R ) 2 E ( t ) E ( 0 ) .
In particular, for the pair ( i , j ) presumed to collide as t T c ,
σ K 2 8 N ( r i j ( t ) 2 R ) 2 E ( 0 ) for all t [ 0 , T c ) .
Step 4. Distance bound derivation. From the above inequality, we obtain
( r i j ( t ) 2 R ) 2 8 N E ( 0 ) σ K 2 | r i j ( t ) 2 R | 8 N E ( 0 ) σ K 2 .
This implies the two-sided bound:
2 R 8 N E ( 0 ) σ K 2 r i j ( t ) 2 R + 8 N E ( 0 ) σ K 2 .
Step 5. Condition preventing collision. Condition (11) is equivalent to
8 N E ( 0 ) σ K 2 < 2 R .
Under this condition, the lower bound is strictly positive:
2 R 8 N E ( 0 ) σ K 2 > 0 .
Therefore, for all t [ 0 , T c ) ,
r i j ( t ) 2 R 8 N E ( 0 ) σ K 2 > 0 .
Step 6. Contradiction and conclusion. Taking the left-hand limit as t T c and using the continuity of r i j ( t ) , we have
r i j ( T c ) = lim t T c r i j ( t ) 2 R 8 N E ( 0 ) σ K 2 > 0 .
This contradicts the initial assumption that lim t T c r i j ( t ) = 0 . Hence, no such first collision time T c can exist; therefore, r i j ( t ) > 0 for all t [ 0 , T max ) and all distinct pairs i j .
Step 7. Global existence. Since collisions are rigorously excluded, the solution remains within the domain Ω = { z R 2 d N : r i j > 0 for all i j } where the right-hand side of (8) is smooth. By standard ODE continuation theory (see Lemma 2), the solution can be extended indefinitely, which proves global existence, i.e., T max = . □

3.4. Asymptotic Clustering Verification

Theorem 3 (Asymptotic Flocking).
Assume the initial energy E ( 0 ) is finite and satisfies condition (11), the communication weight function ψ : R + R + satisfies ψ ( r ) ψ 0 > 0 for all r 0 , and the parameters satisfy λ > 0 , σ > 0 , K 1 > 0 . Then the extended Cucker–Smale system achieves asymptotic flocking in the following sense:
1. 
Velocity alignment: The relative velocities converge to zero asymptotically:
lim t v ^ i ( t ) v ^ j ( t ) = 0 , 1 i , j N .
2. 
Group formation: The inter-agent distances remain uniformly bounded:
sup 0 t < x ^ i ( t ) x ^ j ( t ) 2 R + 8 N E ( 0 ) σ K 2 .
Proof of Theorem 3.
We prove the two parts separately.
Part 1: Proof of velocity alignment.
Step 1.1: Energy properties. By Theorems 1 and 2, under condition (11), the system has a global solution and the total energy E ( t ) satisfies:
  • E ( t ) is non-increasing for all t 0 ,
  • E ( t ) is bounded below by 0,
  • Therefore, lim t E ( t ) = E exists and is finite.
Step 1.2: Convergence of the energy integral. From the existence of the limit E , we have
0 E ˙ ( τ ) d τ = lim t 0 t E ˙ ( τ ) d τ = E E ( 0 ) < .
Thus, 0 E ˙ ( τ ) d τ converges absolutely.
Step 1.3: Uniform continuity of E ˙ ( t ) . From Theorem 1, the energy derivative satisfies
E ˙ ( t ) = λ C 1 2 N i , j ψ ( r i j ) v ^ j v ^ i 2 γ σ K 1 4 N i , j v ^ j v ^ i , x ^ j x ^ i 2 r i j 2 .
We verify that E ˙ ( t ) is uniformly continuous by showing E ¨ ( t ) is bounded. Differentiating E ˙ ( t ) yields expressions involving:
  • v ^ i ( t ) and their derivatives v ^ ˙ i ( t ) (accelerations)
  • x ^ i ( t ) and v ^ i ( t )
  • Terms with denominators r i j ( t )
From Theorem 2, we have the collision avoidance guarantee, which implies a uniform lower bound on inter-agent distances. Specifically, from the proof of Theorem 2, we have
r i j ( t ) 2 R 8 N E ( 0 ) σ K 2 = : δ > 0 for all t 0 ,
where the positivity δ > 0 follows from condition (11).
Furthermore, from Lemma 2 and the energy bound E ( t ) E ( 0 ) , the positions and velocities remain bounded. Consequently, the accelerations v ^ ˙ i ( t ) from Equation (8) are also bounded, as all terms in (8) involve bounded functions divided by r i j ( t ) δ > 0 .
Since E ˙ ( t ) is a rational combination of bounded functions with denominators bounded away from zero, its derivative E ¨ ( t ) is bounded. By the Mean Value Theorem, E ˙ ( t ) is Lipschitz continuous, hence uniformly continuous.
Step 1.4: Application of Barbalat’s Lemma. We apply Barbalat’s Lemma (Lemma 1) to f ( t ) = E ( t ) . The conditions are satisfied:
  • E ( t ) is bounded below (by 0)
  • E ˙ ( t ) is uniformly continuous (established above)
  • 0 E ˙ ( τ ) d τ converges (established in Step 1.2)
Therefore, by Barbalat’s Lemma,
lim t E ˙ ( t ) = 0 .
Step 1.5: Convergence to velocity alignment. Substituting the expression for E ˙ ( t ) , we have
lim t λ C 1 2 N i , j ψ ( r i j ) v ^ j v ^ i 2 γ + σ K 1 4 N i , j v ^ j v ^ i , x ^ j x ^ i 2 r i j 2 = 0 .
Since both terms are non-negative and λ C 1 > 0 , σ K 1 > 0 , it follows that
lim t i , j ψ ( r i j ) v ^ j v ^ i 2 γ = 0 .
By the assumption on the communication weight function, ψ ( r ) ψ 0 > 0 for all r 0 . Therefore,
ψ 0 i , j v ^ j v ^ i 2 γ i , j ψ ( r i j ) v ^ j v ^ i 2 γ 0 .
Since γ > 0.5 > 0 , we conclude that
lim t v ^ j ( t ) v ^ i ( t ) = 0 for all i , j .
This establishes velocity alignment.
Part 2: Proof of group formation.
The group formation bound follows directly from Theorem 2, which provides the two-sided bound
x ^ i ( t ) x ^ j ( t ) 2 R + 8 N E ( 0 ) σ K 2 for all t 0 .
Taking the supremum over all t 0 yields the stated result. □

4. Numerical Simulation and Parametric Analysis

  • Scope of Numerical Validation
The simulation results presented in this section were obtained under idealized conditions—perfect communication, noise-free measurements, and homogeneous agents—to cleanly validate the theoretical predictions. While these conditions are sufficient to demonstrate the fundamental capabilities of the proposed framework, practical implementation would require consideration of additional real-world factors, as discussed in Section 5.

4.1. Simulation Settings

The multi-agent system comprising 20 agents in 3D space was simulated in MATLAB R2021a. Initial velocities were randomly generated within the range [ 2 , 2 ] m / s , and initial positions were uniformly distributed within a cube of side length 5 m centered at the origin, i.e., [ 2.5 , 2.5 ] 3 m 3 . To prevent initial agent overlap, positions were resampled until the pairwise Euclidean distance between any two agents exceeded the safety threshold 2 R . Numerical integration was carried out using a fourth-order Runge–Kutta method with a fixed time step of Δ t = 0.1 s over a total simulation duration of T = 100 s . The communication weight function was chosen as ψ ( r i j ) = 1 / ( 1 + r i j 2 ) 0.4 , and the nonlinear velocity coupling function as Γ ( v ) = C 1 v 1.4 v . Key parameters used in the simulations are listed in Table 1.

4.2. Analysis of Swarm Behaviour Evolution

As illustrated in Figure 1, the system undergoes a transition from a state of disordered motion to one of ordered flocking. Initially, the agents’ positions and velocity vectors are randomly distributed. After 100 s of simulation, however, the agents converge into spatially coordinated formations with aligned velocity directions.
Figure 2 shows that the maximum velocity error, max i , j v ^ i ( t ) v ^ j ( t ) , decreases exponentially over time, reaching a value on the order of 10 3 m/s after approximately t = 10 s. This behaviour aligns with the velocity alignment condition, which requires lim t max i , j v ^ i ( t ) v ^ j ( t ) = 0 .
Similarly, Figure 3 indicates that the maximum inter-agent position difference stabilizes at approximately 6.5 m, which remains well below the theoretical upper bound of 55.29 m.
Analysis of the Conservative Theoretical Bound. The substantial discrepancy between the theoretical upper bound (55.29 m) and the observed maximum separation (approximately 6.5 m) is anticipated. This discrepancy underscores the conservative nature of the theoretical bound, 2 R + 8 N E ( 0 ) / ( σ K 2 ) , derived in Theorem 3. This bound corresponds to a worst-case scenario where the entire initial energy E ( 0 ) is converted into the potential energy of the spring-like binding forces. In practice, the system operates far more efficiently due to several factors:
  • Energy Partition: The initial energy E ( 0 ) is partitioned between kinetic and potential energy, with only a fraction contributing directly to inter-agent distances.
  • Continuous Dissipation: The K 1 damping term continuously dissipates kinetic energy, preventing the system from ever reaching the worst-case potential energy configuration.
  • Parameter Effects: With K 1 = 1.5 and K 2 = 0.8 , the system operates in a regime where damping is dominant, naturally promoting compact swarm formations.
Therefore, the observed separation of 6.5 m (approximately 13 times the safety distance 2 R = 1.0 m) represents a typical operating point rather than the extreme bound. This demonstrates that while the theoretical guarantee provides a rigorous safety certificate, the actual system performance under normal conditions is substantially better.

4.3. Collision Avoidance Verification

Figure 4 demonstrates that the minimum observed inter-agent distance consistently remains above the predefined safety threshold 2 R throughout the simulation. This observation validates both the collision avoidance guarantee established in Theorem 2 and the effectiveness of the binding term in enforcing the desired equilibrium spacing of 2 R in the extended model. Consequently, the system converges to a stable spatial configuration characterized by an inter-agent spacing on the order of 2 R .

4.4. Comparative Analysis with Classical Cucker–Smale Model

To quantitatively assess the performance advantages of the proposed extended model, we conduct a direct comparison with the classical Cucker–Smale formulation under identical initial conditions and parameters ( N = 20 , λ = 1.2 , σ = 2.5 , R = 0.5 ). The classical model employs linear velocity coupling, Γ ( v ) = v , and lacks binding forces, which corresponds to the limiting case K 1 = 0 and K 2 = 0 in Equation (5).
The comparative results, presented in Figure 5, highlight the key performance characteristics of the extended framework:
  • Velocity alignment performance: Both models achieve excellent velocity alignment, with final synchronization errors at the level of machine precision (< 10 5 m/s). This confirms that the core consensus mechanism remains effective under the extended nonlinear coupling, without degradation in alignment capability.
  • Formation compactness: The extended model reduces the maximum inter-agent distance to 6.48 m, compared to 7.23 m for the classical model—a 10.5% reduction in spatial dispersion. This improvement demonstrates that the K 2 binding forces provide enhanced regulation of the formation geometry while preserving swarm coherence.
  • Collision avoidance: In the tested scenario, both models successfully avoid collisions, with minimum distances of 1.050 m (extended) and 1.097 m (classical), both safely exceeding the 2 R = 1.0 m threshold. A critical distinction is that while collision avoidance in the classical model is observed empirically in this specific trial, the extended model provides provable collision avoidance guarantees under condition (11), as established in Theorem 2.
Quantitative comparison summary: Table 2 provides a comprehensive overview of the key performance metrics. The extended model demonstrates velocity alignment comparable to the classical model, along with improved formation compactness. Crucially, it also provides theoretical safety and energy dissipation guarantees, which are absent in the classical formulation.
In summary, the extended framework preserves the velocity alignment performance of the classical model while enhancing formation control through the K 2 binding mechanism. Most significantly, it introduces rigorous theoretical guarantees for safety and energy dissipation—a critical advancement for applications demanding provable collision avoidance.

4.5. Parameter Sensitivity Analysis

This subsection employs a comprehensive multi-metric framework to evaluate the extended Cucker–Smale model. Flocking performance is quantified through four key metrics: velocity synchronization error ( φ 1 ), group dispersion ( φ 2 ), collision count ( φ 3 ), and heading offset angle ( φ 4 ). These metrics are formally defined as:
φ 1 = 1 N ( N 1 ) i j v i v j 2 1 / 2 ( velocity synchronization error )
φ 2 = 1 N ( N 1 ) i j x i x j 2 1 / 2 ( group dispersion )
φ 3 = N crash ( collisions , x i x j < 2 R )
φ 4 = arg ( v c , x 0 x c ) ( heading offset angle )
  • Metric Interpretation:
  • Velocity synchronization error ( φ 1 ): Quantifies alignment quality, with φ 1 0 indicating perfect synchronization.
  • Group dispersion ( φ 2 ): Measures spatial compactness, where lower values correspond to tighter formations.
  • Collision count ( φ 3 ): Tallies the number of agent pairs violating the safety distance ( < 2 R ), averaged over all trials.
  • Heading offset angle ( φ 4 ): Measures directional deviation from the target orientation x 0 , with φ 4 0 indicating perfect alignment.
  • Experimental Protocol: The sensitivity analysis follows a systematic Monte Carlo approach with the following configuration:
  • Parameter ranges: K 2 [ 0.05 , 0.50 ] (increments of 0.05) and K 1 [ 1.25 , 3.05 ] (increments of 0.20).
  • Simulation settings: 2D planar region, 100   s duration, 0.1   s time step (fourth-order Runge–Kutta integration).
  • Initial conditions: Positions uniformly distributed, velocities in the range 10–20 m/s, initial headings ± 45 .
  • Statistical basis: 50 independent trials per parameter configuration.
  • Stability criterion: The system is considered stable when the mean velocity variance remains below 0.05 m 2 / s 2 for 10 consecutive time steps. A detailed sensitivity analysis of this threshold is provided below.

4.5.1. Sensitivity Analysis of the Stability Criterion

To address the potential arbitrariness in selecting the stability threshold ϵ = 0.05 m 2 / s 2 , a sensitivity analysis is conducted by varying ϵ from 0.01 to 0.10 m 2 / s 2 . Five representative K 2 values (0.05, 0.15, 0.25, 0.35, 0.50) are evaluated with K 1 fixed at 1.5. For each threshold, the convergence time is computed, and the relative ranking of K 2 values is compared across all thresholds.
The sensitivity of the stability criterion to parameter variations is analyzed in Figure 6 and Table 3. The Spearman rank correlation coefficient ρ = 1.000 indicates perfect consistency in the parameter ranking across all tested thresholds. Specifically, K 2 = 0.25 consistently yields the fastest convergence time regardless of the threshold value, while K 2 = 0.05 remains the slowest. This result demonstrates the insensitivity of optimal parameter selection to the specific choice of ϵ within the tested range [ 0.01 , 0.10 ] m 2 / s 2 , thereby validating the robustness of the adopted stability criterion.

4.5.2. Repulsion Gain ( K 2 ) Sensitivity

To investigate the effect of the repulsion gain K 2 , we compute steady-state performance metrics while sweeping K 2 from 0.05 to 0.50, with the dissipative gain fixed at K 1 = 1.5 .
As shown in Figure 7, increasing K 2 from 0.05 to 0.15 substantially improves all performance metrics: velocity error decreases by 73.6%, group dispersion reduces by 54.2%, and heading stability improves significantly. However, beyond K 2 = 0.15 , the system enters a saturation zone where marginal benefits diminish, indicating that moderate K 2 values (0.15–0.30) provide optimal performance.
Table 4 reveals robust collision avoidance across the tested K 2 range, with near-zero collision counts confirming the effectiveness of the K 2 mechanism. The single statistically significant collision at K 2 = 0.50 (0.1 collisions/trial) suggests that excessively high K 2 can induce oscillatory behaviour, demonstrating parameter sensitivity at the boundary of the operational range. Stability time shows limited sensitivity to K 2 , fluctuating between 50–59 s without clear monotonic trend.

4.5.3. Dissipation Gain ( K 1 ) Sensitivity

To analyze the effect of the dissipative gain K 1 , performance metrics are computed while sweeping K 1 from 1.25 to 3.05, with the repulsive gain fixed at K 2 = 0.8 .
Figure 8 illustrates a clear trend: increasing K 1 generally degrades flocking performance. Specifically:
  • Velocity synchronization error increases by 85% from K 1 = 1.25 to 3.05;
  • Group dispersion expands by 32%, indicating looser formations;
  • Heading accuracy deteriorates, suggesting reduced directional coordination.
Table 5 demonstrates that collision avoidance remains robust regardless of K 1 variations, with zero collisions recorded across the entire range. This confirms that the K 2 mechanism provides independent safety guarantees. Stability time shows moderate fluctuations (50–59 s) with no systematic trend, indicating limited influence of K 1 on convergence speed.

4.5.4. Interpretation and Implications

Key Findings:
  • Robustness of the stability threshold: The parameter ranking remains perfectly consistent (Spearman ρ = 1.000 ) across thresholds from 0.01 to 0.10 m 2 / s 2 , validating the selection of ϵ = 0.05 .
  • Optimal K 2 range: K 2 [ 0.15 , 0.30 ] provides the best trade-off between performance enhancement and collision safety. Beyond this range, diminishing returns are observed.
  • Performance trade-off with K 1 : Higher K 1 values degrade flocking metrics, suggesting that excessive damping disrupts the balance between velocity alignment and formation maintenance.
  • Independent collision safety: The K 2 mechanism ensures collision avoidance independent of K 1 variations, thereby providing robust safety guarantees.
  • Practical design guidelines: For implementation, designers should prioritize K 2 within the optimal range (0.15–0.30) and employ moderate K 1 values (1.5–2.0) to balance convergence speed with formation quality.
Limitations and Scope: These findings are specific to the tested parameter ranges and experimental conditions. While the trends are statistically significant, they should be interpreted within the context of the 2D simulation environment and idealized communication assumptions. Real-world implementations may require parameter adjustments to account for sensor noise, communication delays, and environmental disturbances.

4.6. Scalability Analysis

To address the practical concern of whether the proposed model remains effective in larger-scale systems, a scalability analysis was conducted. The system’s convergence behaviour was examined for three different agent sizes: N = 20 , 50, and 100 agents. All other parameters were held constant ( K 1 = 1.5 , K 2 = 0.8 , λ = 1.2 , σ = 2.5 , R = 0.5 ) to isolate the effect of population size.
Figure 9 presents the key results. Figure 9a shows the velocity variance over time for the three agent sizes on a logarithmic scale.
All cases exhibit exponential convergence, successfully reaching the predefined threshold ( 10 4 ). Notably, the convergence time decreases as the agent size increases. The N = 100 agent converged in approximately 5.34 s, which is about 44% faster than the N = 20 agent (9.49 s).
This counter-intuitive acceleration effect is visualized in Figure 9b, where convergence time is plotted against N. The trend indicates that denser agents, with their enhanced local connectivity, facilitate faster information propagation and consensus formation.
The final steady-state velocity variance showed a slight increase with N (from 8.49 × 10 10 for N = 20 to 2.56 × 10 7 for N = 100 ), which is attributed to minor numerical integration artifacts in the more complex, stiff ODE system. However, this variance remains negligible in practice, confirming that the model achieves high-fidelity velocity alignment even at scale. This analysis demonstrates that the proposed framework not only scales efficiently to at least 100 agents but also benefits from increased agent density through faster convergence, thereby addressing a key practical requirement for large-scale multi-agent deployments.

4.7. Parameter Optimization

To select optimal parameters, it is necessary to consider both the system’s energy consumption and the velocity alignment performance. The following formula defines the total energy consumption metric:
E ( K 1 , K 2 ) = 1 M m = 1 M t = 0 T i = 1 N a i ( m ) ( t ) 2 Δ t
The energy metric in (12) is defined through four key parameters: M denotes the number of Monte Carlo trials, T represents the total simulation steps, N is the agent population size, and a i ( m ) ( t ) denotes the acceleration vector of the i-th agent in the m-th trial at discrete time t. The time step duration is Δ t . The Energy Consumption Ratio (ECR) is defined as:
E C R = E ( K 1 , K 2 ) E base × 100 % with E base = E ( K 1 = 1.25 , K 2 = 0.5 )
The baseline configuration ( K 1 = 1.25, K 2 = 0.5) represents a moderate operational point identified from preliminary studies, providing a reasonable reference for energy comparison. System test data reveal the influence of repulsion gain parameter K 2 on system performance.
Corrected Interpretation: The performance metrics, as summarized in Table 6, reveal a clear trade-off between coordination accuracy and energy consumption. Velocity synchronization error decreases dramatically from 0.35 m/s at K 2 = 0.05 to 0.002 m/s at K 2 0.40 , representing a 175-fold improvement. Concurrently, the energy consumption ratio (ECR) increases monotonically from 1.5% to 103.6%. The optimal operating range K 2 [ 0.15 , 0.30 ] achieves velocity errors below 0.02 m/s while keeping ECR below 35%. Beyond K 2 = 0.40 , diminishing returns are observed: error reduction plateaus while energy consumption continues to rise, exceeding the baseline at K 2 = 0.50 . This analysis identifies the Pareto-optimal region and provides practical guidance for parameter selection.
As shown in Table 7, when the dissipation gain parameter K 1 is set to 1.85, the velocity synchronization error of the system is reliably maintained within the engineering accuracy range of 0.1 m/s. Concurrently, the energy consumption ratio is optimized to an equilibrium point of 67.1 % .

5. Conclusions and Prospects

This study presents an extended Cucker–Smale (C–S) model that integrates nonlinear velocity coupling with state-aware binding forces, thereby addressing collision avoidance and formation stability in multi-agent systems. Rigorous Lyapunov analysis provides theoretical guarantees for asymptotic flocking and collision safety under a verifiable initial energy condition. Numerical simulations validate the theory and quantify the roles of key control gains, leading to a practical parameter optimization strategy.
Key Findings:
  • The repulsion gain K 2 governs spatial cohesion. An optimal range K 2 [ 0.15 , 0.3 ] substantially improves velocity synchronization and reduces dispersion, with diminishing returns beyond K 2 > 0.15 .
  • High dissipative gain K 1 can destabilize flocking through overcorrection, degrading velocity coherence, spatial cohesion, and heading stability.
  • A Pareto-optimal parameter window ( K 2 [ 0.15 , 0.3 ] , K 1 = 1.85 ) is identified, effectively balancing alignment accuracy, collision avoidance, and energy efficiency.
The current analysis, while robust, operates under ideal assumptions. Practical limitations include perfect communication and sensor accuracy, which are often violated in real-world scenarios.
Future Work:
While the present study establishes a theoretical foundation under ideal conditions, several important extensions are warranted for real-world applications. Future research will focus on the following theoretical and practical challenges:
  • Robustness to Communication Constraints: The current model assumes perfect, instantaneous information exchange. A critical theoretical extension is to analyze the system’s stability and performance under communication delays and intermittent packet loss. This would involve reformulating the model using delayed differential equations or event-triggered control frameworks to derive new convergence conditions.
  • Sensitivity to Measurement Noise: The analysis assumes accurate state measurements. Investigating the model’s behaviour with sensor noise (e.g., Gaussian noise in position/velocity estimates) is essential. This would require a stochastic stability analysis to determine how noise statistics propagate through the nonlinear coupling and binding forces, potentially informing the design of robust observers.
  • Extension to Heterogeneous Dynamics: The framework currently considers homogeneous agents. Extending it to systems with heterogeneous agent dynamics (e.g., varying masses, actuator limits, or sensor capabilities) presents a significant theoretical challenge. This would involve developing heterogeneous Lyapunov functions or adaptive control schemes to ensure cohesive flocking despite individual differences.
  • Limitations and Scope: The numerical validation presented in this work focuses on verifying the theoretical predictions of the proposed model under idealized conditions. This approach allows for clear interpretation of results without confounding factors. While the scalability analysis (Section 4.4) demonstrates the model’s effectiveness with up to 100 agents, validation under more realistic conditions—including communication delays, measurement noise, and heterogeneous agent dynamics—represents important directions for future research as outlined in Section 5. The current study establishes the theoretical foundation and demonstrates fundamental capabilities; subsequent work will build upon this foundation to address implementation challenges in specific application domains.
  • Experimental Validation: Ultimately, implementing and testing the proposed algorithm on physical multi-robot platforms is necessary to validate its practical efficacy and identify unforeseen real-world constraints.
This work establishes a theoretical foundation for safe and efficient multi-agent coordination, with direct relevance to applications such as UAV formation control and autonomous vehicle platooning. The outlined research directions aim to translate these theoretical guarantees into reliable practical implementations.

Author Contributions

Conceptualization, Y.L. and Y.J.; methodology, Y.L.; software, Y.L.; validation, Y.L., Y.J. and W.F.; formal analysis, Y.L.; investigation, Y.L.; resources, Y.L.; data curation, Y.L.; writing—original draft preparation, Y.L.; writing—review and editing, Y.L., Y.J. and W.F.; visualization, Y.L.; supervision, Y.J. and W.F.; project administration, Y.J.; funding acquisition, Y.J. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China (Grant No. 11801221) and the Natural Science Foundation of Jiangsu Province (Grant No. BK20180586).

Institutional Review Board Statement

Not applicable. This study did not involve human participants or animal subjects.

Informed Consent Statement

Not applicable. This study did not involve human participants.

Data Availability Statement

The simulation data and code supporting the findings of this study are available from the corresponding author upon reasonable request. The data are not publicly available due to ongoing research extensions.

Acknowledgments

The authors would like to express sincere gratitude to the anonymous reviewers for their constructive comments and insightful suggestions, which have significantly improved the quality and clarity of this manuscript. During the preparation of this work, the authors used ChatGPT (OpenAI) for language translation and polishing. The authors have thoroughly reviewed and edited all AI-generated content and take full responsibility for the content of this publication.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
MASMulti-Agent Systems
UAVUnmanned Aerial Vehicle
C-SCucker–Smale
ECREnergy Consumption Ratio

References

  1. Berthold, P.; Helbig, A.J.; Mohr, G.; Querner, U. Rapid microevolution of migratory behaviour in a wild bird species. Nature 1992, 360, 668–670. [Google Scholar] [CrossRef]
  2. Partridge, B.L. The structure and function of fish schools. Sci. Am. 1982, 246, 114–123. [Google Scholar] [CrossRef] [PubMed]
  3. Dong, X.; Yu, B.; Shi, Z.; Zhong, Y. Time-varying formation control for unmanned aerial vehicles: Theories and applications. IEEE Trans. Control Syst. Technol. 2014, 23, 340–348. [Google Scholar] [CrossRef]
  4. Jadbabaie, A.; Lin, J.; Morse, A.S. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Autom. Control 2003, 48, 988–1001. [Google Scholar] [CrossRef]
  5. Abegaz, M.S.; Abishu, H.N.; Yacob, Y.H.; Ayall, T.A.; Erbad, A.; Guizani, M. Blockchain-based resource trading in multi-UAV-assisted industrial IoT networks: A multi-agent DRL approach. IEEE Trans. Netw. Serv. Manag. 2022, 20, 166–181. [Google Scholar] [CrossRef]
  6. Li, L.; Hu, J.; Tang, X.; Dong, Y. UAV Trajectory Planning and Resource Optimization for NOMA-VLC Systems via MAS-MARL. In Proceedings of the 2024 Asia Communications and Photonics Conference (ACP) and International Conference on Information Photonics and Optical Communications (IPOC); IEEE: Piscataway, NJ, USA, 2024; pp. 1–4. [Google Scholar]
  7. Lin, N.; Wang, Z.; Zhao, L. MAS-DDPG: Multi-Sensor Self-Adaptive Scheduling for UAV Path Planning in Network-Unavailable Environments. In Proceedings of the 2023 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom); IEEE: Piscataway, NJ, USA, 2023; pp. 1034–1041. [Google Scholar]
  8. Kada, B.; Khalid, M.; Shaikh, M.S. Distributed cooperative control of autonomous multi-agent UAV systems using smooth control. J. Syst. Eng. Electron. 2020, 31, 1297–1307. [Google Scholar] [CrossRef]
  9. Maldonado, D.; Cruz, E.; Torres, J.A.; Cruz, P.J.; Gamboa, S. Multi-agent Systems: A survey about its components, framework and workflow. IEEE Access 2024, 12, 80950–80975. [Google Scholar] [CrossRef]
  10. Jiang, H.; Cui, Z. Research on the Method and Its Improvement of MAS for Tourism E-commerce System. In Proceedings of the 2009 First International Workshop on Education Technology and Computer Science; IEEE: Piscataway, NJ, USA, 2009; Volume 1, pp. 59–61. [Google Scholar]
  11. Wang, C.; Zhang, Y.; Zhao, R.; Li, B.; Chen, J.; Xu, C. Application of WebGIS in distribution network dispatching management. In Proceedings of the 2021 6th International Conference on Smart Grid and Electrical Automation (ICSGEA); IEEE: Piscataway, NJ, USA, 2021; pp. 352–355. [Google Scholar]
  12. Esmaeili, A.; Ghorrati, Z.; Matson, E. Multi-agent cooperation using snow-drift evolutionary game model: Case study in foraging task. In Proceedings of the 2018 Second IEEE International Conference on Robotic Computing (IRC); IEEE: Piscataway, NJ, USA, 2018; pp. 308–312. [Google Scholar]
  13. Scheikl, P.M.; Gyenes, B.; Davitashvili, T.; Younis, R.; Schulze, A.; Müller-Stich, B.P.; Neumann, G.; Wagner, M.; Mathis-Ullrich, F. Cooperative assistance in robotic surgery through multi-agent reinforcement learning. In Proceedings of the 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS); IEEE: Piscataway, NJ, USA, 2021; pp. 1859–1864. [Google Scholar]
  14. Acha, S.; Yi, S. Cooperative Intelligent Control of Multi-Agent Systems (MAS) Through Communication, Trust, and Reliability. Control Syst. Optim. Lett. 2025, 3, 53–67. [Google Scholar] [CrossRef]
  15. Lee, R.K.; Kitts, C.A.; Neumann, M.A.; Mcdonald, R.T. Multiple UAV adaptive navigation for three-dimensional scalar fields. IEEE Access 2021, 9, 122626–122654. [Google Scholar] [CrossRef]
  16. Cucker, F.; Smale, S. Emergent behavior in flocks. IEEE Trans. Autom. Control 2007, 52, 852–862. [Google Scholar] [CrossRef]
  17. Shen, J. Cucker–Smale flocking under hierarchical leadership. SIAM J. Appl. Math. 2008, 68, 694–719. [Google Scholar] [CrossRef]
  18. Cucker, F.; Huepe, C. Flocking with informed agents. Math. Action 2008, 1, 1–25. [Google Scholar] [CrossRef]
  19. Park, J.; Kim, H.J.; Ha, S.-Y. Cucker-Smale flocking with inter-particle bonding forces. IEEE Trans. Autom. Control 2010, 55, 2617–2623. [Google Scholar] [CrossRef]
  20. Li, Z.; Xue, X. Cucker–Smale flocking under rooted leadership with fixed and switching topologies. SIAM J. Appl. Math. 2010, 70, 3156–3174. [Google Scholar] [CrossRef]
  21. Ahn, S.M.; Choi, H.; Ha, S.Y.; Lee, H. On collision-avoiding initial configurations to Cucker-Smale type flocking models. Commun. Math. Sci. 2012, 10, 625–643. [Google Scholar] [CrossRef]
  22. Yin, X.; Yue, D.; Chen, Z. Asymptotic behavior and collision avoidance in the Cucker–Smale model. IEEE Trans. Autom. Control 2019, 65, 3112–3119. [Google Scholar] [CrossRef]
  23. Kim, J.-H.; Park, J.-H. Complete characterization of flocking versus nonflocking of Cucker–Smale model with nonlinear velocity couplings. Chaos Solitons Fractals 2020, 134, 109714. [Google Scholar] [CrossRef]
  24. Zhao, R.; Liu, Q.; Zhang, H. Flocking and collision avoidance problem of a singular Cucker–Smale model with external perturbations. Phys. A Stat. Mech. Appl. 2022, 590, 126718. [Google Scholar] [CrossRef]
  25. Yin, X.; Yue, D.; Han, Q.-L. The Cucker–Smale Model With Nonlinear Velocity Couplings and Power-Law Attractive Potentials. IEEE Trans. Autom. Control 2022, 68, 5752–5758. [Google Scholar] [CrossRef]
  26. Shi, L.; Ma, Z.; Yan, S.; Zhou, Y. Cucker–Smale flocking behavior for multiagent networks with coopetition interactions and communication delays. IEEE Trans. Syst. Man Cybern. Syst. 2024, 24, 5824–5833. [Google Scholar] [CrossRef]
  27. Zhang, Z.; Yin, X.; Gao, Z. Non-flocking and flocking for the Cucker-Smale model with distributed time delays. J. Frankl. Inst. 2023, 360, 8788–8805. [Google Scholar] [CrossRef]
  28. Wu, C.; Dong, J.-G. Effects of Time Delay on Cucker–Smale Flocking Under Hierarchical Leadership. IEEE Trans. Autom. Control 2023, 69, 1812–1817. [Google Scholar] [CrossRef]
  29. Wang, X.; Xue, X. Flocking behavior of the Cucker–Smale model on infinite graphs with a central vertex group. J. Stat. Phys. 2024, 191, 47. [Google Scholar] [CrossRef]
  30. Sun, F.; Wang, R.; Zhu, W.; Li, Y. Flocking in nonlinear multi-agent systems with time-varying delay via event-triggered control. Appl. Math. Comput. 2019, 350, 66–77. [Google Scholar] [CrossRef]
Figure 1. Three-dimensionalflocking evolution of 20 agents, demonstrating the transition from disorder to order. (a) At t = 0 s, agent positions and velocities are randomized. (b) By t = 100 s, the agents achieve spatial coordination and velocity alignment.
Figure 1. Three-dimensionalflocking evolution of 20 agents, demonstrating the transition from disorder to order. (a) At t = 0 s, agent positions and velocities are randomized. (b) By t = 100 s, the agents achieve spatial coordination and velocity alignment.
Applsci 16 03933 g001
Figure 2. Exponential decay of the maximum velocity error over time.
Figure 2. Exponential decay of the maximum velocity error over time.
Applsci 16 03933 g002
Figure 3. Evolution and stabilization of the maximum inter-agent position difference.
Figure 3. Evolution and stabilization of the maximum inter-agent position difference.
Applsci 16 03933 g003
Figure 4. Verification of persistent collision avoidance: minimum inter-agent distance over time.
Figure 4. Verification of persistent collision avoidance: minimum inter-agent distance over time.
Applsci 16 03933 g004
Figure 5. Comparative analysis of the extended model versus the classical Cucker–Smale formulation. (a) Velocity convergence comparison: the extended model shows faster stabilization. (b) Spatial dispersion: the extended model maintains 10% tighter formation. (c) Inter-agent distances: both models maintain safety, with extended model providing theoretical guarantees.
Figure 5. Comparative analysis of the extended model versus the classical Cucker–Smale formulation. (a) Velocity convergence comparison: the extended model shows faster stabilization. (b) Spatial dispersion: the extended model maintains 10% tighter formation. (c) Inter-agent distances: both models maintain safety, with extended model providing theoretical guarantees.
Applsci 16 03933 g005
Figure 6. Sensitivity analysis of the stability criterion. (a) Convergence time as a function of the stability threshold for different K 2 values. (b) Parameter ranking heatmap demonstrating consistent ordering across all tested thresholds (Spearman ρ = 1.000 ).
Figure 6. Sensitivity analysis of the stability criterion. (a) Convergence time as a function of the stability threshold for different K 2 values. (b) Parameter ranking heatmap demonstrating consistent ordering across all tested thresholds (Spearman ρ = 1.000 ).
Applsci 16 03933 g006
Figure 7. System response to repulsion gain ( K 2 ) variation with fixed K 1 = 1.5 . (a) Velocity error decreases with increasing K 2 ; (b) Group dispersion shows optimal compactness at moderate K 2 ; (c) Heading stability improves with K 2 . Error bars represent ±1 standard deviation over 50 trials.
Figure 7. System response to repulsion gain ( K 2 ) variation with fixed K 1 = 1.5 . (a) Velocity error decreases with increasing K 2 ; (b) Group dispersion shows optimal compactness at moderate K 2 ; (c) Heading stability improves with K 2 . Error bars represent ±1 standard deviation over 50 trials.
Applsci 16 03933 g007
Figure 8. Effect of dissipative gain K 1 on flocking performance with fixed K 2 = 0.8 . (a) Velocity error increases with K 1 ; (b) Group dispersion expands as K 1 rises; (c) Heading accuracy deteriorates with higher K 1 . All metrics are averaged over 50 Monte Carlo trials.
Figure 8. Effect of dissipative gain K 1 on flocking performance with fixed K 2 = 0.8 . (a) Velocity error increases with K 1 ; (b) Group dispersion expands as K 1 rises; (c) Heading accuracy deteriorates with higher K 1 . All metrics are averaged over 50 Monte Carlo trials.
Applsci 16 03933 g008
Figure 9. Scalability analysis of the extended Cucker–Smale model. (a) Velocity variance decreases over time for agents of different sizes ( N = 20 , 50 , 100 ), all achieving consensus. (b) Convergence time decreases as agent size increases, demonstrating an acceleration effect in larger, denser groups.
Figure 9. Scalability analysis of the extended Cucker–Smale model. (a) Velocity variance decreases over time for agents of different sizes ( N = 20 , 50 , 100 ), all achieving consensus. (b) Convergence time decreases as agent size increases, demonstrating an acceleration effect in larger, denser groups.
Applsci 16 03933 g009
Table 1. Multi-agent flocking simulation parameters.
Table 1. Multi-agent flocking simulation parameters.
ParameterValue
Velocity coupling strength ( λ )1.2
Binding force strength ( σ )2.5
Dissipative force gain ( K 1 )1.5
Repulsive force gain ( K 2 )0.8
Expected spacing (R)0.5
Table 2. Quantitative comparison between the extended and classical Cucker–Smale models.
Table 2. Quantitative comparison between the extended and classical Cucker–Smale models.
MetricExtended ModelClassical C-SImprovement
Final velocity error (m/s)< 10 5 < 10 5 Comparable
Maximum dispersion (m)6.487.2310.5% reduction
Minimum distance (m)1.0501.097Both > 2 R = 1.0 m
Theoretical safety guaranteeYes (Theorem 2)No
Energy dissipation guaranteeYes (Theorem 1)No
Table 3. Convergence times (in seconds) for different K 2 values and stability thresholds.
Table 3. Convergence times (in seconds) for different K 2 values and stability thresholds.
K 2 0.010.020.030.040.050.060.070.080.090.10
0.05100.0100.0100.098.897.596.595.795.094.293.5
0.1575.272.370.769.768.968.267.767.266.866.4
0.2555.453.452.251.450.850.349.849.449.148.7
0.3561.660.059.158.558.057.557.156.856.556.2
0.5048.247.046.245.645.244.944.544.244.043.7
Table 4. Collision statistics and stabilization time under different K 2 values.
Table 4. Collision statistics and stabilization time under different K 2 values.
K 2 0.050.100.150.200.250.300.350.400.450.50
Collisions0000000000.1
Stability Time (s)57.051.150.753.951.353.258.753.952.554.2
Note: Values averaged over 50 Monte Carlo trials. Collision count 0.1 at K 2 = 0.50 corresponds to 0.1 collisions per trial (5 collisions in 50 trials).
Table 5. Collision statistics and stabilization time under different K 1 values.
Table 5. Collision statistics and stabilization time under different K 1 values.
K 1 1.251.451.651.852.052.252.452.652.853.05
Collisions0000000000
Stability Time (s)50.451.055.451.952.151.858.550.854.156.4
Note: Collision counts remain zero across all K 1 values, confirming the robustness of the K 2 -based collision avoidance mechanism.
Table 6. Performance metrics under variable repulsion gain parameters.
Table 6. Performance metrics under variable repulsion gain parameters.
K 2 0.050.100.150.200.250.300.350.400.450.50
Velocity Error0.350.070.020.0060.0030.0030.0030.0020.0020.002
ECR (%)1.54.69.517.825.434.948.667.282.0103.6
Note: This table has been corrected with the actual simulation data. The corrected ECR values show the expected monotonic increase with K 2 , with energy consumption exceeding the baseline (100%) at K 2 = 0.50 .
Table 7. Performance metrics under variable dissipation gain parameters.
Table 7. Performance metrics under variable dissipation gain parameters.
K 1 1.251.451.651.852.052.252.452.652.853.05
Velocity Error0.050.060.070.080.150.160.210.250.340.34
ECR (%)105.788.382.867.167.358.551.154.550.947.0
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Li, Y.; Jin, Y.; Fan, W. Flocking Dynamics of Multi-Agent Systems Based on an Extended Cucker–Smale Model with Nonlinear Coupling and Binding Forces. Appl. Sci. 2026, 16, 3933. https://doi.org/10.3390/app16083933

AMA Style

Li Y, Jin Y, Fan W. Flocking Dynamics of Multi-Agent Systems Based on an Extended Cucker–Smale Model with Nonlinear Coupling and Binding Forces. Applied Sciences. 2026; 16(8):3933. https://doi.org/10.3390/app16083933

Chicago/Turabian Style

Li, Yimeng, Yinghua Jin, and Wenping Fan. 2026. "Flocking Dynamics of Multi-Agent Systems Based on an Extended Cucker–Smale Model with Nonlinear Coupling and Binding Forces" Applied Sciences 16, no. 8: 3933. https://doi.org/10.3390/app16083933

APA Style

Li, Y., Jin, Y., & Fan, W. (2026). Flocking Dynamics of Multi-Agent Systems Based on an Extended Cucker–Smale Model with Nonlinear Coupling and Binding Forces. Applied Sciences, 16(8), 3933. https://doi.org/10.3390/app16083933

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop