2018 14th International Conference on Advanced Trends in Radioelecrtronics, Telecommunications and Computer Engineering (TCSET) 2018
DOI: 10.1109/tcset.2018.8336197
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of optimal path planning algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0
4

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 37 publications
(27 citation statements)
references
References 11 publications
0
21
0
4
Order By: Relevance
“…Some of these methods allow exploring large areas of interest and reducing the computational time, such as Probabilistic Roadmaps (PRM). This work focuses on the PRM algorithm, due to its advantages compared with other algorithms (e.g., A*, Rapidly-Exploring Random Tree (RRT), bidirectional RRT (bRRT), and Genetic Algorithms (GA)) in terms of both shortest time and distance parameters [16].…”
Section: D Path Planningmentioning
confidence: 99%
“…Some of these methods allow exploring large areas of interest and reducing the computational time, such as Probabilistic Roadmaps (PRM). This work focuses on the PRM algorithm, due to its advantages compared with other algorithms (e.g., A*, Rapidly-Exploring Random Tree (RRT), bidirectional RRT (bRRT), and Genetic Algorithms (GA)) in terms of both shortest time and distance parameters [16].…”
Section: D Path Planningmentioning
confidence: 99%
“…A* algorithm shown in Figure 2. A* tries to minimize the cost for the path by the formulized function as (Korkmaz & Durdu, 2018):…”
Section: A* Algorithmmentioning
confidence: 99%
“…When leaf nodes in the random tree contain the goal point or enter the goal region, a path from the initial point to the goal point can be found (Xinyu, Xiaojuan, Yong, Jiadong, & Rui, 2019). RRT is suitable algorithm to solve path planning problems under holonomic and non-holonomic constraints (Korkmaz & Durdu, 2018). Figure 4 shows the RRT algorithm.…”
Section: Rapidly Exploring Random Tree Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…A* is best regarding the shortest distance, but the algorithm need a longer computational time. The algorithm is not appropriate to the situation for sequential tasks are assigned for robot [24]. The path planning with energy considerations insight were generated by weighted A* search to obtain the global navigation strategy [25].…”
mentioning
confidence: 99%