Abstract
We implement and solve a search-trajectory optimization problem originally formulated in our companion paper, with multiple searchers looking for multiple targets in continuous time and space. The problem minimizes the probability that all of the searchers fail to detect any of the targets during a planning horizon. We develop an implementable algorithm that converges to stationary points of the original infinite-dimensional problem. Numerical tests illustrate the approach in a naval scenario with up to three searchers protecting a capital ship from ten attackers in go-fast boats.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
