CoChat

Trajectory planning for optimal robot catching in real-time

Lampariello, Roberto, Nguyen-Tuong, Duy, Castellini, Claudio, Hirzinger, Gerd, Peters, Jan · 2011 · 2011 IEEE International Conference on Robotics and Automation

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

Abstract

Many real-world tasks require fast planning of highly dynamic movements for their execution in real-time. The success often hinges on quickly finding one of the few plans that can achieve the task at all. A further challenge is to quickly find a plan which optimizes a desired cost. In this paper, we will discuss this problem in the context of catching small flying targets efficiently. This can be formulated as a non-linear optimization problem where the desired trajectory is encoded by an adequate parametric representation. The optimizer generates an energy-optimal trajectory by efficiently using the robot kinematic redundancy while taking into account maximal joint motion, collision avoidance and local minima. To enable the resulting method to work in real-time, examples of the global planner are generalized using nearest neighbour approaches, Support Vector Machines and Gaussian process regression, which are compared in this context. Evaluations indicate that the presented method is highly efficient in complex tasks such as ball-catching.

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.1109/icra.2011.5980114

Cites

21 of 21 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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Show all 21 references

Research works printed but not linked: 1

  1. 10.1002/(SICI)1097-4563(199802)15:2<57::AID-ROB1>3.3.CO;2-T · doi:10.1002/(sici)1097-4563(199802)15:2<57::aid-rob1>3.3.co;2-t

Cited by

See all 117

Metadata

Authors
Lampariello, R., Nguyen-Tuong, D., Castellini, C., Hirzinger, G., & Peters, J.
Affiliations
  • Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR) (DE)
  • Max Planck Institute for Biological Cybernetics (DE)
Venue
2011 IEEE International Conference on Robotics and Automation
Publisher
IEEE
Published
2011-05
Pages
3719-3726
ISSN
1050-4729 (ISSN-L)
OpenAlex
W2095905067
Cited by
117
References
23
Citations by year
2025: 11 · 2024: 6 · 2023: 7 · 2022: 9 · 2021: 7 · 2020: 16 · 2019: 8 · 2018: 16 · 2017: 9 · 2016: 6 · 2015: 6 · 2014: 6 · 2013: 5 · 2012: 5
FWCI
3.82
Type
conference paper
Language
en
Open access
closed
Locations
  • Proceedings - IEEE International Conference on Robotics and Automation/Proceedings (publishedVersion)
  • elib (German Aerospace Center) (acceptedVersion)
  • Max Planck Institute for Plasma Physics (submittedVersion)
  • Max Planck Digital Library (submittedVersion)
  • MPG.PuRe (Max Planck Society) (submittedVersion)
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
  • Physical Sciences › Engineering › Control and Systems Engineering › Robotic Mechanisms and Dynamics
  • Physical Sciences › Engineering › Biomedical Engineering › Soft Robotics and Applications
Keywords
trajectory planning, ball catching, real-time planning, energy-optimal trajectory, kinematic redundancy, collision avoidance, local minima, support vector machine, Gaussian process regression, global planner, dynamic motion planning

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: Trajectory planning for optimal robot catching in real-time. https://app.cochat.ai/papers/10.1109/icra.2011.5980114
The paper
Lampariello, R., Nguyen-Tuong, D., Castellini, C., Hirzinger, G., & Peters, J. (2011). Trajectory planning for optimal robot catching in real-time. 2011 IEEE International Conference on Robotics and Automation. https://doi.org/10.1109/icra.2011.5980114

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.