{"id":"https://openalex.org/W2167432673","doi":"https://doi.org/10.1109/robot.2008.4543566","title":"Multi-robot surveillance: An improved algorithm for the GRAPH-CLEAR problem","display_name":"Multi-robot surveillance: An improved algorithm for the GRAPH-CLEAR problem","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2167432673","doi":"https://doi.org/10.1109/robot.2008.4543566","mag":"2167432673"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2008.4543566","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2008.4543566","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/A5086675026","display_name":"Andreas Kolling","orcid":"https://orcid.org/0000-0002-2679-9821"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andreas Kolling","raw_affiliation_strings":["School of Engineering, University of California, Merced, USA"],"affiliations":[{"raw_affiliation_string":"School of Engineering, University of California, Merced, USA","institution_ids":["https://openalex.org/I156087764"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081177797","display_name":"Stefano Carpin","orcid":"https://orcid.org/0000-0003-3837-7463"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stefano Carpin","raw_affiliation_strings":["School of Engineering, University of California, Merced, USA"],"affiliations":[{"raw_affiliation_string":"School of Engineering, University of California, Merced, USA","institution_ids":["https://openalex.org/I156087764"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086675026"],"corresponding_institution_ids":["https://openalex.org/I156087764"],"apc_list":null,"apc_paid":null,"fwci":247.5809,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.99963187,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2360","last_page":"2365"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12158","display_name":"Guidance and Control Systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T12158","display_name":"Guidance and Control Systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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.9986000061035156,"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/T12288","display_name":"Optimization and Search Problems","score":0.9922999739646912,"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.6322661638259888},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5842077136039734},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5816579461097717},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4867722988128662},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4116491675376892},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3898901641368866},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35518190264701843},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2846142649650574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1965326964855194}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6322661638259888},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5842077136039734},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5816579461097717},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4867722988128662},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4116491675376892},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3898901641368866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35518190264701843},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2846142649650574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1965326964855194},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/robot.2008.4543566","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2008.4543566","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.658.7127","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.658.7127","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://robotics.ucmerced.edu/sites/robotics.ucmerced.edu/files/page/documents/icra2008.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":14,"referenced_works":["https://openalex.org/W90840233","https://openalex.org/W1498511717","https://openalex.org/W2011039300","https://openalex.org/W2020108607","https://openalex.org/W2033649214","https://openalex.org/W2087097376","https://openalex.org/W2087787973","https://openalex.org/W2118525851","https://openalex.org/W2125346672","https://openalex.org/W2137766675","https://openalex.org/W2154788235","https://openalex.org/W2159197431","https://openalex.org/W2161303196","https://openalex.org/W6680400994"],"related_works":["https://openalex.org/W8302103","https://openalex.org/W3171631314","https://openalex.org/W2606825221","https://openalex.org/W4288076938","https://openalex.org/W2967743314","https://openalex.org/W2674584172","https://openalex.org/W1990892711","https://openalex.org/W2184085865","https://openalex.org/W2064245428","https://openalex.org/W2124621291"],"abstract_inverted_index":{"The":[0,31],"main":[1],"contribution":[2],"of":[3,63,73,87],"this":[4],"paper":[5],"is":[6],"an":[7,64],"improved":[8],"algorithm":[9,33],"for":[10,60],"the":[11,58,61,77],"GRAPH-CLEAR":[12],"problem,":[13],"a":[14,24,52,71,85],"novel":[15],"NP-complete":[16],"graph":[17],"theoretic":[18],"problem":[19,78],"we":[20,82],"recently":[21],"introduced":[22],"as":[23],"tool":[25],"to":[26,47,56],"model":[27],"multi-robot":[28],"surveillance":[29],"tasks.":[30],"proposed":[32],"combines":[34],"two":[35],"previously":[36],"developed":[37],"solving":[38],"techniques":[39],"and":[40,70],"produces":[41],"strategies":[42],"that":[43],"require":[44],"less":[45],"robots":[46],"be":[48],"executed.":[49],"We":[50],"provide":[51],"theoretical":[53],"framework":[54],"useful":[55],"identify":[57,84],"conditions":[59],"existence":[62],"optimal":[65],"solution":[66],"under":[67],"special":[68],"circumstances,":[69],"set":[72,86],"mathematical":[74],"tools":[75],"characterizing":[76],"being":[79],"studied.":[80],"Finally":[81],"also":[83],"open":[88],"questions":[89],"deserving":[90],"more":[91],"investigations.":[92]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}