The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Motion Planning of Multi-Limbed Robots Subject to Equilibrium Constraints: The Free-Climbing Robot Problem
Abstract
This paper addresses the problem of planning the motion of a multilimbed robot in order to “free-climb” vertical rock surfaces. Freeclimbing only relies on frictional contact with the surfaces rather than on special fixtures or tools like pitons. It requires strength, but more importantly it requires deliberate reasoning: not only must the robot decide how to adjust its posture to reach the next feature without falling, it must plan an entire sequence of steps, where each one might have future consequences. In this paper, this process of reasoning is broken into manageable pieces by decomposing a freeclimbing robot's configuration space into manifolds associated with each state of contact between the robot and its environment. A multistep planning framework is presented that decides which manifolds to explore by generating a candidate sequence of hand and foot placements first. A one-step planning algorithm is then described that explores individual manifolds quickly. This algorithm extends the probabilistic roadmap approach to better handle the interaction between static equilibrium and the topology of closed kinematic chains. It is assumed throughout this paper that a set of potential contact points has been presurveyed. Validation with real hardware was done with a four-limbed robot called LEMUR (developed by the Mechanical and Robotic Technologies Group at NASA–JPL). Using the planner presented in this paper, LEMUR free-climbed an indoor, near-vertical surface covered with artificial rock features.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343 · cited 2×
“The Probabilistic-Roadmap (PRM) approach, or one of its variants, is widely used for planning paths through highdimensional configuration spaces subject to multiple constraints (see Kavraki et al. 1996 or Chapter 7 of Choset et al. 2005).”
Method
Cited by
Biologically inspired climbing with a hexapedal robot
Spenko, M. J., Haynes, G. C., Saunders, J. A., Cutkosky, M. R., Rizzi, A. A., Full, R. J., & Koditschek, D. E. (2008) · Journal of Field Robotics · doi:10.1002/rob.20238 · Cited by 426
Roehr, T. M., Cordes, F., & Kirchner, F. (2014) · Journal of Field Robotics · doi:10.1002/rob.21477 · Cited by 75
Metadata
- Authors
- Bretl, T.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2006-04
- Volume
- 25
- Issue
- 4
- Pages
- 317-342
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2138419444
- Cited by
- 172
- References
- 1
- FWCI
- 11.76
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Motion Planning of Multi-Limbed Robots Subject to Equilibrium Constraints: The Free-Climbing Robot Problem. https://app.cochat.ai/papers/10.1177/0278364906063979
- The paper
- Bretl, T. (2006). Motion Planning of Multi-Limbed Robots Subject to Equilibrium Constraints: The Free-Climbing Robot Problem. The International Journal of Robotics Research. https://doi.org/10.1177/0278364906063979
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.