{"id":"https://openalex.org/W2111924832","doi":"https://doi.org/10.1109/robot.2008.4543337","title":"An approximation algorithm for the least overlapping p-Frame problem with non-partial coverage for networked robotic cameras","display_name":"An approximation algorithm for the least overlapping p-Frame problem with non-partial coverage for networked robotic cameras","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2111924832","doi":"https://doi.org/10.1109/robot.2008.4543337","mag":"2111924832"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2008.4543337","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2008.4543337","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Robotics and Automation","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/A5110077216","display_name":"XU Yi-liang","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yiliang Xu","raw_affiliation_strings":["Computer Science Department, Texas A&M University, College Station, 77843, USA","Computer Science Department, Texas A&M University, College Station, TX"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Texas A&M University, College Station, 77843, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Computer Science Department, Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054819263","display_name":"Dezhen Song","orcid":"https://orcid.org/0000-0002-2944-5754"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dezhen Song","raw_affiliation_strings":["Computer Science Department, Texas A&M University, College Station, 77843, USA","Computer Science Department, Texas A&M University, College Station, TX"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Texas A&M University, College Station, 77843, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Computer Science Department, Texas A&M University, College Station, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090869394","display_name":"Jingang Yi","orcid":"https://orcid.org/0000-0003-0628-9098"},"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":"Jingang Yi","raw_affiliation_strings":["Mechanical Engineering Department, San Diego State University, 92182, USA","San Diego State University"],"affiliations":[{"raw_affiliation_string":"Mechanical Engineering Department, San Diego State University, 92182, USA","institution_ids":["https://openalex.org/I26538001"]},{"raw_affiliation_string":"San Diego State University","institution_ids":["https://openalex.org/I26538001"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044860343","display_name":"A. Frank van der Stappen","orcid":"https://orcid.org/0000-0001-7965-2818"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"A. Frank van der Stappen","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, PO Box 80089, 3508 TB, The Netherlands","Utrecht university >  >  >  >"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, PO Box 80089, 3508 TB, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht university >  >  >  >","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5110077216"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":1.9058,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.87667674,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1011","last_page":"1016"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9955000281333923,"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.9955000281333923,"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/T11377","display_name":"Retinal and Macular Surgery","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/2741","display_name":"Radiology, Nuclear Medicine and Imaging"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9858999848365784,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/metric","display_name":"Metric (unit)","score":0.6582623720169067},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.6433835625648499},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6243248581886292},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6066588759422302},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5668120384216309},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5219873189926147},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.43543094396591187},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3936629295349121},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36315226554870605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3405768573284149},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07889178395271301}],"concepts":[{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6582623720169067},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.6433835625648499},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6243248581886292},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6066588759422302},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5668120384216309},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5219873189926147},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.43543094396591187},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3936629295349121},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36315226554870605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3405768573284149},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07889178395271301},{"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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/robot.2008.4543337","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2008.4543337","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.6307","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.6307","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://faculty.cs.tamu.edu/dzsong/pdfs/Xu-pFrame-V28.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1965219179","https://openalex.org/W1973307935","https://openalex.org/W1973622621","https://openalex.org/W2004675147","https://openalex.org/W2007689158","https://openalex.org/W2008489673","https://openalex.org/W2017680106","https://openalex.org/W2094658339","https://openalex.org/W2112692787","https://openalex.org/W2114717015","https://openalex.org/W2115720448","https://openalex.org/W2133962824","https://openalex.org/W2146873088","https://openalex.org/W2153356689","https://openalex.org/W2157454320","https://openalex.org/W2159033028","https://openalex.org/W2160982102","https://openalex.org/W2163090347","https://openalex.org/W2203464362","https://openalex.org/W2986240932","https://openalex.org/W3098722153","https://openalex.org/W6681310267","https://openalex.org/W6683952259"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W1976691234","https://openalex.org/W3212023493","https://openalex.org/W2090715877","https://openalex.org/W2572370460"],"abstract_inverted_index":{"We":[0,31,57,86,153],"report":[1],"our":[2,164],"algorithmic":[3],"development":[4],"of":[5,13,17,82],"the":[6,11,34,42,70,95,99,111,114,117,123,126,135,156],"pframe":[7],"problem":[8,121],"that":[9,33,97,109],"addresses":[10],"need":[12],"coordinating":[14],"a":[15,47,60,74,80,88,130],"set":[16,81],"p":[18,35,83],"networked":[19],"robotic":[20],"pan-tilt-zoom":[21],"cameras":[22],"for":[23,73,94],"n,":[24],"(n":[25],"\u226b":[26],"p),":[27],"competing":[28],"polygonal":[29],"requests.":[30],"assume":[32],"frames":[36,45],"have":[37,154],"almost":[38],"no":[39],"overlap":[40],"on":[41,105],"coverage":[43],"between":[44,113],"and":[46,122,158],"request":[48,76],"is":[49,54],"satisfied":[50],"only":[51],"if":[52],"it":[53],"fully":[55],"covered.":[56],"then":[58],"propose":[59,87],"Resolution":[61],"Ratio":[62],"with":[63,77,163],"Non-Partial":[64],"Coverage":[65],"(RRNPC)":[66],"metric":[67],"to":[68,79,92,116,125],"quantify":[69],"satisfaction":[71],"level":[72],"given":[75,131],"respect":[78],"candidate":[84],"frames.":[85],"latticebased":[89],"approximation":[90,132],"algorithm":[91,103,136,157],"search":[93],"solution":[96,115,124],"maximizes":[98],"overall":[100],"satisfaction.":[101],"The":[102],"builds":[104],"an":[106],"induction-like":[107],"approach":[108],"finds":[110],"relationship":[112],"(p":[118],"\u2014":[119],"1)-frame":[120],"p-frame":[127],"problem.":[128],"For":[129],"bound":[133],"\u03b5,":[134],"runs":[137],"in":[138],"O(n/\u03b5":[139],"<sup":[140,144,148],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[141,145,149],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3</sup>":[142],"+p":[143],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[146],"/\u03b5":[147],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">6</sup>":[150],")":[151],"time.":[152],"implemented":[155],"experimental":[159],"results":[160],"are":[161],"consistent":[162],"complexity":[165],"analysis.":[166]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}