{"id":"https://openalex.org/W4387007037","doi":"https://doi.org/10.1145/3603165.3607402","title":"Fixed Cameras Assisted UAVs Monitoring: Enhancing Monitoring Efficiency and Safety","display_name":"Fixed Cameras Assisted UAVs Monitoring: Enhancing Monitoring Efficiency and Safety","publication_year":2023,"publication_date":"2023-07-28","ids":{"openalex":"https://openalex.org/W4387007037","doi":"https://doi.org/10.1145/3603165.3607402"},"language":"en","primary_location":{"id":"doi:10.1145/3603165.3607402","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3603165.3607402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Turing Award Celebration Conference - China 2023","raw_type":"proceedings-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/A5059354488","display_name":"Haihan Zhang","orcid":"https://orcid.org/0000-0002-5369-2173"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Haihan Zhang","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003181030","display_name":"Haipeng Dai","orcid":"https://orcid.org/0000-0003-0545-8187"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haipeng Dai","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, China","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059354488"],"corresponding_institution_ids":["https://openalex.org/I881766915"],"apc_list":null,"apc_paid":null,"fwci":0.2009,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.50640991,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"71","last_page":"72"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9976000189781189,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.6790297031402588},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.6280340552330017},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.519744873046875},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5177173018455505},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5042284727096558},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.49607810378074646},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4538305401802063},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.44691145420074463},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.42561689019203186},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3824062943458557},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33409979939460754},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13232961297035217}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6790297031402588},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6280340552330017},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.519744873046875},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5177173018455505},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5042284727096558},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.49607810378074646},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4538305401802063},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.44691145420074463},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.42561689019203186},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3824062943458557},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33409979939460754},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13232961297035217},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3603165.3607402","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3603165.3607402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Turing Award Celebration Conference - China 2023","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2113437680","https://openalex.org/W4231490457"],"related_works":["https://openalex.org/W2357796514","https://openalex.org/W2393014972","https://openalex.org/W2896347948","https://openalex.org/W2357595179","https://openalex.org/W2351136238","https://openalex.org/W2402949237","https://openalex.org/W2891162720","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W3204684126"],"abstract_inverted_index":{"Traditional":[0],"monitoring":[1,4,25,49,61,105,123,132,146,220],"tasks":[2,50],"involve":[3],"objects":[5,94],"using":[6,95],"fixed":[7,99],"cameras":[8,100,129],"with":[9,183],"limited":[10,111],"field":[11,34],"of":[12,35,37,113,159,167,194,208,240,267],"view,":[13],"making":[14],"it":[15,63,89],"challenging":[16,136],"to":[17,28,60,91,130,154,216,263],"deploy":[18],"in":[19,47,51,170,236],"certain":[20,83,93],"scenarios":[21],"and":[22,32,115,128,148,187,222],"achieve":[23],"optimal":[24],"positions.":[26],"Due":[27],"the":[29,122,126,145,176,192,200,218,225,232,241,246,255,265,268],"flexible":[30],"mobility":[31],"wide":[33],"view":[36],"unmanned":[38],"aerial":[39],"vehicles":[40],"(UAVs),":[41],"they":[42],"have":[43,70],"been":[44,71],"widely":[45],"employed":[46],"various":[48,74],"many":[52],"domains.":[53],"However,":[54,108],"if":[55],"UAVs":[56,78,114,127],"are":[57],"too":[58],"close":[59],"objects,":[62],"may":[64],"pose":[65],"safety":[66],"risks.":[67],"Consequently,":[68],"regulations":[69],"established":[72],"by":[73,228],"countries":[75],"specifying":[76],"that":[77,224,245],"should":[79],"fly":[80],"at":[81],"a":[82,110,135,150,156,179,237,250],"distance":[84],"from":[85,163],"objects.":[86,107],"This":[87],"makes":[88],"difficult":[90],"monitor":[92],"UAVs.":[96],"Fortunately,":[97],"nearby":[98],"can":[101],"be":[102],"rented":[103],"for":[104,118,125],"these":[106,198],"given":[109],"number":[112,158,166],"finite":[116,157],"budget":[117],"renting":[119],"cameras,":[120],"determining":[121],"strategies":[124,162,169,221],"maximize":[131],"utility":[133],"becomes":[134],"problem.":[137],"To":[138,191],"address":[139],"this":[140,229],"challenge,":[141],"we":[142,174,243,259],"first":[143],"discretize":[144],"space":[147],"propose":[149,212],"strategy":[151],"extraction":[152],"algorithm":[153,203,215,230,248],"extract":[155],"representative":[160],"candidate":[161,168],"an":[164,205,213],"infinite":[165],"continuous":[171],"space.":[172],"Then,":[173],"formulate":[175],"problem":[177,182],"as":[178],"submodular":[180],"maximization":[181],"two":[184],"knapsack":[185],"constraints":[186],"one":[188],"matroid":[189],"constraint.":[190],"best":[193],"our":[195],"knowledge,":[196],"under":[197],"constraints,":[199],"known":[201,233,256],"approximation":[202,206,214,252],"has":[204,249],"ratio":[207,253],".":[209],"We":[210],"further":[211],"obtain":[217],"final":[219],"prove":[223],"solution":[226],"provided":[227],"outperforms":[231],"algorithm.":[234,257],"Moreover,":[235],"special":[238],"case":[239],"problem,":[242],"demonstrate":[244],"proposed":[247,269],"better":[251],"than":[254],"Finally,":[258],"conduct":[260],"extensive":[261],"experiments":[262],"validate":[264],"effectiveness":[266],"algorithms.":[270]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}