We formulate a search-trajectory optimization problem, with multiple searchers looking for multiple targets in continuous time and space, as a parameterdistributed optimal control model. The problem minimizes the probability that all of the searchers fail to detect any of the targets during a planning horizon. We construct discretization schemes and prove that they lead to consistent approximations in the sense of E. Polak.
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 infinitedimensional 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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.