{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:17:09Z","timestamp":1787012229350,"version":"build-2736575974"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"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":[[2019,11]]},"DOI":"10.1109\/iros40897.2019.8967796","type":"proceedings-article","created":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T23:53:51Z","timestamp":1580428431000},"page":"7425-7430","source":"Crossref","is-referenced-by-count":6,"title":["Bidirectional Heuristic Search for Motion Planning with an Extend Operator"],"prefix":"10.1109","author":[{"given":"Allen","family":"Cheng","sequence":"first","affiliation":[{"name":"Robotics Institute, Carnegie Mellon University,Pittsburgh,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dhruv Mauria","family":"Saxena","sequence":"additional","affiliation":[{"name":"Robotics Institute, Carnegie Mellon University,Pittsburgh,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maxim","family":"Likhachev","sequence":"additional","affiliation":[{"name":"Robotics Institute, Carnegie Mellon University,Pittsburgh,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/322003.322004","article-title":"An improved bidirectional heuristic search algorithm","volume":"24","author":"de champeaux","year":"1977","journal-title":"J ACM"},{"key":"ref11","article-title":"Bidirectional search that is guaranteed to meet in the middle","author":"holte","year":"0","journal-title":"THIRTIETH AAAI Conference on Artificial Intelligence"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487437"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915594029"},{"key":"ref14","article-title":"Improved multi-heuristic a* for searching with uncalibrated heuristics","author":"narayanan","year":"0","journal-title":"Eighth Annual Symposium on Combinatorial Search"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref16","article-title":"Kinodynamic rrt*: Optimal motion planning for systems with linear differential constraints","author":"webb","year":"2012"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-013-9963-y"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980550"},{"key":"ref19","first-page":"219","article-title":"First results on the effect of error in heuristic search","volume":"5","author":"pohl","year":"1970","journal-title":"Machine Intelligence"},{"key":"ref4","author":"lavalle","year":"1998","journal-title":"Rapidly-Exploring Random Trees A New Tool for Path Planning"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref6","author":"jordan","year":"2013","journal-title":"Optimal bidirectional rapidly-exploring random trees"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ROBIO.2015.7419012"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2172\/4785039"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2010.VI.034"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/9.3.275"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90069-6"},{"key":"ref1","article-title":"Path planning with adaptive dimensionality","author":"gochev","year":"0","journal-title":"Fourth Annual Symposium on Combinatorial Search"},{"key":"ref20","author":"likhachev","year":"2003","journal-title":"Ara formal analysis"},{"key":"ref22","first-page":"714","article-title":"A robust and fast action selection mechanism for planning","author":"bonet","year":"1997","journal-title":"AAAI\/IAAI"},{"key":"ref21","first-page":"217","article-title":"Bidirectional best-first search with bounded error: Summary of results","author":"koll","year":"1993","journal-title":"Proceedings of the 13th International Joint Conference on Artifical Intelligence-Volume 1"},{"key":"ref24","author":"blanco","year":"2014","journal-title":"nanoflann a C++ header-only fork of FLANN a library for Nearest Neighbor (NN) with KD-trees"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509685"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/MRA.2012.2205651","article-title":"The open motion planning library","volume":"19","author":"sucan","year":"2012","journal-title":"IEEE Robotics & Automation Magazine"}],"event":{"name":"2019 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","location":"Macau, China","start":{"date-parts":[[2019,11,3]]},"end":{"date-parts":[[2019,11,8]]}},"container-title":["2019 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8957008\/8967518\/08967796.pdf?arnumber=8967796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T19:22:10Z","timestamp":1756754530000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8967796\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/iros40897.2019.8967796","relation":{},"subject":[],"published":{"date-parts":[[2019,11]]}}}