2017 IEEE-RAS 17th International Conference on Humanoid Robotics (Humanoids) 2017
DOI: 10.1109/humanoids.2017.8239531
|View full text |Cite
|
Sign up to set email alerts
|

Humanoid navigation in uneven terrain using learned estimates of traversability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 19 publications
0
8
0
Order By: Relevance
“…Dynamic planning using a reduced robot model has recently shown promising results [21] but has not been evaluated in deployment scenarios. Other work on navigation planning specifically for legged robots either only considers cases of obstacle avoidance on flat terrain [22], [23] or does additional contact planning, which pushes computational complexity past the real-time mark [24], [25], [26].…”
Section: Related Workmentioning
confidence: 99%
“…Dynamic planning using a reduced robot model has recently shown promising results [21] but has not been evaluated in deployment scenarios. Other work on navigation planning specifically for legged robots either only considers cases of obstacle avoidance on flat terrain [22], [23] or does additional contact planning, which pushes computational complexity past the real-time mark [24], [25], [26].…”
Section: Related Workmentioning
confidence: 99%
“…Each action is a foot contact transition, which means moving one foot to a new pose. Contact transitions are predefined as a discrete set of foot projections, shown in Figure 2(a), and we adopt the contact projection approach in [38].…”
Section: Anytime Discrete-search Contact Plannermentioning
confidence: 99%
“…V. ANYTIME DISCRETE-SEARCH CONTACT PLANNER We build on the anytime discrete-search contact planner described in [36] with substantial modification on the edge cost and heuristic computation. We formulate the contact planning problem as a graph search.…”
Section: Centroidal Momentum Dynamics Optimizationmentioning
confidence: 99%
“…An action is either moving one end-effector to a new contact pose, or breaking one palm contact. The contact transitions are based on a predefined discrete transition model, shown in Figure 2, and we adopt the contact projection scheme in [36]. The edge cost of each action from a state s to a state s is defined as…”
Section: Centroidal Momentum Dynamics Optimizationmentioning
confidence: 99%