pith. sign in

arxiv: 2108.06161 · v4 · pith:IBCQ6QGCnew · submitted 2021-08-13 · 💻 cs.RO · cs.AI

Reinforcement Learning for Robot Navigation with Adaptive Forward Simulation Time (AFST) in a Semi-Markov Model

classification 💻 cs.RO cs.AI
keywords navigationafstenvironmentsproblemrobotunknownactionadaptive
0
0 comments X
read the original abstract

Deep reinforcement learning (DRL) algorithms have proven effective in robot navigation, especially in unknown environments, by directly mapping perception inputs into robot control commands. However, most existing methods ignore the local minimum problem in navigation and thereby cannot handle complex unknown environments. In this paper, we propose the first DRL-based navigation method modeled by a semi-Markov decision process (SMDP) with continuous action space, named Adaptive Forward Simulation Time (AFST), to overcome this problem. Specifically, we reduce the dimensions of the action space and improve the distributed proximal policy optimization (DPPO) algorithm for the specified SMDP problem by modifying its GAE to better estimate the policy gradient in SMDPs. Experiments in various unknown environments demonstrate the effectiveness of AFST.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Temporal Self-Imitation Learning

    cs.RO 2026-06 unverdicted novelty 6.0

    TSIL mines temporally efficient successful trajectories during RL training to supply configuration-conditioned adaptive targets and efficiency-weighted self-imitation, improving efficiency and robustness across 15 lon...