2019 American Control Conference (ACC) 2019
DOI: 10.23919/acc.2019.8815213
|View full text |Cite
|
Sign up to set email alerts
|

Learning-based control for a communicating mobile robot under unknown rates

Abstract: In problems such as surveying or monitoring remote regions, a mobile robot must transmit data over a wireless network with unknown, position-dependent transmission rates. We propose an algorithm to achieve this objective that learns approximations of the rate function and of an optimal-control solution that transmits the data in minimum time. The rates are estimated with supervised learning from the samples observed; and the control is found with dynamic programming sweeps around the current state of the robot… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 17 publications
0
4
0
Order By: Relevance
“…Regarding the obstacles, it will assumed that there is a finite number of them and that the initial state is initialized sufficiently far away that the robot can still avoid the obstacle. Recall that in the version of PT solved in Buşoniu et al (2019), there were no obstacles, and the dynamics had to be first-order, without any signal y.…”
Section: Pn (Navigation and Transmission Problemmentioning
confidence: 99%
See 3 more Smart Citations
“…Regarding the obstacles, it will assumed that there is a finite number of them and that the initial state is initialized sufficiently far away that the robot can still avoid the obstacle. Recall that in the version of PT solved in Buşoniu et al (2019), there were no obstacles, and the dynamics had to be first-order, without any signal y.…”
Section: Pn (Navigation and Transmission Problemmentioning
confidence: 99%
“…Note that in line 8, the rate function approximator R is used. Compared to the algorithm of Buşoniu et al (2019), this version eliminates two components that did not significantly contribute to performance: direct reinforcement learning and softmax exploration. Instead, here only greedy action selection is used, with optimistic initialization.…”
Section: Rate-learning Algorithm For the Transmission Problemmentioning
confidence: 99%
See 2 more Smart Citations