2021
DOI: 10.1016/j.rcim.2021.102196
|View full text |Cite
|
Sign up to set email alerts
|

Path planning for manipulators based on an improved probabilistic roadmap method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0
1

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 60 publications
(13 citation statements)
references
References 18 publications
0
12
0
1
Order By: Relevance
“…The algorithm adds visual constraints to the probabilistic roadmap, which avoids collision with obstacles while ensuring that the target is within the field of view of visual sensors. Chen et al proposed a PRM sampling strategy based on virtual force field in 2021 [62], which improved the performance of PRM algorithm in narrow passage scenarios, enabling end-effector to effectively avoid obstacles in chaotic environments.…”
Section: Random Sampling-based Grasping Path Planning Algorithmsmentioning
confidence: 99%
“…The algorithm adds visual constraints to the probabilistic roadmap, which avoids collision with obstacles while ensuring that the target is within the field of view of visual sensors. Chen et al proposed a PRM sampling strategy based on virtual force field in 2021 [62], which improved the performance of PRM algorithm in narrow passage scenarios, enabling end-effector to effectively avoid obstacles in chaotic environments.…”
Section: Random Sampling-based Grasping Path Planning Algorithmsmentioning
confidence: 99%
“…The experiments in this paper are based on this equipment. In the experiment section, we compare Q-learning with the A* algorithm [34], PRM [35], RRT [36], and BRRT(bidirectional rapid exploring random trees) [37]. The parameters of the comparison algorithm are shown in Table 2.…”
Section: Experiments a Test Environment And Parameters Settingsmentioning
confidence: 99%
“…However, they did not differentiate between static and dynamic obstacles, resulting in higher path curvature and increased overall path length. Chen et al preserved key waypoints in global planning to overcome the issue of the dynamic window approach becoming trapped in local optima 9 . They achieved optimization in terms of path length and smoothness.…”
Section: Introductionmentioning
confidence: 99%