TY - GEN
T1 - Reusing risk-aware stochastic abstract policies in robotic navigation learning
AU - Da Silva, Valdinei Freire
AU - Koga, Marcelo Li
AU - Cozman, Fábio Gagliardi
AU - Costa, Anna Helena Reali
PY - 2014/1/1
Y1 - 2014/1/1
N2 - In this paper we improve learning performance of a risk-aware robot facing navigation tasks by employing transfer learning; that is, we use information from a previously solved task to accelerate learning in a new task. To do so, we transfer risk-aware memoryless stochastic abstract policies into a new task. We show how to incorporate risk-awareness into robotic navigation tasks, in particular when tasks are modeled as stochastic shortest path problems. We then show how to use a modified policy iteration algorithm, called AbsProb-PI, to obtain risk-neutral and risk-prone memoryless stochastic abstract policies. Finally, we propose a method that combines abstract policies, and show how to use the combined policy in a new navigation task. Experiments validate our proposals and show that one can find effective abstract policies that can improve robot behavior in navigation problems. © 2014 Springer-Verlag Berlin Heidelberg.
AB - In this paper we improve learning performance of a risk-aware robot facing navigation tasks by employing transfer learning; that is, we use information from a previously solved task to accelerate learning in a new task. To do so, we transfer risk-aware memoryless stochastic abstract policies into a new task. We show how to incorporate risk-awareness into robotic navigation tasks, in particular when tasks are modeled as stochastic shortest path problems. We then show how to use a modified policy iteration algorithm, called AbsProb-PI, to obtain risk-neutral and risk-prone memoryless stochastic abstract policies. Finally, we propose a method that combines abstract policies, and show how to use the combined policy in a new navigation task. Experiments validate our proposals and show that one can find effective abstract policies that can improve robot behavior in navigation problems. © 2014 Springer-Verlag Berlin Heidelberg.
UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84905444219&origin=inward
UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=84905444219&origin=inward
U2 - 10.1007/978-3-662-44468-9_23
DO - 10.1007/978-3-662-44468-9_23
M3 - Conference contribution
SN - 9783662444672
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 256
EP - 267
BT - Reusing risk-aware stochastic abstract policies in robotic navigation learning
T2 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Y2 - 1 January 2018
ER -