0
Research Papers

Nearest Neighbor-Based Rendezvous for Sparsely Connected Mobile Agents

[+] Author and Article Information
Ahmad A. Masoud

Electrical Engineering Department,
King Fahd University of Petroleum
and Minerals (KFUPM),
P.O. Box 287,
Dhahran 31261, Saudi Arabia
e-mail: masoud@kfupm.edu.sa

Contributed by the Dynamic Systems Division of ASME for publication in the JOURNAL OF DYNAMIC SYSTEMS, MEASUREMENT, AND CONTROL. Manuscript received March 12, 2015; final manuscript received August 4, 2015; published online September 2, 2015. Assoc. Editor: Jongeun Choi.

J. Dyn. Sys., Meas., Control 137(12), 121002 (Sep 02, 2015) (18 pages) Paper No: DS-15-1106; doi: 10.1115/1.4031248 History: Received March 12, 2015; Revised August 04, 2015

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.

Copyright © 2015 by ASME
Your Session has timed out. Please sign back in to continue.

References

Figures

Grahic Jump Location
Fig. 1

Nearest-neighbor consensus protocol does not guarantee convergence

Grahic Jump Location
Fig. 2

Priority buffer arrangement

Grahic Jump Location
Fig. 5

Joint sharing of an agent guarantees connectedness

Grahic Jump Location
Fig. 6

NADF-based control protocol

Grahic Jump Location
Fig. 7

A carlike mobile robot

Grahic Jump Location
Fig. 4

If an agent enters βi, it remains in βi

Grahic Jump Location
Fig. 3

Distances relative to agent i

Grahic Jump Location
Fig. 8

Converting guidance into control for a UAV

Grahic Jump Location
Fig. 10

The time derivative of H will converge to Ω

Grahic Jump Location
Fig. 11

Modified protocol guarantees convergence, L = 1

Grahic Jump Location
Fig. 12

Time to converge versus log(ε)

Grahic Jump Location
Fig. 13

dxn versus time, ε = 1

Grahic Jump Location
Fig. 14

dxn versus time, ε = 3

Grahic Jump Location
Fig. 15

x and y trajectories of agent 1, suggested protocol

Grahic Jump Location
Fig. 16

Random behavior, ε = 0.25

Grahic Jump Location
Fig. 17

Deterministic behavior, ε = 2

Grahic Jump Location
Fig. 18

Complex behavior, ε = 1

Grahic Jump Location
Fig. 19

A directed communication graph

Grahic Jump Location
Fig. 20

Single-integrator agents using the graph in Fig. 19

Grahic Jump Location
Fig. 21

Double integrator agents using the communication graph in Fig. 19

Grahic Jump Location
Fig. 22

Double integrator agents using the communication graph in Fig. 19, NADF used

Grahic Jump Location
Fig. 23

x and y components of the control signal for agent 1

Grahic Jump Location
Fig. 24

Double integrator agents using the communication graph in Fig. 19, Kd = 0 and b = 2

Grahic Jump Location
Fig. 25

Double integrator agents with actuator saturation

Grahic Jump Location
Fig. 26

Double integrator agents with 2 s communication delay

Grahic Jump Location
Fig. 27

Maximum interagent distance versus time for different communication delays, double integrator agents

Grahic Jump Location
Fig. 28

Double integrator agents with external drift

Grahic Jump Location
Fig. 29

Double integrator agents subject to both external drift and 2 s communication delays

Grahic Jump Location
Fig. 30

Cooperative tracking, double integrator agents

Grahic Jump Location
Fig. 31

Five single-integrator agents using the suggested protocol

Grahic Jump Location
Fig. 32

Five double integrator agents using the suggested control protocol

Grahic Jump Location
Fig. 33

Control signals for the fifth agent in Fig. 32

Grahic Jump Location
Fig. 34

Agents in Fig. 32 with 80% actuator saturation

Grahic Jump Location
Fig. 35

Control signals for the fifth agent in Fig. 34

Grahic Jump Location
Fig. 36

Trajectories for carlike agents, K1 = 0.5 and K2 = 4

Grahic Jump Location
Fig. 37

Orientation, agent 5

Grahic Jump Location
Fig. 38

Control signals agent 5

Grahic Jump Location
Fig. 39

Trajectories for carlike agents, K1 = 0.5 and K2 = 10

Grahic Jump Location
Fig. 40

Two jets synchronizing their orientations

Grahic Jump Location
Fig. 41

Banking angle, jet 2

Grahic Jump Location
Fig. 42

Tangential force, jet 2

Grahic Jump Location
Fig. 43

Normal lift force, jet

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In