Rendezvous of multiple mobile agents with preserved network connectivity

Su, Housheng; Wang, Xiaofan; Chen, Guanrong

doi:10.1016/j.sysconle.2010.03.006

Cited by 266 publications

(181 citation statements)

References 39 publications

Supporting

Mentioning

180

Contrasting

Order By: Relevance

“…Therefore, we first divide a long time series into many short overlapping [27]. Therefore, it is not suitable to select a very high threshold to let the network lose the connectivity for the pigeon group.…”

Section: B Multiscale Analysis Of Reciprocal Linksmentioning

confidence: 99%

Reciprocal relationships in collective flights of homing pigeons

Kattas

Small

2012

Phys. Rev. E

View full text Add to dashboard Cite

Collective motion of bird flocks can be explained via the hypothesis of many wrongs and/or a structured leadership mechanism. In pigeons, previous studies have shown that there is a well-defined hierarchical structure and certain specific individuals occupy more dominant positions, suggesting that leadership by the few individuals drives the behavior of the collective. Conversely, by analyzing the same datasets, we uncover a more egalitarian mechanism. We show that both reciprocal relationships and a stratified hierarchical leadership are important and necessary in the collective movements of pigeon flocks. Rather than birds adopting either exclusive averaging or leadership strategies, our experimental results show that it is an integrated combination of both compromise and leadership which drives the group's movement decisions.

show abstract

Section: B Multiscale Analysis Of Reciprocal Linksmentioning

confidence: 99%

Reciprocal relationships in collective flights of homing pigeons

Kattas

Small

2012

Phys. Rev. E

View full text Add to dashboard Cite

show abstract

“…Compared to [22,31] where the robust consensus tracking problems were considered and the agent dynamics were restricted to being single or double integrator, this paper considers robust attitude tracking of multiple spacecraft where the attitude dynamics of spacecraft are nonlinear. Additionally, [32,33] considered the rendezvous problem and the adaptive consensus problem for multiple mobile linear agents with preserved network connectivity, which is an interesting topic for the distributed cooperative control of multiple spacecraft. However, it is more challenging and cannot be obtained easily by extending the results in our paper.…”

Section: Resultsmentioning

confidence: 99%

Distributed Robust Attitude Tracking of Multiple Spacecraft with Disturbances and Unmodelled Dynamics

Yang

Liu

2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper considers the distributed robust attitude tracking problem of multiple spacecraft subject to disturbances and unmodelled dynamics. We designed a distributed robust attitude controller for each spacecraft using the relative attitudes and relative angular velocities of neighbors to ensure that the attitude tracking errors between the leader and the followers converge to zero under the condition that the communication graph among the followers is undirected and connected and at least one follower has the access to the leader. The control algorithm achieves robust attitude tracking under the existence of the disturbances and unmodelled dynamics by selecting the control gains according to the given condition.

show abstract

“…The above research results have achieved multi-agent progressive aggregation control, however, the movement state of the next moment in the agent depends on the current moment itself and the neighbor's movement state and without reference to the historical state of the previous moment, based on the researches of Housheng Su [5] and Michael M. Zavlanos et al [6], this paper proposes a new state backtracking aggregation control algorithm that maintains topological connectivity. Each agent keeps the historical information of last time about itself and neighborhood and used as a reference for the motion conditions of the next moment.…”

Section: Introductionmentioning

confidence: 99%

Multi-Agent Rendezvous Problem Based on State Backtracking

Tian¹

2018

Proceedings of the 2018 International Conference on Network, Communication, Computer Engineering (NCCE 2018)

View full text Add to dashboard Cite

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.

show abstract

Rendezvous of multiple mobile agents with preserved network connectivity

Cited by 266 publications

References 39 publications

Reciprocal relationships in collective flights of homing pigeons

Reciprocal relationships in collective flights of homing pigeons

Distributed Robust Attitude Tracking of Multiple Spacecraft with Disturbances and Unmodelled Dynamics

Multi-Agent Rendezvous Problem Based on State Backtracking

Contact Info

Product

Resources

About