Reinforcement Learning Timing Optimization for Safe Robot Navigation in Dynamic Environments

Reinforcement learning theoretically needs to keep re-learning new optimal policies for autonomous robot navigation when the environment is dynamic. Given no reinforcement learning is failure-free, however, the practical deployment of reinforcement learning raises a new but fundamental question: when to re-learn and when not to be safer in the long-term robot navigation? An early re-learning could encounter more failures due to unnecessary and unsafe explorations in the learning process while a late re-learning cannot avoid failures caused by the deteriorating policy. To determine the optimal timing of learning with minimal failures, we propose a Value of Learning approach that maximizes the difference between the learning gain and the learning cost. The learning gain estimates the performance improvement with respect to time and the learning cost evaluates the learning-induced failure risk, which is assumed to relate to environment changes and exploration strategies. A dynamic maze experiment validates that our approach can find an optimal re-learning timing with significantly fewer failures if compared with “always learning” and “no learning”, which are two representative cases of the early and late learning.

Authors

Institutions

Publication Details

Published
2024-11-26
DOI
https://doi.org/10.1109/iccais63750.2024.10814522
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reinforcement Learning Timing Optimization for Safe Robot Navigation in Dynamic Environments

Mingli Lu, X. K. Zhou, Benlian Xu, Jun Li
Robotic Path Planning Algorithms
article

Reinforcement Learning Timing Optimization for Safe Robot Navigation in Dynamic Environments

Mingli Lu, X. K. Zhou, Benlian Xu, Jun Li
article en

Abstract

Reinforcement learning theoretically needs to keep re-learning new optimal policies for autonomous robot navigation when the environment is dynamic. Given no reinforcement learning is failure-free, however, the practical deployment of reinforcement learning raises a new but fundamental question: when to re-learn and when not to be safer in the long-term robot navigation? An early re-learning could encounter more failures due to unnecessary and unsafe explorations in the learning process while a late re-learning cannot avoid failures caused by the deteriorating policy. To determine the optimal timing of learning with minimal failures, we propose a Value of Learning approach that maximizes the difference between the learning gain and the learning cost. The learning gain estimates the performance improvement with respect to time and the learning cost evaluates the learning-induced failure risk, which is assumed to relate to environment changes and exploration strategies. A dynamic maze experiment validates that our approach can find an optimal re-learning timing with significantly fewer failures if compared with “always learning” and “no learning”, which are two representative cases of the early and late learning.

Suzhou University of Technology (CN), Suzhou University of Science and Technology (CN), Nanjing University of Science and Technology (CN)
Affordable and clean energy
Openalex Percentile: Top 75%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Reinforcement Learning Timing Optimization for Safe Robot Navigation in Dynamic Environments — Mingli Lu, X. K. Zhou, et al. · (2024) | TGRS Research Map | TGRS