Using a half cheetah habitat for random augmentation computing

被引:0
|
作者
Kishor K. [1 ]
机构
[1] ABES Institute of Technology Ghaziabad, Uttar Pradesh
关键词
Augmented Random Search; Dynamical System; Hyper parameter; Linear Policies; Model-free Vs model-based learning; RL (Reinforcement Learning);
D O I
10.1007/s11042-024-19084-0
中图分类号
学科分类号
摘要
Reinforcement learning algorithms that depend on physical models are thought to provide more substantial outcomes in comparison to model-free approaches when implemented on dynamic systems. Previous research has mostly focused on addressing self-management difficulties via the use of sophisticated neural network models. In order to get state-of-the-art outcomes, these models need a significant amount of training data. When using model-free policy search techniques, it is often considered that model-free reinforcement learning processes with policies that provide worse outcomes may be avoided by utilizing augmented random search (ARS), model-free. This technique improves the effectiveness and speeds up the training of linear methods for performing control tasks on the virtual physics engine Half-Cheetah Environment. To reach this objective, we use the computational efficiency of Augmented Random Search (ARS) to assess the agent's performance over several random episodes and hyper parameters. The study also showcases the effectiveness of the search approach used for this project via the examination of simulation data, including many events and agents' behaviors. Our simulation reveals that the commonly used metric for assessing the efficiency of RL learning is inadequate in accurately determining the efficacy of specific circumstances. In these instances, Augmented Random Search (ARS) surpasses other algorithms by achieving more rewards. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.
引用
收藏
页码:5927 / 5946
页数:19
相关论文
共 50 条
  • [41] COMPUTING RANDOM FIELDS.
    Wiseman, N.E.
    Nedunuri, S.
    1600, (29):
  • [42] Random walk to quantum computing
    Barends, Rami
    PHYSICS WORLD, 2017, 30 (12) : 45 - 46
  • [43] SMCACC: Developing an Efficient Dynamic Secure Framework for Mobile Capabilities Augmentation Using Cloud Computing
    Abd Elminaam, Diaa Salama
    Alanezi, Farah Turkey
    Hosny, Khalid M.
    IEEE ACCESS, 2019, 7 : 120214 - 120237
  • [44] RSMDA: Random Slices Mixing Data Augmentation
    Kumar, Teerath
    Mileo, Alessandra
    Brennan, Rob
    Bendechache, Malika
    APPLIED SCIENCES-BASEL, 2023, 13 (03):
  • [45] THE EFFICACY OF RANDOM BIOPSIES DURING BREAST AUGMENTATION
    VALIULIS, JP
    ORSULAK, JP
    ANNALS OF PLASTIC SURGERY, 1985, 15 (05) : 400 - 403
  • [46] Random Structural Data Augmentation for Lane Detection
    Liu, Binhui
    Li, Peiyan
    Xu, Yonghua
    Cao, Lisong
    Hong, Liu
    Sheng, Jie
    Ling, Qiang
    2022 INTERNATIONAL CONFERENCE ON ADVANCED ROBOTICS AND MECHATRONICS (ICARM 2022), 2022, : 279 - 283
  • [47] Random Noise Boxes: Data Augmentation for Spectrograms
    Goubeaud, Maxime
    Gmyrek, Nicolla
    Ghorban, Farzin
    Schelkes, Lucas
    Kummert, Anton
    PROCEEDINGS OF THE 2021 IEEE INTERNATIONAL CONFERENCE ON PROGRESS IN INFORMATICS AND COMPUTING (PIC), 2021, : 24 - 28
  • [48] Using LiDAR and Random Forest to improve deer habitat models in a managed forest landscape
    Shanley, Colin S.
    Eacker, Daniel R.
    Reynolds, Conor P.
    Bennetsen, Bonnie M. B.
    Gilbert, Sophie L.
    FOREST ECOLOGY AND MANAGEMENT, 2021, 499
  • [49] Random half-integral polytopes
    Braun, Gabor
    Pokutta, Sebastian
    OPERATIONS RESEARCH LETTERS, 2011, 39 (03) : 204 - 207
  • [50] Random Recollections of an Eventful Half Century
    Ross, T. Edward
    JOURNAL OF ACCOUNTANCY, 1937, 64 (04): : 256 - 278