Results 1 - 10 of 1,612

Rendezvous of Mobile Agents in Directed Graphs

by Jérémie Chalopin, Shantanu Das
"... Abstract. We study the problem of gathering at the same location two mobile agents that are dispersed in an unknown and unlabeled environment. This problem called Rendezvous, is a fundamental task in distributed coordination among autonomous entities. Most previous studies on the subject model the e ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
directed graphs and present the first deterministic solution for rendezvous of two anonymous (identical) agents moving in such a digraph. Our algorithm achieves rendezvous with detection for any solvable instance of the problem, without any prior knowledge about the digraph, not even its size.

Consensus and cooperation in networked multi-agent systems

by Reza Olfati-Saber , J Alex Fax , Richard M Murray , Reza Olfati-Saber , J Alex Fax , Richard M Murray - Proceedings of the IEEE , 2007
"... Summary. This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, 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 multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees

Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules

by A. Jadbabaie, J. Lin, A. S. Morse , 2002
"... In a recent Physical Review Letters paper, Vicsek et. al. propose a simple but compelling discrete-time model of n autonomous agents fi.e., points or particlesg all moving in the plane with the same speed but with dierent headings. Each agent's heading is updated using a local rule based on ..."
Abstract - Cited by 1290 (62 self) - Add to MetaCart
on the average of its own heading plus the headings of its \neighbors." In their paper, Vicsek et. al. provide simulation results which demonstrate that the nearest neighbor rule they are studying can cause all agents to eventually move in the same direction despite the absence of centralized

Goal-directed Requirements Acquisition

by Anne Dardenne , Axel van Lamsweerde, Stephen Fickas - SCIENCE OF COMPUTER PROGRAMMING , 1993
"... Requirements analysis includes a preliminary acquisition step where a global model for the specification of the system and its environment is elaborated. This model, called requirements model, involves concepts that are currently not supported by existing formal specification languages, such as goal ..."
Abstract - Cited by 585 (17 self) - Add to MetaCart
, such as goals to be achieved, agents to be assigned, alternatives to be negotiated, etc. The paper presents an approach to requirements acquisition which is driven by such higher-level concepts. Requirements models are acquired as instances of a conceptual meta-model. The latter can be represented as a graph

Consensus Problems in Networks of Agents with Switching Topology and Time-Delays

by Reza Olfati Saber, Richard M. Murray , 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or leader ..."
Abstract - Cited by 1112 (21 self) - Add to MetaCart
in convergence analysis of consensus protocols. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate

On robust rendezvous for mobile autonomous agents

by Sonia Martínez, Jorge Cortés, Francesco Bullo , 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 multi-agent 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 multi-agent networks in arbitrary

Consensus Seeking in Multi-agent Systems under Dynamically Changing Interaction Topologies

by Wei Ren, Randal W. Beard , 2003
"... This note considers the problem of information consensus among multiple agents in the presence of limited and unreliable information exchange with dynamically changing interaction topologies. Both discrete and continuous update schemes are proposed for information consensus. The note shows that i ..."
Abstract - Cited by 449 (37 self) - Add to MetaCart
that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs across some time intervals has a spanning tree frequently enough as the system evolves. Simulation results show the effectiveness of our update schemes.

Deterministic Rendezvous in Graphs

by Anders Dessmark, Pierre Fraigniaud, Andrzej Pelc - 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
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

Rendezvous of mobile agents in unknown graphs with faulty links

by Jérémie Chalopin, Shantanu Das, Nicola Santoro - 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 fault-free. 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 fault-free. In this paper, we consider the case when some

Asynchronous deterministic rendezvous in graphs

by Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, Ugo Vaccaro
"... 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 well-studied 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 well-studied rendezvous problem and we seek fast deterministic algorithms for it. Since in the asynchronous setting meeting at a
Results 1 - 10 of 1,612