{"id":"https://openalex.org/W4416749032","doi":"https://doi.org/10.1109/iros60139.2025.11246957","title":"WiTAH A*: Winding-Constrained Anytime Heuristic Search for a Pair of Tethered Robots","display_name":"WiTAH A*: Winding-Constrained Anytime Heuristic Search for a Pair of Tethered Robots","publication_year":2025,"publication_date":"2025-10-19","ids":{"openalex":"https://openalex.org/W4416749032","doi":"https://doi.org/10.1109/iros60139.2025.11246957"},"language":null,"primary_location":{"id":"doi:10.1109/iros60139.2025.11246957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11246957","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/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,Department of Mechanical and Industrial Engineering,Boston,MA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University,Department of Mechanical and Industrial Engineering,Boston,MA,USA","institution_ids":["https://openalex.org/I12912129"]}]},{"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,Department of Mechanical and Industrial Engineering,Boston,MA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University,Department of Mechanical and Industrial Engineering,Boston,MA,USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.42389738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"14132","last_page":"14139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.6245999932289124,"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.6245999932289124,"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.10620000213384628,"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.0681999996304512,"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/robot","display_name":"Robot","score":0.5604000091552734},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5519000291824341},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5501999855041504},{"id":"https://openalex.org/keywords/tangent","display_name":"Tangent","score":0.4410000145435333},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.43849998712539673},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.41519999504089355},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.37940001487731934},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.3700999915599823}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5604000091552734},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5519000291824341},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5501999855041504},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4948999881744385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47189998626708984},{"id":"https://openalex.org/C138187205","wikidata":"https://www.wikidata.org/wiki/Q131251","display_name":"Tangent","level":2,"score":0.4410000145435333},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.43849998712539673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42669999599456787},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.41519999504089355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3813000023365021},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.37940001487731934},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.3700999915599823},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3643999993801117},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.3628000020980835},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3276999890804291},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.2957000136375427},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.2809000015258789},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.2759999930858612},{"id":"https://openalex.org/C2988037039","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Meta heuristic","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.26100000739097595},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros60139.2025.11246957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11246957","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1605811565","https://openalex.org/W1622225657","https://openalex.org/W1980644536","https://openalex.org/W1996183429","https://openalex.org/W2003522422","https://openalex.org/W2017872311","https://openalex.org/W2025677780","https://openalex.org/W2069965629","https://openalex.org/W2091701965","https://openalex.org/W2118750611","https://openalex.org/W2218961386","https://openalex.org/W2467774239","https://openalex.org/W2577017106","https://openalex.org/W2898729409","https://openalex.org/W2946414660","https://openalex.org/W3089888669","https://openalex.org/W3091295346","https://openalex.org/W4288391271","https://openalex.org/W4366504052","https://openalex.org/W4401415978","https://openalex.org/W4405785621"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,83],"propose":[4],"a":[5,15,32,45,76],"variant":[6],"of":[7,34,89,104],"the":[8,23,27,69,85,90,94,105],"anytime":[9,56,100],"hybrid":[10],"A*":[11,57],"algorithm":[12,43,91,107],"that":[13,75],"generates":[14],"fast":[16],"but":[17],"suboptimal":[18],"solution":[19],"before":[20],"progressively":[21],"optimizing":[22],"paths":[24,30,97],"to":[25,67,73],"find":[26],"shortest":[28,95],"winding-constrained":[29,96],"for":[31,92],"pair":[33],"tethered":[35],"robots":[36],"under":[37],"curvature":[38],"constraints.":[39],"Specifically,":[40],"our":[41],"proposed":[42,106],"uses":[44],"tangent":[46],"graph":[47,52],"as":[48],"its":[49],"underlying":[50],"search":[51,58],"and":[53,72,87],"leverages":[54],"an":[55,99],"framework":[59],"with":[60],"appropriately":[61],"defined":[62],"cost":[63],"metrics":[64],"in":[65,98],"order":[66],"reduce":[68],"overall":[70],"computation":[71],"ensure":[74],"winding":[77],"angle":[78],"constraint":[79],"is":[80,108],"satisfied.":[81],"Moreover,":[82],"prove":[84],"completeness":[86],"optimality":[88],"finding":[93],"fashion.":[101],"The":[102],"effectiveness":[103],"demonstrated":[109],"via":[110],"simulation":[111],"experiments.":[112]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-28T00:00:00"}