Multi-Agent Rendezvous Problem Based on State Backtracking

DOI

10.2991/ncce-18.2018.124How to use a DOI?

Keywords

multi-agent; rendezvous; distribute system; cooperative control; state backtracking.

Abstract

This paper studies a new distributed multi-agent rendezvous problem based on state backtracking. It uses the historical state information of the agent as a reference for the current time to achieve the purpose of preserving topology connectivity and accelerating the rendezvous speed. The agent uses different switching strategies according to the changes of the historical moments and surrounding neighborhoods at the current moment and uses the potential function to enhance the topology connectivity so that the agents eventually rendezvous at the same point. Finally, the simulation experiment and the rendezvous effect statistics are given. The simulation experiments with 50 agents randomly distributed in the plane are taken as examples and the effects are compared. The results show that under this protocol, multi-agent systems 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 Based on State Backtracking
BT  - Proceedings of the 2018 International Conference on Network, Communication, Computer Engineering (NCCE 2018)
PB  - Atlantis Press
SP  - 754
EP  - 760
SN  - 1951-6851
UR  - https://doi.org/10.2991/ncce-18.2018.124
DO  - 10.2991/ncce-18.2018.124
ID  - Tian2018/05
ER  -