{"id":"https://openalex.org/W2774251627","doi":"https://doi.org/10.1109/iros.2017.8206451","title":"Semi-boustrophedon coverage with a dubins vehicle","display_name":"Semi-boustrophedon coverage with a dubins vehicle","publication_year":2017,"publication_date":"2017-09-01","ids":{"openalex":"https://openalex.org/W2774251627","doi":"https://doi.org/10.1109/iros.2017.8206451","mag":"2774251627"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2017.8206451","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2017.8206451","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5016429655","display_name":"Jeremy Lewis","orcid":"https://orcid.org/0000-0001-7870-9165"},"institutions":[{"id":"https://openalex.org/I155781252","display_name":"University of South Carolina","ror":"https://ror.org/02b6qw903","country_code":"US","type":"education","lineage":["https://openalex.org/I155781252"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jeremy S. Lewis","raw_affiliation_strings":["Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA","institution_ids":["https://openalex.org/I155781252"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036410066","display_name":"W. G. Edwards","orcid":null},"institutions":[{"id":"https://openalex.org/I155781252","display_name":"University of South Carolina","ror":"https://ror.org/02b6qw903","country_code":"US","type":"education","lineage":["https://openalex.org/I155781252"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William Edwards","raw_affiliation_strings":["Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA","institution_ids":["https://openalex.org/I155781252"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016423805","display_name":"Kelly Benson","orcid":null},"institutions":[{"id":"https://openalex.org/I155781252","display_name":"University of South Carolina","ror":"https://ror.org/02b6qw903","country_code":"US","type":"education","lineage":["https://openalex.org/I155781252"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kelly Benson","raw_affiliation_strings":["Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA","institution_ids":["https://openalex.org/I155781252"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088614516","display_name":"Ioannis Rekleitis","orcid":"https://orcid.org/0000-0002-0655-224X"},"institutions":[{"id":"https://openalex.org/I155781252","display_name":"University of South Carolina","ror":"https://ror.org/02b6qw903","country_code":"US","type":"education","lineage":["https://openalex.org/I155781252"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ioannis Rekleitis","raw_affiliation_strings":["Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA","institution_ids":["https://openalex.org/I155781252"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089976123","display_name":"Jason M. O\u2019Kane","orcid":"https://orcid.org/0000-0002-1536-4822"},"institutions":[{"id":"https://openalex.org/I155781252","display_name":"University of South Carolina","ror":"https://ror.org/02b6qw903","country_code":"US","type":"education","lineage":["https://openalex.org/I155781252"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jason M. O'Kane","raw_affiliation_strings":["Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA","institution_ids":["https://openalex.org/I155781252"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5016429655"],"corresponding_institution_ids":["https://openalex.org/I155781252"],"apc_list":null,"apc_paid":null,"fwci":0.9249,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.84500952,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"5630","last_page":"5637"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9797000288963318,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9663000106811523,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7268114686012268},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.7009303569793701},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6955372095108032},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6393957138061523},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6044650673866272},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5764343738555908},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5325198769569397},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5268346667289734},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4298490881919861},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.4209977686405182},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.41487917304039},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3388667702674866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3313477039337158},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1240060031414032},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12086525559425354},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.08705592155456543}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7268114686012268},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7009303569793701},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6955372095108032},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6393957138061523},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6044650673866272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5764343738555908},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5325198769569397},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5268346667289734},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4298490881919861},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4209977686405182},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.41487917304039},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3388667702674866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3313477039337158},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1240060031414032},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12086525559425354},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.08705592155456543},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2017.8206451","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2017.8206451","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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":26,"referenced_works":["https://openalex.org/W1517470327","https://openalex.org/W1544032329","https://openalex.org/W1672203963","https://openalex.org/W1970071808","https://openalex.org/W2000296729","https://openalex.org/W2011039300","https://openalex.org/W2018275663","https://openalex.org/W2019738489","https://openalex.org/W2055569927","https://openalex.org/W2066194644","https://openalex.org/W2076406387","https://openalex.org/W2093385687","https://openalex.org/W2103296723","https://openalex.org/W2104642742","https://openalex.org/W2108154659","https://openalex.org/W2130706967","https://openalex.org/W2159017378","https://openalex.org/W2171977020","https://openalex.org/W2285629142","https://openalex.org/W2287598468","https://openalex.org/W2313274380","https://openalex.org/W2990036179","https://openalex.org/W3083648773","https://openalex.org/W6675343733","https://openalex.org/W6696598765","https://openalex.org/W6770691134"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2359992618","https://openalex.org/W4376138746","https://openalex.org/W2362402143","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2308371765","https://openalex.org/W2171568915","https://openalex.org/W2265604726","https://openalex.org/W1183061632"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,71,93],"problem":[4,36,41],"of":[5,17,82],"generating":[6,61],"coverage":[7,35,64,84],"paths-that":[8],"is,":[9],"paths":[10,99],"that":[11,32,60,92],"pass":[12],"within":[13],"some":[14],"sensor":[15],"footprint":[16],"every":[18],"point":[19],"in":[20,103],"an":[21,62],"environment-for":[22],"vehicles":[23],"with":[24],"Dubins":[25,83],"motion":[26],"constraints.":[27],"We":[28],"extend":[29],"previous":[30],"work":[31],"solves":[33],"this":[34],"as":[37],"a":[38,45],"traveling":[39],"salesman":[40],"(TSP)":[42],"by":[43,68],"introducing":[44],"practical":[46],"heuristic":[47],"algorithm":[48,94],"to":[49,86,101],"reduce":[50],"runtime":[51],"while":[52],"maintaining":[53],"near-optimal":[54],"path":[55,65],"length.":[56],"Furthermore,":[57],"we":[58],"show":[59],"optimal":[63,102],"is":[66],"NP-hard":[67],"reducing":[69],"from":[70],"Exact":[72],"Cover":[73],"problem,":[74],"which":[75],"provides":[76],"justification":[77],"for":[78],"our":[79],"algorithm's":[80],"conversion":[81],"instances":[85],"TSP":[87],"instances.":[88],"Extensive":[89],"experiments":[90],"demonstrate":[91],"does":[95],"indeed":[96],"produce":[97],"length":[98],"comparable":[100],"significantly":[104],"less":[105],"time.":[106]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-23T07:41:27.035349","created_date":"2025-10-10T00:00:00"}