{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T16:41:07Z","timestamp":1745167267266,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/cdc.2003.1272513","type":"proceedings-article","created":{"date-parts":[[2004,6,21]],"date-time":"2004-06-21T17:52:40Z","timestamp":1087840360000},"page":"5502-5507","source":"Crossref","is-referenced-by-count":22,"title":["Continuous path planning with multiple constraints"],"prefix":"10.1109","author":[{"given":"I.M.","family":"Mitchell","sequence":"first","affiliation":[]},{"given":"S.","family":"Sastry","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4755-1"},{"key":"17","article-title":"Fast sweeping method for Eikonal equations I: Distance function","author":"zhao","year":"2002","journal-title":"Tech Rep"},{"journal-title":"Level Set Methods and Fast Marching Methods","year":"1999","author":"sethian","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"16","article-title":"Numerical solution of dynamic programming equations","author":"falcone","year":"1997","journal-title":"Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.2307\/1999247"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2003.1272513"},{"key":"11","first-page":"7","article-title":"Algorithms for routing with multiple constraints","author":"puri","year":"2002","journal-title":"AIPS 2002 Workshop on Planning and Scheduling Using Multiple Criteria"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1190\/1.1887581"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1998.6090"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.93.4.1591"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/9.412624"},{"key":"10","first-page":"743","article-title":"A*prune: An algorithm for finding k shortest paths subject to multiple constraints","volume":"2","author":"liu","year":"2001","journal-title":"Infocom 2001"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011234012449"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/21.148426"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500106"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/90.779205"},{"key":"8","first-page":"639","article-title":"A gradient method for realtime robot control","volume":"1","author":"konolige","year":"2000","journal-title":"International Conference on Intelligent Robots and Systems (IROS)"}],"event":{"name":"42nd IEEE International Conference on Decision and Control","acronym":"CDC-03","location":"Maui, HI, USA"},"container-title":["42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8969\/28459\/01272513.pdf?arnumber=1272513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T12:57:10Z","timestamp":1489409830000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1272513\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/cdc.2003.1272513","relation":{},"subject":[]}}