2018
DOI: 10.1109/access.2018.2872693
|View full text |Cite
|
Sign up to set email alerts
|

A Computational Framework for Automatic Online Path Generation of Robotic Inspection Tasks via Coverage Planning and Reinforcement Learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0
3

Year Published

2020
2020
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(20 citation statements)
references
References 27 publications
0
17
0
3
Order By: Relevance
“…Five AUVs are distributed in the 3D underwater environment, their original positions are (7,45,18), (9,28,5), (19,9,3), (4,45,14), and (27,49,46). They are represented by dots in different colors.…”
Section: A Target Hunting When Auv Is the Same Velocity As The Targetmentioning
confidence: 99%
See 2 more Smart Citations
“…Five AUVs are distributed in the 3D underwater environment, their original positions are (7,45,18), (9,28,5), (19,9,3), (4,45,14), and (27,49,46). They are represented by dots in different colors.…”
Section: A Target Hunting When Auv Is the Same Velocity As The Targetmentioning
confidence: 99%
“…The simulation research target hunting when the velocity of AUV is slower than the speed of moving target. In the simulation with five AUVs, their original positions are (17,43,42), (39,45,3), (19,34,6), (40,22,5), and (37,9,23). The target is located in (44, 47, 38) originally and its trajectory is purple.…”
Section: B Target Hunting When the Velocity Of Auv Is Slower Than Thmentioning
confidence: 99%
See 1 more Smart Citation
“…Using deep RL, they replaced most steps of the previous pre-planning smoothing method with a neural-network based method and achieved the development of an algorithm involving fewer calculations than the usual solution. Jing et al [25] proposed a computational framework for robot path generation for surface/shape inspection application. They used an RL-based tree search algorithm to efficiently generate online paths based on the proposed MDP formulation to solve the coverage planning problem [11].…”
Section: B Related Workmentioning
confidence: 99%
“…When robot performs reinforcement learning, it has to be able to generalize to new actions to become autonomous. Most approaches concern that robots derive efficient representations from high-dimensional sensory inputs, and use these to generalize past experience to new situations [7] [8]. Generally, this is a hard problem, since the search space the robot has to explore is potentially huge [9].…”
Section: Introductionmentioning
confidence: 99%