{"id":"https://openalex.org/W2109850682","doi":"https://doi.org/10.1109/iros.2009.5354168","title":"Collision-probability constrained PRM for a manipulator with base pose uncertainty","display_name":"Collision-probability constrained PRM for a manipulator with base pose uncertainty","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2109850682","doi":"https://doi.org/10.1109/iros.2009.5354168","mag":"2109850682"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2009.5354168","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2009.5354168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"},"type":"conference-paper","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/A5103158590","display_name":"Yifeng Huang","orcid":"https://orcid.org/0000-0001-8548-630X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yifeng Huang","raw_affiliation_strings":["School of Engineering Science, RAMP, Canada","RAMP, School of Engineering Science, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering Science, RAMP, Canada","institution_ids":[]},{"raw_affiliation_string":"RAMP, School of Engineering Science, Canada","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067371024","display_name":"Kamal Gupta","orcid":"https://orcid.org/0000-0002-4154-0615"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kamal Gupta","raw_affiliation_strings":["School of Engineering Science, RAMP, Canada","RAMP, School of Engineering Science, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering Science, RAMP, Canada","institution_ids":[]},{"raw_affiliation_string":"RAMP, School of Engineering Science, Canada","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":null,"first_page":"1426","last_page":"1432"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9736999869346619,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10653","display_name":"Robot Manipulation and Learning","score":0.9416999816894531,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6850258111953735},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.610119104385376},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.602263331413269},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5961422920227051},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.5358328819274902},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5211215615272522},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.5112073421478271},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.48148882389068604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47956007719039917},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4543515741825104},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.43859943747520447},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4117025136947632},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28277450799942017},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2676079273223877},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2386259138584137},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.1881607472896576},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1376459300518036},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.11403772234916687}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6850258111953735},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.610119104385376},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.602263331413269},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5961422920227051},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.5358328819274902},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5211215615272522},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.5112073421478271},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.48148882389068604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47956007719039917},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4543515741825104},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.43859943747520447},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4117025136947632},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28277450799942017},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2676079273223877},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2386259138584137},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.1881607472896576},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1376459300518036},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.11403772234916687},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2009.5354168","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2009.5354168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W133520045","https://openalex.org/W255922872","https://openalex.org/W1424654272","https://openalex.org/W1696799614","https://openalex.org/W1762891830","https://openalex.org/W1970543907","https://openalex.org/W2055811883","https://openalex.org/W2099987996","https://openalex.org/W2120794627","https://openalex.org/W2123283036","https://openalex.org/W2125288829","https://openalex.org/W2128353551","https://openalex.org/W2128990851","https://openalex.org/W2129626945","https://openalex.org/W2131058166","https://openalex.org/W2133588246","https://openalex.org/W2152724075","https://openalex.org/W2158727662","https://openalex.org/W2159176259","https://openalex.org/W2159722616","https://openalex.org/W2168359464","https://openalex.org/W2171771720","https://openalex.org/W2172103629","https://openalex.org/W2277605219","https://openalex.org/W2336416123","https://openalex.org/W2611243847","https://openalex.org/W4242811155","https://openalex.org/W6609661983","https://openalex.org/W6675080091"],"related_works":["https://openalex.org/W2107702345","https://openalex.org/W2137520303","https://openalex.org/W1536392978","https://openalex.org/W2216928063","https://openalex.org/W4225279627","https://openalex.org/W2102269193","https://openalex.org/W2776102956","https://openalex.org/W1128195214","https://openalex.org/W569048669","https://openalex.org/W2621332712"],"abstract_inverted_index":{"We":[0,72,125],"address":[1],"the":[2,16,30,34,47,52,65,68,80,83,95,99,120,123,164,187,196,214,221],"motion":[3],"planning":[4],"problem":[5,104,112],"for":[6,29,51,74,230],"a":[7,21,25,49,57,75,90,106,128,140,147,152,157,160,177,231,237],"manipulator":[8,17,53,84,96,234],"system":[9],"with":[10,41,56,146,227],"base":[11,43],"pose":[12],"uncertainty,":[13,31,48],"e.g.,":[14],"when":[15],"is":[18,54,87,115,166,174,180,211],"mounted":[19,235],"on":[20,139,236],"mobile":[22,238],"base.":[23,239],"Using":[24],"particle":[26],"based":[27,138],"representation":[28],"we":[32,218],"extend":[33],"PRM":[35],"(probabilistic":[36],"roadmap)":[37],"approach":[38],"to":[39,97,201],"deal":[40],"this":[42,191],"uncertainty.":[44],"Because":[45],"of":[46,59,67,82,122,159,170,216,223],"path":[50,77,102,111,142,161],"associated":[55],"probability":[58,81,108,135,169],"being":[60,85,172],"collision-free,":[61],"which":[62],"fundamentally":[63],"changes":[64],"nature":[66],"PRM's":[69],"query":[70,103,130,225],"phase.":[71],"plan":[73],"shortest":[76,110],"such":[78],"that":[79,155],"collision-free":[86,173],"higher":[88],"than":[89,176],"user":[91],"defined":[92],"threshold,":[93],"were":[94],"follow":[98],"path.":[100,198],"The":[101],"becomes":[105],"collision":[107],"constrained":[109,136],"(CP-CSPP),":[113],"and":[114],"shown":[116],"as":[117],"NP-hard":[118],"w.r.t.":[119],"number":[121,215],"particles.":[124],"then":[126,185],"present":[127],"lazy":[129],"algorithm,":[131],"called":[132],"Lazy-CPC-PRM":[133,150],"(collision":[134],"LazyPRM),":[137],"k-shortest":[141],"algorithm":[143,165,226],"in":[144,205,213],"conjunction":[145],"labeling":[148],"algorithm.":[149],"exploits":[151],"key":[153],"insight":[154],"if":[156],"portion":[158,192],"considered":[162],"by":[163,182],"invalid":[167],"(the":[168],"it":[171],"less":[175],"threshold)":[178],"or":[179],"dominated":[181],"another":[183],"sub-path,":[184],"all":[186],"longer":[188],"paths":[189],"containing":[190],"can":[193],"not":[194],"be":[195],"solution":[197],"This":[199],"leads":[200],"significant":[202],"efficiency":[203],"gains":[204],"practice.":[206],"Although,":[207],"worst":[208],"case":[209],"complexity":[210],"exponential":[212],"particles,":[217],"empirically":[219],"show":[220],"effectiveness":[222],"our":[224],"30":[228],"particles":[229],"simulated":[232],"3-dof":[233]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}