We investigate the problem of risk averse robot path planning using the deep reinforcement learning and distributionally robust optimization perspectives. Our problem formulation involves modelling the robot as a stochastic linear dynamical system, assuming that a collection of process noise samples is available. We cast the risk averse motion planning problem as a Markov decision process and propose a continuous reward function design that explicitly takes into account the risk of collision with obstacles while encouraging the robot’s motion towards the goal. We learn the risk-averse robot control actions through Lipschitz approximated Wasserstein distributionally robust deep Q-learning to hedge against the noise uncertainty. The learned control actions result in a safe and risk averse trajectory from the source to the goal, avoiding all the obstacles. Various supporting numerical simulations are presented to demonstrate our proposed approach.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Path Planning Using Wassertein Distributionally Robust Deep Q-learning


    Beteiligte:

    Erscheinungsdatum :

    2023-01-01


    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch


    Schlagwörter :

    Klassifikation :

    DDC:    629



    Safe Reinforcement Learning Using Wasserstein Distributionally Robust MPC and Chance Constraint

    Kordabad, Arash Bahari / Wisniewski, Rafael / Gros, Sebastien | BASE | 2022

    Freier Zugriff

    Distributionally robust airline fleet assignment problem

    Silva, Marco / Poss, Michael | DataCite | 2019


    Distributionally robust origin–destination demand estimation

    Wang, Jingxing / Song, Jun / Zhao, Chaoyue et al. | Elsevier | 2024


    Distributionally robust ramp metering under traffic demand uncertainty

    Gu, Chuanye / Wu, Changzhi / Wu, Yonghong et al. | Taylor & Francis Verlag | 2022