Trajectory planning for optimal robot catching in real-time
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.
Integrity signals
Registry
Cites
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.
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?
The cited source says what the claim attributes to it.
In the citing paper
“Although in the past, the field has seen impressive examples of object catching in-flight, they were either restricted to catching simple spherical objects [13], [28], [30]-[32], [44] or to catching objects with a slow changing orientation (e.g., a paper airplane [18]).”
From Catching Objects in Flight (2014) · cites this paper as [28]
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
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Mathematical elements for computer graphics
Rogers, D. F., & Adams, J. A. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,072
Modeling and Control of Robot Manipulators
(2000) · Industrial Robot: An International Journal · doi:10.1108/ir.2000.04927aae.003 · Cited by 989
Mathematical Elements for Computer Graphics
Mudur, S. P. (1986) · Advances in Computer Graphics I · doi:10.1007/978-3-642-46514-7_2 · Cited by 626
Task-Specific Generalization of Discrete and Periodic Dynamic Movement Primitives
Ude, A., Gams, A., Asfour, T., & Morimoto, J. (2010) · IEEE Transactions on Robotics · doi:10.1109/tro.2010.2065430 · Cited by 355
Kinematically optimal catching a flying ball with a hand-arm-system
Bauml, B., Wimbock, T., & Hirzinger, G. (2010) · 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2010.5651175 · Cited by 113
Self-citationOff-the-shelf vision for a robotic ball catcher
Frese, U., Bauml, B., Haidacher, S., Schreiber, G., Schaefer, I., Hahnle, M., & Hirzinger, G. (2002) · Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180) · doi:10.1109/iros.2001.977211 · Cited by 103
Self-citation
Research works printed but not linked: 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
Motion planning with sequential convex optimization and convex collision checking
Schulman, J., Duan, Y., Ho, J., Lee, A., Awwal, I., Bradlow, H., Pan, J., Patil, S., Goldberg, K., & Abbeel, P. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914528132 · Cited by 866
“Whereas convex-convex collision detection takes two colliding shapes and computes the minimal translation to get them out of collision, the distance field (and its gradient) merely computes how to get each robot point (or sphere) out of collision; however, two points may disagree on which way to go.”
BackgroundFinding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization
Schulman, J., Ho, J., Lee, A., Awwal, I., Bradlow, H., & Abbeel, P. (2013) · Robotics: Science and Systems IX · doi:10.15607/rss.2013.ix.031 · Cited by 430
“Lampariello et al. [15] incorporate signed distances between polytopes as inequality constraints in an optimal control problem.”
BackgroundKim, S., Shukla, A., & Billard, A. (2014) · IEEE Transactions on Robotics · doi:10.1109/tro.2014.2316022 · Cited by 220
“A body of work has been devoted to the autonomous control of fast movements such as catching [13], [18], [25], [28], [30]–[32], [44], hitting flying objects [24], [37], and juggling [6], [33], [35].”
BackgroundMethodReinforcement learning to adjust parametrized motor primitives to new situations
Kober, J., Wilhelm, A., Oztop, E., & Peters, J. (2012) · Autonomous Robots · doi:10.1007/s10514-012-9290-3 · Cited by 163
Self-citationTrajectory planning of free-floating space robot using Particle Swarm Optimization (PSO)
Wang, M., Luo, J., & Walter, U. (2015) · Acta Astronautica · doi:10.1016/j.actaastro.2015.03.008 · Cited by 158
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.