Abstract

The problem of vehicle-target assignment (VTA) to capture a team of evading targets using a swarm of pursuing vehicles is investigated in this article. The VTA problem is formulated as an integer linear programming (ILP), such that the time to intercept all the targets is minimized subject to a number of constraints. To obtain closed-form formulas for the time-to-go matrix in the framework of ILP optimization, a one-on-one pursuit-evasion problem based on the ideal proportional navigation (IPN) guidance law is investigated. By considering two different scenarios of non-maneuvering and maneuvering evaders, analytical closed-form solutions for the pursuit-evasion time-to-go as explicit functions of the position and velocity vectors of the pursuers and evaders are developed, and efficient evasion strategies based on IPN guidance scheme are presented. The efficacy of the theoretical results in estimating the elements of time-to-go matrix is demonstrated by solving the VTA problem in simulations.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.