{"id":"https://openalex.org/W2553326346","doi":"https://doi.org/10.1109/coase.2016.7743548","title":"On minimizing turns in robot coverage path planning","display_name":"On minimizing turns in robot coverage path planning","publication_year":2016,"publication_date":"2016-08-01","ids":{"openalex":"https://openalex.org/W2553326346","doi":"https://doi.org/10.1109/coase.2016.7743548","mag":"2553326346"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2016.7743548","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2016.7743548","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Automation Science and Engineering (CASE)","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/A5055044183","display_name":"Stanislav Bochkarev","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Stanislav Bochkarev","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103134580","display_name":"Stephen L. Smith","orcid":"https://orcid.org/0000-0002-8636-407X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stephen L. Smith","raw_affiliation_strings":["University of Waterloo, Waterloo, ON, CA"],"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, ON, CA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055044183"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":3.8411,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.9591186,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1237","last_page":"1242"},"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.908024787902832},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.7598571181297302},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6892455816268921},{"id":"https://openalex.org/keywords/convex-polygon","display_name":"Convex polygon","score":0.632901668548584},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6318396925926208},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6223059892654419},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5746744871139526},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.540132999420166},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4744590222835541},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43406134843826294},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24269312620162964},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22360047698020935},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09481638669967651}],"concepts":[{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.908024787902832},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7598571181297302},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6892455816268921},{"id":"https://openalex.org/C2780034980","wikidata":"https://www.wikidata.org/wiki/Q3259505","display_name":"Convex polygon","level":3,"score":0.632901668548584},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6318396925926208},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6223059892654419},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5746744871139526},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.540132999420166},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4744590222835541},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43406134843826294},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24269312620162964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22360047698020935},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09481638669967651},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"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/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/coase.2016.7743548","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2016.7743548","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W171569338","https://openalex.org/W1535557537","https://openalex.org/W1549307772","https://openalex.org/W1566622904","https://openalex.org/W1590932131","https://openalex.org/W1625747805","https://openalex.org/W1970071808","https://openalex.org/W1970499532","https://openalex.org/W1993336589","https://openalex.org/W2017708378","https://openalex.org/W2019738489","https://openalex.org/W2025161487","https://openalex.org/W2030902651","https://openalex.org/W2076406387","https://openalex.org/W2095511177","https://openalex.org/W2099114258","https://openalex.org/W2107712101","https://openalex.org/W2108154659","https://openalex.org/W2114531006","https://openalex.org/W2123325526","https://openalex.org/W2130706967","https://openalex.org/W2162734360","https://openalex.org/W3083648773"],"related_works":["https://openalex.org/W2053943947","https://openalex.org/W4313269929","https://openalex.org/W2091897099","https://openalex.org/W4240339429","https://openalex.org/W2088889931","https://openalex.org/W2154141401","https://openalex.org/W2314484939","https://openalex.org/W2013545179","https://openalex.org/W1585992543","https://openalex.org/W2215744270"],"abstract_inverted_index":{"In":[0,23],"this":[1,109],"paper":[2],"we":[3,45,81,107,121],"study":[4],"sweep":[5],"coverage":[6,25,36,124,169],"path":[7,125,170],"planning,":[8],"in":[9,17,134,160,166],"which":[10,60,157],"a":[11,18,56,78,83,105,123,140],"robot":[12,40],"must":[13],"cover":[14,73],"all":[15],"points":[16],"workspace":[19,128],"with":[20,38,155],"its":[21],"footprint.":[22],"many":[24],"applications,":[26],"including":[27],"cleaning":[28],"and":[29,68,114,137,171],"monitoring,":[30],"it":[31],"is":[32],"beneficial":[33],"to":[34,50,72,85,111],"use":[35],"paths":[37],"minimal":[39],"turns.":[41],"To":[42],"address":[43],"this,":[44],"provide":[46,82],"an":[47,100],"efficient":[48],"method":[49,84,110],"compute":[51,122],"the":[52,62,74,87,94,118,127,143,162,167],"minimum":[53,146],"altitude":[54],"of":[55,64,96,104,117,126,142,145,164],"non-convex":[57,79],"polygonal":[58],"region,":[59,136],"captures":[61],"number":[63,163],"parallel":[65,131],"line":[66,132],"segments,":[67],"thus":[69],"turns,":[70],"needed":[71],"region.":[75],"Then,":[76],"given":[77],"polygon,":[80],"cut":[86],"polygon":[88],"into":[89],"two":[90],"pieces":[91],"that":[92],"minimizes":[93],"sum":[95],"their":[97],"altitudes.":[98],"Given":[99],"initial":[101],"convex":[102],"decomposition":[103],"workspace,":[106],"apply":[108],"iteratively":[112],"re-optimize":[113],"delete":[115],"cuts":[116],"decomposition.":[119],"Finally,":[120],"by":[129],"placing":[130],"segments":[133,144],"each":[135],"then":[138],"computing":[139],"tour":[141],"cost.":[147],"We":[148],"present":[149],"simulation":[150],"results":[151],"on":[152],"several":[153],"workspaces":[154],"obstacles,":[156],"demonstrate":[158],"improvements":[159],"both":[161],"turns":[165],"final":[168],"runtime.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}