Evidence map›Paper›PMID 38667207›Full record

ArticleBiomimetics (Basel, Switzerland)2024

Reinforcement Learning with Task Decomposition and Task-Specific Reward System for Automation of High-Level Tasks.

Gunam Kwon, Byeongjun Kim, Nam Kyu Kwon

Abstract read
In one paragraph

Article in Biomimetics (Basel, Switzerland), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Gunam KwonDepartment of Electronic Engineering, Yeungnam University, Gyeongsan 38541, Republic of Korea.
Byeongjun KimDepartment of Electronic Engineering, Yeungnam University, Gyeongsan 38541, Republic of Korea.ORCID 0009-0008-6486-6926
Nam Kyu KwonDepartment of Electronic Engineering, Yeungnam University, Gyeongsan 38541, Republic of Korea.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

This paper introduces a reinforcement learning method that leverages task decomposition and a task-specific reward system to address complex high-level tasks, such as door opening, block stacking, and nut assembly. These tasks are decomposed into various subtasks, with the grasping and putting tasks executed through single joint and gripper actions, while other tasks are trained using the SAC algorithm alongside the task-specific reward system. The task-specific reward system aims to increase the learning speed, enhance the success rate, and enable more efficient task execution. The experimental results demonstrate the efficacy of the proposed method, achieving success rates of 99.9% for door opening, 95.25% for block stacking, 80.8% for square-nut assembly, and 90.9% for round-nut assembly. Overall, this method presents a promising solution to address the challenges associated with complex tasks, offering improvements over the traditional end-to-end approach.

Indexed as

deep reinforcement learninghigh-level tasksoft actor–critictask decomposition

Identifiers

PMID38667207
PMCPMC11047822

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.