Results 1  10
of
184
Asynchronous deterministic rendezvous in graphs
"... Two mobile agents (robots) having distinct labels and located in nodes of an unknown anonymous connected graph, have to meet. We consider the asynchronous version of this wellstudied rendezvous problem and we seek fast deterministic algorithms for it. Since in the asynchronous setting meeting at a ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
Two mobile agents (robots) having distinct labels and located in nodes of an unknown anonymous connected graph, have to meet. We consider the asynchronous version of this wellstudied rendezvous problem and we seek fast deterministic algorithms for it. Since in the asynchronous setting meeting at a
Asynchronous Deterministic Rendezvous on the Line
, 2009
"... We study the rendezvous problem in the asynchronous setting in the graph of infinite line following the model introduced in [13]. We formulate general lemmas about deterministic rendezvous algorithms in this setting which characterize the algorithms in which the agents have the shortest routes. We a ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We study the rendezvous problem in the asynchronous setting in the graph of infinite line following the model introduced in [13]. We formulate general lemmas about deterministic rendezvous algorithms in this setting which characterize the algorithms in which the agents have the shortest routes. We
Deterministic Rendezvous in Graphs
 In Proc. 11th European Symposium on Algorithms (ESA’03
, 2003
"... Two mobile agents having distinct identi ers and located in nodes of an unknown anonymous connected graph, have to meet at some node of the graph. We seek fast deterministic algorithms for this rendezvous problem, under two scenarios: simultaneous startup, when both agents start executing the al ..."
Abstract

Cited by 37 (1 self)
 Add to MetaCart
working in time O(n log l), for known n, and an algorithm polynomial in n, l and the dierence between startup times, if n is unknown. For arbitrary graphs, our main contribution is a general feasibility result: rendezvous can be accomplished on arbitrary connected graphs, even with arbitrary startup
Almost optimal asynchronous rendezvous in infinite multidimensional grids
 IN: PROC. OF THE 24TH INT. SYMP. ON DISTRIBUTED COMPUTING (DISC). VOLUME 6343 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2010
"... Two anonymous mobile agents (robots) moving in an asynchronous manner have to meet in an infinite grid of dimension δ> 0, starting from two arbitrary positions at distance at most d. Since the problem is clearly infeasible in such general setting, we assume that the grid is embedded in a δdimen ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
Two anonymous mobile agents (robots) moving in an asynchronous manner have to meet in an infinite grid of dimension δ> 0, starting from two arbitrary positions at distance at most d. Since the problem is clearly infeasible in such general setting, we assume that the grid is embedded in a δ
Rendezvous of Mobile Agents in Anonymous Networks with Faulty Channels∗
"... A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (asynchronous anonymous multiagent) rendezvous problem has been studied extensively but only for networks that are safe ..."
Abstract
 Add to MetaCart
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (asynchronous anonymous multiagent) rendezvous problem has been studied extensively but only for networks that are safe
Rendezvous of mobile agents in unknown graphs with faulty links
 In Proc. of Distributed Computing, 21st International Conference (DISC 2007), Lecture Notes in Computer Science
, 2007
"... A group of mobile agents wandering among the nodes of a network have to gather together in a single node of the graph; This problem known as the Rendezvous problem has been studied extensively but only for networks that are safe or faultfree. In this paper, we consider the case when some of the edg ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
A group of mobile agents wandering among the nodes of a network have to gather together in a single node of the graph; This problem known as the Rendezvous problem has been studied extensively but only for networks that are safe or faultfree. In this paper, we consider the case when some
ASYNCHRONOUS RENDEZVOUS ANALYSIS VIA SETVALUED CONSENSUS THEORY∗
"... Abstract. This paper presents the design and analysis result for asynchronous rendezvous control of multiagent systems with continuoustime dynamics and intermittent interactions. The protocoldesigning strategies only impose weak restrictions on anticipatedwaypoint sets (from which the waypoints ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
with respect to update times and provide mild sufficient conditions for the solvability of the asynchronous rendezvous problem. The proof techniques rely much on graph theory and nonnegative matrix theory. The obtained result extends greatly the existing work in the literature and several examples demonstrate
Deterministic Symmetric Rendezvous in Arbitrary Graphs Overcoming Anonymity, Failures and Uncertainty
"... Abstract We consider the rendezvous problem of gathering two or more identical agents that are initially scattered among the nodes of an unknown graph. We discuss some of the recent results for this problem focusing only on deterministic algorithms for the general case when the graph topology is unk ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract We consider the rendezvous problem of gathering two or more identical agents that are initially scattered among the nodes of an unknown graph. We discuss some of the recent results for this problem focusing only on deterministic algorithms for the general case when the graph topology
Rendezvous search with revealed information: Applications to the line and complete graphs. unpublished
, 2006
"... The symmetric rendezvous problem on a network Q asks how two players, forced to use the same mixed strategy, can minimize their expected meeting time, starting from a known initial distribution on the nodes of Q: This minimum is called the (symmetric) ‘rendezvous value’of Q: Traditionally, the playe ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
the case where they are placed a known distance apart on the line graph Q (‘symmetric rendezvous on the line’). These techniques can be used to give lower bounds on the rendezvous times of the original game (without any revealed information). Our approach is to concentrate on a general analysis of the e
1 Multirobot rendezvous with visibility sensors in nonconvex environments
, 2006
"... Abstract — This paper presents a coordination algorithm for mobile autonomous robots. Relying upon distributed sensing the robots achieve rendezvous, that is, they move to a common location. Each robot is a point mass moving in a nonconvex environment according to an omnidirectional kinematic model. ..."
Abstract
 Add to MetaCart
of robust visibility, connectivitypreserving constraint sets, and proximity graphs. Simulations illustrate the theoretical results on the correctness of the proposed algorithm, and its performance in asynchronous setups and with sensor measurement and control errors. Index Terms — Multirobot coordination
Results 1  10
of
184