{"id":"https://openalex.org/W2346637437","doi":"https://doi.org/10.1177/0278364916640908","title":"Fast probabilistic collision checking for sampling-based motion planning using locality-sensitive hashing","display_name":"Fast probabilistic collision checking for sampling-based motion planning using locality-sensitive hashing","publication_year":2016,"publication_date":"2016-05-02","ids":{"openalex":"https://openalex.org/W2346637437","doi":"https://doi.org/10.1177/0278364916640908","mag":"2346637437"},"language":"en","primary_location":{"id":"doi:10.1177/0278364916640908","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364916640908","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076812698","display_name":"Jia Pan","orcid":"https://orcid.org/0000-0001-9003-2054"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Jia Pan","raw_affiliation_strings":["Department of Mechanical and Biomedical Engineering, City University of Hong Kong, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Biomedical Engineering, City University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004194238","display_name":"Dinesh Manocha","orcid":"https://orcid.org/0000-0001-7047-9801"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dinesh Manocha","raw_affiliation_strings":["Department of Computer Science, University of North Carolina, Chapel Hill, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina, Chapel Hill, USA","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076812698"],"corresponding_institution_ids":["https://openalex.org/I168719708"],"apc_list":null,"apc_paid":null,"fwci":3.3147,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.94976806,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"35","issue":"12","first_page":"1477","last_page":"1496"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11714","display_name":"Multimodal Machine Learning Applications","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7588164806365967},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6995829939842224},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.631219208240509},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6068525314331055},{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.5776882171630859},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.577622652053833},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.526619017124176},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.5259873270988464},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.5123122930526733},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46597787737846375},{"id":"https://openalex.org/keywords/collision-detection","display_name":"Collision detection","score":0.4631035029888153},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.42812132835388184},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38032644987106323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34917551279067993},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30228951573371887},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.25100964307785034},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.24515578150749207},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.17869850993156433},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.12096506357192993}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7588164806365967},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6995829939842224},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.631219208240509},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6068525314331055},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.5776882171630859},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.577622652053833},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.526619017124176},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.5259873270988464},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.5123122930526733},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46597787737846375},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.4631035029888153},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.42812132835388184},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38032644987106323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34917551279067993},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30228951573371887},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.25100964307785034},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.24515578150749207},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.17869850993156433},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.12096506357192993},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0278364916640908","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364916640908","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7799999713897705,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W146900863","https://openalex.org/W178999881","https://openalex.org/W181534116","https://openalex.org/W1489843519","https://openalex.org/W1492925305","https://openalex.org/W1495392417","https://openalex.org/W1497953515","https://openalex.org/W1502916507","https://openalex.org/W1670942551","https://openalex.org/W1971458750","https://openalex.org/W1971672424","https://openalex.org/W1981721425","https://openalex.org/W2004139909","https://openalex.org/W2008967868","https://openalex.org/W2008995227","https://openalex.org/W2018740177","https://openalex.org/W2026665074","https://openalex.org/W2038276547","https://openalex.org/W2041836310","https://openalex.org/W2065096474","https://openalex.org/W2103207620","https://openalex.org/W2106473816","https://openalex.org/W2107535513","https://openalex.org/W2112224432","https://openalex.org/W2114628632","https://openalex.org/W2118356379","https://openalex.org/W2122724557","https://openalex.org/W2126458834","https://openalex.org/W2128259081","https://openalex.org/W2128990851","https://openalex.org/W2134146845","https://openalex.org/W2141664020","https://openalex.org/W2157543942","https://openalex.org/W2161298439","https://openalex.org/W2162006472","https://openalex.org/W2164696537","https://openalex.org/W2171266831","https://openalex.org/W2176446742","https://openalex.org/W2296360731","https://openalex.org/W2401467858","https://openalex.org/W2515936176","https://openalex.org/W2570764145","https://openalex.org/W2949071206","https://openalex.org/W4210700398","https://openalex.org/W4236573885","https://openalex.org/W4241241842"],"related_works":["https://openalex.org/W1555349535","https://openalex.org/W2393322642","https://openalex.org/W1556451512","https://openalex.org/W1884989760","https://openalex.org/W2000601968","https://openalex.org/W2144265691","https://openalex.org/W2033383639","https://openalex.org/W3108918257","https://openalex.org/W3016124764","https://openalex.org/W2024392402"],"abstract_inverted_index":{"We":[0,106,119],"present":[1],"a":[2,43,133,182],"novel":[3],"approach":[4,128],"to":[5,15,37,58,66,81,100,196],"perform":[6,50],"fast":[7],"probabilistic":[8,125],"collision":[9,30,40,75,83,104,126],"checking":[10,84,127],"in":[11,158,199],"high-dimensional":[12],"configuration":[13,45],"spaces":[14],"accelerate":[16],"the":[17,26,39,67,82,93,102,121,164,174,178,187,200],"performance":[18,188,201],"of":[19,28,86,123,136,184,189,202],"sampling-based":[20,137],"motion":[21,138],"planning.":[22],"Our":[23,152],"formulation":[24],"stores":[25],"results":[27,85],"prior":[29,60,88],"queries,":[31],"and":[32,150,192,206],"then":[33,78],"uses":[34],"such":[35,161],"information":[36],"predict":[38],"probability":[41],"for":[42,115,173],"new":[44,68,72],"sample.":[46],"In":[47],"particular,":[48],"we":[49,193],"an":[51,170],"approximate":[52,116],"k-NN":[53,117],"(":[54],"k-nearest":[55],"neighbor)":[56],"search":[57,176],"find":[59],"query":[61,69,73,89],"samples":[62],"that":[63,95],"are":[64,98],"closest":[65],"configuration.":[70],"The":[71],"sample\u2019s":[74],"status":[76],"is":[77],"estimated":[79],"according":[80],"these":[87,156],"samples,":[90],"based":[91],"on":[92,177,181,204],"fact":[94],"nearby":[96],"configurations":[97],"likely":[99],"have":[101],"same":[103],"status.":[105],"use":[107],"locality-sensitive":[108],"hashing":[109],"techniques":[110],"with":[111,132],"sub-linear":[112],"time":[113],"complexity":[114],"queries.":[118],"evaluate":[120],"benefit":[122],"our":[124,190],"by":[129],"integrating":[130],"it":[131],"wide":[134],"variety":[135],"planners,":[139],"including":[140],"PRM":[141],"(Probabilistic":[142],"roadmaps),":[143],"lazyPRM,":[144],"RRT":[145],"Rapidly":[146],"exploring":[147],"random":[148],"trees,":[149],"RRT*.":[151],"method":[153],"can":[154],"improve":[155],"planners":[157,203],"various":[159],"manners,":[160],"as":[162],"accelerating":[163],"local":[165],"path":[166],"validation,":[167],"or":[168],"computing":[169],"efficient":[171],"order":[172],"graph":[175],"roadmap.":[179],"Experiments":[180],"set":[183],"benchmarks":[185],"demonstrate":[186],"method,":[191],"observe":[194],"up":[195],"2x":[197],"speedup":[198],"rigid":[205],"articulated":[207],"robots.":[208]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}