CORE
πΊπ¦Β
Β make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Adaptive rendezvous of multiple mobile agents with nonlinear dynamics and preserved network connectivity
Authors
MZ Chen
C Li
HS Su
Publication date
1 January 2011
Publisher
'United States Sports Academy'
Abstract
This paper investigates rendezvous of multiple nonlinear dynamical mobile agents with a virtual leader in a dynamic proximity network. It is assumed that only a fraction of agents in the group have access to the information on the position and velocity of the virtual leader. To avoid fragmentation, a bounded connectivity-preserving rendezvous algorithm is proposed for the multi-agent systems. Under the assumption that the initial network is connected, local adaptation strategies for the rendezvous algorithm are introduced that enable all agents to synchronize with the virtual leader even when only one agent is informed, without requiring any knowledge of the agent dynamics. Simulation results on an example are given to numerically verify the theoretical results. Β© 2011 Asian Control Association.published_or_final_versio
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
HKU Scholars Hub
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:hub.hku.hk:10722/135895
Last time updated on 01/06/2016