2019 International Conference on Robotics and Automation (ICRA) 2019
DOI: 10.1109/icra.2019.8793578
|View full text |Cite
|
Sign up to set email alerts
|

Feedback motion planning of legged robots by composing orbital Lyapunov functions using rapidly-exploring random trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…Once the ROAs are computed for multiple cyclic or steady-state gaits, they may be sequenced together by reasoning about overlapping regions to create nonsteady or agile gaits using heuristics 4 or more systematic motion planning algorithms such as rapidly exploring random trees. 5 The flow of the paper is as follows. First, we give some background and related work on the ROA for legged systems in Section 2.…”
Section: Introductionmentioning
confidence: 99%
“…Once the ROAs are computed for multiple cyclic or steady-state gaits, they may be sequenced together by reasoning about overlapping regions to create nonsteady or agile gaits using heuristics 4 or more systematic motion planning algorithms such as rapidly exploring random trees. 5 The flow of the paper is as follows. First, we give some background and related work on the ROA for legged systems in Section 2.…”
Section: Introductionmentioning
confidence: 99%
“…Further approaches employed the principles of motion planning algorithms which can compute collision-free path required for a robot to successfully complete a task [3]. Researchers have employed various motion planning algorithm, such as Dynamic roadmaps (DRM) [4,5], Rapidly Exploring Random Trees (RRT) [6,7], and elastic [8,9]. Although, significant improvements have been made using this approach, in general, motion planning algorithms is computational complex due to the high dimensionality of the configuration space that must be considered.…”
Section: Introductionmentioning
confidence: 99%