Consensus-Driven Deviated Pursuit for Guaranteed Simultaneous Interception of Moving Targets

This work proposes a cooperative strategy that employs deviated pursuit guidance to simultaneously intercept a moving (but not manoeuvring) target. As opposed to many existing cooperative guidance strategies which use estimates of time-to-go, based on proportional-navigation guidance, the proposed strategy uses an exact expression for time-to-go to ensure simultaneous interception. The guidance design considers nonlinear engagement kinematics, allowing the proposed strategy to remain effective over a large operating regime. Unlike existing strategies on simultaneous interception that achieve interception at the average value of their initial time-to-go estimates, this work provides flexibility in the choice of impact time. By judiciously choosing the edge weights of the communication network, a weighted consensus in time-to-go can be achieved. It has been shown that by allowing an edge weight to be negative, consensus in time-to-go can even be achieved for an impact time that lies outside the convex hull of the set of initial time-to-go values of the individual interceptors. The bounds on such negative weights have been analysed for some special graphs, using Nyquist criterion. Simulations are provided to vindicate the efficacy of the proposed strategy.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Aerospace and Electronic Systems
Published
2025-05-29
DOI
https://doi.org/10.1109/taes.2025.3575049
Citations
3
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
3.83
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Consensus-Driven Deviated Pursuit for Guaranteed Simultaneous Interception of Moving Targets

Dwaipayan Mukherjee, Shashi Ranjan Kumar, Abhinav Sinha
3 citations
IEEE Transactions on Aerospace and Electronic Systems
Robotic Path Planning Algorithms
3.83
article

Consensus-Driven Deviated Pursuit for Guaranteed Simultaneous Interception of Moving Targets

Dwaipayan Mukherjee, Shashi Ranjan Kumar, Abhinav Sinha
article en
3 citations

Abstract

This work proposes a cooperative strategy that employs deviated pursuit guidance to simultaneously intercept a moving (but not manoeuvring) target. As opposed to many existing cooperative guidance strategies which use estimates of time-to-go, based on proportional-navigation guidance, the proposed strategy uses an exact expression for time-to-go to ensure simultaneous interception. The guidance design considers nonlinear engagement kinematics, allowing the proposed strategy to remain effective over a large operating regime. Unlike existing strategies on simultaneous interception that achieve interception at the average value of their initial time-to-go estimates, this work provides flexibility in the choice of impact time. By judiciously choosing the edge weights of the communication network, a weighted consensus in time-to-go can be achieved. It has been shown that by allowing an edge weight to be negative, consensus in time-to-go can even be achieved for an impact time that lies outside the convex hull of the set of initial time-to-go values of the individual interceptors. The bounds on such negative weights have been analysed for some special graphs, using Nyquist criterion. Simulations are provided to vindicate the efficacy of the proposed strategy.

IEEE Transactions on Aerospace and Electronic SystemsVol. 61(5)
Indian Institute of Technology Bombay (IN), University of Cincinnati (US)
Openalex Percentile: Top 7%
Robotic Path Planning Algorithms
3.83
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.