{"id":"https://openalex.org/W3130141697","doi":"https://doi.org/10.1177/0278364921992787","title":"Hardness of Motion Planning with Obstacle Uncertainty in Two Dimensions","display_name":"Hardness of Motion Planning with Obstacle Uncertainty in Two Dimensions","publication_year":2021,"publication_date":"2021-02-18","ids":{"openalex":"https://openalex.org/W3130141697","doi":"https://doi.org/10.1177/0278364921992787","mag":"3130141697"},"language":"en","primary_location":{"id":"doi:10.1177/0278364921992787","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364921992787","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/A5074627548","display_name":"Luke Shimanuki","orcid":"https://orcid.org/0000-0002-4156-9944"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Luke Shimanuki","raw_affiliation_strings":["Massachusetts Institute of Technology, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-4156-9944","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009465922","display_name":"Brian Axelrod","orcid":"https://orcid.org/0000-0001-8991-8915"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Brian Axelrod","raw_affiliation_strings":["Stanford University, CA, USA"],"raw_orcid":"https://orcid.org/0000-0001-8991-8915","affiliations":[{"raw_affiliation_string":"Stanford University, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009465922"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.2731,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.49623676,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"40","issue":"10-11","first_page":"1151","last_page":"1166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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.9976000189781189,"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/T11714","display_name":"Multimodal Machine Learning Applications","score":0.9948999881744385,"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/motion-planning","display_name":"Motion planning","score":0.7832658290863037},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.7353059649467468},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5852810144424438},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49321597814559937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48528262972831726},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4596845805644989},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4592258036136627},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.45209887623786926},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.45151567459106445},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.44991159439086914},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4436098337173462},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.443270206451416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41517508029937744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3221937417984009},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3063482940196991},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2464950978755951},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.145168274641037},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08345866203308105}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7832658290863037},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7353059649467468},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5852810144424438},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49321597814559937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48528262972831726},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4596845805644989},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4592258036136627},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.45209887623786926},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.45151567459106445},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.44991159439086914},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4436098337173462},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.443270206451416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41517508029937744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3221937417984009},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3063482940196991},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2464950978755951},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.145168274641037},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08345866203308105},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0278364921992787","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364921992787","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":[{"score":0.7099999785423279,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G1078063216","display_name":"RI: Small: A Systematic Approach to Robot Task and Motion Planning in Belief Space","funder_award_id":"1420316","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1724386851","display_name":"AF: Medium: Collaborative Research: Exploiting Opportunities in Pseudorandomness","funder_award_id":"1763311","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2773019091","display_name":null,"funder_award_id":"FA9550-17-1-0165","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G2911450482","display_name":null,"funder_award_id":"DGE-165651 8","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3806200841","display_name":"AF: Medium: Collaborative Research:  Exploiting Opportunities in Pseudorandomness","funder_award_id":"1763299","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4406529996","display_name":"S&AS:INT: Integrated Reasoning, Planning and Acting for Household Robots","funder_award_id":"1723381","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4516764163","display_name":"NRI: Learning to Plan for New Robot Manipulation Tasks","funder_award_id":"1523767","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5452928237","display_name":null,"funder_award_id":"N00014-18-1-2847","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309015","display_name":"Charles Stark Draper Laboratory","ror":"https://ror.org/04378d909"},{"id":"https://openalex.org/F4320312638","display_name":"Thomas and Stacey Siebel Foundation","ror":null},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1140243306","https://openalex.org/W1424654272","https://openalex.org/W1524912379","https://openalex.org/W1529817735","https://openalex.org/W1763528081","https://openalex.org/W1817769608","https://openalex.org/W1971086298","https://openalex.org/W1994584977","https://openalex.org/W2011992362","https://openalex.org/W2012136789","https://openalex.org/W2023862787","https://openalex.org/W2032100464","https://openalex.org/W2042106485","https://openalex.org/W2053044028","https://openalex.org/W2067754486","https://openalex.org/W2070683816","https://openalex.org/W2076369477","https://openalex.org/W2083756938","https://openalex.org/W2103052138","https://openalex.org/W2115356364","https://openalex.org/W2128990851","https://openalex.org/W2170220350","https://openalex.org/W2418752758","https://openalex.org/W2470448410","https://openalex.org/W2604272474","https://openalex.org/W2788657802","https://openalex.org/W2807095006","https://openalex.org/W2889786920","https://openalex.org/W2949893390","https://openalex.org/W2964027335","https://openalex.org/W4210896998","https://openalex.org/W4242073862","https://openalex.org/W4319288700"],"related_works":["https://openalex.org/W2794103424","https://openalex.org/W4280529077","https://openalex.org/W4245435724","https://openalex.org/W1996530509","https://openalex.org/W3028317537","https://openalex.org/W2389515972","https://openalex.org/W2055301889","https://openalex.org/W2507185596","https://openalex.org/W1505959757","https://openalex.org/W2394276631"],"abstract_inverted_index":{"We":[0,52,151],"consider":[1],"the":[2,8,30,45,65,89,116,135,149,170],"problem":[3,175],"of":[4,10,22,32,91,112,118,195],"motion":[5,27,77,164],"planning":[6,28,78,138,165],"in":[7,29,39,64,134],"presence":[9,31],"uncertain":[11,68],"obstacles,":[12,92],"modeled":[13],"as":[14],"polytopes":[15],"with":[16,67,86,120,189],"Gaussian-distributed":[17],"faces":[18],"(PGDFs).":[19],"A":[20],"number":[21,90,194],"practical":[23,63],"algorithms":[24],"exist":[25],"for":[26],"known":[33,136],"obstacles":[34,81,168],"by":[35,154],"constructing":[36],"a":[37,49,102,109,146,192],"graph":[38,46,147],"configuration":[40],"space,":[41],"then":[42],"efficiently":[43],"searching":[44],"to":[47,61,88,101,123,183],"find":[48],"collision-free":[50],"path.":[51],"show":[53,73,153],"that":[54,74,160],"such":[55],"an":[56,121],"exact":[57],"algorithm":[58],"is":[59,82,106,141],"unlikely":[60],"be":[62],"domain":[66],"obstacles.":[69,197],"In":[70],"particular,":[71],"we":[72],"safe":[75,162],"2D":[76],"among":[79,166],"PGDF":[80,167],"[Formula:":[83,95,157,177],"see":[84,96,158,178],"text]-hard":[85,97,179],"respect":[87],"and":[93,114,127,169],"remains":[94],"after":[98],"being":[99],"restricted":[100,182],"graph.":[103],"Our":[104],"reduction":[105,155],"based":[107],"on":[108],"path":[110],"encoding":[111],"MAXQHORNSAT":[113],"uses":[115],"risk":[117],"collision":[119],"obstacle":[122,187],"encode":[124],"variable":[125],"assignments":[126],"literal":[128],"satisfactions.":[129],"This":[130],"implies":[131],"that,":[132],"unlike":[133],"case,":[137],"under":[139],"uncertainty":[140],"hard,":[142],"even":[143,180],"when":[144,181],"given":[145],"containing":[148],"solution.":[150],"further":[152],"from":[156],"text]-SAT":[159],"both":[161],"3D":[163],"related":[171],"minimum":[172],"constraint":[173],"removal":[174],"remain":[176],"cases":[184],"where":[185],"each":[186],"overlaps":[188],"at":[190],"most":[191],"constant":[193],"other":[196]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}