{"id":"https://openalex.org/W2116235023","doi":"https://doi.org/10.1109/dcoss.2011.5982137","title":"STARS: Static relays for multi-robot real-time search and monitoring","display_name":"STARS: Static relays for multi-robot real-time search and monitoring","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2116235023","doi":"https://doi.org/10.1109/dcoss.2011.5982137","mag":"2116235023"},"language":"en","primary_location":{"id":"doi:10.1109/dcoss.2011.5982137","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcoss.2011.5982137","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)","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/A5024619000","display_name":"Yuanteng Pei","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yuanteng Pei","raw_affiliation_strings":["Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA","Department of Computer Science and Engineering, Michigan State University, East Lansing, MI 48824 USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI 48824 USA#TAB#","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009845048","display_name":"Matt W. Mutka","orcid":"https://orcid.org/0000-0002-7381-8095"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matt W. Mutka","raw_affiliation_strings":["Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA","Department of Computer Science and Engineering, Michigan State University, East Lansing, MI 48824 USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI 48824 USA#TAB#","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024619000"],"corresponding_institution_ids":["https://openalex.org/I87216513"],"apc_list":null,"apc_paid":null,"fwci":2.1925,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.88515506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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.9995999932289124,"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.9966999888420105,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9954000115394592,"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.7306957840919495},{"id":"https://openalex.org/keywords/relay","display_name":"Relay","score":0.6614841222763062},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5806676745414734},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5748507380485535},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5510186553001404},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5237584114074707},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5097617506980896},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.48222196102142334},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48164430260658264},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42168277502059937},{"id":"https://openalex.org/keywords/time-constraint","display_name":"Time constraint","score":0.4187881350517273},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.41418319940567017},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.41240420937538147},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2707289159297943},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22380933165550232},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16352084279060364},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08608028292655945}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7306957840919495},{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.6614841222763062},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5806676745414734},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5748507380485535},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5510186553001404},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5237584114074707},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5097617506980896},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.48222196102142334},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48164430260658264},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42168277502059937},{"id":"https://openalex.org/C2775907273","wikidata":"https://www.wikidata.org/wiki/Q7805281","display_name":"Time constraint","level":2,"score":0.4187881350517273},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.41418319940567017},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.41240420937538147},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2707289159297943},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22380933165550232},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16352084279060364},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08608028292655945},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/dcoss.2011.5982137","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcoss.2011.5982137","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.723.7513","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.723.7513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jeffpei.com/pub/STARS-DCOSS2011.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":28,"referenced_works":["https://openalex.org/W76732495","https://openalex.org/W1516796808","https://openalex.org/W1968492936","https://openalex.org/W1970524896","https://openalex.org/W1997039203","https://openalex.org/W2004882088","https://openalex.org/W2022337418","https://openalex.org/W2041485345","https://openalex.org/W2045428936","https://openalex.org/W2046312856","https://openalex.org/W2050819731","https://openalex.org/W2056017162","https://openalex.org/W2060743393","https://openalex.org/W2095453748","https://openalex.org/W2098846072","https://openalex.org/W2111972027","https://openalex.org/W2117768029","https://openalex.org/W2128740072","https://openalex.org/W2134003300","https://openalex.org/W2137045485","https://openalex.org/W2152464086","https://openalex.org/W2162764137","https://openalex.org/W2171060218","https://openalex.org/W2490234810","https://openalex.org/W3141863997","https://openalex.org/W6642394703","https://openalex.org/W6661419576","https://openalex.org/W6674445081"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W2935909890","https://openalex.org/W1531601525","https://openalex.org/W2592478754","https://openalex.org/W2189435634","https://openalex.org/W4301419164","https://openalex.org/W2055574289","https://openalex.org/W2950637524","https://openalex.org/W942307408","https://openalex.org/W4376528622"],"abstract_inverted_index":{"We":[0,12,72],"first":[1],"present":[2],"a":[3,14,112],"problem":[4,62],"called":[5],"precedence":[6,95],"constrained":[7],"two":[8,137],"traveling":[9],"salesman":[10],"(PC2TSP).":[11],"propose":[13],"near-optimal":[15,154],"heuristic":[16],"to":[17,19,45,50,111,128,132,151],"PC2TSP":[18,40,46,129,152],"generate":[20],"tours":[21,103],"by":[22,57,85,97,104],"clustering":[23],"points,":[24],"generating":[25],"optimal":[26],"single-traveler":[27],"tours,":[28],"and":[29,32,41,88,100,117,125,144],"tour":[30],"pruning":[31],"balance.":[33],"Second,":[34],"we":[35,59],"show":[36,147],"an":[37],"application":[38],"of":[39,63,121],"how":[42],"our":[43,126,149],"solution":[44,75,127,150],"can":[47],"be":[48],"applied":[49],"the":[51,61,74,94],"application.":[52],"By":[53],"modeling":[54],"in":[55],"part":[56],"PC2TSP,":[58],"solve":[60],"minimum":[64],"time":[65],"two-robot":[66],"real-time":[67],"search":[68],"with":[69,134,141,156],"relay":[70],"deployment.":[71],"call":[73],"STAtic":[76],"Relay":[77],"aided":[78],"Search":[79],"(STARS),":[80],"which":[81],"identifies":[82],"visiting":[83],"positions":[84],"set":[86],"cover":[87],"Steiner":[89],"connected":[90],"dominating":[91],"set;":[92],"assigns":[93],"constraint":[96],"breadth-first":[98],"search;":[99],"finally":[101],"generates":[102],"PC2TSP.":[105],"STARS":[106,124],"substantially":[107],"reduces":[108],"cost":[109],"compared":[110],"homogeneous":[113],"mobile":[114],"robot":[115],"system":[116],"enables":[118],"constant":[119],"monitoring":[120],"suspicious":[122],"areas.":[123],"are":[130],"extensible":[131],"deal":[133],"more":[135],"than":[136,158],"travelers.":[138],"Extensive":[139],"simulations":[140],"both":[142],"narrow":[143],"wide":[145],"regions":[146],"that":[148],"achieves":[153],"performance":[155],"less":[157],"2%":[159],"average":[160],"difference":[161],"from":[162],"optimal.":[163]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}