{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T09:10:19Z","timestamp":1779268219324,"version":"3.51.4"},"reference-count":54,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,5,30]]},"DOI":"10.1109\/icra48506.2021.9561653","type":"proceedings-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:28:35Z","timestamp":1634689715000},"page":"7449-7456","source":"Crossref","is-referenced-by-count":7,"title":["Computationally-Efficient Roadmap-based Inspection Planning via Incremental Lazy Search"],"prefix":"10.1109","author":[{"given":"Mengyu","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Salzman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Alterovitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460188"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016639210559"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref31","first-page":"1","article-title":"A survey of asymptotically optimal sampling-based motion planning methods","volume":"4","author":"gammell","year":"0","journal-title":"Annual Review of Control Robotics and Autonomous Systems"},{"key":"ref30","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2830331"},{"key":"ref36","article-title":"Computationally-efficient roadmap-based inspection planning via incremental lazy search","author":"fu","year":"2021","journal-title":"arXiv preprint arXiv 2103 13573v1 [cs RO]"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1177\/1729881416663664"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574716000084"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2827161"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487440"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2008.4650988"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s12008-012-0160-1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844726"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2016.2635107"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631159"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.23919\/ICCAS.2017.8204468"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6696591"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1609\/icaps.v22i1.13529","article-title":"Sampling-based coverage path planning for inspection of complex structures","author":"englot","year":"2012","journal-title":"International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8206411"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2539377"},{"key":"ref54","article-title":"ASCE 2017 infrastructure report card","year":"0"},{"key":"ref53","article-title":"IRIS","author":"fu","year":"2020"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/rob.20350"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/rob.20324"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/OCEANS-Bergen.2013.6608142"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1029\/97EO00151"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8461135"},{"key":"ref15","first-page":"1311","article-title":"Algorithmic motion planning","author":"halperin","year":"2018","journal-title":"Handbook of Discrete and Computational Geometry"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2019.XV.057"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2678606"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759637"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2014.X.033"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-015-9517-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7140101"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8593719"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MWSCAS.2016.7869968"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/0278364912467485"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6224726"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00079-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913490046"},{"key":"ref46","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1609\/icaps.v28i1.13931","article-title":"Lazy receding horizon A* for efficient path planning in graphs with expensive-to-evaluate edges","author":"mandalika","year":"2018","journal-title":"International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1609\/icaps.v28i1.13879","article-title":"The provable virtue of laziness in motion planning","author":"haghtalab","year":"2018","journal-title":"International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1048"},{"key":"ref47","first-page":"745","article-title":"Generalized lazy search for robot motion planning: Interleaving search and edge evaluation via event-based toggles","author":"mandalika","year":"2019","journal-title":"International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139603"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139773"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1609\/icaps.v26i1.13788","article-title":"A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors","author":"dellin","year":"2016","journal-title":"International Conference on Automated Planning and Scheduling (ICAPS)"}],"event":{"name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","location":"Xi'an, China","start":{"date-parts":[[2021,5,30]]},"end":{"date-parts":[[2021,6,5]]}},"container-title":["2021 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9560720\/9560666\/09561653.pdf?arnumber=9561653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T22:47:00Z","timestamp":1673563620000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9561653\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,30]]},"references-count":54,"URL":"https:\/\/doi.org\/10.1109\/icra48506.2021.9561653","relation":{},"subject":[],"published":{"date-parts":[[2021,5,30]]}}}