Skip to content
naulon
Not checkedNot checked for notices yet.

Optimal Path-Planning of Nonholonomic Terrain Robots for Dynamic Obstacle Avoidance Using Single-Time Velocity Estimator and Reinforcement Learning Approach

Hamid Taghavifar, Bin Xu, Leyla Taghavifar and 1 more

IEEE Access · 2019

doi:10.1109/access.2019.2950166 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

A single-time velocity estimator-based reinforcement learning (RL) algorithm, integrated with a chaotic metaheuristic optimization technique is proposed in this article for the optimal path-planning of the nonholonomic robots considering a moving/stationary obstacle avoidance strategy. The additional contribution of the present study is by employing the Terramechanics principles to incorporate the effects of wheel sinkage into the deformable terrain on the dynamics of the robot aiming to find the optimal compensating force/torque magnitude to sustain a robust and smooth motion. The designed systematic control-oriented system incorporates a cost function of weighted components associated with the target-tracking and the obstacle avoidance. The designed velocity estimator contributes to the finite-state Markov decision process (MDP) in order to train the transition probabilities of the problem objectives. Based on the obtained results, the optimal solution for the Q-learning in terms of the adjusting factor for the minimized tracking error and obstacle collision risk propagation profiles is found at 0.22. The results further confirm the promising capacity of the proposed optimization-based RL algorithm for the collision avoidance control of the nonholonomic robots on deformable terrains.

Abstract licence: CC BY-NC-ND

References38

    38 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.