{"id":"https://openalex.org/W4416749523","doi":"https://doi.org/10.1109/iros60139.2025.11246799","title":"Sampling-Based Path Planning for Tethered Robot Chains","display_name":"Sampling-Based Path Planning for Tethered Robot Chains","publication_year":2025,"publication_date":"2025-10-19","ids":{"openalex":"https://openalex.org/W4416749523","doi":"https://doi.org/10.1109/iros60139.2025.11246799"},"language":null,"primary_location":{"id":"doi:10.1109/iros60139.2025.11246799","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11246799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5085737081","display_name":"Zeyuan Jin","orcid":"https://orcid.org/0000-0003-1434-4886"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zeyuan Jin","raw_affiliation_strings":["Independent Researchers, Previously Affiliated With Arizona State University,Tempe,AZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Independent Researchers, Previously Affiliated With Arizona State University,Tempe,AZ","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085715540","display_name":"Xingjian Xue","orcid":"https://orcid.org/0000-0003-4704-4927"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xingjian Xue","raw_affiliation_strings":["Northeastern University,Boston,MA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University,Boston,MA,USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Josh Stoffel","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Josh Stoffel","raw_affiliation_strings":["Independent Researchers, Previously Affiliated With Arizona State University,Tempe,AZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Independent Researchers, Previously Affiliated With Arizona State University,Tempe,AZ","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011843629","display_name":"Sze Zheng Yong","orcid":"https://orcid.org/0000-0002-2104-3128"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sze Zheng Yong","raw_affiliation_strings":["Northeastern University,Boston,MA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University,Boston,MA,USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.42494307,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"12420","last_page":"12427"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.8190000057220459,"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.8190000057220459,"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/T12288","display_name":"Optimization and Search Problems","score":0.04149999842047691,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.036400001496076584,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/bottleneck","display_name":"Bottleneck","score":0.8122000098228455},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.732200026512146},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7074999809265137},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.680899977684021},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6251000165939331},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.524399995803833},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.489300012588501},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.4041000008583069}],"concepts":[{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.8122000098228455},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.732200026512146},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7074999809265137},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.680899977684021},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6251000165939331},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5889999866485596},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.524399995803833},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.489300012588501},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4672999978065491},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4505999982357025},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.4041000008583069},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.3971000015735626},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.38690000772476196},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.385699987411499},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.36000001430511475},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.32580000162124634},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.2971000075340271},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.2549000084400177},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros60139.2025.11246799","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11246799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W138882551","https://openalex.org/W1971086298","https://openalex.org/W2001478433","https://openalex.org/W2043640786","https://openalex.org/W2069965629","https://openalex.org/W2100672260","https://openalex.org/W2104314621","https://openalex.org/W2122841674","https://openalex.org/W2143747168","https://openalex.org/W2218961386","https://openalex.org/W3004407706","https://openalex.org/W3089888669","https://openalex.org/W3091295346","https://openalex.org/W3133726103","https://openalex.org/W4313406104","https://openalex.org/W4401415978"],"related_works":[],"abstract_inverted_index":{"Motivated":[0],"by":[1,42,56],"human-chains":[2],"in":[3,24,133],"rescue":[4],"missions,":[5],"this":[6],"paper":[7],"proposes":[8],"a":[9,25,87],"scalable":[10],"path":[11,96,124],"planning":[12,97],"algorithm":[13],"for":[14,37,69,99],"multiple":[15],"mobile":[16],"robots":[17],"that":[18,49,63,78],"are":[19,82,92],"tethered":[20,100],"to":[21,76],"one":[22],"another":[23],"chain":[26],"topology":[27],"with":[28,65],"finite-length":[29],"tethers.":[30],"Specifically,":[31],"our":[32,131],"approach":[33,132],"trades":[34],"off":[35],"optimality":[36],"scalability":[38],"and":[39,111,126],"computational":[40],"tractability":[41],"adding":[43],"some":[44],"simplifying,":[45],"yet":[46],"realistic":[47],"constraints":[48],"can":[50],"significantly":[51],"reduce":[52],"computation.":[53],"In":[54],"particular,":[55],"maintaining":[57],"the":[58,70,74,79,90,116,120,128],"existence":[59],"of":[60,119,130],"tether":[61,80],"configurations":[62,81],"coincide":[64],"collision-free,":[66,83],"feasible":[67],"paths":[68],"robots,":[71],"we":[72,114],"remove":[73],"need":[75],"check":[77],"which":[84],"is":[85],"often":[86],"bottleneck":[88],"since":[89],"tethers":[91],"infinite-dimensional.":[93],"Our":[94],"proposed":[95],"framework":[98],"robot":[101],"chains":[102],"builds":[103],"upon":[104],"sampling-based":[105],"algorithms":[106],"such":[107],"as":[108],"RRT*,":[109],"BIT*,":[110],"ABIT*.":[112],"Finally,":[113],"prove":[115],"probabilistic":[117],"completeness":[118],"approach,":[121],"ensuring":[122],"reliable":[123],"generation,":[125],"demonstrate":[127],"effectiveness":[129],"simulation":[134],"experiments.":[135]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-28T00:00:00"}