{"id":"https://openalex.org/W2768128106","doi":"https://doi.org/10.1177/1550147717741265","title":"Minimizing maximum cost in task coverage problem with multiple mobile sensors: A heuristic approach based on all-pairs shortest path","display_name":"Minimizing maximum cost in task coverage problem with multiple mobile sensors: A heuristic approach based on all-pairs shortest path","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2768128106","doi":"https://doi.org/10.1177/1550147717741265","mag":"2768128106"},"language":"en","primary_location":{"id":"doi:10.1177/1550147717741265","is_oa":true,"landing_page_url":"https://doi.org/10.1177/1550147717741265","pdf_url":"https://journals.sagepub.com/doi/pdf/10.1177/1550147717741265","source":{"id":"https://openalex.org/S64417657","display_name":"International Journal of Distributed Sensor Networks","issn_l":"1550-1329","issn":["1550-1329","1550-1477"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Distributed Sensor Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://journals.sagepub.com/doi/pdf/10.1177/1550147717741265","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091209975","display_name":"Hyeun Jeong Min","orcid":"https://orcid.org/0000-0002-9033-7023"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyeun Jeong Min","raw_affiliation_strings":["Computer and Telecommunication Engineering Division, Yonsei University, Wonju, South Korea"],"affiliations":[{"raw_affiliation_string":"Computer and Telecommunication Engineering Division, Yonsei University, Wonju, South Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057617802","display_name":"Hyo-Sang Lim","orcid":"https://orcid.org/0000-0002-4958-193X"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Hyo-Sang Lim","raw_affiliation_strings":["Computer and Telecommunication Engineering Division, Yonsei University, Wonju, South Korea"],"affiliations":[{"raw_affiliation_string":"Computer and Telecommunication Engineering Division, Yonsei University, Wonju, South Korea","institution_ids":["https://openalex.org/I193775966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057617802"],"corresponding_institution_ids":["https://openalex.org/I193775966"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":{"value":2200,"currency":"USD","value_usd":2200},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16181593,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"11","first_page":"155014771774126","last_page":"155014771774126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9983000159263611,"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.9983000159263611,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.860903263092041},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6841781139373779},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.674322783946991},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6010194420814514},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5828961730003357},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5794273614883423},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4931580424308777},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4530683159828186},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4032290279865265},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3316154479980469},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.323483407497406},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22784829139709473},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2014589011669159},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09729468822479248},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09244385361671448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07074978947639465}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.860903263092041},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6841781139373779},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.674322783946991},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6010194420814514},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5828961730003357},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5794273614883423},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4931580424308777},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4530683159828186},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4032290279865265},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3316154479980469},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.323483407497406},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22784829139709473},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2014589011669159},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09729468822479248},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09244385361671448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07074978947639465},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1177/1550147717741265","is_oa":true,"landing_page_url":"https://doi.org/10.1177/1550147717741265","pdf_url":"https://journals.sagepub.com/doi/pdf/10.1177/1550147717741265","source":{"id":"https://openalex.org/S64417657","display_name":"International Journal of Distributed Sensor Networks","issn_l":"1550-1329","issn":["1550-1329","1550-1477"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Distributed Sensor Networks","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:sae:intdis:v:13:y:2017:i:11:p:1550147717741265","is_oa":false,"landing_page_url":"https://journals.sagepub.com/doi/10.1177/1550147717741265","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:doaj.org/article:cd8b4b5268e64d7b80719432bb61b39f","is_oa":true,"landing_page_url":"https://doaj.org/article/cd8b4b5268e64d7b80719432bb61b39f","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Distributed Sensor Networks, Vol 13 (2017)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1177/1550147717741265","is_oa":true,"landing_page_url":"https://doi.org/10.1177/1550147717741265","pdf_url":"https://journals.sagepub.com/doi/pdf/10.1177/1550147717741265","source":{"id":"https://openalex.org/S64417657","display_name":"International Journal of Distributed Sensor Networks","issn_l":"1550-1329","issn":["1550-1329","1550-1477"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Distributed Sensor Networks","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2768128106.pdf","grobid_xml":"https://content.openalex.org/works/W2768128106.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1974713906","https://openalex.org/W1976225933","https://openalex.org/W2012806873","https://openalex.org/W2034675152","https://openalex.org/W2037156716","https://openalex.org/W2050819731","https://openalex.org/W2080754158","https://openalex.org/W2101133348","https://openalex.org/W2108241642","https://openalex.org/W2115292965","https://openalex.org/W2116132127","https://openalex.org/W2128740072","https://openalex.org/W2135536356","https://openalex.org/W2136948681","https://openalex.org/W2141821897","https://openalex.org/W2142425726","https://openalex.org/W2154730439","https://openalex.org/W2165142526","https://openalex.org/W2169528473","https://openalex.org/W2487987157","https://openalex.org/W2617370582","https://openalex.org/W2956015669","https://openalex.org/W3147567656","https://openalex.org/W4255664216","https://openalex.org/W4376530426"],"related_works":["https://openalex.org/W4232403550","https://openalex.org/W623607250","https://openalex.org/W4245429118","https://openalex.org/W4205110281","https://openalex.org/W4212927854","https://openalex.org/W4211151614","https://openalex.org/W4244798043","https://openalex.org/W4251969024","https://openalex.org/W4250793136","https://openalex.org/W2070875930"],"abstract_inverted_index":{"We":[0,92],"address":[1],"a":[2,12,73,98],"task":[3],"coverage":[4,140],"problem":[5],"to":[6,38,42,83,134],"cover":[7],"all":[8,62,117],"given":[9,13],"tasks":[10,23,41,58,63,107,114,118],"with":[11,104],"number":[14],"of":[15,52,100,139],"mobile":[16],"sensors.":[17,34],"In":[18],"this":[19],"context,":[20],"we":[21],"consider":[22],"as":[24,87],"certain":[25],"points":[26],"or":[27],"regions":[28],"that":[29,59,96,126],"should":[30],"be":[31],"probed":[32],"by":[33],"Our":[35],"work":[36],"is":[37,72],"find":[39,48],"initial":[40,57],"deploy":[43],"sensors":[44],"in":[45,137],"advance,":[46],"and":[47,64,89,108,119,141],"an":[49,94],"efficient":[50,131],"set":[51,99],"search":[53,88],"paths":[54,103],"from":[55],"the":[56,66,127],"completely":[60],"covers":[61],"minimizes":[65],"maximum":[67,142],"cost":[68,121],"among":[69],"paths.":[70],"This":[71],"challenging":[74],"issue":[75],"for":[76],"various":[77],"sensor":[78],"applications,":[79],"particularly":[80],"those":[81],"related":[82],"time-critical":[84],"missions,":[85],"such":[86],"rescue":[90],"operations.":[91],"propose":[93],"algorithm":[95,129],"selects":[97],"all-pairs":[101],"shortest":[102],"fewer":[105],"duplicated":[106],"extends":[109],"each":[110],"path":[111,143],"using":[112],"remaining":[113],"while":[115],"covering":[116],"avoiding":[120],"increases.":[122],"Experimental":[123],"results":[124],"demonstrate":[125],"proposed":[128],"provides":[130],"solutions":[132],"compared":[133],"existing":[135],"algorithms":[136],"terms":[138],"costs.":[144]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}