{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:33:30Z","timestamp":1729643610711,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/iros.2018.8594209","type":"proceedings-article","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T02:33:30Z","timestamp":1548297210000},"page":"8110-8117","source":"Crossref","is-referenced-by-count":2,"title":["Perception-Driven Sparse Graphs for Optimal Motion Planning"],"prefix":"10.1109","author":[{"given":"Thomas","family":"Sayre-McCord","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sertac","family":"Karaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"12","article-title":"ARA: Anytime A with provable bounds on sub-optimality","volume":"16","author":"likhachev","year":"2004","journal-title":"Advances in neural information processing systems"},{"key":"ref11","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":"ICAPS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01928918"},{"journal-title":"OBPRM An obstacle-based PRM for 3D workspaces","year":"1998","author":"amato","key":"ref14"},{"key":"ref15","first-page":"1","article-title":"Theta*: Any-Angle Path Planning on Grids","volume":"1","author":"nash","year":"2007","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI)"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v24i1.7566","article-title":"Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D","author":"nash","year":"2010","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI)"},{"key":"ref17","article-title":"Incremental Phi*: Incremental Any-Angle Path Planning on Grids","author":"likhachev","year":"2009","journal-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-015-9529-x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2012.6651592"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2008.2012116"},{"journal-title":"Rapidly-Exploring Random Trees A New Tool for Path Planning","year":"1998","author":"lavalle","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8463195"},{"key":"ref9","article-title":"D* Lite","volume":"15","author":"koenig","year":"2002","journal-title":"AAAI\/IAAI"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225351"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225228"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/HUMANOIDS.2016.7803264"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2014.X.033"},{"key":"ref24","article-title":"The mathematical theory of optimal processes","author":"pontryagin","year":"1964","journal-title":"ser International series of monographs in pure and applied mathematics v 55"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8202271"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-012-9321-0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/2372560"}],"event":{"name":"2018 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","start":{"date-parts":[[2018,10,1]]},"location":"Madrid","end":{"date-parts":[[2018,10,5]]}},"container-title":["2018 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8574473\/8593358\/08594209.pdf?arnumber=8594209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T03:52:09Z","timestamp":1694577129000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8594209\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/iros.2018.8594209","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}