Multi-Agent Rendezvous Problem Based on State Backtracking
Jiahe Tian · Proceedings of the 2018 International Conference on Network, Communication, Computer Engineering (NCCE 2018) · 2018
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.