{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T02:35:02Z","timestamp":1730342102420,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T00:00:00Z","timestamp":1720569600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T00:00:00Z","timestamp":1720569600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,10]]},"DOI":"10.23919\/acc60939.2024.10644796","type":"proceedings-article","created":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:19Z","timestamp":1725558979000},"page":"3545-3550","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of Backtracking A* for Resource Constrained Shortest Path Problems"],"prefix":"10.23919","author":[{"given":"Bryce","family":"Ford","sequence":"first","affiliation":[{"name":"The Ohio State University,Mechanical and Aerospace Engineering,Columbus,Ohio,United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mrinal","family":"Kumar","sequence":"additional","affiliation":[{"name":"The Ohio State University,Mechanical and Aerospace Engineering,Columbus,Ohio,United States"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2016.7526691"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916277"},{"issue":"2","key":"ref3","first-page":"63","article-title":"The constrained shortest path problem: Algorithmic approaches and an algebraic study with generalization","volume":"2","author":"Xiao","year":"2005","journal-title":"AKCE International Journal of Graphs and Combinatorics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2514\/6.2022-1592"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.21511"},{"key":"ref6","article-title":"Computers and intractability","author":"Garey","year":"1979","journal-title":"A Guide to the"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100403"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190402"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1988.11732063"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2015.2428654"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(66)90020-5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/net.10090"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/net.21856"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3830"},{"volume-title":"Introduction to Algorithms","year":"2022","author":"Cormen","key":"ref15"}],"event":{"name":"2024 American Control Conference (ACC)","start":{"date-parts":[[2024,7,10]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10644130\/10644150\/10644796.pdf?arnumber=10644796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:32:55Z","timestamp":1725769975000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10644796\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,10]]},"references-count":15,"URL":"https:\/\/doi.org\/10.23919\/acc60939.2024.10644796","relation":{},"subject":[],"published":{"date-parts":[[2024,7,10]]}}}