2019
DOI: 10.1002/rob.21894
|View full text |Cite
|
Sign up to set email alerts
|

Sampling‐based hierarchical motion planning for a reconfigurable wheel‐on‐leg planetary analogue exploration rover

Abstract: Reconfigurable mobile planetary rovers are versatile platforms that may safely traverse cluttered environments by morphing their physical geometry. Planning paths for these adaptive robots is challenging due to their many degrees of freedom, and the need to consider potentially continuous platform reconfiguration along the length of the path. We propose a novel hierarchical structure for asymptotically optimal (AO) sampling‐based planners and specifically apply it to the state‐of‐the‐art Fast Marching Tree (FM… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
34
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(34 citation statements)
references
References 53 publications
0
34
0
Order By: Relevance
“…To the authors’ knowledge there are not many existing Local Planning approaches addressing the kinodynamic constraints of robots with multiple locomotion modes. Reid et al [ 50 ] proposed the use of a Sampling-Based algorithm, the Fast Marching Tree (FMT*), to tackle the motion planning of a reconfigurable hybrid robot with wheeled-legs.…”
Section: Path Planning Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…To the authors’ knowledge there are not many existing Local Planning approaches addressing the kinodynamic constraints of robots with multiple locomotion modes. Reid et al [ 50 ] proposed the use of a Sampling-Based algorithm, the Fast Marching Tree (FMT*), to tackle the motion planning of a reconfigurable hybrid robot with wheeled-legs.…”
Section: Path Planning Algorithmsmentioning
confidence: 99%
“…The main objective of FMT* is to find paths, avoiding obstacles, in problems involving a high number of degrees of freedom. One example of this is the motion planning of an articulated vehicle presented by Reid et al [ 50 ]. Ichter et al [ 199 ] propose the use of Group Marching Tree (GMT*), a similar algorithm to FMT* but which focuses on speeding up computation via parallelization using GPUs.…”
Section: C-space-search-based Path Planning Algorithmsmentioning
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%
“…To avoid discretization of the environment, Hitz et al (2017) use evolutionary techniques to optimize a parameterized B-spline in continuous space. Further, Reid et al (2020) explore hierarchical informative planning with applications to sampling using reconfigurable systems such as a planetary rover. Additional approaches to informative path planning based on hypothesis testing (Lim et al, 2016), fast marching methods (Lawrance et al, 2017), and orienteering (Bottarelli et al, 2019) have also been proposed.…”
Section: Related Workmentioning
confidence: 99%