Singleton in fencing control protocol

The problem of singleton formation in fencing control is similar to the local minimum point in Artificial Potential Fields (APFs). This problem is discussed in Chen 2019 automatica1 and our IJRNC work. The post is written to show some thinking when we investigate this problem.

1. Problem Description#

1.1 System Model#

  • NN autonomous vehicles (N≥3N \geq 3), each vehicle’s position is xi=[x1,i,x2,i]⊤∈R2x_i = [x_{1,i}, x_{2,i}]^\top \in \mathbb{R}^2
  • Kinematic model: x˙i(t)=ui(t)\dot{x}_i(t) = u_i(t), where uiu_i is the control input to be designed
  • Designated target position: xo∈R2x_o \in \mathbb{R}^2
  • co(x)\text{co}(x) denotes the convex hull of vehicle positions
  • Pxo(x)=min⁡s∈co(x)∥xo−s∥P_{x_o}(x) = \min_{s \in \text{co}(x)} \|x_o - s\|: distance from the target to the convex hull
  • area(x)\text{area}(x): area of the convex hull (Lebesgue measure)

1.2 Control Objectives#

Design the controller uiu_i such that the closed-loop system satisfies the following three properties:

No.PropertyMeaning
(P1)Target fencinglim⁡t→∞Pxo(x(t))=0\lim_{t \to \infty} P_{x_o}(x(t)) = 0, i.e., the target asymptotically enters the interior of the vehicles’ convex hull
(P2)Collision avoidance∥xi(t)−xj(t)∥>d, ∀t≥0, i≠j\|x_i(t) - x_j(t)\| > d,\ \forall t \geq 0,\ i \neq j, the inter-vehicle distance always exceeds the safety threshold dd
(P3)No singleton formationThe set S={x∣area(x)=0, ∥xi−xj∥>d}\mathcal{S} = \{x \mid \text{area}(x) = 0,\ \|x_i - x_j\| > d\} (all vehicles collinear) is not an invariant set

Note: (P1) has two implications: (a) there exists a desired trajectory x∗(t)x^*(t) such that the target lies within the convex hull of x∗(t)x^*(t) at all times; (b) the actual trajectory asymptotically converges to x∗(t)x^*(t).

1.3 Neighbor Definition#

The geographic neighbor set of vehicle ii:

Ni(t)={j∈N:j≠i∣∥xi(t)−xj(t)∥≤μ}\mathcal{N}_i(t) = \{j \in \mathbb{N} : j \neq i \mid \|x_i(t) - x_j(t)\| \leq \mu\}

where μ>d>0\mu > d > 0 is the sensing range. The neighbor relation is symmetric, so the underlying graph is undirected.


2. Control Algorithm#

2.1 Controller Structure (Equation 2)#

The control input uiou_i^o for each vehicle ii consists of three functional components:

uio=∑j∈Niα(∥xij∥)xij∥xij∥⏟repulsive term+∑j∈Niβ(xi,xj,xo)Rxij∥xij∥⏟rotation term+k(xo−xi)⏟attractive term u_i^o = \underbrace{\sum_{j \in \mathcal{N}_i} \alpha(\|x_{ij}\|) \frac{x_{ij}}{\|x_{ij}\|}}_{\text{repulsive term}} + \underbrace{\sum_{j \in \mathcal{N}_i} \beta(x_i, x_j, x_o) R \frac{x_{ij}}{\|x_{ij}\|}}_{\text{rotation term}} + \underbrace{k(x_o - x_i)}_{\text{attractive term}}

where xij=xi−xjx_{ij} = x_i - x_j, and RR is the 90∘90^\circ counterclockwise rotation matrix.

2.2 Detailed Description of Each Component#

(a) Attractive Component#

k(xo−xi),k>0k(x_o - x_i), \quad k > 0
  • Function: Drives each vehicle toward the target position
  • Parameter: kk is the attraction gain

(b) Repulsive Component#

∑j∈Niα(∥xij∥)xij∥xij∥\sum_{j \in \mathcal{N}_i} \alpha(\|x_{ij}\|) \frac{x_{ij}}{\|x_{ij}\|}
  • Function: Avoids collisions between adjacent vehicles
  • Properties of function α(s)\alpha(s):
    • Domain: (d,∞)→[0,∞)(d, \infty) \to [0, \infty), continuous
    • α(s)=0, ∀s∈[μ,∞)\alpha(s) = 0,\ \forall s \in [\mu, \infty) — no repulsive force beyond the sensing range
    • lim⁡s→d+α(s)=∞\lim_{s \to d^+} \alpha(s) = \infty — repulsive force increases sharply as distance approaches dd
  • Physical meaning: When two vehicles are closer than μ\mu, a repulsive force arises along the line connecting them, increasing as the distance decreases

