{"id":"https://openalex.org/W4387567317","doi":"https://doi.org/10.1109/etfa54631.2023.10275710","title":"A streamlined heuristic for the problem of Min-Time Coverage in Constricted Environments (Extended Abstract)","display_name":"A streamlined heuristic for the problem of Min-Time Coverage in Constricted Environments (Extended Abstract)","publication_year":2023,"publication_date":"2023-09-12","ids":{"openalex":"https://openalex.org/W4387567317","doi":"https://doi.org/10.1109/etfa54631.2023.10275710"},"language":"en","primary_location":{"id":"doi:10.1109/etfa54631.2023.10275710","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/etfa54631.2023.10275710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 28th International Conference on Emerging Technologies and Factory Automation (ETFA)","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/A5102725531","display_name":"Young-In Kim","orcid":"https://orcid.org/0009-0000-7426-5499"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Young-In Kim","raw_affiliation_strings":["Georgia Institute of Technology,School of Industrial & Systems Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology,School of Industrial & Systems Engineering","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008675858","display_name":"Spyros Reveliotis","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Spyros Reveliotis","raw_affiliation_strings":["Georgia Institute of Technology,School of Industrial & Systems Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology,School of Industrial & Systems Engineering","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9997000098228455,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9937000274658203,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9926000237464905,"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/heuristic","display_name":"Heuristic","score":0.7458151578903198},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7172966003417969},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6826491355895996},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6820254921913147},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6686379313468933},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6632663011550903},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5456016063690186},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5431337952613831},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5248820185661316},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33742308616638184},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3256438970565796},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2923269271850586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2221609354019165}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7458151578903198},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7172966003417969},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6826491355895996},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6820254921913147},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6686379313468933},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6632663011550903},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5456016063690186},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5431337952613831},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5248820185661316},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33742308616638184},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3256438970565796},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2923269271850586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2221609354019165},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/etfa54631.2023.10275710","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/etfa54631.2023.10275710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 28th International Conference on Emerging Technologies and Factory Automation (ETFA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W200058615","https://openalex.org/W2106371135","https://openalex.org/W2191404279","https://openalex.org/W2888729493","https://openalex.org/W2894758515","https://openalex.org/W2952408149","https://openalex.org/W2963697709","https://openalex.org/W3120581161","https://openalex.org/W3208388366","https://openalex.org/W4212851288","https://openalex.org/W4235414394","https://openalex.org/W4253331343","https://openalex.org/W4384284032","https://openalex.org/W4385286336","https://openalex.org/W6854372826","https://openalex.org/W6854466839"],"related_works":["https://openalex.org/W2011675579","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W4232431455","https://openalex.org/W2107423006","https://openalex.org/W1581805909"],"abstract_inverted_index":{"The":[0],"problem":[1,76],"of":[2,11,18,34,43,57,74,81,97,110,120,139,149],"min-time":[3],"coverage":[4],"in":[5,26],"constricted":[6,29],"environments":[7],"concerns":[8],"the":[9,16,72,75,82,95,106,118,121,131,150,157],"employment":[10],"networked":[12],"robotic":[13],"fleets":[14],"for":[15,52,65,101],"support":[17],"routine":[19],"inspection":[20],"and":[21,86],"service":[22],"operations":[23],"taking":[24],"place":[25],"well-structured":[27],"but":[28],"environments.":[30],"In":[31],"a":[32,40,46,54,78,98,135,146],"series":[33],"previous":[35],"works,":[36],"we":[37,87],"have":[38,88],"provided":[39],"detailed":[41],"definition":[42],"this":[44,102,111],"problem,":[45],"Mixed":[47],"Integer":[48],"Programming":[49],"(MIP)":[50],"formulation":[51],"it,":[53],"formal":[55],"analysis":[56],"its":[58,66,124],"worst-case":[59,107],"computational":[60,108,159],"complexity,":[61],"additional":[62],"structural":[63,92],"results":[64,93],"optimal":[67],"solutions":[68],"that":[69,152],"also":[70],"enable":[71],"solution":[73],"through":[77],"partial":[79],"relaxation":[80],"original":[83],"MIP":[84],"formulation,":[85],"further":[89],"employed":[90],"these":[91],"towards":[94],"development":[96],"construction":[99],"heuristic":[100,112,151],"problem.":[103],"But":[104],"while":[105],"complexity":[109],"is":[113],"polynomial":[114],"with":[115],"respect":[116],"to":[117,133],"size":[119],"problem-defining":[122],"elements,":[123],"practical":[125],"scalability":[126],"has":[127,153],"been":[128],"challenged":[129],"by":[130],"need":[132],"solve":[134],"large":[136],"(super-linear)":[137],"number":[138],"linear":[140],"programming":[141],"formulations.":[142],"This":[143],"work":[144],"introduces":[145],"modified":[147],"version":[148],"reduced":[154],"very":[155],"drastically":[156],"involved":[158],"times.":[160]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}