2020
DOI: 10.1109/tase.2020.2976560
|View full text |Cite
|
Sign up to set email alerts
|

Neural RRT*: Learning-Based Optimal Path Planning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
141
0
1

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 295 publications
(142 citation statements)
references
References 27 publications
0
141
0
1
Order By: Relevance
“…The Neural RRT* algorithm, proposed by Wang et al in Reference [ 21 ], is a novel optimal path planning algorithm based on convolutional neural networks. It used the A* algorithm to generate training data, considering map information as input, and the optimal path as ground truth.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The Neural RRT* algorithm, proposed by Wang et al in Reference [ 21 ], is a novel optimal path planning algorithm based on convolutional neural networks. It used the A* algorithm to generate training data, considering map information as input, and the optimal path as ground truth.…”
Section: Resultsmentioning
confidence: 99%
“…Novel DNN-based path planning methods which have been developed are based on biologically inspired cognitive architectures [ 20 ], with the three primary methods being swarm intelligence, evolutionary algorithms, and neurodynamics. In the case of Reference [ 21 ], an optimal path planning algorithm based on convolutional neural networks (CNN) and random-exporing trees (RRT) is presented. Their approach, called Neural RRT*, is a framework for generating the sampling distribution of the optimal path under several constraints.…”
Section: Related Workmentioning
confidence: 99%
“…The above aims to enhance the path-planning effectiveness by decreasing the implicit drawbacks of a single category. An example of these techniques is found in [21]. In the above research, an NN improves the RRT* algorithm by determining a suitable sampling distribution.…”
Section: Introduction 1a Review Of Path-planning Methodsmentioning
confidence: 99%
“…Therefore, the adaptive mechanism of the proposed algorithm can show better performance when the problem is more complicated. The adaptive update method is determined by formulas (11) and (12).…”
Section: Fitness Evaluationmentioning
confidence: 99%
“…At this stage, there are many path planning algorithms that can be used for automated robot inspections of IWSNs, such as rapidly exploring random tree (RRT) algorithm, Dijkstra algorithm, A * algorithm, GA, and ICA [11][12][13][14][15]. These algorithms can find a relatively good path, but they also have various disadvantages.…”
Section: Introductionmentioning
confidence: 99%