Nearest Neighbor-Based Rendezvous for Sparsely Connected Mobile Agents

  • Ahmad A. Masoud*
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In this paper, a convergent, nearest-neighbor, control protocol is suggested for agents with nontrivial dynamics. The protocol guarantees convergence to a common point in space even if each agent is restricted to communicate with a single nearest neighbor. The neighbor, however, is required to lie outside an arbitrarily small priority zone surrounding the agent. The control protocol consists of two layers interconnected in a provably correct manner. The first layer provides the guidance signal to a rendezvous point assuming that the agents have first-order dynamics. The other layer converts in a decentralized manner the guidance signal to a control signal that suits realistic agents, such as unmanned ground vehicles (UGVs), unmanned aerial vehicles (UAVs), and holonomic agents with second-order dynamics.

Original languageEnglish
Article number121002
JournalJournal of Dynamic Systems, Measurement and Control, Transactions of the ASME
Volume137
Issue number12
DOIs
StatePublished - 1 Dec 2015

Bibliographical note

Publisher Copyright:
Copyright © 2015 by ASME.

Keywords

  • decentralized agents
  • nearest-neighbor protocol
  • rendezvous control
  • sparse communication graphs

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Information Systems
  • Instrumentation
  • Mechanical Engineering
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Nearest Neighbor-Based Rendezvous for Sparsely Connected Mobile Agents'. Together they form a unique fingerprint.

Cite this