{"id":"https://openalex.org/W2260116627","doi":"https://doi.org/10.1145/2833312.2833457","title":"When can multi-agent rendezvous be executed in time linear in the diameter of a plane configuration?","display_name":"When can multi-agent rendezvous be executed in time linear in the diameter of a plane configuration?","publication_year":2016,"publication_date":"2016-01-04","ids":{"openalex":"https://openalex.org/W2260116627","doi":"https://doi.org/10.1145/2833312.2833457","mag":"2260116627"},"language":"en","primary_location":{"id":"doi:10.1145/2833312.2833457","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2833312.2833457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","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/A5012383867","display_name":"Peter Hegarty","orcid":"https://orcid.org/0000-0002-5487-4075"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Peter Hegarty","raw_affiliation_strings":["Chalmers/Gothenburg University, Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers/Gothenburg University, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049015414","display_name":"Anders Martinsson","orcid":null},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Anders Martinsson","raw_affiliation_strings":["Chalmers/Gothenburg University, Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers/Gothenburg University, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049220054","display_name":"Dmitry Zhelezov","orcid":null},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Dmitry Zhelezov","raw_affiliation_strings":["Chalmers/Gothenburg University, Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers/Gothenburg University, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012383867"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":0.2966,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61835823,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"5","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.9998999834060669,"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.9998999834060669,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9997000098228455,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9912999868392944,"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/rendezvous","display_name":"Rendezvous","score":0.9594998359680176},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.724626898765564},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5565181970596313},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.5557997226715088},{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.517238438129425},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49938488006591797},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4594610035419464},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4370729923248291},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.41663485765457153},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4157026410102844},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40234053134918213},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33769524097442627},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27928799390792847},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1910206377506256},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.19029134511947632},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.13119035959243774},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.1268131136894226}],"concepts":[{"id":"https://openalex.org/C2779968344","wikidata":"https://www.wikidata.org/wiki/Q3932925","display_name":"Rendezvous","level":3,"score":0.9594998359680176},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.724626898765564},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5565181970596313},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.5557997226715088},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.517238438129425},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49938488006591797},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4594610035419464},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4370729923248291},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.41663485765457153},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4157026410102844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40234053134918213},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33769524097442627},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27928799390792847},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1910206377506256},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.19029134511947632},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.13119035959243774},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.1268131136894226},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C29829512","wikidata":"https://www.wikidata.org/wiki/Q40218","display_name":"Spacecraft","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2833312.2833457","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2833312.2833457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.lib.chalmers.se:231854","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/231854-when-can-multi-agent-rendezvous-be-executed-in-time-linear-in-the-diameter-of-a-plane-configuration","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Conference.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:231854","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/231854","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W630423399","https://openalex.org/W1662003440","https://openalex.org/W1701848903","https://openalex.org/W1975845178","https://openalex.org/W2021429920","https://openalex.org/W2022149728","https://openalex.org/W2040570464","https://openalex.org/W2077415032","https://openalex.org/W2097569568","https://openalex.org/W2113096089","https://openalex.org/W2158669326","https://openalex.org/W2245527669","https://openalex.org/W2576544140","https://openalex.org/W4296154464","https://openalex.org/W6620405761","https://openalex.org/W6637268629"],"related_works":["https://openalex.org/W2743652671","https://openalex.org/W3188793535","https://openalex.org/W2032709970","https://openalex.org/W2066813664","https://openalex.org/W2102115312","https://openalex.org/W2122100695","https://openalex.org/W2094166299","https://openalex.org/W2519024191","https://openalex.org/W2963183586","https://openalex.org/W2159176266"],"abstract_inverted_index":{"In":[0,15],"multi-agent":[1],"rendezvous":[2],"it":[3],"is":[4,70,137],"naturally":[5],"assumed":[6],"that":[7,66],"agents":[8],"have":[9],"a":[10,25,42,60,116],"maximum":[11],"speed":[12],"of":[13,18,41,62,80,135],"movement.":[14],"the":[16,29,39,67,130,133],"absence":[17],"any":[19,93],"distributed":[20,53],"control":[21],"issues,":[22],"this":[23],"imposes":[24],"lower":[26],"bound":[27],"on":[28],"time":[30,123,127],"to":[31,38,129],"rendezvous,":[32],"for":[33,143],"idealised":[34],"point":[35,105],"agents,":[36],"proportional":[37,128],"diameter":[40],"configuration.":[43],"Assuming":[44,92],"bounded":[45],"visibility,":[46],"we":[47,86,114],"consider":[48],"\u03a9(n2":[49],"log":[50],"n)":[51],"points":[52,136],"independently":[54],"and":[55,90,102,110],"uniformly":[56],"at":[57],"random":[58,108],"in":[59,122,126],"disc":[61],"radius":[63],"n,":[64],"so":[65],"visibility":[68],"graph":[69],"asymptotically":[71],"almost":[72],"surely":[73],"(a.a.s.)":[74],"connected.":[75],"We":[76],"allow":[77],"three":[78],"types":[79],"possible":[81],"interaction":[82,95],"between":[83],"neighbors,":[84],"which":[85,119],"term":[87],"signalling,":[88],"sweeping":[89],"tracking.":[91],"such":[94],"can":[96,106],"be":[97],"executed":[98],"without":[99],"significant":[100],"delay,":[101],"assuming":[103],"each":[104],"generate":[107],"bits":[109],"has":[111],"unlimited":[112],"memory,":[113],"describe":[115],"randomized":[117],"algorithm":[118],"a.a.s.":[120],"runs":[121],"O(n),":[124],"hence":[125],"diameter,":[131],"provided":[132],"number":[134],"o(n3).":[138],"Several":[139],"questions":[140],"are":[141],"posed":[142],"future":[144],"work.":[145]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}