CoChat

Continuous wave peristaltic motion in a robot

Open access
Boxerbaum, Alexander S, Shaw, Kendrick M, Chiel, Hillel J, Quinn, Roger D · 2012 · The International Journal of Robotics Research
Cited by 175

The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.

Abstract

We have developed several innovative designs for a new kind of robot that uses a continuous wave of peristalsis for locomotion, the same method that earthworms use, and report on the first completed prototypes. This form of locomotion is particularly effective in constrained spaces, and although the motion has been understood for some time, it has rarely been effectively or accurately implemented in a robotic platform. As an alternative to robots with long segments, we present a technique using a braided mesh exterior to produce smooth waves of motion along the body of a worm-like robot. We also present a new analytical model of this motion and compare predicted robot velocity to a 2D simulation and a working prototype. Because constant-velocity peristaltic waves form due to accelerating and decelerating segments, it has been often assumed that this motion requires strong anisotropic ground friction. However, our analysis shows that with smooth, constant velocity waves, the forces that cause accelerations within the body sum to zero. Instead, transition timing between aerial and ground phases plays a critical role in the amount of slippage, and the final robot speed. The concept is highly scalable, and we present methods of construction at two different scales.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1177/0278364911432486

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 175

Metadata

Authors
Boxerbaum, A. S., Shaw, K. M., Chiel, H. J., & Quinn, R. D.
Venue
The International Journal of Robotics Research
Published
2012-01-18
Volume
31
Issue
3
Pages
302-318
ISSN
  • 0278-3649 (ISSN-L)
  • 1741-3176
OpenAlex
W2160203512
Cited by
175
References
18
FWCI
4.53
Type
journal article
Language
en
Open access
green

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

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.