{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:14:13Z","timestamp":1766268853927,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1109\/icra.2017.7989435","type":"proceedings-article","created":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T21:44:28Z","timestamp":1501019068000},"page":"3770-3777","source":"Crossref","is-referenced-by-count":5,"title":["Densification strategies for anytime motion planning over large dense roadmaps"],"prefix":"10.1109","author":[{"given":"Shushman","family":"Choudhury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Salzman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjiban","family":"Choudhury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siddhartha S.","family":"Srinivasa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386213"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"ssc 4","author":"hart","year":"1968","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"ref12","article-title":"Deterministic sampling-based motion planning: Optimality, complexity, and performance","author":"janson","year":"2015","journal-title":"CoRR abs\/1505 00023"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/70.660866"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref18","first-page":"1034","article-title":"Iterative-deepening-A*: An optimal admissible tree search","author":"korf","year":"1985","journal-title":"Joint Conference on Artificial Intelligence"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1999.770022"},{"key":"ref28","first-page":"137","article-title":"When does weighted A* fail?","author":"wilt","year":"2012","journal-title":"Symposium on Combinatorial Search"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2014.X.033"},{"key":"ref27","first-page":"105","article-title":"Anytime nonparametric A","author":"van den berg","year":"2011","journal-title":"Association for the Advancement of Artificial Intelligence"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487615"},{"key":"ref6","first-page":"459","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"},{"key":"ref5","article-title":"The Open Motion Planning Library","author":"?ucan","year":"2012","journal-title":"IEEE Robotics & Automation Magazine"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942976"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139775"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2001.932820"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref20","first-page":"767","article-title":"ARA*: Anytime A* with provable bounds on sub-optimality","author":"likhachev","year":"2003","journal-title":"Advances in neural information processing systems"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139773"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970081"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915615688"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2539377"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-009-9160-9"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2016.XII.003"}],"event":{"name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2017,5,29]]},"location":"Singapore, Singapore","end":{"date-parts":[[2017,6,3]]}},"container-title":["2017 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7960754\/7988677\/07989435.pdf?arnumber=7989435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T16:08:01Z","timestamp":1569946081000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7989435\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/icra.2017.7989435","relation":{},"subject":[],"published":{"date-parts":[[2017,5]]}}}