A coverage-based guidance algorithm of multiple interceptors for uncertain targets

This paper addresses the cooperative guidance problem of multiple interceptors to capture the mobile targets. Due to the measurement noise and decoys, the location of the real target can only be described by a probability density function. A coverage-based guidance algorithm is developed to maximize...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 32nd Chinese Control Conference pp. 7341 - 7346
Main Authors Zhai, Chao, He, Fenghua, Hong, Yiguang
Format Conference Proceeding
LanguageEnglish
Published TCCT, CAA 01.07.2013
Subjects
Coverage Control
Density measurement
Equations
Guidance
Joints
Mathematical model
Multiple Interceptors
Probability density function
Time measurement
Uncertainty
Vehicles
Online AccessGet full text

Cover

More Information
Summary:This paper addresses the cooperative guidance problem of multiple interceptors to capture the mobile targets. Due to the measurement noise and decoys, the location of the real target can only be described by a probability density function. A coverage-based guidance algorithm is developed to maximize the probability of interception. Moreover, the lower bound of interception probability is given, which goes up with the increase of the number of interceptors. Finally, the numerical example illustrates the effectiveness of the proposed algorithm.
ISSN:2161-2927