2020
DOI: 10.1007/s10846-019-01134-7
|View full text |Cite
|
Sign up to set email alerts
|

A Smooth and Safe Path Planning for an Active Lower Limb Exoskeleton

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 37 publications
0
6
0
Order By: Relevance
“…However, for practical experiments, this representation is computationally unfeasible. In this way, new bubbles can be easily computed using information from the workspace without needing the C-obstacle computation, as shown in [ 30 ]. Besides, it also allows us to compute bubbles for different robots.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…However, for practical experiments, this representation is computationally unfeasible. In this way, new bubbles can be easily computed using information from the workspace without needing the C-obstacle computation, as shown in [ 30 ]. Besides, it also allows us to compute bubbles for different robots.…”
Section: Resultsmentioning
confidence: 99%
“…Notice that the paths are not smooth, which can be a problem when considering a practical application. However, it is possible to apply optimization techniques to smooth the paths obtained from the probabilistic foam methods, as shown in [ 30 ], ensuring both safe and smooth paths.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The method Goal-Biased Probabilistic Foam (Nascimento et al, 2018b) is a global sampling-based path planner ideal for robots that need to perform safe motion. The GBPF is a variant of the Probabilistic Foam Method (Nascimento et al, 2018a(Nascimento et al, , 2020 where bubbles are expanded in the free configuration space and propagate with a strategy inspired on the expanding method of the search tree from the RRT-GoalBias algorithm Lavalle et al (2000), a variant of the classic Rapidly-Exploring Random Tree (RRT) LaValle (1998). The method GBPF converges to the goal configuration faster than the original PFM and provides paths with high clearance, differently from RRT.…”
Section: Goal-biased Probabilistic Foammentioning
confidence: 99%
“…Therefore, this feature can be used to perform path adjustments and, consequently, smooth the resulted path. Nascimento et al (2020) present an optimization approach to smooth the path obtained by path planners based on the probabilistic foam. We use the same approach in this work to make the path smoother.…”
Section: Path Smoothingmentioning
confidence: 99%