2017 10th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI) 2017
DOI: 10.1109/cisp-bmei.2017.8302157
|View full text |Cite
|
Sign up to set email alerts
|

A deep reinforcement learning approach to preserve connectivity for multi-robot systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 11 publications
0
6
0
Order By: Relevance
“…The proposed schemes in [127] and [128] do not consider a minimum distance between the leaders and followers. The leaders and followers can collide with each other if the distance between them is too short.…”
Section: B Connectivity Preservationmentioning
confidence: 99%
See 2 more Smart Citations
“…The proposed schemes in [127] and [128] do not consider a minimum distance between the leaders and followers. The leaders and followers can collide with each other if the distance between them is too short.…”
Section: B Connectivity Preservationmentioning
confidence: 99%
“…Considering the general scenario, the authors in [128] address the connectivity preservation between multiple leaders and multiple followers. The robot system is definitely connected if any two robots are connected via a direct link or multi-hop link.…”
Section: B Connectivity Preservationmentioning
confidence: 99%
See 1 more Smart Citation
“…Actor-critic method and DQN have been applied in communication networks to maintain connectivity. Few examples on application of RL related to preserving connectivity are: [57], [206] [207], [208].…”
Section: Communication and Networkingmentioning
confidence: 99%
“…Solutions might be found in A3C's action strategy. In stochastic differential equations (SDE) [27], the white noise N t is often seen as the "derivative" of the Brownian motion B t [28], so the total derivative of A3C algorithm can be written as: η t dt = µ θ (s t ) dt + σ θ (s t ) • dB t . This gives a starting point for our research.…”
Section: Introductionmentioning
confidence: 99%