{"id":"https://openalex.org/W4404100954","doi":"https://doi.org/10.1109/tro.2024.3492386","title":"Topo-Geometrically Distinct Path Computation Using Neighborhood-Augmented Graph, and Its Application to Path Planning for a Tethered Robot in 3-D","display_name":"Topo-Geometrically Distinct Path Computation Using Neighborhood-Augmented Graph, and Its Application to Path Planning for a Tethered Robot in 3-D","publication_year":2024,"publication_date":"2024-11-06","ids":{"openalex":"https://openalex.org/W4404100954","doi":"https://doi.org/10.1109/tro.2024.3492386"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2024.3492386","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tro.2024.3492386","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1109/tro.2024.3492386","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033598257","display_name":"Alp Sahin","orcid":"https://orcid.org/0000-0002-1111-5386"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alp Sahin","raw_affiliation_strings":["Department of Mechanical Engineering and Mechanics, Lehigh University, Bethlehem, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering and Mechanics, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101463763","display_name":"Subhrajit Bhattacharya","orcid":"https://orcid.org/0000-0001-9139-054X"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhrajit Bhattacharya","raw_affiliation_strings":["Department of Mechanical Engineering and Mechanics, Lehigh University, Bethlehem, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering and Mechanics, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033598257"],"corresponding_institution_ids":["https://openalex.org/I186143895"],"apc_list":null,"apc_paid":null,"fwci":0.9971,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.77958804,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"41","issue":null,"first_page":"20","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9987999796867371,"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.9987999796867371,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11106","display_name":"Data Management and Algorithms","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.7630148530006409},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6666985750198364},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6311426162719727},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6000862717628479},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5949486494064331},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5820549726486206},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5088234543800354},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4877975285053253},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4211477041244507},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34358304738998413},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2962844967842102}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7630148530006409},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6666985750198364},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6311426162719727},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6000862717628479},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5949486494064331},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5820549726486206},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5088234543800354},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4877975285053253},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4211477041244507},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34358304738998413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2962844967842102},{"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":[{"id":"doi:10.1109/tro.2024.3492386","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tro.2024.3492386","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1109/tro.2024.3492386","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tro.2024.3492386","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W1584534477","https://openalex.org/W1591987192","https://openalex.org/W1837811515","https://openalex.org/W1935926926","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1976930960","https://openalex.org/W1992787855","https://openalex.org/W1999071165","https://openalex.org/W2000359213","https://openalex.org/W2006104867","https://openalex.org/W2069965629","https://openalex.org/W2078765782","https://openalex.org/W2092876423","https://openalex.org/W2104314621","https://openalex.org/W2110762409","https://openalex.org/W2117828438","https://openalex.org/W2128990851","https://openalex.org/W2161473822","https://openalex.org/W2162991084","https://openalex.org/W2169528473","https://openalex.org/W2171496510","https://openalex.org/W2214613866","https://openalex.org/W2218961386","https://openalex.org/W2411321320","https://openalex.org/W2482392012","https://openalex.org/W2600080636","https://openalex.org/W2738685171","https://openalex.org/W2741438308","https://openalex.org/W2790743156","https://openalex.org/W2963700156","https://openalex.org/W2965865771","https://openalex.org/W2997947190","https://openalex.org/W3004407706","https://openalex.org/W3022573402","https://openalex.org/W3043921574","https://openalex.org/W3089888669","https://openalex.org/W3149042249","https://openalex.org/W3159537771","https://openalex.org/W3162628365","https://openalex.org/W4200605189","https://openalex.org/W4206033904","https://openalex.org/W4250200009","https://openalex.org/W4366504052","https://openalex.org/W4383720954","https://openalex.org/W4401417118","https://openalex.org/W6681425221"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W1904098742","https://openalex.org/W2908094156","https://openalex.org/W3158921809","https://openalex.org/W1980828932","https://openalex.org/W2389896347","https://openalex.org/W2359600231","https://openalex.org/W1987886368","https://openalex.org/W1660309994"],"abstract_inverted_index":{"Many":[0],"robotics":[1],"applications":[2],"benefit":[3],"from":[4],"being":[5],"able":[6],"to":[7,20,51,62,77,122,149],"compute":[8,27,78,99],"multiple":[9,100],"geodesic":[10,83,137],"paths":[11,29,84,102,118,138,153],"in":[12,30,46,68,158],"a":[13,89,155],"given":[14],"configuration":[15],"space.":[16],"Existing":[17],"paradigm":[18],"is":[19],"use":[21],"topological":[22,32,124],"path":[23],"planning,":[24],"which":[25,42,94],"can":[26,98],"optimal":[28,101],"distinct":[31,54,123],"classes.":[33],"However,":[34],"these":[35],"methods":[36],"usually":[37],"require":[38,111],"nontrivial":[39],"geometric":[40,113],"constructions,":[41,114],"are":[43,49,59,104,119,139],"prohibitively":[44],"expensive":[45],"3-D,":[47],"and":[48,115,134],"unable":[50],"distinguish":[52],"between":[53,136],"topologically":[55],"equivalent":[56],"geodesics":[57],"that":[58,103],"created":[60],"due":[61],"high-cost/curvature":[63],"regions":[64],"or":[65],"prismatic":[66],"obstacles":[67],"3-D.":[69],"In":[70],"this":[71],"article,":[72],"we":[73],"propose":[74],"an":[75],"approach":[76,108],"<inline-formula":[79],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[80],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex-math":[81],"notation=\"LaTeX\">$k$</tex-math></inline-formula>":[82],"using":[85],"the":[86,116,127,144],"concept":[87],"of":[88,140,146],"novel":[90],"neighborhood-augmented":[91],"graph,":[92],"on":[93],"graph":[95],"search":[96],"algorithms":[97],"topo-geometrically":[105],"distinct.":[106],"Our":[107],"does":[109],"not":[110,120],"complex":[112],"resulting":[117],"restricted":[121],"classes,":[125],"making":[126],"algorithm":[128,148],"suitable":[129],"for":[130,154],"problems":[131],"where":[132],"finding":[133],"distinguishing":[135],"interest.":[141],"We":[142],"demonstrate":[143],"application":[145],"our":[147],"planning":[150],"shortest":[151],"traversible":[152],"tethered":[156],"robot":[157],"3-D":[159],"with":[160],"cable-length":[161],"constraint.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}