(c) Rotation Component#

∑j∈Niβ(xi,xj,xo)Rxij∥xij∥\sum_{j \in \mathcal{N}_i} \beta(x_i, x_j, x_o) R \frac{x_{ij}}{\|x_{ij}\|}
  • Function: When vehicles and the target are nearly collinear, generates a lateral rotational force to break the singleton straight-line formation
  • Definition of β\beta:
β(xi,xj,xo)=ϵ⋅max⁡{0, δ−∠(xio,xjo)}\beta(x_i, x_j, x_o) = \epsilon \cdot \max\{0,\ \delta - \angle(x_{io}, x_{jo})\}

where:

  • ∠(xio,xjo)=arccos⁡(xio⋅xjo∥xio∥∥xjo∥)∈[0,π]\angle(x_{io}, x_{jo}) = \arccos\left(\frac{x_{io} \cdot x_{jo}}{\|x_{io}\|\|x_{jo}\|}\right) \in [0, \pi]: the angle subtended by vehicles ii and jj as viewed from the target

  • δ∈[0,π/2)\delta \in [0, \pi/2): angle threshold

  • ϵ>0\epsilon > 0: rotation strength

  • By convention, ∠(0,a)=∠(a,0)=π\angle(0, a) = \angle(a, 0) = \pi

  • Activation condition: Activates when ∠(xio,xjo)<δ\angle(x_{io}, x_{jo}) < \delta, i.e., when the angle between the two vehicles as seen from the target is very small (vehicles and target are nearly collinear)

  • Physical meaning: RR rotates the force direction by 90∘90^\circ, prompting the vehicle to “turn away” from the collinear configuration


3. Main Theoretical Results#

3.1 Theorem Statement (Theorem 2.1)#

For system (1) with control input ui=uiou_i = u_i^o (Equation 2), when N>3N > 3, the target fencing problem is solved in the sense of (P1), (P2), and (P3), provided that:

  • The vehicles are initially collision-free: ∥xi(0)−xj(0)∥>d, i≠j\|x_i(0) - x_j(0)\| > d,\ i \neq j

Furthermore, if the control input is subject to exponentially decaying perturbations ei(t)e_i(t) (satisfying lim⁡t→∞ei(t)=0\lim_{t \to \infty} e_i(t) = 0), i.e., ui=uio+eiu_i = u_i^o + e_i, the conclusion still holds.

3.2 Proof Sketch#

(P1) Proof of Target Fencing#

  1. The centroid of the vehicles xˉ=1N∑i∈Nxi\bar{x} = \frac{1}{N}\sum_{i \in \mathbb{N}} x_i satisfies:
xˉ˙=−kxˉ+kxo+eˉ\dot{\bar{x}} = -k\bar{x} + k x_o + \bar{e}

where eˉ=1N∑iei\bar{e} = \frac{1}{N}\sum_{i} e_i. The derivation exploits the symmetry of the neighbor relation (i∈Nj⇔j∈Nii \in \mathcal{N}_j \Leftrightarrow j \in \mathcal{N}_i), xij=−xjix_{ij} = -x_{ji}, and β(xi,xj,xo)=β(xj,xi,xo)\beta(x_i, x_j, x_o) = \beta(x_j, x_i, x_o).

  1. Since eˉ(t)→0\bar{e}(t) \to 0 exponentially, the linear system drives xˉ(t)→xo\bar{x}(t) \to x_o.

  2. The centroid always lies within the convex hull (xˉ∈co(x)\bar{x} \in \text{co}(x)), hence the target enters the convex hull: Pxo(x(t))→0P_{x_o}(x(t)) \to 0.

(P2) Proof of Collision Avoidance#

  1. Construct a Lyapunov potential function:
V(x)=12∑i∈N∑j∈Ni∫∥xij∥μα(s) ds+k2∑i∈N∥xi−xo∥2V(x) = \frac{1}{2}\sum_{i \in \mathbb{N}}\sum_{j \in \mathcal{N}_i} \int_{\|x_{ij}\|}^{\mu} \alpha(s)\,ds + \frac{k}{2}\sum_{i \in \mathbb{N}} \|x_i - x_o\|^2
  1. Compute its time derivative along the trajectory, yielding:
dVdt≤∑i∈N∥ψi∥2+∥ei∥22(*) \frac{dV}{dt} \leq \sum_{i \in \mathbb{N}} \frac{\|\psi_i\|^2 + \|e_i\|^2}{2} \tag{*}

