{"id":"https://openalex.org/W3200142631","doi":"https://doi.org/10.1109/lra.2022.3191939","title":"Optimal Partitioning of Non-Convex Environments for Minimum Turn Coverage Planning","display_name":"Optimal Partitioning of Non-Convex Environments for Minimum Turn Coverage Planning","publication_year":2022,"publication_date":"2022-07-18","ids":{"openalex":"https://openalex.org/W3200142631","doi":"https://doi.org/10.1109/lra.2022.3191939","mag":"3200142631"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2022.3191939","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2022.3191939","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-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/A5060191157","display_name":"Megnath Ramesh","orcid":"https://orcid.org/0000-0002-8676-9296"},"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":false,"raw_author_name":"Megnath Ramesh","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada"],"raw_orcid":"https://orcid.org/0000-0002-8676-9296","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001134058","display_name":"Frank Imeson","orcid":"https://orcid.org/0000-0002-4399-2172"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Frank Imeson","raw_affiliation_strings":["Avidbots Corp., Kitchener, ON, Canada"],"raw_orcid":"https://orcid.org/0000-0002-4399-2172","affiliations":[{"raw_affiliation_string":"Avidbots Corp., Kitchener, ON, Canada","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001551882","display_name":"Bar\u0131\u015f Fi\u0307dan","orcid":"https://orcid.org/0000-0002-5333-0201"},"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":false,"raw_author_name":"Baris Fidan","raw_affiliation_strings":["Department of Mechanical and Mechatronics Engineering, University of Waterloo, Waterloo, ON, Canada"],"raw_orcid":"https://orcid.org/0000-0002-5333-0201","affiliations":[{"raw_affiliation_string":"Department of Mechanical and Mechatronics 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":[{"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":false,"raw_author_name":"Stephen L. Smith","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada"],"raw_orcid":"https://orcid.org/0000-0002-8636-407X","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3353,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.89541983,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"7","issue":"4","first_page":"9731","last_page":"9738"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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.9991000294685364,"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/T10653","display_name":"Robot Manipulation and Learning","score":0.995199978351593,"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/heuristics","display_name":"Heuristics","score":0.8181024789810181},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5852847099304199},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5346013903617859},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5286536812782288},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5051961541175842},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4940643608570099},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4751070439815521},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46546176075935364},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.4347779154777527},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3714676797389984},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3185967206954956},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24391263723373413}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8181024789810181},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5852847099304199},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5346013903617859},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5286536812782288},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5051961541175842},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4940643608570099},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4751070439815521},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46546176075935364},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.4347779154777527},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3714676797389984},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3185967206954956},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24391263723373413},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/lra.2022.3191939","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2022.3191939","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W86044744","https://openalex.org/W1484555300","https://openalex.org/W1517470327","https://openalex.org/W1535557537","https://openalex.org/W1590932131","https://openalex.org/W1702514015","https://openalex.org/W1873425142","https://openalex.org/W1968143987","https://openalex.org/W1999016010","https://openalex.org/W2000366535","https://openalex.org/W2000889179","https://openalex.org/W2012084603","https://openalex.org/W2019738489","https://openalex.org/W2080197990","https://openalex.org/W2159017378","https://openalex.org/W2283031475","https://openalex.org/W2308030640","https://openalex.org/W2553326346","https://openalex.org/W2611147814","https://openalex.org/W2614564353","https://openalex.org/W2798566347","https://openalex.org/W2892049203","https://openalex.org/W2956901944","https://openalex.org/W2967496134","https://openalex.org/W2968535582","https://openalex.org/W3000637312","https://openalex.org/W3003308247","https://openalex.org/W3004187019","https://openalex.org/W3009674568","https://openalex.org/W3044306737","https://openalex.org/W3047628358","https://openalex.org/W3111602004","https://openalex.org/W3120826121","https://openalex.org/W3126413449","https://openalex.org/W3128433320","https://openalex.org/W3138591890"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W2061353171","https://openalex.org/W4290885807","https://openalex.org/W3153687528","https://openalex.org/W4287212971","https://openalex.org/W2950871975","https://openalex.org/W2571516991","https://openalex.org/W2103498863","https://openalex.org/W2794564760","https://openalex.org/W3040895870"],"abstract_inverted_index":{"In":[0,93],"this":[1,94,121],"letter,":[2],"we":[3,96],"tackle":[4],"the":[5,26,30,33,53,59,105,114,131,144,161],"problem":[6,77],"of":[7,36,61,78,108,140,155],"planning":[8,101],"an":[9],"optimal":[10,106],"coverage":[11,80,100,111,150,165],"path":[12,27],"for":[13,113,152],"a":[14,98,124,153],"robot":[15,54],"operating":[16],"indoors.":[17],"Many":[18],"existing":[19],"approaches":[20],"attempt":[21],"to":[22,143],"discourage":[23],"turns":[24],"in":[25,116],"by":[28,122],"covering":[29],"environment":[31,115,132],"along":[32],"least":[34],"number":[35,107],"<italic":[37,135],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[38,136],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">coverage":[39],"lines</i>":[40],",":[41],"i.e.,":[42],"straight-line":[43],"paths.":[44],"This":[45],"is":[46,83],"because":[47],"turning":[48],"not":[49,90],"only":[50],"slows":[51],"down":[52],"but":[55],"also":[56],"negatively":[57],"affects":[58],"quality":[60],"coverage,":[62],"e.g.,":[63],"tools":[64],"like":[65],"cameras":[66],"and":[67,159],"cleaning":[68],"attachments":[69],"commonly":[70],"have":[71],"poor":[72],"performance":[73],"around":[74],"turns.":[75],"The":[76],"minimizing":[79],"lines":[81,112],"however":[82],"typically":[84],"solved":[85],"using":[86],"heuristics":[87],"that":[88,103,128],"do":[89,120],"guarantee":[91],"optimality.":[92],"work,":[95],"propose":[97],"turn-minimizing":[99],"method":[102],"computes":[104],"axis-parallel":[109,134],"(horizontal/vertical)":[110],"polynomial":[117],"time.":[118],"We":[119,147],"formulating":[123],"linear":[125],"program":[126],"(LP)":[127],"optimally":[129],"partitions":[130],"into":[133],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">ranks</i>":[137],"(non-intersecting":[138],"rectangles":[139],"width":[141],"equal":[142],"tool":[145],"width).":[146],"then":[148],"generate":[149],"paths":[151],"set":[154],"real-world":[156],"indoor":[157],"environments":[158],"compare":[160],"results":[162],"with":[163],"state-of-the-art":[164],"approaches.":[166]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}