{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:30:55Z","timestamp":1787322655456,"version":"build-2736575974"},"reference-count":21,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Control Optim."],"published-print":{"date-parts":[[2015,1]]},"abstract":"We introduce a novel dynamic vehicle routing problem termed the Radially Escaping Targets (RET) problem in which mobile targets appear uniformly randomly on a disk according to a stochastic process and move radially outward to escape the disk in a minimum amount of time. A single vehicle is assigned the task of intercepting the targets before they escape. We first obtain two fundamental upper bounds on the fraction of targets intercepted by the vehicle in the steady state---termed the capture fraction---for the RET problem. We then propose three policies to maximize the capture fraction for the RET problem, and identify parameter regimes in which they are suitable. All three policies are within a constant factor of the optimal in specific parameter regimes. For the asymptotic regime of low arrival rate, this factor is equal to one. For the asymptotic regime of high arrival rate, the factor is equal to 2.52 when the disk radius is greater than or equal to one. For moderate speed regimes, this factor is dependent on the target speed. We verify performance of the policies with numerical simulations.<\/jats:p>","DOI":"10.1137\/141000087","type":"journal-article","created":{"date-parts":[[2015,9,15]],"date-time":"2015-09-15T13:00:00Z","timestamp":1442322000000},"page":"2934-2954","source":"Crossref","is-referenced-by-count":9,"title":["Vehicle Routing Algorithms for Radially Escaping Targets"],"prefix":"10.1137","volume":"53","author":[{"given":"Pushkarini","family":"Agharkar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaunak D.","family":"Bopardikar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Bullo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"key":"atypb1","unstructured":"M. Abramowitz and I. A. Stegun,\n Handbook of Mathematical Functions: With Formulas, Graphs, and Mathematical Tables\n , Dover Publications, New York, 1972."},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9081-y"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"E. Bakolas and P. Tsiotras,\n Optimal pursuit of moving targets using dynamic Voronoi diagrams\n , in Proceedings of the 49th IEEE Conference on Decision and Control, 2010, pp. 7431-7436.","DOI":"10.1109\/CDC.2010.5717963"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.4.601"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2014.2344451"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2049278"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"L. Breiman,\n Probability\n , Classics Appl. Math. 7, SIAM, Philadelphia, 1992.","DOI":"10.1137\/1.9781611971286"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2011.2158181"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795295468"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-001-0081-4"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00075-0"},{"key":"atypb12","unstructured":"R. Isaacs,\n Differential Games\n , John Wiley & Sons, New York, 1965."},{"key":"atypb13","unstructured":"L. Kleinrock,\n Queueing Systems. Volume I: Theory\n , John Wiley & Sons, New York, 1975."},{"key":"atypb14","first-page":"145","author":"Lan Y.","year":"2012","journal-title":"Proceedings of the IEEE Conference on Decision and Control and the Chinese Control Conference"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.861685"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-008-0101-1"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.76.1188"},{"key":"atypb18","unstructured":"S. M. Ross,\n Applied Probability Models with Optimization Applications\n , Dover Publications, New York, 1992."},{"key":"atypb19","first-page":"8543","author":"Smith S. L.","year":"2009","journal-title":"Proceedings of the IEEE Conference on Decision and Control and the Chinese Control Conference"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1287\/moor.15.4.749"},{"key":"atypb21","doi-asserted-by":"crossref","unstructured":"P. Toth and D. Vigo, eds.\n The Vehicle Routing Problem\n , SIAM Monogr. Discrete Math. Appl. 9, SIAM, Philadelphia, 2002.","DOI":"10.1137\/1.9780898718515"}],"container-title":["SIAM Journal on Control and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/141000087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:24:03Z","timestamp":1787318643000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/141000087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/141000087"],"URL":"https:\/\/doi.org\/10.1137\/141000087","relation":{},"ISSN":["0363-0129","1095-7138"],"issn-type":[{"value":"0363-0129","type":"print"},{"value":"1095-7138","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}