where ∥ψi∥≤(N−1)ϵδ\|\psi_i\| \leq (N-1)\epsilon\delta.

  1. Integrating gives:
∫∥xij(t)∥μα(s) ds≤V(x(0))+C1t+C2<∞\int_{\|x_{ij}(t)\|}^{\mu} \alpha(s)\,ds \leq V(x(0)) + C_1 t + C_2 < \infty

Since ∫α(s) ds\int \alpha(s)\,ds diverges as s→d+s \to d^+, it follows that ∥xij(t)∥>d\|x_{ij}(t)\| > d holds at all times.

(P3) Proof of No Singleton Formation (Proof by Contradiction)#

  1. Assume S\mathcal{S} is an invariant set, i.e., the vehicles remain collinear with the target at all times.
  2. Due to collision avoidance, the ordering of vehicles along the line is invariant. Denote the two extreme vehicles as hˉ\bar{h} and ℓ\ell.
  3. From (P1), the centroid converges to the target, so there exists a time TT after which the target lies between the two extreme vehicles.
  4. Analyze the velocities of the extreme vehicles: when an extreme vehicle has no neighbors, its velocity relative to the other extreme vehicle exceeds k(N−1)d/2k(N-1)d/2, inevitably leading to collision — a contradiction.
  5. Further analyze the case where neighbors are present, leveraging the effect of the rotation term, ultimately deriving a contradiction — the vehicles cannot remain collinear indefinitely.

Note: When N=3N=3, the conclusion requires excluding special initial distributions (three vehicles initially collinear, one coincident with the target and the other two symmetric); the system works normally after a small perturbation.

4. Why singleton-free design matters#

In both papers above, the rationale for singleton-free design is discussed. Here we present some ideas from the perspective of extending the algorithm. We focus on singleton (collinear) formations in 2D space.

4.1 Target collision avoidance#

If target repulsion is added to the controller and singleton formation is prevented, the target can be fenced.
Without singleton exclusion, however, vehicles trapped in a collinear formation cannot fence the target.

Consider the case where vehicles are aligned in a straight line with the target at one end.
Using the modified controller

uio=∑j∈Ni∪{0}α(∥xij∥)xij∥xij∥⏟repulsive term+∑j∈Niβ(xi,xj,xo)Rxij∥xij∥⏟rotation term+k(xo−xi)⏟attractive term u_i^o = \underbrace{\sum_{j \in \mathcal{N}_i\cup \{0\}} \alpha(\|x_{ij}\|) \frac{x_{ij}}{\|x_{ij}\|}}_{\text{repulsive term}} + \underbrace{\sum_{j \in \mathcal{N}_i} \beta(x_i, x_j, x_o) R \frac{x_{ij}}{\|x_{ij}\|}}_{\text{rotation term}} + \underbrace{k(x_o - x_i)}_{\text{attractive term}}

the target will be fenced — provided the rotation term is active.

If the rotation term is disabled, the vehicles remain collinear and the formation is blocked by the target (the target stays at one end of the line, outside the convex hull).

4.2 Obstacle collision avoidance#

Consider the case where vehicles are aligned in a straight line with the target and one point obstacle. The obstacle and the target are positioned at one end of the line.
Using the modified controller

uio=∑j∈Ni∪{obstacle}α(∥xij∥)xij∥xij∥⏟repulsive term+∑j∈Niβ(xi,xj,xo)Rxij∥xij∥⏟rotation term+k(xo−xi)⏟attractive term u_i^o = \underbrace{\sum_{j \in \mathcal{N}_i\cup \{obstacle\}} \alpha(\|x_{ij}\|) \frac{x_{ij}}{\|x_{ij}\|}}_{\text{repulsive term}} + \underbrace{\sum_{j \in \mathcal{N}_i} \beta(x_i, x_j, x_o) R \frac{x_{ij}}{\|x_{ij}\|}}_{\text{rotation term}} + \underbrace{k(x_o - x_i)}_{\text{attractive term}}

the target will be fenced provided the rotation term is active. Otherwise, the formation will be blocked by the obstacle.

4.3 Drawback of the rotation term#

The paper proves that no collision occurs for t∈[0,∞)t \in [0, \infty), but asymptotic collision (t→∞t \to \infty) is not ruled out.
This is mainly due to the residual term ψi\psi_i in inequality (*), which is difficult to analyse precisely.

In practice, this drawback is not a serious concern, since t→∞t \to \infty may not exist in the physical world.


  1. Zhiyong Chen. A cooperative target-fencing protocol of multiple vehicles 10.1016/j.automatica.2019.05.034 ↩︎