Computing the Minimum-Time Interception of a Moving Target

Maksim Buzikov ()
Additional contact information
Maksim Buzikov: V.A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences

Journal of Optimization Theory and Applications, 2024, vol. 202, issue 2, No 18, 975-995

Abstract: Abstract In this study, we propose an algorithmic framework for solving a class of optimal control problems. This class is associated with the minimum-time interception of moving target problems, where a plant with a given state equation must approach a moving target whose trajectory is known a priori. Our framework employs an analytical description of the distance from an arbitrary point to the reachable set of the plant. The proposed algorithm is always convergent and cannot be improved without losing the guarantee of its convergence to the correct solution for arbitrary Lipschitz continuous trajectories of the moving target. In practice, it is difficult to obtain an analytical description of the distance to the reachable set for the sophisticated state equation of the plant. Nevertheless, it was shown that the distance can be obtained for some widely used models, such as the Dubins car, in an explicit form. Finally, we illustrate the generality and effectiveness of the proposed framework for simple motions and the Dubins model.

Keywords: Optimal control; Moving target; Reachable set; Lipschitz functions; Markov–Dubins path; 49M15; 49J15; 65H05 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-024-02487-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:202:y:2024:i:2:d:10.1007_s10957-024-02487-2

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-024-02487-2

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().