{"id":"https://openalex.org/W3112423526","doi":"https://doi.org/10.1109/access.2020.3044987","title":"Coverage Path Planning Techniques for Inspection of Disjoint Regions With Precedence Provision","display_name":"Coverage Path Planning Techniques for Inspection of Disjoint Regions With Precedence Provision","publication_year":2020,"publication_date":"2020-12-15","ids":{"openalex":"https://openalex.org/W3112423526","doi":"https://doi.org/10.1109/access.2020.3044987","mag":"3112423526"},"language":"en","primary_location":{"id":"doi:10.1109/access.2020.3044987","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3044987","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/9312710/09294034.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/9312710/09294034.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101758699","display_name":"Zeba Khanam","orcid":"https://orcid.org/0000-0002-2886-683X"},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Zeba Khanam","raw_affiliation_strings":["School of Computer Science and Electronic Engineering (CSEE), University of Essex, Colchester, U.K"],"raw_orcid":"https://orcid.org/0000-0002-2886-683X","affiliations":[{"raw_affiliation_string":"School of Computer Science and Electronic Engineering (CSEE), University of Essex, Colchester, U.K","institution_ids":["https://openalex.org/I110002522"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013456828","display_name":"Sangeet Saha","orcid":"https://orcid.org/0000-0001-6119-4927"},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sangeet Saha","raw_affiliation_strings":["School of Computer Science and Electronic Engineering (CSEE), University of Essex, Colchester, U.K"],"raw_orcid":"https://orcid.org/0000-0001-6119-4927","affiliations":[{"raw_affiliation_string":"School of Computer Science and Electronic Engineering (CSEE), University of Essex, Colchester, U.K","institution_ids":["https://openalex.org/I110002522"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103245109","display_name":"Shoaib Ehsan","orcid":"https://orcid.org/0000-0001-9631-1898"},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Shoaib Ehsan","raw_affiliation_strings":["School of Computer Science and Electronic Engineering (CSEE), University of Essex, Colchester, U.K"],"raw_orcid":"https://orcid.org/0000-0001-9631-1898","affiliations":[{"raw_affiliation_string":"School of Computer Science and Electronic Engineering (CSEE), University of Essex, Colchester, U.K","institution_ids":["https://openalex.org/I110002522"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005183926","display_name":"Rustam Stolkin","orcid":"https://orcid.org/0000-0002-0890-8836"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rustam Stolkin","raw_affiliation_strings":["School of Metallurgy and Materials, University of Birmingham, Birmingham, U.K"],"raw_orcid":"https://orcid.org/0000-0002-0890-8836","affiliations":[{"raw_affiliation_string":"School of Metallurgy and Materials, University of Birmingham, Birmingham, U.K","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077992830","display_name":"Klaus D. McDonald-Maier","orcid":"https://orcid.org/0000-0002-6412-8519"},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Klaus Mcdonald-Maier","raw_affiliation_strings":["School of Computer Science and Electronic Engineering (CSEE), University of Essex, Colchester, U.K"],"raw_orcid":"https://orcid.org/0000-0002-6412-8519","affiliations":[{"raw_affiliation_string":"School of Computer Science and Electronic Engineering (CSEE), University of Essex, Colchester, U.K","institution_ids":["https://openalex.org/I110002522"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.7667,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.74669397,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":null,"first_page":"5412","last_page":"5427"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9922999739646912,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9912999868392944,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7446157336235046},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6829455494880676},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.642086923122406},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6318197250366211},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6112475991249084},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6061134934425354},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5450024008750916},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5082271099090576},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.487138956785202},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4855325222015381},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.43237021565437317},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42556512355804443},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4201938807964325},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.342065691947937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24442341923713684},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19504037499427795},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.17398127913475037},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12307155132293701},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.080473393201828}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7446157336235046},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6829455494880676},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.642086923122406},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6318197250366211},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6112475991249084},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6061134934425354},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5450024008750916},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5082271099090576},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.487138956785202},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4855325222015381},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.43237021565437317},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42556512355804443},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4201938807964325},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.342065691947937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24442341923713684},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19504037499427795},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17398127913475037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12307155132293701},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.080473393201828},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/access.2020.3044987","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3044987","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/9312710/09294034.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:eprints.soton.ac.uk:473497","is_oa":true,"landing_page_url":"http://doi.org/10.1109/ACCESS.2020.3044987>).","pdf_url":"https://eprints.soton.ac.uk/473497/1/Coverage_Path_Planning_Techniques_for_Inspection_of_Disjoint_Regions_With_Precedence_Provision.pdf","source":{"id":"https://openalex.org/S4306401019","display_name":"ePrints Soton (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:repository.essex.ac.uk:29371","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ACCESS.2020.3044987","pdf_url":null,"source":{"id":"https://openalex.org/S4306401236","display_name":"Open Access at Essex (University of Essex)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I110002522","host_organization_name":"University of Essex","host_organization_lineage":["https://openalex.org/I110002522"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:doaj.org/article:c3fecae44239499196f11f113183fb81","is_oa":true,"landing_page_url":"https://doaj.org/article/c3fecae44239499196f11f113183fb81","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 9, Pp 5412-5427 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2020.3044987","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3044987","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/9312710/09294034.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6100000143051147,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G2223601268","display_name":"Robust remote sensing for multi-modal characterisation in nuclear and other extreme environments","funder_award_id":"EP/P017487/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G528393513","display_name":"National Centre for Nuclear Robotics (NCNR)","funder_award_id":"EP/R02572X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6552220756","display_name":null,"funder_award_id":"EP/R02572X","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6685461517","display_name":null,"funder_award_id":"EP/R02572X/1 and EP/P017487/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7795727766","display_name":null,"funder_award_id":"EP/P017487/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3112423526.pdf","grobid_xml":"https://content.openalex.org/works/W3112423526.grobid-xml"},"referenced_works_count":52,"referenced_works":["https://openalex.org/W1544032329","https://openalex.org/W1968384435","https://openalex.org/W1997039203","https://openalex.org/W2002303033","https://openalex.org/W2004464961","https://openalex.org/W2017173351","https://openalex.org/W2019738489","https://openalex.org/W2025161487","https://openalex.org/W2066511933","https://openalex.org/W2091359661","https://openalex.org/W2136454334","https://openalex.org/W2152938561","https://openalex.org/W2166177494","https://openalex.org/W2264174776","https://openalex.org/W2312361439","https://openalex.org/W2313509455","https://openalex.org/W2315770071","https://openalex.org/W2523764602","https://openalex.org/W2559613836","https://openalex.org/W2562251562","https://openalex.org/W2584119522","https://openalex.org/W2597321818","https://openalex.org/W2605937326","https://openalex.org/W2767714156","https://openalex.org/W2772154329","https://openalex.org/W2781841050","https://openalex.org/W2786330942","https://openalex.org/W2790223694","https://openalex.org/W2807177569","https://openalex.org/W2811185140","https://openalex.org/W2883180136","https://openalex.org/W2887254253","https://openalex.org/W2891973815","https://openalex.org/W2892049203","https://openalex.org/W2898358825","https://openalex.org/W2900742918","https://openalex.org/W2902077273","https://openalex.org/W2910850106","https://openalex.org/W2950081984","https://openalex.org/W2968800074","https://openalex.org/W2977741377","https://openalex.org/W2990642629","https://openalex.org/W3000429334","https://openalex.org/W3004647014","https://openalex.org/W3005757297","https://openalex.org/W3011231347","https://openalex.org/W3032586311","https://openalex.org/W4231343630","https://openalex.org/W4232422036","https://openalex.org/W4239052356","https://openalex.org/W6692835593","https://openalex.org/W6773900632"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W4395071568","https://openalex.org/W3139139461","https://openalex.org/W2056737145","https://openalex.org/W4297094037","https://openalex.org/W1660309994"],"abstract_inverted_index":{"Recent":[0],"times":[1],"are":[2,9,82,137],"witnessing":[3],"an":[4],"emergence":[5],"of":[6,41,50,109,115,144,154,174,196,229,233],"sites":[7,43,231],"that":[8],"hazardous":[10,67],"for":[11],"human":[12],"access.":[13],"This":[14],"has":[15,189],"created":[16],"a":[17,33,162,217],"global":[18],"demand":[19],"to":[20,26,46,61,139,146,177,192,227],"equip":[21],"agents":[22,45],"with":[23,237],"the":[24,48,66,90,92,105,110,112,141,150,155,194,197],"ability":[25,173],"autonomously":[27],"inspect":[28],"such":[29,42],"environments":[30],"by":[31],"computing":[32],"coverage":[34,63,78,180],"path":[35,64,79,102,107,152],"effectively":[36],"and":[37,100,133,164,222],"efficiently.":[38],"However,":[39],"inspection":[40,228],"requires":[44],"consider":[47,72],"correlation":[49],"work,":[51],"providing":[52],"precedence":[53,73,86,238],"provision":[54],"in":[55,65,200,220],"visiting":[56],"regions.":[57],"The":[58,172,206,214],"current":[59],"approaches":[60],"compute":[62],"sites,":[68],"however,":[69],"do":[70],"not":[71],"provision.":[74,87,239],"To":[75,88],"this":[76],"end,":[77],"planning":[80,108,153],"strategies":[81],"proposed,":[83],"which":[84,225],"provide":[85,178],"meet":[89],"challenges,":[91],"problem":[93],"is":[94,119,159,167,181,209],"divided":[95],"into":[96,161],"two":[97],"phases:":[98],"inter-region":[99],"intra-region":[101],"planning.":[103],"In":[104,149],"`inter-region'":[106],"approach,":[111,156],"site":[113],"comprising":[114,232],"multiple":[116,234],"disjoint":[117,235],"regions":[118,145,236],"modelled":[120],"as":[121],"connectivity":[122],"graph.":[123],"Two":[124],"novel":[125],"approaches,":[126],"Mixed":[127],"Integer":[128],"Linear":[129],"Programming":[130],"(MILP)":[131],"solution":[132],"heuristic":[134],"based":[135],"techniques,":[136],"proposed":[138,198,207],"generate":[140],"ordered":[142],"sequence":[143],"be":[147],"traversed.":[148],"`intra-region'":[151],"each":[157,170],"region":[158],"decomposed":[160],"grid":[163],"Boustrophedon":[165],"Motion":[166],"planned":[168],"over":[169],"region.":[171],"combined":[175],"approach":[176,199,208],"complete":[179],"proved":[182],"under":[183],"minor":[184],"assumption.":[185],"An":[186],"investigative":[187],"study":[188],"been":[190],"conducted":[191],"elucidate":[193],"efficiency":[195],"different":[201],"scenarios":[202],"using":[203],"simulation":[204],"experiments.":[205],"evaluated":[210],"against":[211],"baseline":[212],"approaches.":[213],"results":[215],"manifest":[216],"significant":[218],"reduction":[219],"cost":[221],"execution":[223],"time,":[224],"caters":[226],"target":[230]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}