Table of Contents
Fetching ...

Trajectory Encryption Cooperative Salvo Guidance

Lohitvel Gopikannan, Shashi Ranjan Kumar, Abhinav Sinha

TL;DR

This work addresses simultaneous interception by a heterogeneous swarm of unmanned vehicles applying different guidance laws, seeking to obfuscate collective intent and improve robustness. It introduces a trajectory encryption guidance framework where time-to-go values are driven to a common, prescribed-time $t_e$ using a distributed control law over a directed graph, regardless of initial engagement geometry. A Lyapunov-based analysis with $V= rac{oldsymbol{e}^ op oldsymbol{e}}{2}$ demonstrates prescribed-time stability and convergence of time-to-go errors, while enabling mid-engagement morphing between guidance principles to further complicate adversarial inference. Simulations across DP and TPN, including PIP variants and multiple topologies, show simultaneous interception and rich trajectory diversity, highlighting practical benefits for secure, resilient cooperative salvo guidance in contested environments.

Abstract

This paper introduces the concept of trajectory encryption in cooperative simultaneous target interception, wherein heterogeneity in guidance principles across a team of unmanned autonomous systems is leveraged as a strategic design feature. By employing a mix of heterogeneous time-to-go formulations leading to a cooperative guidance strategy, the swarm of vehicles is able to generate diverse trajectory families. This diversity expands the feasible solution space for simultaneous target interception, enhances robustness under disturbances, and enables flexible time-to-go adjustments without predictable detouring. From an adversarial perspective, heterogeneity obscures the collective interception intent by preventing straightforward prediction of swarm dynamics, effectively acting as an encryption layer in the trajectory domain. Simulations demonstrate that the swarm of heterogeneous vehicles is able to intercept a moving target simultaneously from a diverse set of initial engagement configurations.

Trajectory Encryption Cooperative Salvo Guidance

TL;DR

This work addresses simultaneous interception by a heterogeneous swarm of unmanned vehicles applying different guidance laws, seeking to obfuscate collective intent and improve robustness. It introduces a trajectory encryption guidance framework where time-to-go values are driven to a common, prescribed-time using a distributed control law over a directed graph, regardless of initial engagement geometry. A Lyapunov-based analysis with demonstrates prescribed-time stability and convergence of time-to-go errors, while enabling mid-engagement morphing between guidance principles to further complicate adversarial inference. Simulations across DP and TPN, including PIP variants and multiple topologies, show simultaneous interception and rich trajectory diversity, highlighting practical benefits for secure, resilient cooperative salvo guidance in contested environments.

Abstract

This paper introduces the concept of trajectory encryption in cooperative simultaneous target interception, wherein heterogeneity in guidance principles across a team of unmanned autonomous systems is leveraged as a strategic design feature. By employing a mix of heterogeneous time-to-go formulations leading to a cooperative guidance strategy, the swarm of vehicles is able to generate diverse trajectory families. This diversity expands the feasible solution space for simultaneous target interception, enhances robustness under disturbances, and enables flexible time-to-go adjustments without predictable detouring. From an adversarial perspective, heterogeneity obscures the collective interception intent by preventing straightforward prediction of swarm dynamics, effectively acting as an encryption layer in the trajectory domain. Simulations demonstrate that the swarm of heterogeneous vehicles is able to intercept a moving target simultaneously from a diverse set of initial engagement configurations.

Paper Structure

This paper contains 5 sections, 5 theorems, 29 equations, 6 figures.

Key Result

Lemma 1

Let $V(x(t), t) : \mathcal{D} \times \mathbb{R}_+ \to \mathbb{R}$ be a continuously differentiable function, where $\mathcal{D} \subset \mathbb{R}^n$ is a domain containing the origin. Assume there exists a constant $b > 0$ such that $V(0, t) = 0, \quad V(x(t), t) > 0, \;\; \forall \, x(t) \in \

Figures (6)

  • Figure 1: Cooperative heterogeneous multi-agent engagement.
  • Figure 2: Communication Topologies
  • Figure 3: Performance of the proposed method for a typical case.
  • Figure 4: Efficacy of the proposed method for new engagement geometry.
  • Figure 5: Efficacy of the proposed method under guidance morphing.
  • ...and 1 more figures

Theorems & Definitions (15)

  • Definition 1: hp2
  • Lemma 1: hp2
  • Lemma 2: hp3
  • Definition 2
  • Definition 3
  • Theorem 1
  • proof
  • Remark 1
  • Remark 2
  • Corollary 1
  • ...and 5 more