{"id":"https://openalex.org/W2192809511","doi":"https://doi.org/10.1080/01691864.2015.1081104","title":"Constrained motion planning for robot manipulators using local geometric information","display_name":"Constrained motion planning for robot manipulators using local geometric information","publication_year":2015,"publication_date":"2015-10-20","ids":{"openalex":"https://openalex.org/W2192809511","doi":"https://doi.org/10.1080/01691864.2015.1081104","mag":"2192809511"},"language":"en","primary_location":{"id":"doi:10.1080/01691864.2015.1081104","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01691864.2015.1081104","pdf_url":null,"source":{"id":"https://openalex.org/S192584203","display_name":"Advanced Robotics","issn_l":"0169-1864","issn":["0169-1864","1568-5535"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advanced Robotics","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/A5063823674","display_name":"Jeonghyeon Wang","orcid":"https://orcid.org/0000-0002-4053-2306"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jeonghyeon Wang","raw_affiliation_strings":["Robotics Program, KAIST, Daejeon, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Robotics Program, KAIST, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076742962","display_name":"Jujang Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jujang Lee","raw_affiliation_strings":["Robotics Program, KAIST, Daejeon, Republic of Korea.; Department of Electrical Engineering, KAIST, Daejeon, Republic of Korea","Department of Electrical Engineering, KAIST, Daejeon, Republic of Korea","Robotics Program, KAIST, Daejeon, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Robotics Program, KAIST, Daejeon, Republic of Korea.; Department of Electrical Engineering, KAIST, Daejeon, Republic of Korea","institution_ids":[]},{"raw_affiliation_string":"Department of Electrical Engineering, KAIST, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Robotics Program, KAIST, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054727482","display_name":"Jinwhan Kim","orcid":"https://orcid.org/0000-0001-6886-2449"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Jinwhan Kim","raw_affiliation_strings":["Robotics Program, KAIST, Daejeon, Republic of Korea.; Department of Mechanical Engineering, KAIST, Daejeon, Republic of Korea","Robotics Program, KAIST, Daejeon, Republic of Korea","Department of Mechanical Engineering, KAIST, Daejeon, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Robotics Program, KAIST, Daejeon, Republic of Korea.; Department of Mechanical Engineering, KAIST, Daejeon, Republic of Korea","institution_ids":[]},{"raw_affiliation_string":"Robotics Program, KAIST, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Mechanical Engineering, KAIST, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054727482"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.10265988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"29","issue":"24","first_page":"1611","last_page":"1623"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9987999796867371,"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9972000122070312,"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/motion-planning","display_name":"Motion planning","score":0.7231416702270508},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.658417284488678},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6210719347000122},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6024104356765747},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5475526452064514},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5338391661643982},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5271332263946533},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.500762939453125},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.46525293588638306},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4368158280849457},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3670453727245331},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3381917476654053},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33047860860824585}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7231416702270508},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.658417284488678},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6210719347000122},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6024104356765747},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5475526452064514},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5338391661643982},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5271332263946533},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.500762939453125},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.46525293588638306},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4368158280849457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3670453727245331},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3381917476654053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33047860860824585},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/01691864.2015.1081104","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01691864.2015.1081104","pdf_url":null,"source":{"id":"https://openalex.org/S192584203","display_name":"Advanced Robotics","issn_l":"0169-1864","issn":["0169-1864","1568-5535"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advanced Robotics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W294676392","https://openalex.org/W641269917","https://openalex.org/W1424654272","https://openalex.org/W1883379779","https://openalex.org/W1906034729","https://openalex.org/W1947715309","https://openalex.org/W1965244358","https://openalex.org/W1971315778","https://openalex.org/W2021927715","https://openalex.org/W2022831006","https://openalex.org/W2031335381","https://openalex.org/W2069666248","https://openalex.org/W2102128251","https://openalex.org/W2103776982","https://openalex.org/W2116341587","https://openalex.org/W2128990851","https://openalex.org/W2134447392","https://openalex.org/W2135699399","https://openalex.org/W2141664020","https://openalex.org/W2163426622","https://openalex.org/W2403902171","https://openalex.org/W2611243847"],"related_works":["https://openalex.org/W1980381208","https://openalex.org/W2364594919","https://openalex.org/W2167092671","https://openalex.org/W1861706286","https://openalex.org/W2219338811","https://openalex.org/W2149583853","https://openalex.org/W2992415251","https://openalex.org/W2143002539","https://openalex.org/W2130386332","https://openalex.org/W2118356379"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,19,29,35,136,146],"new":[4],"motion":[5],"planning":[6],"algorithm":[7,32,79,166],"for":[8],"robot":[9],"manipulator":[10,20],"systems":[11],"with":[12,160,163],"path":[13,36],"constraints.":[14],"The":[15,77,156],"constraint":[16,60],"function":[17],"of":[18,24,101,116,126],"determines":[21],"the":[22,42,52,55,59,74,81,87,93,99,102,114,124,127,169],"subspace":[23,56],"its":[25],"joint":[26],"space,":[27],"and":[28,85,145],"proposed":[30,78],"sampling-based":[31],"can":[33,47],"find":[34],"that":[37],"connects":[38],"valid":[39,45],"samples":[40,46,53,66],"in":[41,171],"subspace.":[43],"These":[44],"be":[48],"obtained":[49,162],"by":[50,58],"projecting":[51],"onto":[54],"defined":[57],"function.":[61],"However,":[62],"these":[63],"iteratively":[64],"generated":[65],"easily":[67],"fall":[68],"into":[69],"local":[70,82,94],"optima,":[71],"which":[72,112],"degrades":[73],"search":[75,88,103],"performance.":[76,172],"uses":[80],"geometric":[83],"information":[84],"expands":[86,107],"tree":[89,104],"adaptively":[90],"to":[91,122,132,167],"avoid":[92],"convergence":[95],"problem.":[96],"It":[97],"increases":[98],"greediness":[100],"when":[105],"it":[106,129],"toward":[108],"an":[109,164],"unexplored":[110],"area,":[111],"produces":[113],"benefit":[115],"reducing":[117],"computational":[118],"time.":[119],"In":[120],"order":[121],"demonstrate":[123],"performance":[125],"algorithm,":[128],"is":[130],"applied":[131],"two":[133,150],"example":[134],"problems:":[135],"maze":[137],"problem":[138,148],"using":[139,149],"PUMA":[140],"560":[141],"under":[142],"predefined":[143],"constraints":[144],"closed-chain":[147],"Selective":[151],"Compliance":[152],"Assembly":[153],"Robot":[154],"Arms.":[155],"results":[157],"are":[158],"compared":[159],"those":[161],"existing":[165],"show":[168],"improvement":[170]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}