We address optimal placement of vehicles with simple motion, to intercept a mobile target that arrives stochastically on a line segment. The optimality of vehicle placement is measured through a cost function associated with intercepting the target. With a single vehicle, we assume that the target either moves with fixed speed and in a fixed direction or moves to maximize the vertical height or intercept time. We show that each of the corresponding cost functions is convex, has smooth gradient and has a unique minimizing location, and so the optimal vehicle placement is obtained by any standard gradient-based optimization technique. With multiple vehicles, we assume that the target moves with fixed speed and in fixed direction. We present a discrete time partitioning and gradient-based algorithm, and characterize conditions under which the algorithm asymptotically leads the vehicles to a set of critical configurations of the cost function.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Optimal Intercept of Maneuvering Targets

    R. E. Dickson | NTIS | 1969


    Impact Angle Control Guidance to Intercept Moving Targets by Virtual Target Technique

    Libing Hou / Jihong Zhu / Minchi Kuang et al. | DOAJ | 2021

    Freier Zugriff


    Optimal Effort Intercept against Two Maneuvering Targets

    Weiss, Martin / Shima, Tal | British Library Conference Proceedings | 2018


    Output Feedback Control and Sensor Placement for a Hypersonic Vehicle Model (Preprint)

    P. Jankovsky / D. O. Sigthorsson / A. Serrani et al. | NTIS | 2006