{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:09:00Z","timestamp":1762297740991,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1109\/icra.2011.5980550","type":"proceedings-article","created":{"date-parts":[[2011,8,16]],"date-time":"2011-08-16T19:26:17Z","timestamp":1313522777000},"page":"5478-5485","source":"Crossref","is-referenced-by-count":43,"title":["Planning for Manipulation with Adaptive Motion Primitives"],"prefix":"10.1109","author":[{"given":"Benjamin J.","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gokul","family":"Subramania","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sachin","family":"Chitta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Likhachev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","article-title":"Multiple sequence alignment using A*","author":"zhou","year":"2002","journal-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI)"},{"key":"14","first-page":"90","article-title":"Beam-stack search: Integrating backtracking with beam search","author":"zhou","year":"2005","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"11","article-title":"Heuristics: Intelligent search strategies for computer problem solving","author":"pearl","year":"1984","journal-title":"Addison-Wesley"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152817"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570258"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509685"},{"key":"1","article-title":"Path planning using lazy prm","volume":"1","author":"bohlin","year":"2007","journal-title":"IEEE International Conference on Robotics and Automation"},{"key":"10","article-title":"ARA*: Anytime A* with provable bounds on sub-optimality","volume":"16","author":"likhachev","year":"2003","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"journal-title":"Chapter 5 of Speeding Up the Convergence of Online Heuristic Search and Scaling Up Offline Heuristic Search","year":"2004","author":"furcy","key":"5"},{"key":"4","article-title":"Incremental sampling-based algorithms for optimal motion planning","author":"frazzoli","year":"2010","journal-title":"Int Journal of Robotics Research"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1177\/0278364909340445"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"}],"event":{"name":"2011 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2011,5,9]]},"location":"Shanghai, China","end":{"date-parts":[[2011,5,13]]}},"container-title":["2011 IEEE International Conference on Robotics and Automation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5967842\/5979525\/05980550.pdf?arnumber=5980550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T05:32:53Z","timestamp":1490074373000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5980550\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icra.2011.5980550","relation":{},"subject":[],"published":{"date-parts":[[2011,5]]}}}