The paper proposes an approach to learn and plan simultaneously in a partially known environment. The proposed framework exploits the Voronoi bias property of Rapidly exploring Random Tree* (RRT*), which balances the exploration-exploitation in Reinforcement Learning (RL). RL is employed to learn policy (sequence of actions), while RRT* is planning simultaneously. Once policy is learned for a fixed start and goal, repeated planing for identical start and goal can be avoided. In case of any environmental uncertainties, RL dynamically adapts the learned policy with the help of RRT*. Apparently, both learning and planning complement each other to handle environmental uncertainties dynamically in real-time and online. Interestingly, more the proposed algorithm runs, its efficiency increases in terms of planning time and uncertainty handling capability over the contender algorithm (i.e., RRT*). Simulation results are shown to demonstrate the efficacy of the proposed approach.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Simultaneous Learning and Planning using Rapidly Exploring Random Tree* and Reinforcement Learning


    Contributors:


    Publication date :

    2021-06-15


    Size :

    2616488 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Simplified and Smoothed Rapidly-Exploring Random Tree Algorithm for Robot Path Planning

    Gültekin, Ayhan / Diri, Samet / Becerikli, Yaşar | BASE | 2023

    Free access

    Real-Time Directed Rapidly Exploring Random Tree Path Planning for Air Collision Avoidance

    Lee, Minkyu / Noh, Geemoon / Park, Jihoon et al. | AIAA | 2022



    Planning using a Network of Reusable Paths: A Physical Embodiment of a Rapidly Exploring Random Tree

    Stenning, B. E. / McManus, C. / Barfoot, T. | British Library Online Contents | 2013


    Modeling UAV swarm flight trajectories using Rapidly-exploring Random Tree algorithm

    Jan M. Kelner / Wojciech Burzynski / Wojciech Stecz | DOAJ | 2024

    Free access