Results 1  10
of
402
On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronzing Automata
, 2014
"... ..."
Consensus and cooperation in networked multiagent systems
 Proceedings of the IEEE
, 2007
"... Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multiagent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, timedelays, and performance guarantees. An ove ..."
Abstract

Cited by 807 (4 self)
 Add to MetaCart
Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multiagent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, timedelays, and performance guarantees
On robust rendezvous for mobile autonomous agents
, 2005
"... This paper presents coordination algorithms for networks of mobile autonomous agents. The objective of the proposed algorithms is to achieve rendezvous, that is, agreement over the location of the agents in the network. We provide analysis and design results for multiagent networks in arbitrary di ..."
Abstract

Cited by 203 (21 self)
 Add to MetaCart
This paper presents coordination algorithms for networks of mobile autonomous agents. The objective of the proposed algorithms is to achieve rendezvous, that is, agreement over the location of the agents in the network. We provide analysis and design results for multiagent networks in arbitrary
The multiagent rendezvous problem.
 In Proceedings of the IEEE Conference on Decision and Control,
, 2003
"... AbstractThis paper is concerned with the collective behavior of a group of n > 1 mobile autonomous agents, labelled 1 through n, which can all move in the plane. Each agent is able to continuously track the positions of all other agents currently within its "sensing region" where by a ..."
Abstract

Cited by 103 (5 self)
 Add to MetaCart
by an agent's sensing region is meant a closed disk of positive radius r centered at the agent's current position. The multiagent rendezvous problem is to devise "local" control strategies, one for each agent, which without any active communication between agents, cause all members
A Framework for Comparing Models of Computation
 IEEE TRANSACTIONS ON COMPUTERAIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
, 1998
"... We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general terms as sets of possible behaviors. A process is determinate if, given the constraints imposed by the inputs, there are exactly o ..."
Abstract

Cited by 322 (67 self)
 Add to MetaCart
partially ordered or totally ordered set. Timed models are where the set of tags is totally ordered. Synchronous events share the same tag, and synchronous signals contain events with the same set of tags. Synchronous processes have only synchronous signals as behaviors. Strict causality (in timed tag
Rendezvous in One and More Dimensions
"... This article is mainly concerned with the rendezvous problem on the ndimensional integer lattice. Two blind players are initially placed at nodes whose di¤erence vector has length 2 and is parallel to some coordinate axis. In each period they must move to an adjacent node. They have no common notio ..."
Abstract
 Add to MetaCart
notion of locations or directions. The least expected rendezvous times R a (using distinct strategies) and R s (using the same mixed strategy) are shown to satisfy lim R a (n)=n · 8=3 and limR s (n) =n · 56=9: This work extends the work of the author and S. Gal (R a (1) = 13=4) and that of V. Baston (R
The rendezvous problem on discrete locations
 J. Appl. Probab
, 1990
"... Two friends have become separated in a building or shopping mall and and wish to meet as quickly as possible. There are n possible locations where they might meet. However, the locations are identical and there has been no prior agreement where to meet or how to search. Hence they must use identical ..."
Abstract

Cited by 54 (4 self)
 Add to MetaCart
, then rendezvous will require n steps on average. It is possible to do better than this: although the optimal strategy is difficult to characterize for general n, there is a strategy with an expected time until rendezvous of less than 0.829 n for large enough n. For n = 2 and 3 the optimal strategy can
Rendezvous for Cognitive Radios
 Mobile Computing, IEEE Transactions on
"... Abstract—Cognitive radios have been touted as a solution to communicating in a Dynamic Spectrum Access environment. This paper examines how cognitive radios initially find one another among the expanse of everchanging open spectrum, termed the rendezvous problem. Specifically, it addresses the prob ..."
Abstract

Cited by 42 (1 self)
 Add to MetaCart
clock blind rendezvous algorithms are proposed, and it is shown that the performance of these algorithms compares favorably to that of a random blind rendezvous algorithm. Specifically, the sequencebased algorithm provides a bounded Time To Rendezvous (TTR) and the ability to prioritize channels where
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
the algorithm at the same time, and arbitrary startup, when starting times of the agents are arbitrarily decided by the adversary. We rst show that rendezvous can be completed in time O(n + log l) on any nnode tree, where l is the smaller of the two identi ers, even with arbitrary startup. This complexity
Results 1  10
of
402