2017
DOI: 10.1109/access.2017.2708422
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Global Connectivity Maintenance and Control of Multi-Robot Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
7

Relationship

3
4

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 20 publications
0
7
0
Order By: Relevance
“…Due to the high operating efficiency of the embedded system, the generation time for each new formation was within 15 s, which meets the requirements of small UAV formations. The formation transformation method of the UAVs in the experiment comes from study [35], and the communication control method between UAVs comes from study [36].…”
Section: Flight Verification and Resultsmentioning
confidence: 99%
“…Due to the high operating efficiency of the embedded system, the generation time for each new formation was within 15 s, which meets the requirements of small UAV formations. The formation transformation method of the UAVs in the experiment comes from study [35], and the communication control method between UAVs comes from study [36].…”
Section: Flight Verification and Resultsmentioning
confidence: 99%
“…The communication network of the centralised dispatch system has a star topology centred on the dispatch centre, and each communication link is bidirectional. The distributed system only requires communication network topology connectivity [8], even joint connection [9]. The communication link can be bidirectional or unidirectional [10].…”
Section: Comparison Of Centralised and Distributed Ed Methodsmentioning
confidence: 99%
“…where ij pp − is the adjacency distance between robot i and j,  is a tuning parameter. In this paper, we define The weighted Laplacian matrix of the graph G is defined as [19] L  is defined as the algebraic connectivity to measure the connectivity of a graph ,and the larger the 2  is, the stronger the graph connectivity is.…”
Section: Preliminaries a Graph Theory And Global Connectivitymentioning
confidence: 99%
“…In addition, strong connectivity will take up more unnecessary network resources, which is not conducive to the execution of overall tasks. To solve this problem, a distributed control algorithm is proposed in [19] to maintain, enhance, and reduce the global connectivity online, according to different stages of tasks.…”
Section: Introductionmentioning
confidence: 99%