{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T12:22:39Z","timestamp":1764332559490,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1109\/iros.2017.8206118","type":"proceedings-article","created":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T17:12:59Z","timestamp":1513271579000},"page":"2864-2871","source":"Crossref","is-referenced-by-count":9,"title":["An effort bias for sampling-based motion planning"],"prefix":"10.1109","author":[{"given":"Scott","family":"Kiesel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyi","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wheeler","family":"Ruml","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363587"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759551"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195999000285"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2005.I.031"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2015.2424031"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2010.2047820"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref16","article-title":"Speedy versus greedy search","author":"wilt","year":"2014","journal-title":"Proceedings of the Annual Symposium on Combinatorial Search (SOCS)"},{"key":"ref17","first-page":"476","article-title":"D* lite","author":"koenig","year":"0","journal-title":"Proceedings of AAAI 2002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/9.769375"},{"journal-title":"Robotics needs non-classical planning","year":"2016","author":"kiesel","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2001.973334"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-3-642-00312-7_28","article-title":"Kinodynamic motion planning by interior-exterior cell exploration","author":"sucan","year":"2009","journal-title":"Algorithmic Foundation of Robotics VIII"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630908"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68405-3_18"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942563"},{"key":"ref8","first-page":"674","article-title":"Bounded suboptimal search: A direct approach using inadmissible estimates","author":"thayer","year":"2011","journal-title":"Proceedings of IJCAI"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1609\/icaps.v19i1.13390","article-title":"Using distance estimates in heuristic search","author":"thayer","year":"2009","journal-title":"Proceedings of ICAPS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref9","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"},{"journal-title":"Principles of Robot Motion Theory Algorithms and Implementation","year":"2005","author":"choset","key":"ref1"},{"key":"ref20","article-title":"Informed RRT*: Optimal incremental path planning focused through an admissible ellipsoidal heuristic","author":"gammell","year":"2014","journal-title":"Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139776"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2007.4399557"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v21i1.13474","article-title":"Learning inadmissible heuristics during search","author":"thayer","year":"2011","journal-title":"Proceedings of the Twenty-first International Conference on Automated Planning and Scheduling (ICAPS-11)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IVS.2013.6629647"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6696589"}],"event":{"name":"2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","start":{"date-parts":[[2017,9,24]]},"location":"Vancouver, BC","end":{"date-parts":[[2017,9,28]]}},"container-title":["2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8119304\/8202121\/08206118.pdf?arnumber=8206118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T18:58:12Z","timestamp":1693335492000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8206118\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/iros.2017.8206118","relation":{},"subject":[],"published":{"date-parts":[[2017,9]]}}}