Multi-Agent Rendezvous Problem with Preserving Topology Connectivity

DOI

10.2991/ncce-18.2018.159How to use a DOI?

Keywords

multi-agent system; rendezvous; distribute control; preserving connectivity.

Abstract

This paper studies a distributed multi-agent rendezvous problem that preserves topology connectivity. Based on the constraint function, the agent's own and its neighbor's current time and last time's condition are used as conditions to judge the agent's movement trend and connectivity quality in the system.After that, the evaluation result is used as one of the basis for adjusting the input of the agent control so as to achieve the purpose of preserving the topology connectivity. Finally, taking the 50 agents distributed uniformly on the plane as an example, the simulation results and performance analysis are given. The results show that under this strategy, the multi-agent system can achieve gradual rendezvous at the same point.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jiahe Tian
PY  - 2018/05
DA  - 2018/05
TI  - Multi-Agent Rendezvous Problem with Preserving Topology Connectivity
BT  - Proceedings of the 2018 International Conference on Network, Communication, Computer Engineering (NCCE 2018)
PB  - Atlantis Press
SP  - 947
EP  - 952
SN  - 1951-6851
UR  - https://doi.org/10.2991/ncce-18.2018.159
DO  - 10.2991/ncce-18.2018.159
ID  - Tian2018/05
ER  -