2020
DOI: 10.20944/preprints202011.0494.v3
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning

Abstract: This paper proposed a triangular inequality-based rewiring method for the Rapidly exploring Random Tree (RRT)-Connect robot path-planning algorithm that guarantees the planning time compared to the RRT algorithm, to bring it closer to the optimum. To check the proposed algorithm’s performance, this paper compared the RRT and RRT-Connect algorithms in various environments through simulation. From these experimental results, the proposed algorithm shows both quicker planning time and shorter path lengt… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(12 citation statements)
references
References 4 publications
0
8
0
Order By: Relevance
“…The specification of the computer used in the simulation is shown in Table 1. The simulator used for the simulation [4] was developed based on C# WPF (Microsoft Visual Studio Community 2019 Version 16.1.6 Microsoft .NET Framework Version 4.8.03752), and only a single thread was used for calculations except for the visual part. generally, depending on the specification of the computer, the result of performance Measurement such as planning time may be variations during the simulation.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The specification of the computer used in the simulation is shown in Table 1. The simulator used for the simulation [4] was developed based on C# WPF (Microsoft Visual Studio Community 2019 Version 16.1.6 Microsoft .NET Framework Version 4.8.03752), and only a single thread was used for calculations except for the visual part. generally, depending on the specification of the computer, the result of performance Measurement such as planning time may be variations during the simulation.…”
Section: Resultsmentioning
confidence: 99%
“…If it is free from collision, it calls postTriangular(), otherwise it calls interpolation(). postTriangular() connects qchild and qancestor like the Triangular Rewiring method [4], and the qparent between them is deleted from the path. interpolation() finds (interpolates) the point between qchild and qparent, and between qparent and qancestor that are free from obstacle collision when connected and rewire qchild, qancestor and those two points found.…”
Section: Endmentioning
confidence: 99%
See 1 more Smart Citation
“…The disinfection robot was designed using a path planning method called Rapidly-Exploring Random Tree Connect (RRT-Connect) [39], which consisted of two rapidly-exploring random trees (RRTs) and a simple greedy heuristic. RRTs were used for the robot's route planning, the aim of which was to select a route from a start position (qinit) to a goal position (qgoal), preventing the robot from colliding with a target object or obstacles.…”
Section: B Route Planningmentioning
confidence: 99%
“…In order to solve the problem of path planning, a variety of tasks need to be completed, such as positioning, obstacle avoidance and so on. Some researchers put forward the research methods and development trend of robot path planning technology [6]. According to the degree of mastering environmental information, path planning of intelligent robot can be divided into global path planning based on model and local path planning based on sensor.…”
Section: Introductionmentioning
confidence: 99%