Two missile guidance algorithms are proposed for the intercept and for the rendezvous of a maneuvering target, while avoiding a static obstacle by a specified avoidance distance. The guidance algorithms are derived as solutions of a linear quadratic optimal control problem and they are expressed as formulas reminiscent of the classical (augmented) proportional navigation type guidance laws. These formulas include correction terms that are responsible for obstacle avoidance and are parameterized by the minimum avoidance distance. Simulation results are used to demonstrate the performance of the two algorithms.
Linear Quadratic Optimal Control-Based Missile Guidance Law With Obstacle Avoidance
IEEE Transactions on Aerospace and Electronic Systems ; 55 , 1 ; 205-214
2019-02-01
2221644 byte
Article (Journal)
Electronic Resource
English
Linear Quadratic Optimal Guidance with Obstacle Avoidance
British Library Conference Proceedings | 2017
|Optimal Linear-Quadratic Missile Guidance Laws with Penalty on Command Variability
Online Contents | 2015
|