{"id":"https://openalex.org/W2908470874","doi":"https://doi.org/10.1109/robosoft.2019.8722778","title":"Near-optimal Smooth Path Planning for Multisection Continuum Arms","display_name":"Near-optimal Smooth Path Planning for Multisection Continuum Arms","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2908470874","doi":"https://doi.org/10.1109/robosoft.2019.8722778","mag":"2908470874"},"language":"en","primary_location":{"id":"doi:10.1109/robosoft.2019.8722778","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robosoft.2019.8722778","pdf_url":null,"source":{"id":"https://openalex.org/S4306498402","display_name":"2019 2nd IEEE International Conference on Soft Robotics (RoboSoft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 2nd IEEE International Conference on Soft Robotics (RoboSoft)","raw_type":"proceedings-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/A5091825521","display_name":"Jiahao Deng","orcid":null},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jiahao Deng","raw_affiliation_strings":["School of Computing, DePaul University, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, DePaul University, Chicago, IL, USA","institution_ids":["https://openalex.org/I118353179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056112019","display_name":"Brandon H. Meng","orcid":"https://orcid.org/0000-0001-5531-3934"},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brandon H. Meng","raw_affiliation_strings":["School of Computing, DePaul University, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, DePaul University, Chicago, IL, USA","institution_ids":["https://openalex.org/I118353179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009111693","display_name":"Iyad Kanj","orcid":"https://orcid.org/0000-0003-1698-8829"},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Iyad Kanj","raw_affiliation_strings":["School of Computing, DePaul University, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, DePaul University, Chicago, IL, USA","institution_ids":["https://openalex.org/I118353179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026038506","display_name":"Isuru S. Godage","orcid":"https://orcid.org/0000-0001-6112-0813"},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Isuru S. Godage","raw_affiliation_strings":["School of Computing, DePaul University, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, DePaul University, Chicago, IL, USA","institution_ids":["https://openalex.org/I118353179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5091825521"],"corresponding_institution_ids":["https://openalex.org/I118353179"],"apc_list":null,"apc_paid":null,"fwci":5.2934,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.96898942,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"416","last_page":"421"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10868","display_name":"Soft Robotics and Applications","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10868","display_name":"Soft Robotics and Applications","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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.9968000054359436,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9907000064849854,"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.7757599353790283},{"id":"https://openalex.org/keywords/inverse-kinematics","display_name":"Inverse kinematics","score":0.6722791790962219},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6388520002365112},{"id":"https://openalex.org/keywords/kinematics","display_name":"Kinematics","score":0.6113556623458862},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6103713512420654},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5493679642677307},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5437291264533997},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5426807999610901},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5245043039321899},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.5106154084205627},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4692250192165375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4515107274055481},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4345625340938568},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4326461851596832},{"id":"https://openalex.org/keywords/robot-kinematics","display_name":"Robot kinematics","score":0.432047963142395},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40668249130249023},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3316175639629364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2967943549156189},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23802435398101807},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.15174034237861633},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08731544017791748}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7757599353790283},{"id":"https://openalex.org/C17816587","wikidata":"https://www.wikidata.org/wiki/Q1501872","display_name":"Inverse kinematics","level":3,"score":0.6722791790962219},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6388520002365112},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.6113556623458862},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6103713512420654},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5493679642677307},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5437291264533997},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5426807999610901},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5245043039321899},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.5106154084205627},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4692250192165375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4515107274055481},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4345625340938568},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4326461851596832},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.432047963142395},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40668249130249023},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3316175639629364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2967943549156189},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23802435398101807},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.15174034237861633},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08731544017791748},{"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/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robosoft.2019.8722778","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robosoft.2019.8722778","pdf_url":null,"source":{"id":"https://openalex.org/S4306498402","display_name":"2019 2nd IEEE International Conference on Soft Robotics (RoboSoft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 2nd IEEE International Conference on Soft Robotics (RoboSoft)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1750689792","https://openalex.org/W1891615552","https://openalex.org/W1925606516","https://openalex.org/W1966513134","https://openalex.org/W1977785674","https://openalex.org/W2055201760","https://openalex.org/W2101667962","https://openalex.org/W2124540383","https://openalex.org/W2131063775","https://openalex.org/W2139761653","https://openalex.org/W2184993170","https://openalex.org/W2245493112","https://openalex.org/W2396013977","https://openalex.org/W2412166587","https://openalex.org/W2413886764","https://openalex.org/W2894081025","https://openalex.org/W4246219036","https://openalex.org/W4251181231"],"related_works":["https://openalex.org/W2744818472","https://openalex.org/W2970937359","https://openalex.org/W1253671258","https://openalex.org/W3134555460","https://openalex.org/W4283266117","https://openalex.org/W2355512144","https://openalex.org/W4396731552","https://openalex.org/W2946941768","https://openalex.org/W2607470227","https://openalex.org/W2351331567"],"abstract_inverted_index":{"We":[0,38,51,110,141],"study":[1],"the":[2,28,31,35,56,73,95,104,115,119,122,126,146,152,183],"path":[3,26,68,168,173,189],"planning":[4,69],"problem":[5],"for":[6,27,76],"continuum-arm":[7],"robots,":[8],"in":[9,103,129,165],"which":[10],"we":[11,21,92],"are":[12,44,49,134,139],"given":[13],"a":[14,25,62,67,77,167,177,188],"starting":[15],"and":[16,20,46,114,136],"an":[17],"end":[18],"point,":[19],"need":[22],"to":[23,54,60,94,100,106,145,176],"compute":[24],"tip":[29],"of":[30,81,86,121,182],"continuum":[32,57,78],"arm":[33,58,79],"between":[34],"two":[36],"points.":[37],"consider":[39],"both":[40,130],"cases":[41,131],"where":[42,47,132,137],"obstacles":[43,133],"present":[45,135],"they":[48,138],"not.":[50,140],"demonstrate":[52],"how":[53],"leverage":[55],"features":[59],"introduce":[61],"new":[63],"model":[64],"that":[65,171],"enables":[66],"approach":[70,144,155,186],"based":[71],"on":[72],"configurations":[74,96],"graph,":[75],"consisting":[80,85],"three":[82,87],"sections,":[83],"each":[84],"muscle":[88],"actuators.":[89],"The":[90],"algorithm":[91,124,162],"apply":[93],"graph":[97],"allows":[98],"us":[99],"exploit":[101],"parallelism":[102],"computation":[105],"obtain":[107],"efficient":[108],"implementation.":[109],"conducted":[111],"extensive":[112],"tests,":[113],"obtained":[116],"results":[117],"show":[118],"completeness":[120],"proposed":[123],"under":[125],"considered":[127],"discretizations,":[128],"compared":[142,175],"our":[143,161],"standard":[147],"inverse":[148,153,184],"kinematics":[149,154,185],"approach.":[150],"While":[151],"is":[156],"much":[157],"faster":[158],"when":[159],"successful,":[160],"always":[163],"succeeds":[164],"finding":[166],"or":[169],"reporting":[170],"no":[172],"exists,":[174],"roughly":[178],"70%":[179],"success":[180],"rate":[181],"(when":[187],"exists).":[190]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2025-10-10T00:00:00"}