{"id":"https://openalex.org/W3109989819","doi":"https://doi.org/10.1109/icca51439.2020.9264472","title":"Multi-Regional Coverage Path Planning for Robots with Energy Constraint","display_name":"Multi-Regional Coverage Path Planning for Robots with Energy Constraint","publication_year":2020,"publication_date":"2020-10-09","ids":{"openalex":"https://openalex.org/W3109989819","doi":"https://doi.org/10.1109/icca51439.2020.9264472","mag":"3109989819"},"language":"en","primary_location":{"id":"doi:10.1109/icca51439.2020.9264472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icca51439.2020.9264472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 16th International Conference on Control & Automation (ICCA)","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/A5063416695","display_name":"Junfei Xie","orcid":"https://orcid.org/0000-0001-7406-3221"},"institutions":[{"id":"https://openalex.org/I26538001","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42","country_code":"US","type":"education","lineage":["https://openalex.org/I26538001"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Junfei Xie","raw_affiliation_strings":["Department of Electrical and Computer Engineering, San Diego State University, San Diego, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, San Diego State University, San Diego, CA","institution_ids":["https://openalex.org/I26538001"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101920273","display_name":"Jun Chen","orcid":"https://orcid.org/0000-0003-2591-9585"},"institutions":[{"id":"https://openalex.org/I26538001","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42","country_code":"US","type":"education","lineage":["https://openalex.org/I26538001"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jun Chen","raw_affiliation_strings":["Department of Aerospace Engineering, San Diego State University, San Diego, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering, San Diego State University, San Diego, CA","institution_ids":["https://openalex.org/I26538001"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I26538001"],"apc_list":null,"apc_paid":null,"fwci":0.2563,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.58539775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1372","last_page":"1377"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9828000068664551,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6980571746826172},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6638653874397278},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6367085576057434},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6243932843208313},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5795500874519348},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.567043125629425},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5612218379974365},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4848431348800659},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4418233036994934},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42459139227867126},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.41486966609954834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2433612048625946},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1845453679561615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15336361527442932}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6980571746826172},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6638653874397278},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6367085576057434},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6243932843208313},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5795500874519348},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.567043125629425},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5612218379974365},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4848431348800659},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4418233036994934},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42459139227867126},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.41486966609954834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2433612048625946},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1845453679561615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15336361527442932},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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/icca51439.2020.9264472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icca51439.2020.9264472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 16th International Conference on Control & Automation (ICCA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W187767610","https://openalex.org/W1824657313","https://openalex.org/W1968594877","https://openalex.org/W1991901901","https://openalex.org/W2019738489","https://openalex.org/W2029242918","https://openalex.org/W2037332764","https://openalex.org/W2040872506","https://openalex.org/W2046419297","https://openalex.org/W2057025928","https://openalex.org/W2115772460","https://openalex.org/W2125334953","https://openalex.org/W2136454334","https://openalex.org/W2137363349","https://openalex.org/W2530592706","https://openalex.org/W2742700879","https://openalex.org/W2788813553","https://openalex.org/W2811185140","https://openalex.org/W2891973815","https://openalex.org/W2909399037","https://openalex.org/W2944433607","https://openalex.org/W3011231347","https://openalex.org/W3034486736","https://openalex.org/W6607571859","https://openalex.org/W6638373262"],"related_works":["https://openalex.org/W4297427155","https://openalex.org/W2975368677","https://openalex.org/W3025823153","https://openalex.org/W3136451934","https://openalex.org/W3200006077","https://openalex.org/W2170228269","https://openalex.org/W2592478754","https://openalex.org/W2189435634","https://openalex.org/W4301419164","https://openalex.org/W2055574289"],"abstract_inverted_index":{"Coverage":[0],"path":[1],"planning":[2],"(CPP)":[3],"has":[4,43,101],"been":[5],"extensively":[6],"studied":[7],"in":[8,50,131],"the":[9,65,84,90,94,97,116,124,128],"literature,":[10],"which":[11,48],"is":[12,112],"a":[13,25,62,106],"key":[14],"step":[15],"to":[16,87,114],"realize":[17],"robotic":[18],"applications":[19],"that":[20],"require":[21],"complete":[22],"coverage":[23],"of":[24,64,93,127],"region,":[26],"such":[27],"as":[28,61],"lawn":[29],"mowing,":[30],"room":[31],"cleaning,":[32],"land":[33],"assessment,":[34],"search":[35],"and":[36,120,134],"rescue.":[37],"However,":[38],"CPP":[39,56],"for":[40],"multiple":[41],"regions":[42],"gained":[44],"much":[45],"less":[46],"attention,":[47],"arises":[49],"many":[51],"real":[52],"scenarios.":[53],"This":[54],"multiregional":[55],"problem":[57,68,86,100],"can":[58],"be":[59],"considered":[60],"variant":[63],"traveling":[66],"salesman":[67],"(TSP)":[69],"enhanced":[70],"with":[71],"CPP,":[72],"namely":[73],"TSP-CPP.":[74],"In":[75],"this":[76],"paper,":[77],"we":[78],"extend":[79],"our":[80],"previous":[81],"investigation":[82],"on":[83],"TSP-CPP":[85,99],"further":[88],"consider":[89],"energy":[91],"constraint":[92],"robots.":[95],"As":[96],"constrained":[98],"an":[102],"NP-Hard":[103],"computational":[104],"complexity,":[105],"stepwise":[107],"selection":[108],"based":[109],"heuristic":[110],"algorithm":[111,130],"developed":[113],"solve":[115],"problem.":[117],"Simulation":[118],"experiments":[119],"comparison":[121],"studies":[122],"show":[123],"good":[125],"performance":[126],"proposed":[129],"balancing":[132],"optimality":[133],"efficiency.":[135]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}