Search-Trajectory Optimization: Part I, Formulation and Theory

作者: Joseph Foraker , Johannes O. Royset , Isaac Kaminer

DOI: 10.1007/S10957-015-0768-Y

关键词:

摘要: We formulate a search-trajectory optimization problem, with multiple searchers looking for targets in continuous time and space, as parameter-distributed optimal control model. The problem minimizes the probability that all of fail to detect any during planning horizon. construct discretization schemes prove they lead consistent approximations sense E. Polak.

参考文章(29)
Joseph Carl. Foraker, Optimal search for moving targets in continuous time and space using consistent approximations Monterey, California. Naval Postgraduate School. ,(2011)
William W. Hager, Runge-Kutta Discretizations of Optimal Control Problems Springer, Boston, MA. pp. 233- 244 ,(2000) , 10.1007/978-1-4615-5223-9_17
Joseph Foraker, Johannes O. Royset, Isaac Kaminer, Search-Trajectory Optimization: Part II, Algorithms and Computations Journal of Optimization Theory and Applications. ,vol. 169, pp. 550- 567 ,(2016) , 10.1007/S10957-015-0770-4
Johannes O. Royset, Hiroyuki Sato, Route optimization for multiple searchers Naval Research Logistics. ,vol. 57, pp. 701- 717 ,(2009) , 10.1002/NAV.20432
Marc Mangel, Search for a Randomly Moving Object Siam Journal on Applied Mathematics. ,vol. 40, pp. 327- 338 ,(1981) , 10.1137/0140028
Lawrence D. Stone, Henry R. Richardson, Search for Targets with Conditionally Deterministic Motion Siam Journal on Applied Mathematics. ,vol. 27, pp. 239- 255 ,(1974) , 10.1137/0127017