2020
DOI: 10.3233/ica-190616
|View full text |Cite
|
Sign up to set email alerts
|

A membrane parallel rapidly-exploring random tree algorithm for robotic motion planning

Abstract: In recent years, incremental sampling-based motion planning algorithms have been widely used to solve robot motion planning problems in high-dimensional configuration spaces. In particular, the Rapidly-exploring Random Tree (RRT) algorithm and its asymptotically-optimal counterpart called RRT* are popular algorithms used in real-life applications due to its desirable properties. Such algorithms are inherently iterative, but certain modules such as the collision-checking procedure can be parallelized providing … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
2

Relationship

2
8

Authors

Journals

citations
Cited by 51 publications
(22 citation statements)
references
References 62 publications
0
22
0
Order By: Relevance
“…Modern autonomous indoor robots are developed to perform some more tasks related to interact with the external environment. This robot and environmental interaction have various styles and types such as the systems where reconstruction of shapes of any three-dimensional object [212] and also a navigation system based on vision, which is mostly used in drones [213].…”
Section: E: Rapidly-explained Random Tree Algorithmsmentioning
confidence: 99%
“…Modern autonomous indoor robots are developed to perform some more tasks related to interact with the external environment. This robot and environmental interaction have various styles and types such as the systems where reconstruction of shapes of any three-dimensional object [212] and also a navigation system based on vision, which is mostly used in drones [213].…”
Section: E: Rapidly-explained Random Tree Algorithmsmentioning
confidence: 99%
“…-RRT-ENPS-GPU: a family of enzymatic numerical P systems implementing the RRT/RRT* algorithms [28]. -CuSNP: spiking neural P systems [3,4].…”
Section: Parallel Implementationsmentioning
confidence: 99%
“…RRT is a sampling-based path planning algorithm, which is characterized by randomly extracting the configuration space or state space, and searching for connectivity in it [25,26]. This allows rapid planning in semi-structured spaces, and it is not only suitable for ordinary two-dimensional planes, but also for three-dimensional spaces.…”
Section: Introductionmentioning
confidence: 99%