{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:45:07Z","timestamp":1772829907155,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1109\/robot.2010.5509470","type":"proceedings-article","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T16:07:20Z","timestamp":1279814840000},"page":"2515-2522","source":"Crossref","is-referenced-by-count":28,"title":["High-dimensional planning on the GPU"],"prefix":"10.1109","author":[{"given":"Joseph T","family":"Kider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Henderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Likhachev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alla","family":"Safonova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref11","article-title":"R* search","author":"likhachev","year":"2008","journal-title":"Proceedings of the National Conference on Artificial Intelligence"},{"key":"ref12","article-title":"GPU accelerated pathfinding","author":"bleiweiss","year":"2008","journal-title":"Proceedings of the 23rd ACM SIGGRAPH\/EUROGRAPHICS Symposium on Graphics Hardware Ser GH '08"},{"key":"ref13","first-page":"47","article-title":"All-pairs shortest-paths for large graphs on the GPU","author":"katz","year":"2008","journal-title":"Proceedings of the 23rd ACM SIGGRAPH\/EUROGRAPHICS Symposium on Graphics Hardware Ser GH '08"},{"key":"ref14","article-title":"Parallel state space search on the GPU","author":"edelkamp","year":"2009","journal-title":"Proceedings of the International Symposium on Combinatorial Search"},{"key":"ref15","article-title":"Parallel best-first search: Optimal and suboptimal solutions","author":"burns","year":"2009","journal-title":"Proceedings of the International Symposium on Combinatorial Search"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v19i1.13375","article-title":"Suboptimal and anytime heuristic search on multi-core machines","author":"burns","year":"2009","journal-title":"ICAPS"},{"key":"ref17","first-page":"1217","article-title":"Parallel structured duplicate detection","author":"zhou","year":"2007","journal-title":"National Conference on Artificial Intelligence (AAAI)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1036"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1609\/icaps.v19i1.13350","article-title":"Scalable, Parallel Best-First Search for Optimal Sequential Planning","author":"kishimoto","year":"2009","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling"},{"key":"ref4","first-page":"90","article-title":"Beam-stack search: Integrating backtracking with beam search","author":"zhou","year":"2005","journal-title":"ICAPS"},{"key":"ref3","article-title":"Multiple sequence alignment using A*","author":"zhou","year":"2002","journal-title":"Proceedings of the National Conference on Artificial Intelligence"},{"key":"ref6","first-page":"272","article-title":"A* speed optimizations","author":"rabin","year":"2000","journal-title":"Game Programming Gems"},{"key":"ref5","article-title":"ARA*: Anytime A* with provable bounds on sub-optimality","author":"likhachev","year":"2003","journal-title":"Advances in Neural Information Processing Systems (NIPS) 16"},{"key":"ref8","article-title":"Planning long dynamically-feasible maneuvers for autonomous vehicles","author":"likhachev","year":"2008","journal-title":"Proceedings of Robotics Science and Systems (RSS)"},{"key":"ref7","article-title":"Performance measurement and analysis of certain search algorithms","author":"gaschnig","year":"1979","journal-title":"Tech Rep CMU-CS-79-124"},{"key":"ref2","article-title":"Chapter 5 of speeding up the convergence of online heuristic search and scaling up offline heuristic search","author":"furcy","year":"2004"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref1","article-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"pearl","year":"1984"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1023\/A:1024452529781","article-title":"Kbfs: K-best-first search","volume":"39","author":"feiner","year":"2003","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2004.1389681"},{"key":"ref21","article-title":"RRT-plan: a randomized algorithm for strips planning","author":"burfoot","year":"2006","journal-title":"Proceedings of the National Conference on Artificial Intelligence (AAAJ)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2007.4399557"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1145\/1276377.1276510","article-title":"Construction and optimal search of interpolated motion graphs","author":"safonova","year":"2007","journal-title":"ACM Trans Graph"},{"key":"ref26","article-title":"Multi agent navigation on GPU","author":"bleiweiss","year":"2009"},{"key":"ref25","article-title":"NVIDIA CUDA compute unified device architecture programming guide","year":"2007"}],"event":{"name":"2010 IEEE International Conference on Robotics and Automation (ICRA 2010)","location":"Anchorage, AK","start":{"date-parts":[[2010,5,3]]},"end":{"date-parts":[[2010,5,7]]}},"container-title":["2010 IEEE International Conference on Robotics and Automation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5501116\/5509124\/05509470.pdf?arnumber=5509470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T07:28:16Z","timestamp":1685690896000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5509470\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/robot.2010.5509470","relation":{},"subject":[],"published":{"date-parts":[[2010,5]]}}}