{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,30]],"date-time":"2026-10-30T16:32:21Z","timestamp":1793377941028,"version":"4.5.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"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":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1109\/lra.2021.3067298","type":"journal-article","created":{"date-parts":[[2021,3,18]],"date-time":"2021-03-18T19:32:19Z","timestamp":1616095939000},"page":"5357-5364","source":"Crossref","is-referenced-by-count":26,"title":["Interleaving Graph Search and Trajectory Optimization for Aggressive Quadrotor Flight"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9892-8322","authenticated-orcid":false,"given":"Ramkumar","family":"Natarajan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5434-7945","authenticated-orcid":false,"given":"Howie","family":"Choset","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maxim","family":"Likhachev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","article-title":"Differential flatness of mechanical control systems: A catalog of prototype systems","author":"murray","year":"0","journal-title":"Proc ASME Int Mech Eng Congr Expo"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/AERO.2009.4839309"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2004.1389727"},{"key":"ref30","article-title":"Ascending technologies, GMBH","author":"technologies","year":"2012"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2096"},{"key":"ref11","first-page":"767","article-title":"Ara*: Anytime a* with provable bounds on sub-optimality","author":"likhachev","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2016.2633290"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1239(199809)8:11<995::AID-RNC373>3.3.CO;2-N"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2663526"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7138978"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487282"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8206119"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2994"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0004-3702(70)90007-X","article-title":"Heuristic search viewed as path finding in a graph","volume":"1","author":"i","year":"1970","journal-title":"Artif Intell"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989679"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2015.2479878"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6094506"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28872-7_37"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913509035"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICAMechS.2014.6911574"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2795654"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911434236"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/0278364910369189"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1115\/1.4030676"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8206409"},{"key":"ref21","first-page":"141","article-title":"On finding narrow passages with probabilistic roadmap planners","author":"hsu","year":"0","journal-title":"Proc Robot Algorithmic Perspective Workshop Algorithmic Foundations Robot"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980409"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917712421"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-010-9416-9"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3182\/20110828-6-IT-1002.03178"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9399748\/09381601.pdf?arnumber=9381601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:02Z","timestamp":1652194442000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9381601\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":33,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3067298","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}