{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T01:50:39Z","timestamp":1787363439556,"version":"build-2736575974"},"reference-count":41,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Control Optim."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>We consider both discrete and continuous control problems constrained by a fixed budget of some resource, which may be renewed upon entering a preferred subset of the state space. In the discrete case, we consider deterministic shortest path problems on graphs with a full budget reset in all preferred nodes. In the continuous case, we derive augmented PDEs of optimal control, which are then solved numerically on the extended state space with a full\/instantaneous budget reset on the preferred subset. We introduce an iterative algorithm for solving these problems efficiently. The method's performance is demonstrated on a range of computational examples, including optimal path planning with constraints on prolonged visibility by a static enemy observer.<\/jats:p>","DOI":"10.1137\/110853182","type":"journal-article","created":{"date-parts":[[2015,3,19]],"date-time":"2015-03-19T11:23:12Z","timestamp":1426764192000},"page":"712-744","source":"Crossref","is-referenced-by-count":7,"title":["Optimal Control with Budget Constraints and Resets"],"prefix":"10.1137","volume":"53","author":[{"given":"R.","family":"Takei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"W.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Z.","family":"Clawson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Kirov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Vladimirsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,3,19]]},"reference":[{"key":"atypb1","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin,\n                      Network Flows. Theory, Algorithms, and Applications\n                      , Prentice Hall, Englewood Cliffs, NJ, 1993."},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-011-9512-4"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1137\/0328053"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"M. Bardi and I. Capuzzo Dolcetta,\n                      Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations\n                      , Birkha\u0308user Boston, Boston, 1997.","DOI":"10.1007\/978-0-8176-4755-1"},{"key":"atypb5","first-page":"89","author":"Bardi M.","year":"1994","journal-title":"Boston"},{"key":"atypb6","first-page":"105","author":"Bardi M.","year":"1999","journal-title":"Boston"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.38.8.716"},{"key":"atypb8","unstructured":"D. P. Bertsekas,\n                      Network Optimization: Continuous & Discrete Models\n                      , Athena Scientific, Boston, 1998."},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142997323521"},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"S. Cacace, E. Cristiani, and M. Falcone,\n                      A local ordered upwind method for Hamilton-Jacobi and Isaacs equations\n                      , in Proceedings of the 18th IFAC World Congress, 2011, pp. 6800-6805.","DOI":"10.3182\/20110828-6-IT-1002.02473"},{"key":"atypb11","first-page":"732","author":"Carlini E.","year":"2006","journal-title":"Berlin"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1137\/06067403X"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/10080909X"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1137\/130936531"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1983-0690039-8"},{"key":"atypb16","unstructured":"E. Cristiani and M. Falcone,\n                      A Fast Marching Method for Pursuit-Evasion Games\n                      , published electronically in \u201cCommunications to SIMAI Congress\u201d, SIMAI 2006 (Baia Samuele, Ragusa, Italy, 2006), Vol. 1, 2006."},{"key":"atypb17","doi-asserted-by":"crossref","unstructured":"R. Dial,\n                      Algorithm 360: Shortest path forest with topological ordering\n                      , Comm. ACM, 12 (1969), pp. 632-633.","DOI":"10.1145\/363269.363610"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"atypb19","first-page":"70","author":"Falcone M.","year":"1994","journal-title":"Berlin"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01442644"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050031"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2009.05.029"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1137\/0323018"},{"key":"atypb24","first-page":"109","author":"Hansen P.","year":"1980","journal-title":"New York"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140109"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2003.11.007"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.4208\/jcm.1003-m0015"},{"key":"atypb28","doi-asserted-by":"crossref","unstructured":"H. J. Kushner and P. G. Dupuis,\n                      Numerical Methods for Stochastic Control Problems in Continuous Time\n                      , Springer-Verlag, New York, 1992.","DOI":"10.1007\/978-1-4684-0441-8"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90077-8"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1016\/S0362-546X(98)00301-0"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.93.4.1591"},{"key":"atypb32","unstructured":"J. A. Sethian,\n                      Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision and Materials Sciences\n                      , Cambridge University Press, Cambridge, UK, 1996."},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347059"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.201222998"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142901392742"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6911(00)00026-8"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2004.02.015"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142901396533"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1109\/9.412624"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0321"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-04-01678-3"}],"container-title":["SIAM Journal on Control and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/110853182","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:01:23Z","timestamp":1787317283000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/110853182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/110853182"],"URL":"https:\/\/doi.org\/10.1137\/110853182","relation":{},"ISSN":["0363-0129","1095-7138"],"issn-type":[{"value":"0363-0129","type":"print"},{"value":"1095-7138","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}