{"id":"https://openalex.org/W2170220350","doi":"https://doi.org/10.1109/sfcs.1987.42","title":"New lower bound techniques for robot motion planning problems","display_name":"New lower bound techniques for robot motion planning problems","publication_year":1987,"publication_date":"1987-10-01","ids":{"openalex":"https://openalex.org/W2170220350","doi":"https://doi.org/10.1109/sfcs.1987.42","mag":"2170220350"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1987.42","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5089723214","display_name":"John Canny","orcid":"https://orcid.org/0000-0002-7161-7927"},"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"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Canny","raw_affiliation_strings":["Computer Science Division, University of California, Berkeley, USA","Massachusetts Institute of Technology, Artificial Intelligent Laboratory"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Artificial Intelligent Laboratory","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Computer Science Division, University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007364145","display_name":"John H. Reif","orcid":"https://orcid.org/0000-0002-9096-2056"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Reif","raw_affiliation_strings":["Computer Science Department, Duke University, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Duke University, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":15.101,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":534,"citation_normalized_percentile":{"value":0.992593,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Sampling-Based Motion Planning Algorithms","score":0.9999,"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":"Sampling-Based Motion Planning Algorithms","score":0.9999,"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/T10571","display_name":"Kinematic and Dynamic Analysis of Robot Manipulators","score":0.973,"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"}},{"id":"https://openalex.org/T10653","display_name":"Robotic Grasping and Learning from Demonstration","score":0.9722,"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-planning","display_name":"Path Planning","score":0.594088},{"id":"https://openalex.org/keywords/optimal-motion-planning","display_name":"Optimal Motion Planning","score":0.590538},{"id":"https://openalex.org/keywords/trajectory-planning","display_name":"Trajectory Planning","score":0.55105},{"id":"https://openalex.org/keywords/real-time-planning","display_name":"Real-Time Planning","score":0.548556},{"id":"https://openalex.org/keywords/probabilistic-roadmaps","display_name":"Probabilistic Roadmaps","score":0.548211}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7710104},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5973271},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.59656715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48979807},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.47977456},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45280528},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44445997},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4381693},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.4286942},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4267569},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3357023},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28963026},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20889953},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1987.42","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.77,"display_name":"Sustainable cities and communities"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":26,"referenced_works":["https://openalex.org/W1509580513","https://openalex.org/W1512906775","https://openalex.org/W1539769924","https://openalex.org/W1558198085","https://openalex.org/W1584532470","https://openalex.org/W1602815913","https://openalex.org/W1760889480","https://openalex.org/W2006918089","https://openalex.org/W2009056209","https://openalex.org/W2010522178","https://openalex.org/W2024693023","https://openalex.org/W2033013465","https://openalex.org/W2034469604","https://openalex.org/W2038958985","https://openalex.org/W2042106485","https://openalex.org/W2055891854","https://openalex.org/W2072839015","https://openalex.org/W2105660272","https://openalex.org/W2123976412","https://openalex.org/W2143745968","https://openalex.org/W2150500908","https://openalex.org/W2154394754","https://openalex.org/W2163178194","https://openalex.org/W2561675875","https://openalex.org/W3217399827","https://openalex.org/W588257714"],"related_works":["https://openalex.org/W3197207153","https://openalex.org/W3154539612","https://openalex.org/W3138952546","https://openalex.org/W3013085049","https://openalex.org/W2380019117","https://openalex.org/W2369187583","https://openalex.org/W2359600231","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W1508899372"],"abstract_inverted_index":{"We":[0,30,79,102],"present":[1],"new":[2],"techniques":[3],"for":[4],"establishing":[5],"lower":[6,77],"bounds":[7],"in":[8,40,90,132,139,147,172,210],"robot":[9],"motion":[10,114,128,154],"planning":[11,115,129],"problems.":[12],"Our":[13],"scheme":[14],"is":[15,45,100,119,143,186,195],"based":[16],"on":[17],"path":[18,38,50,88],"encoding":[19],"and":[20,94],"uses":[21],"homotopy":[22],"equivalence":[23],"classes":[24,89],"of":[25,178,182],"paths":[26],"to":[27,35,46,108,126,145,188,192,197],"encode":[28],"state.":[29],"first":[31,206],"apply":[32],"the":[33,36,48,96,124,158,168,176,190,193,205],"method":[34],"shortest":[37,49,87],"problem":[39,44,67,99,177,209],"3":[41,140],"dimensions.":[42],"The":[43],"find":[47],"under":[51],"an":[52],"Lp":[53],"metric":[54],"(e.g.":[55],"a":[56,104,137,148,180],"euclidean":[57],"metric)":[58],"between":[59],"two":[60,111],"points":[61],"amid":[62],"polyhedral":[63],"obstacles.":[64,165],"Although":[65],"this":[66],"has":[68],"been":[69],"extensively":[70],"studied,":[71],"there":[72,82],"were":[73],"no":[74],"previously":[75],"known":[76],"bounds.":[78],"show":[80,109],"that":[81,95,110,167],"may":[83,155],"be":[84,198],"exponentially":[85],"many":[86],"single-source":[91,97],"multiple-destination":[92],"problems,":[93],"single-destination":[98],"NP-hard.":[101,120],"use":[103],"similar":[105],"proof":[106],"technique":[107,125],"dimensional":[112],"dynamic":[113],"with":[116,130],"bounded":[117],"velocity":[118],"Finally":[121],"we":[122,135],"extend":[123],"compliant":[127],"uncertainty":[131],"control.":[133],"Specifically,":[134],"consider":[136],"point":[138,169,191],"dimensions":[141],"which":[142,185],"commanded":[144,159,183],"move":[146,189],"straight":[149],"line,":[150],"but":[151],"whose":[152],"actual":[153],"differ":[156],"from":[157],"motion,":[160],"possibly":[161],"involving":[162],"sliding":[163],"against":[164],"Given":[166],"initially":[170],"lies":[171],"some":[173],"start":[174],"region,":[175],"finding":[179],"sequence":[181],"velocities":[184],"guaranteed":[187],"goal":[194],"shown":[196],"non-deterministic":[199],"exponential":[200],"time":[201],"hard,":[202],"making":[203],"it":[204],"provably":[207],"intractable":[208],"robotics.":[211]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2170220350","counts_by_year":[{"year":2024,"cited_by_count":14},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":22},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":18},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":19},{"year":2015,"cited_by_count":15},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":18},{"year":2012,"cited_by_count":13}],"updated_date":"2024-10-29T06:21:57.132977","created_date":"2016-06-24"}
