{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:41:59Z","timestamp":1763664119201,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T00:00:00Z","timestamp":1571616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T00:00:00Z","timestamp":1571616000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1738010"],"award-info":[{"award-number":["1738010"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Dyn Games Appl"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s13235-019-00327-x","type":"journal-article","created":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T12:38:31Z","timestamp":1571661511000},"page":"391-416","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Evasive Path Planning Under Surveillance Uncertainty"],"prefix":"10.1007","volume":"10","author":[{"given":"Marc Aur\u00e8le","family":"Gilles","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4284-4546","authenticated-orcid":false,"given":"Alexander","family":"Vladimirsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,21]]},"reference":[{"key":"327_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10915-011-9512-4","volume":"51","author":"K Alton","year":"2012","unstructured":"Alton K, Mitchell IM (2012) An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton\u2013Jacobi equations. J Sci Comput 51:313\u2013348","journal-title":"J Sci Comput"},{"key":"327_CR2","volume-title":"Optimal control and viscosity solutions of Hamilton\u2013Jacobi-Bellman equations","author":"M Bardi","year":"2008","unstructured":"Bardi M, Capuzzo-Dolcetta I (2008) Optimal control and viscosity solutions of Hamilton\u2013Jacobi-Bellman equations. Springer, Berlin"},{"key":"327_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-order methods in optimization","author":"A Beck","year":"2017","unstructured":"Beck A (2017) First-order methods in optimization, vol 25. SIAM, Philadelphia"},{"key":"327_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0167-6377(84)90010-5","volume":"3","author":"P Brucker","year":"1984","unstructured":"Brucker P (1984) An $$O(n)$$ algorithm for quadratic knapsack problems. Oper Res Lett 3:163\u2013166","journal-title":"Oper Res Lett"},{"key":"327_CR5","volume-title":"Probabilistic theory of mean field games with applications I\u2013II","author":"R Carmona","year":"2017","unstructured":"Carmona R, Delarue F (2017) Probabilistic theory of mean field games with applications I\u2013II. Springer, Berlin"},{"key":"327_CR6","unstructured":"Cartee E, Lai L, Song Q, Vladimirsky A (2019) Time-dependent surveillance-evasion games, preprint \narXiv:1903.01332"},{"key":"327_CR7","doi-asserted-by":"publisher","first-page":"A547","DOI":"10.1137\/10080909X","volume":"34","author":"A Chacon","year":"2012","unstructured":"Chacon A, Vladimirsky A (2012) Fast two-scale methods for Eikonal equations. SIAM J Sci Comput 34:A547\u2013A578","journal-title":"SIAM J Sci Comput"},{"key":"327_CR8","doi-asserted-by":"publisher","first-page":"A156","DOI":"10.1137\/12088197X","volume":"37","author":"A Chacon","year":"2015","unstructured":"Chacon A, Vladimirsky A (2015) A parallel two-scale method for Eikonal equations. SIAM J Sci Comput 37:A156\u2013A180","journal-title":"SIAM J Sci Comput"},{"key":"327_CR9","doi-asserted-by":"publisher","first-page":"A2478","DOI":"10.1137\/130936531","volume":"36","author":"Z Clawson","year":"2014","unstructured":"Clawson Z, Chacon A, Vladimirsky A (2014) Causal domain restriction for Eikonal equations. SIAM J Sci Comput 36:A2478\u2013A2505","journal-title":"SIAM J Sci Comput"},{"key":"327_CR10","unstructured":"Clawson Z, Ding X, Englot B, Frewen TA, Sisson WM, Vladimirsky A (2015) A bi-criteria path planning algorithm for robotics applications, preprint \narXiv:1511.01166"},{"key":"327_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0002-9947-1983-0690039-8","volume":"277","author":"MG Crandall","year":"1983","unstructured":"Crandall MG, Lions P-L (1983) Viscosity solutions of Hamilton\u2013Jacobi equations. Trans Am Math Soc 277:1\u201342","journal-title":"Trans Am Math Soc"},{"key":"327_CR12","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01197559","volume":"14","author":"I Das","year":"1997","unstructured":"Das I, Dennis JE (1997) A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems. Struct Optim 14:63\u201369","journal-title":"Struct Optim"},{"key":"327_CR13","doi-asserted-by":"crossref","unstructured":"Desilles A, Zidani H (2018) Pareto front characterization for multi-objective optimal control problems using Hamilton-Jacobi approach, preprint","DOI":"10.1137\/18M1176993"},{"key":"327_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269\u2013271","journal-title":"Numer Math"},{"key":"327_CR15","unstructured":"Dobbie J (1966) Solution of some surveillance-evasion problems by the methods of differential games. In: Proceedings of the 4th international conference on operational research. MIT, Wiley, New York"},{"key":"327_CR16","volume-title":"Semi-Lagrangian approximation schemes for linear and Hamilton\u2013Jacobi equations","author":"M Falcone","year":"2014","unstructured":"Falcone M, Ferretti R (2014) Semi-Lagrangian approximation schemes for linear and Hamilton\u2013Jacobi equations, vol 133. SIAM, Philadelphia"},{"key":"327_CR17","first-page":"205","volume-title":"Paris\u2013Princeton lectures on mathematical finance","author":"O Gu\u00e9ant","year":"2010","unstructured":"Gu\u00e9ant O, Lasry J-M, Lions P-L (2010) Mean field games and applications. Paris\u2013Princeton lectures on mathematical finance. Springer, Berlin, pp 205\u2013266"},{"key":"327_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1051\/cocv\/2013056","volume":"20","author":"A Guigue","year":"2014","unstructured":"Guigue A (2014) Approximation of the pareto optimal set for multiobjective optimal control problems using viability kernels. ESAIM COCV 20:95\u2013115","journal-title":"ESAIM COCV"},{"key":"327_CR19","first-page":"517","volume":"1","author":"A Kumar","year":"2010","unstructured":"Kumar A, Vladimirsky A (2010) An efficient method for multiobjective optimal control and optimal control subject to integral constraints. J Comput Math 1:517\u2013551","journal-title":"J Comput Math"},{"key":"327_CR20","unstructured":"Lewin J (1973) Decoy in pursuit-evasion games. PhD thesis, Department of Aeronautics and Astronautics, Stanford University"},{"key":"327_CR21","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01262940","volume":"16","author":"J Lewin","year":"1975","unstructured":"Lewin J, Breakwell JV (1975) The surveillance-evasion game of degree. J Optim Theory Appl 16:339\u2013353","journal-title":"J Optim Theory Appl"},{"key":"327_CR22","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00933329","volume":"27","author":"J Lewin","year":"1979","unstructured":"Lewin J, Olsder GJ (1979) Conic surveillance evasion. J Optim Theory Appl 27:107\u2013125","journal-title":"J Optim Theory Appl"},{"key":"327_CR23","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"RT Marler","year":"2004","unstructured":"Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Struct Multidiscip Optim 26:369\u2013395","journal-title":"Struct Multidiscip Optim"},{"key":"327_CR24","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s00211-013-0571-3","volume":"126","author":"J-M Mirebeau","year":"2014","unstructured":"Mirebeau J-M (2014) Efficient fast marching with Finsler metrics. Numer Math 126:515\u2013557","journal-title":"Numer Math"},{"key":"327_CR25","unstructured":"Mitchell IM, Sastry S (2003) Continuous path planning with multiple constraints. In: 2003 42nd IEEE conference on decision and control, vol\u00a05, pp\u00a05502\u20135507"},{"key":"327_CR26","volume-title":"A course in game theory","author":"MJ Osborne","year":"1994","unstructured":"Osborne MJ, Rubinstein A (1994) A course in game theory. MIT press, Cambridge"},{"key":"327_CR27","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1007\/s10915-019-00905-6","volume":"79","author":"D Qi","year":"2019","unstructured":"Qi D, Vladimirsky A (2019) Corner cases, singularities, and dynamic factoring. J Sci Comput 79:1456\u20131476","journal-title":"J Sci Comput"},{"key":"327_CR28","first-page":"735","volume":"2","author":"T Raghavan","year":"1994","unstructured":"Raghavan T (1994) Zero-sum two-person games. Handb Game Theory Econ Appl 2:735\u2013768","journal-title":"Handb Game Theory Econ Appl"},{"key":"327_CR29","doi-asserted-by":"crossref","unstructured":"Sethian JA (1996) A fast marching level set method for monotonically advancing fronts. In: Proceedings of the National Academy of Sciences, vol\u00a093, pp\u00a01591\u20131595","DOI":"10.1073\/pnas.93.4.1591"},{"key":"327_CR30","volume-title":"Level set methods and fast marching methods: evolving interfaces in computational geometry, fluid mechanics, computer vision, and materials science","author":"JA Sethian","year":"1999","unstructured":"Sethian JA (1999) Level set methods and fast marching methods: evolving interfaces in computational geometry, fluid mechanics, computer vision, and materials science, vol 3. Cambridge University Press, Cambridge"},{"key":"327_CR31","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1137\/S0036142901392742","volume":"41","author":"JA Sethian","year":"2003","unstructured":"Sethian JA, Vladimirsky A (2003) Ordered upwind methods for static Hamilton\u2013Jacobi equations: theory and algorithms. SIAM J Numer Anal 41:325\u2013363","journal-title":"SIAM J Numer Anal"},{"key":"327_CR32","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1142\/9789812709066_0002","volume-title":"Mathematics and computation in imaging science and information processing","author":"C-W Shu","year":"2007","unstructured":"Shu C-W (2007) High order numerical methods for time dependent Hamilton\u2013Jacobi equations. Mathematics and computation in imaging science and information processing. World Scientific, Singapore, pp 47\u201391"},{"key":"327_CR33","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1137\/0324032","volume":"24","author":"H Soner","year":"1986","unstructured":"Soner H (1986) Optimal control with state-space constraint. I SIAM J Control Optim 24:552\u2013561","journal-title":"I SIAM J Control Optim"},{"key":"327_CR34","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1137\/110853182","volume":"53","author":"R Takei","year":"2015","unstructured":"Takei R, Chen W, Clawson Z, Kirov S, Vladimirsky A (2015) Optimal control with budget constraints and resets. SIAM J Control Optim 53:712\u2013744","journal-title":"SIAM J Control Optim"},{"key":"327_CR35","volume-title":"Semi-infinite linear programs and semi-infinite matrix games","author":"S Tijs","year":"1976","unstructured":"Tijs S (1976) Semi-infinite linear programs and semi-infinite matrix games. Katholieke Universiteit Nijmegen, Mathematisch Instituut, Nijmegen"},{"key":"327_CR36","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S0036142901396533","volume":"41","author":"Y-HR Tsai","year":"2003","unstructured":"Tsai Y-HR, Cheng L-T, Osher S, Zhao H-K (2003) Fast sweeping algorithms for a class of Hamilton\u2013Jacobi equations. SIAM J Numer Anal 41:673\u2013694","journal-title":"SIAM J Numer Anal"},{"key":"327_CR37","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1109\/9.412624","volume":"40","author":"JN Tsitsiklis","year":"1995","unstructured":"Tsitsiklis JN (1995) Efficient algorithms for globally optimal trajectories. IEEE Trans Autom Control 40:1528\u20131538","journal-title":"IEEE Trans Autom Control"},{"key":"327_CR38","unstructured":"Wang W, Carreira-Perpin\u00e1n MA (2013) Projection onto the probability simplex: an efficient algorithm with a simple proof, and an application, arXiv preprint \narXiv:1309.1541"},{"key":"327_CR39","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1090\/S0025-5718-04-01678-3","volume":"74","author":"H Zhao","year":"2005","unstructured":"Zhao H (2005) A fast sweeping method for Eikonal equations. Math Comput 74:603\u2013627","journal-title":"Math Comput"}],"container-title":["Dynamic Games and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-019-00327-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13235-019-00327-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-019-00327-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T23:08:02Z","timestamp":1603148882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13235-019-00327-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,21]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["327"],"URL":"https:\/\/doi.org\/10.1007\/s13235-019-00327-x","relation":{},"ISSN":["2153-0785","2153-0793"],"issn-type":[{"type":"print","value":"2153-0785"},{"type":"electronic","value":"2153-0793"}],"subject":[],"published":{"date-parts":[[2019,10,21]]},"assertion":[{"value":"21 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}