{"id":"https://openalex.org/W2738685171","doi":"https://doi.org/10.1109/icra.2017.7989349","title":"Planning and executing optimal non-entangling paths for tethered underwater vehicles","display_name":"Planning and executing optimal non-entangling paths for tethered underwater vehicles","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2738685171","doi":"https://doi.org/10.1109/icra.2017.7989349","mag":"2738685171"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2017.7989349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","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/A5062751548","display_name":"Seth McCammon","orcid":"https://orcid.org/0000-0002-9004-989X"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seth McCammon","raw_affiliation_strings":["Robotics Program of the School of Mechanical, Industrial, and Manufacturing Engineering, Oregon State University, Corvallis, OR"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Program of the School of Mechanical, Industrial, and Manufacturing Engineering, Oregon State University, Corvallis, OR","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023976625","display_name":"Geoffrey A. Hollinger","orcid":"https://orcid.org/0000-0001-6502-8950"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Geoffrey A. Hollinger","raw_affiliation_strings":["Robotics Program of the School of Mechanical, Industrial, and Manufacturing Engineering, Oregon State University, Corvallis, OR"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Program of the School of Mechanical, Industrial, and Manufacturing Engineering, Oregon State University, Corvallis, OR","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I131249849"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3040","last_page":"3046"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T11192","display_name":"Underwater Vehicles and Communication Systems","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T12288","display_name":"Optimization and Search Problems","score":0.9927999973297119,"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/computer-science","display_name":"Computer science","score":0.6702882051467896},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6500820517539978},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6456624865531921},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5805870890617371},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5583220720291138},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.5366937518119812},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5212598443031311},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5161622762680054},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5158275961875916},{"id":"https://openalex.org/keywords/underwater","display_name":"Underwater","score":0.5140482187271118},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.5015881061553955},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.4292709529399872},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4283193349838257},{"id":"https://openalex.org/keywords/homotopy","display_name":"Homotopy","score":0.4243742525577545},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4142667353153229},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35221725702285767},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3082573413848877},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2612655758857727},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2036668360233307},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1962757408618927}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6702882051467896},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6500820517539978},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6456624865531921},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5805870890617371},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5583220720291138},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5366937518119812},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5212598443031311},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5161622762680054},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5158275961875916},{"id":"https://openalex.org/C98083399","wikidata":"https://www.wikidata.org/wiki/Q3246517","display_name":"Underwater","level":2,"score":0.5140482187271118},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.5015881061553955},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.4292709529399872},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4283193349838257},{"id":"https://openalex.org/C5961521","wikidata":"https://www.wikidata.org/wiki/Q746083","display_name":"Homotopy","level":2,"score":0.4243742525577545},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4142667353153229},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35221725702285767},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3082573413848877},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2612655758857727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2036668360233307},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1962757408618927},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C111368507","wikidata":"https://www.wikidata.org/wiki/Q43518","display_name":"Oceanography","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","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/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2017.7989349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8100000023841858,"display_name":"Life below water","id":"https://metadata.un.org/sdg/14"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1595895163","https://openalex.org/W1837811515","https://openalex.org/W1971086298","https://openalex.org/W1992787855","https://openalex.org/W2001478433","https://openalex.org/W2024060531","https://openalex.org/W2069965629","https://openalex.org/W2102488278","https://openalex.org/W2106086387","https://openalex.org/W2121683864","https://openalex.org/W2128990851","https://openalex.org/W2171997367","https://openalex.org/W2212622954","https://openalex.org/W2295417718","https://openalex.org/W2563303447","https://openalex.org/W2605662526","https://openalex.org/W6677663079","https://openalex.org/W6697205691","https://openalex.org/W6736193076"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2164188042","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W4232431455"],"abstract_inverted_index":{"In":[0,108],"this":[1],"paper,":[2],"we":[3,31,99],"present":[4],"a":[5,48,61,76,83,109,124,134,142],"method":[6,115,152],"to":[7,56,70,96,104,118,156],"improve":[8],"the":[9,33,43,53,57,88,97],"navigation":[10],"of":[11,42,78,91,111,126,136],"tethered":[12],"underwater":[13,145],"vehicles":[14],"by":[15,59,150],"computing":[16,92],"optimal":[17,54,73,94,120],"paths":[18,122,148],"that":[19],"prevent":[20],"their":[21],"tethers":[22],"from":[23],"becoming":[24],"entangled":[25],"in":[26,133],"obstacles.":[27],"To":[28,86],"accomplish":[29],"this,":[30],"define":[32],"Non-Entangling":[34],"Travelling":[35,44],"Salesperson":[36,45],"Problem":[37,46],"(NE-TSP)":[38],"as":[39],"an":[40,72,93],"extension":[41],"with":[47],"non-entangling":[49,84,121],"constraint.":[50],"We":[51],"compute":[52,105],"solution":[55,95],"NE-TSP":[58],"constructing":[60],"Mixed":[62],"Integer":[63],"Programming":[64],"model,":[65],"leveraging":[66],"homotopy":[67],"augmented":[68],"graphs":[69],"plan":[71,119],"trajectory":[74],"through":[75,123],"set":[77,110,135],"inspection":[79],"points,":[80],"while":[81],"maintaining":[82],"guarantee.":[85],"avoid":[87],"computational":[89],"expense":[90],"NE-TSP,":[98],"also":[100],"introduce":[101],"several":[102],"methods":[103],"near-optimal":[106],"solutions.":[107],"simulated":[112],"trials,":[113],"our":[114,151],"was":[116],"able":[117],"variety":[125],"environments.":[127],"These":[128],"results":[129],"were":[130,153],"then":[131,154],"validated":[132],"pool":[137],"and":[138],"field":[139],"trials":[140],"using":[141],"Seabotix":[143],"vLBV300":[144],"vehicle.":[146],"The":[147],"generated":[149],"compared":[155],"human-generated":[157],"paths.":[158]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}