pith. sign in

arxiv: 2606.22143 · v1 · pith:7F7NKS67new · submitted 2026-06-20 · 💻 cs.RO · cs.GT· cs.LG

Physics-Informed Eikonal Caging for Whole-Arm Manipulation Planning

Yan Zhang , Yiming Li , Yifei Dong , Florian T. Pokorny , Sylvain Calinon This is my paper

Pith reviewed 2026-06-26 11:39 UTC · model grok-4.3

classification 💻 cs.RO cs.GTcs.LG
keywords cagingwhole-arm manipulationphysics-informed neural networkeikonal equationescape time fieldmanipulation planningcontact model mismatch
0
0 comments X

The pith

Reformulating caging as a minimum-time escape problem produces an escape-time field that obeys an eikonal equation and can be learned with a physics-informed neural network for manipulation planning.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper recasts the geometric idea of caging an object inside a robot arm's shape as the shortest time an object would need to escape that shape. This produces a continuous field over configurations that quantifies enclosure quality and obeys the eikonal equation from wave propagation. A physics-informed neural network then approximates the field to create a smooth, differentiable objective that planners can directly optimize. The resulting plans favor robot poses that make escape harder, allowing the use of simpler contact models while still achieving robustness to model errors in whole-arm tasks.

Core claim

Caging is reformulated as a minimum-time escape problem under the robot's enclosing geometry. The resulting escape-time field measures enclosure quality, satisfies an eikonal equation, and is approximated by a physics-informed neural network to yield a differentiable representation for embedding into continuous optimization-based manipulation planning.

What carries the argument

The escape-time field from the minimum-time escape problem, which satisfies the eikonal equation and is approximated via a physics-informed neural network to provide a differentiable enclosure metric.

If this is right

  • Whole-arm manipulation planners can optimize directly for configurations that resist object escape using the differentiable field.
  • Simplified contact models such as quasi-dynamic approximations become viable for planning without sacrificing robustness.
  • Improved resistance to disturbances and contact-model mismatch is achieved in both simulation and real-world tests compared to baselines.
  • Geometric enclosure acts as a practical robustness primitive for contact-rich whole-arm manipulation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The approach may generalize to other enclosure-based tasks like containment or guarding in robotics.
  • Connections to traditional path-planning methods using eikonal equations could allow hybrid planning strategies.
  • Further validation with varying object shapes and dynamic environments would test the limits of the enclosure metric.
  • Embedding the field into learning-based controllers could enable online adjustment during execution.

Load-bearing premise

That solving the minimum-time escape problem under the robot geometry accurately captures the robustness of caging to inaccuracies in contact models.

What would settle it

A real-robot experiment in which a planned manipulation using the escape-time objective fails under actual contact while a non-caging baseline succeeds would falsify the claim that the field provides the intended robustness.

Figures

Figures reproduced from arXiv: 2606.22143 by Florian T. Pokorny, Sylvain Calinon, Yan Zhang, Yifei Dong, Yiming Li.

Figure 1
Figure 1. Figure 1: Conceptual overview of whole-arm caging manipulation for robust whole-arm manipulation planning with simplified contact dynamics. Top: the robot transports a box-shaped object using distributed whole-arm contact along a manipulation trajectory planned with a simplified object model, where the box is under-approximated by a circular geometry (yellow circle). Bottom: the corresponding escape-time field over … view at source ↗
Figure 2
Figure 2. Figure 2: Illustrations of caging and partial caging with a point￾mass object (yellow star) in its configuration space R 2 . The white region indicates environment obstacles, corresponding to the collision set C col o . The escape region consists of configurations outside the boundary ∂Ωg, shown as a dashed circle. Cyan curves indicate possible collision-free paths of the object: in the caging case they remain trapp… view at source ↗
Figure 3
Figure 3. Figure 3: (a): Eikonal caging in the configuration space of a point mass (yellow star) interacting with a square-annulus obstacle (white area). The point mass lies inside the inner cavity (grey area), while the goal region is outside the red dashed boundary; No collision-free path exists from the cavity to the goal, so this region forms a cage in configuration space. Contours with values indicate the minimal escape … view at source ↗
Figure 4
Figure 4. Figure 4: Comparison between the PINN-based eikonal caging time field and the ground-truth solution from FMM. Two representative robot configurations and point-mass positions are shown, illustrating that the learned model closely matches the true escape-time field and recovers the corresponding optimal escape paths. As shown in the previous subsection, Tˆ is a conservative lower bound of the true rigid-body escape t… view at source ↗
Figure 5
Figure 5. Figure 5: Optimal caging configurations found with CMA-ES and SQP, maximizing the learned eikonal caging metric of an object represented by three circles shown in red. Configuration optimization. We next optimize Equa￾tion (9) for an object represented by three circles, using both CMA-ES and SQP from the same initial robot configuration. As shown in [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Whole-arm caging manipulation under three objective modes. Mode 1 minimizes the minimum distance between the object and the whole robot arm; Mode 2 minimizes the average distance between the object and all robot links; Mode 3 uses the learned escape-time field for whole-arm caging (our method). For each mode, we show the same initial robot configuration, the robot–object configuration at first contact, and… view at source ↗
Figure 7
Figure 7. Figure 7: Contact distribution, proximity diagnostics, and enclosure quality for the three planning modes. object–arm distance (metric used in Mode 2); and (iii) the escape-time caging metric. Results are shown in [PITH_FULL_IMAGE:figures/full_fig_p010_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Object–to–goal distance over time during open￾loop execution of planned trajectories under three levels of random disturbances across the three planning modes. Lower values indicate better task progress. Mode 3 shows the most concentrated and stable trajectories across disturbance levels [PITH_FULL_IMAGE:figures/full_fig_p011_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Final object-to-goal distance at the terminal time step under random disturbances. Smaller values indicate better task completion. Mode 3 consistently achieves the lowest final error, while Mode 2 exhibits the largest degradation under disturbance. denote the object velocity predicted by the QP-based quasi￾dynamic model, and let v true o = f true o (q,ur) denote the velocity produced by the true contact dy… view at source ↗
Figure 10
Figure 10. Figure 10: Object trajectories under dynamics-order mismatch. Robot motions are planned using the first-order quasi-dynamic model (blue solid) and executed under second-order MuJoCo dynamics (red dashed). The goal region is shown in green. Mode 3 preserves similar overall behavior under mismatch, whereas Modes 1 and 2 exhibit larger deviations or task failure. different objectives tolerate unmodeled object motion. F… view at source ↗
Figure 11
Figure 11. Figure 11: Object trajectories under shape under-approximation. Robot motions planned for a circular object are executed on polygonal objects (octagon, hexagon, square) with increasing geometric mismatch. The circle case is the no-mismatch reference. Mode 3 remains comparatively stable as mismatch increases, while the baselines accumulate larger trajectory errors [PITH_FULL_IMAGE:figures/full_fig_p013_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Illustration of shape under-approximation used during planning. The orange circle denotes the simplified object model used for optimization, while black outlines indicate the true polygonal shapes used during execution. Blue segments show maximum contact-point displacement δϕn, and green arcs show corresponding surface-normal mismatch δγd. Larger mismatch values imply greater geometric modeling error. whe… view at source ↗
Figure 13
Figure 13. Figure 13: Object trajectories under friction mismatch. Robot motions planned with nominal friction coefficient µ = 0.5 are executed using different friction values. Mode 3 exhibits smaller task-level trajectory deviations across the tested range, indicating reduced sensitivity to friction mis-specification. 7 Validation on Realistic Geometry and Real-World Systems Since the proposed method is fundamentally geometry… view at source ↗
Figure 14
Figure 14. Figure 14: Experiment setup with a Franka arm for tabletop whole-arm manipulation planning. Red dashed lines and arrows indicate the active joints. subset of joints is fixed and only joints [1, 4, 6] are actively controlled ( [PITH_FULL_IMAGE:figures/full_fig_p014_14.png] view at source ↗
Figure 16
Figure 16. Figure 16: Initial contact configurations for whole-arm caging manipulation (WACaging) and baseline contact geometries (Point, Link, WAContact). The nominal object representation used for planning (orange circle) is an under-approximation of the true box geometry (light orange). Transparent robot parts are only used for visualization and are incapable of making contact with the target object. The green marker indica… view at source ↗
Figure 15
Figure 15. Figure 15: Whole-arm caging configurations for a Franka arm and three everyday object geometries. For each object, the left panel shows the optimized caging configuration obtained with CMA-ES, with a 3D rendering of the object shown in the inset. The right panel visualizes the learned escape-time field together with the object’s 2D point-based approximation. Each object is represented by a small set of circles whose… view at source ↗
Figure 17
Figure 17. Figure 17: Robot and object configurations at keyframes with four different contact geometries [PITH_FULL_IMAGE:figures/full_fig_p017_17.png] view at source ↗
Figure 18
Figure 18. Figure 18: Robustness evaluation under random object motion disturbances. The object trajectories without any disturbances are shown as Nominal trajectories with blue lines. Red trajectories show the mean disturbed object trajectories (shown with grey thin lines) over 100 trials [PITH_FULL_IMAGE:figures/full_fig_p017_18.png] view at source ↗
Figure 19
Figure 19. Figure 19: Caging metric comparison [PITH_FULL_IMAGE:figures/full_fig_p017_19.png] view at source ↗
Figure 21
Figure 21. Figure 21: Whole-arm trajectory tracking and caging perfor￾mance analysis Overall tracking and enclosure behavior. Figure 21a illustrates the resulting object trajectories and corresponding escape-time values for λ ∈ {1, 5, 10, 50, 100}. For small λ (e.g., λ = 1 or 5), the planner prioritizes enclosure and produces object paths that remain closer to the left-side arc as observed in the previous goal-reach task, desp… view at source ↗
Figure 22
Figure 22. Figure 22: Evaluation of robustness with solution generated under λ = 100. Left: Robustness to random motion disturbance with magnitude σ = 0.005m. Right: Robustness to four representative forms of contact model mismatches. Compared with the goal-reaching task, the escape-time profile differs because the robot must temporarily reduce enclosure in order to adjust its pushing configuration. As shown in Figure 21a, the… view at source ↗
Figure 23
Figure 23. Figure 23: Real-world experiment setup with increasing levels of object-shape mismatch relative to the planning model. (a,b) Initial contact configuration in simulation and on the Franka robot. During planning, the object is approximated as six cylindrical primitives corresponding to the kitchen paper rolls (white cylinders in (a)). We considered three levels of object shape mismatch (SM) relative to the simulation … view at source ↗
Figure 24
Figure 24. Figure 24: Object trajectories during sim-to-real transfer under three increasing levels of object-shape mismatch. Other execution conditions are kept unchanged across the three scenarios. The yellow dot marks the nominal initial object position used during simulation planning. For each case, the planned simulation trajectory is shown in blue, together with five real-world trials (thin dashed lines) and their mean t… view at source ↗
Figure 25
Figure 25. Figure 25: Snapshots of robot–object configurations in simulation and real-world execution under the most challenging mismatch setting (SM3: A4 paper box with an additional paper roll). The upper row shows the planning model used for whole-arm caging manipulation, while the lower row shows corresponding real-world execution. Despite multiple simultaneous contact-geometry mismatches, the transferred trajectory remain… view at source ↗
Figure 27
Figure 27. Figure 27: Object’s distance to goal at final time step. 0.5 0.0 0.5 FMM y ( m ) (a) 0.19 0.38 0.58 0.77 0.96 (b) 0.19 0.38 0.58 0.77 0.96 0.5 0.0 0.5 x (m) 0.5 0.0 0.5 PINN y ( m ) 0.19 0.38 0.58 0.77 0.5 0.0 0.5 x (m) 0.19 0.38 0.58 0.77 0.0 0.2 0.4 0.6 0.8 1.0 1.2 Escape time (s) Point Mass Path Robot [PITH_FULL_IMAGE:figures/full_fig_p026_27.png] view at source ↗
Figure 26
Figure 26. Figure 26: Contact distribution, proximity diagnostics, and enclosure quality for the three planning modes. controller whose stiffness parameters match those used in the corresponding QP-based planning model. Each planned trajectory waypoint generated by the QP model is executed over 50 MuJoCo simulation steps, allowing the system to converge to the target configuration before advancing to the next waypoint. B Addit… view at source ↗
read the original abstract

Planning contact-rich whole-arm manipulation is challenging because interactions that involve extended robot geometry give rise to complex contact dynamics that are difficult to model accurately. This creates a need for planning principles that do not rely heavily on precise contact models. Caging offers one such geometric notion of robustness to modeling inaccuracy by restricting object escape through geometrically enclosing the object. However, existing caging formulations are difficult to incorporate into continuous optimization-based manipulation planning. We reformulate caging as a minimum-time escape problem in which the object seeks to leave an enclosing robot geometry in the shortest time. This yields a continuous escape-time field that measures the robot's enclosure quality and we show it satisfies an eikonal equation. We therefore can approximate this field using a physics-informed neural network, producing a smooth differentiable representation that can be embedded directly into manipulation planning. The resulting objective supports whole-arm manipulation planning to favor robot configurations resisting object escape. This improves the manipulation robustness to contact model mismatch, thus enabling planning with simplified contact models, including quasi-dynamic approximations and simplified object geometry. Across simulation and real-world experiments, we show improved robustness to disturbances and contact-model mismatch relative to baselines. These results suggest that geometric enclosure can serve as a practical robustness primitive for whole-arm manipulation. A supplementary video, which includes an intuitive overview of our method and experiment video results, is available on our project webpage.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper reformulates caging for whole-arm manipulation as a minimum-time escape problem for an object leaving the robot's enclosing geometry. It asserts that the resulting escape-time field satisfies the eikonal equation, approximates the field via a physics-informed neural network (PINN) to obtain a smooth differentiable representation, and embeds this field as an objective in continuous manipulation planning. The approach is claimed to improve robustness to contact-model mismatch, enabling use of simplified models (e.g., quasi-dynamic), with supporting simulation and real-robot experiments.

Significance. If the escape-time-to-robustness mapping is valid, the method supplies a geometric, model-light primitive that can be directly differentiated and optimized within existing planners. This addresses a practical gap in contact-rich whole-arm tasks where accurate dynamics are unavailable. The PINN-based eikonal approximation is a clean way to obtain the required smoothness without discretizing the configuration space.

major comments (2)
  1. [Abstract] Abstract and opening paragraphs: the central claim that the min-time escape field under idealized enclosing geometry quantifies robustness to contact-model mismatch (friction, compliance, multi-contact dynamics) is asserted without an explicit argument or counter-example analysis showing why this geometric quantity dominates unmodeled effects that could permit escape even when the field value is large. This mapping is load-bearing for the practical utility of the planning objective.
  2. [Abstract / Methods] The abstract states that the escape-time field satisfies the eikonal equation and that a PINN is used to approximate it, yet supplies no derivation steps, boundary-condition enforcement details (T=0 on boundary, | abla T|=1 inside), or error analysis for the PINN training. Because the eikonal property is the justification for using the PINN inside the planner, this omission affects assessment of the method's soundness.
minor comments (1)
  1. Notation for the escape-time field T and the enclosing geometry should be introduced with a single consistent definition early in the manuscript rather than piecemeal.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments, which help clarify the presentation of our contributions. We address each major comment below with specific responses and proposed revisions.

read point-by-point responses

  1. Referee: [Abstract] Abstract and opening paragraphs: the central claim that the min-time escape field under idealized enclosing geometry quantifies robustness to contact-model mismatch (friction, compliance, multi-contact dynamics) is asserted without an explicit argument or counter-example analysis showing why this geometric quantity dominates unmodeled effects that could permit escape even when the field value is large. This mapping is load-bearing for the practical utility of the planning objective.

    Authors: We agree that an explicit argument linking the escape-time field to robustness against contact-model mismatch would strengthen the manuscript. The underlying intuition is that a large escape time under the idealized enclosing geometry implies the object must traverse a long path in configuration space to escape, providing a temporal buffer even if unmodeled effects (e.g., reduced friction or compliance) alter the actual dynamics. In the revision we will add a dedicated paragraph in the introduction that formalizes this reasoning and includes a simple counter-example: two robot configurations with identical contact models but differing escape times, showing that the higher escape-time configuration maintains enclosure under perturbed friction coefficients where the lower one fails. This addition will make the load-bearing claim more transparent without altering the core method. revision: yes

  2. Referee: [Abstract / Methods] The abstract states that the escape-time field satisfies the eikonal equation and that a PINN is used to approximate it, yet supplies no derivation steps, boundary-condition enforcement details (T=0 on boundary, |∇T|=1 inside), or error analysis for the PINN training. Because the eikonal property is the justification for using the PINN inside the planner, this omission affects assessment of the method's soundness.

    Authors: The derivation that the minimum-time escape problem yields the eikonal equation (with T=0 on the boundary and |∇T|=1 in the free space) appears in Section III-B of the manuscript, along with the PINN loss formulation that enforces these conditions via the PDE residual. However, the abstract and early sections do not recap these steps. In the revision we will insert a concise derivation outline (one paragraph) into the introduction immediately after the problem statement, explicitly stating the boundary condition and the |∇T|=1 interior condition. We will also add a short error analysis subsection in the experiments (including L2 residual norms on a held-out grid and maximum pointwise error) to quantify PINN accuracy and support the claim that the approximation is sufficiently faithful for use inside the planner. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation relies on external PDE and experimental validation

full rationale

The paper defines caging via a min-time escape reformulation (a modeling choice), notes that the resulting field satisfies the eikonal equation by the standard Hamilton-Jacobi property of unit-speed escape (external fact), approximates it with a PINN (standard technique whose loss is independent of the planning objective), and embeds the field into an optimization cost. Robustness to contact mismatch is asserted as an empirical outcome validated in simulation and hardware experiments rather than derived by construction from any fitted parameter or self-citation. No load-bearing step reduces to a definitional equivalence or internal fit.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Based solely on the abstract, the central claim rests on the mathematical fact that the minimum-time escape function satisfies the eikonal equation (standard PDE) and on the modeling assumption that geometric enclosure time is a sufficient proxy for robustness to contact mismatch. No free parameters or invented entities are mentioned.

axioms (2)
  • standard math The minimum-time escape function under enclosing robot geometry satisfies the eikonal equation.
    Invoked in the abstract when the escape-time field is introduced.
  • domain assumption Geometric enclosure quality measured by escape time provides robustness to contact-model inaccuracy.
    Stated as the motivation for using caging in the first paragraph of the abstract.

pith-pipeline@v0.9.1-grok · 5790 in / 1438 out tokens · 14660 ms · 2026-06-26T11:39:59.714658+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

126 extracted references · 9 canonical work pages · 1 internal anchor

  1. [1]

    and Pokorny, Florian T

    Stork, Johannes A. and Pokorny, Florian T. and Kragic, Danica , booktitle =. A Topology-based Object Representation for Clasping, Latching and Hooking , year =

  2. [2]

    and Toussaint, Marc and Kragic, Danica , booktitle =

    Zarubin, Dmitry and Pokorny, Florian T. and Toussaint, Marc and Kragic, Danica , booktitle =. Caging Complex Objects with Geodesic Balls , year =

  3. [3]

    and Stork, Johannes A

    Pokorny, Florian T. and Stork, Johannes A. and Kragic, Danica , booktitle =. Grasping Objects with Holes: A Topological Approach , year =

  4. [4]

    and Pokorny, Florian T

    Stork, Johannes A. and Pokorny, Florian T. and Kragic, Danica , booktitle =. Integrated Motion and Clasp Planning with Virtual Linking , year =

  5. [5]

    Proceedings of IEEE International Conference on Robotics and Automation , volume=

    Caging 2D bodies by 1-parameter two-fingered gripping systems , author=. Proceedings of IEEE International Conference on Robotics and Automation , volume=. 1996 , organization=

    1996

  6. [6]

    IEEE Transactions on Robotics , year=

    Simultaneous trajectory optimization and contact selection for contact-rich manipulation with high-fidelity geometry , author=. IEEE Transactions on Robotics , year=

  7. [7]

    The International Journal of Robotics Research , volume=

    From caging to grasping , author=. The International Journal of Robotics Research , volume=. 2012 , publisher=

    2012

  8. [8]

    Autonomous Robots , volume=

    Herding by caging: a formation-based motion planning framework for guiding mobile agents , author=. Autonomous Robots , volume=. 2021 , publisher=

    2021

  9. [9]

    The international journal of robotics research , volume=

    Free space of rigid objects: Caging, path non-existence, and narrow passage detection , author=. The international journal of robotics research , volume=. 2021 , publisher=

    2021

  10. [10]

    2015 IEEE International Conference on Robotics and Automation (ICRA) , pages=

    Robust three-finger three-parameter caging of convex polygons , author=. 2015 IEEE International Conference on Robotics and Automation (ICRA) , pages=. 2015 , organization=

    2015

  11. [11]

    IEEE Transactions on Automation Science and Engineering , volume=

    Equilateral three-finger caging of polygonal objects using contact space search , author=. IEEE Transactions on Automation Science and Engineering , volume=. 2018 , publisher=

    2018

  12. [12]

    2013 IEEE International Conference on Robotics and Automation , pages=

    Measurement framework of partial cage quality based on probabilistic motion planning , author=. 2013 IEEE International Conference on Robotics and Automation , pages=. 2013 , organization=

    2013

  13. [13]

    2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages=

    Partial caging: A clearance-based definition and deep learning , author=. 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages=. 2019 , organization=

    2019

  14. [14]

    IEEE Robotics and Automation Letters , volume=

    Energy-bounded caging: Formal definition and 2-D energy lower bound algorithm based on weighted alpha shapes , author=. IEEE Robotics and Automation Letters , volume=. 2016 , publisher=

    2016

  15. [15]

    2024 IEEE International Conference on Robotics and Automation (ICRA) , pages=

    Quasi-static soft fixture analysis of rigid and deformable objects , author=. 2024 IEEE International Conference on Robotics and Automation (ICRA) , pages=. 2024 , organization=

    2024

  16. [16]

    IEEE Robotics and Automation Letters , volume=

    Characterizing manipulation robustness through energy margin and caging analysis , author=. IEEE Robotics and Automation Letters , volume=

  17. [17]

    2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages=

    Cagecoopt: enhancing manipulation robustness through caging-guided morphology and policy co-optimization , author=. 2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages=. 2025 , organization=

    2025

  18. [18]

    2026 IEEE International Conference on Robotics and Automation (ICRA) , year=

    Robustness-Aware Tool Selection and Manipulation Planning with Learned Energy-Informed Guidance , author=. 2026 IEEE International Conference on Robotics and Automation (ICRA) , year=

    2026

  19. [19]

    and Hutchinson, Seth A

    LaValle, Steven M. and Hutchinson, Seth A. , year=. The International Journal of Robotics Research , publisher=. doi:10.1177/027836499801700104 , number=

    work page doi:10.1177/027836499801700104

  20. [20]

    Algorithmica , volume=

    Robot motion planning: A game-theoretic foundation , author=. Algorithmica , volume=. 2000 , publisher=

    2000

  21. [21]

    2016 , school=

    A tensor-train-decomposition-based algorithm for high-dimensional pursuit-evasion games , author=. 2016 , school=

    2016

  22. [22]

    2024 IEEE-RAS 23rd International Conference on Humanoid Robots (Humanoids) , pages=

    Explicit contact optimization in whole-body contact-rich manipulation , author=. 2024 IEEE-RAS 23rd International Conference on Humanoid Robots (Humanoids) , pages=. 2024 , organization=

    2024

  23. [24]

    The International Journal of Robotics Research , volume=

    ASIMO: Agent-centric scene representation in multi-object manipulation , author=. The International Journal of Robotics Research , volume=. 2025 , publisher=

    2025

  24. [25]

    2021 IEEE International Conference on Robotics and Automation (ICRA) , pages=

    Cost-to-go function generating networks for high dimensional motion planning , author=. 2021 IEEE International Conference on Robotics and Automation (ICRA) , pages=. 2021 , organization=

    2021

  25. [26]

    Learning Continuous Environment Fields via Implicit Functions , author=

  26. [27]

    The Eleventh International Conference on Learning Representations , year=

    NTFields: Neural Time Fields for Physics-Informed Robot Motion Planning , author=. The Eleventh International Conference on Learning Representations , year=

  27. [28]

    RSS 2023 Workshop on Symmetries in Robot Learning , year=

    Progressive Learning for Physics-informed Neural Motion Planning , author=. RSS 2023 Workshop on Symmetries in Robot Learning , year=

    2023

  28. [29]

    IEEE Robotics and Automation Letters , volume=

    Grasp multiple objects with one hand , author=. IEEE Robotics and Automation Letters , volume=. 2024 , publisher=

    2024

  29. [30]

    7th Annual Conference on Robot Learning , year=

    Predicting object interactions with behavior primitives: An application in stowing tasks , author=. 7th Annual Conference on Robot Learning , year=

  30. [32]

    , author=

    A fast marching level set method for monotonically advancing fronts. , author=. proceedings of the National Academy of Sciences , volume=

  31. [33]

    SIAM Journal on Numerical Analysis , volume=

    Anisotropic fast-marching on cartesian grids using lattice basis reduction , author=. SIAM Journal on Numerical Analysis , volume=. 2014 , publisher=

    2014

  32. [34]

    Iberoamerican Congress on Pattern Recognition , pages=

    Sub-Riemannian fast marching in SE (2) , author=. Iberoamerican Congress on Pattern Recognition , pages=. 2015 , organization=

    2015

  33. [35]

    Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages=

    A new finsler minimal path model with curvature penalization for image segmentation and closed contour detection , author=. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages=

  34. [36]

    2024 IEEE International Conference on Robotics and Automation (ICRA) , pages=

    Representing robot geometry as distance fields: Applications to whole-body manipulation , author=. 2024 IEEE International Conference on Robotics and Automation (ICRA) , pages=. 2024 , organization=

    2024

  35. [37]

    Conference on robot learning , pages=

    Learning models as functionals of signed-distance fields for manipulation planning , author=. Conference on robot learning , pages=. 2022 , organization=

    2022

  36. [38]

    SIAM Journal on Scientific Computing , volume=

    Causal domain restriction for Eikonal equations , author=. SIAM Journal on Scientific Computing , volume=. 2014 , publisher=

    2014

  37. [39]

    Mathematical Programming , volume=

    Optimization-based simulation of nonsmooth rigid multibody dynamics , author=. Mathematical Programming , volume=. 2006 , publisher=

    2006

  38. [41]

    IEEE Transactions on robotics , volume=

    Global planning for contact-rich manipulation via local smoothing of quasi-dynamic contact models , author=. IEEE Transactions on robotics , volume=. 2023 , publisher=

    2023

  39. [42]

    2012 IEEE/RSJ international conference on intelligent robots and systems , pages=

    Mujoco: A physics engine for model-based control , author=. 2012 IEEE/RSJ international conference on intelligent robots and systems , pages=. 2012 , organization=

    2012

  40. [43]

    VP-STO: Via-point-based Stochastic Trajectory Optimization for Reactive Robot Behavior , year=

    Jankowski, Julius and Brudermüller, Lara and Hawes, Nick and Calinon, Sylvain , booktitle=. VP-STO: Via-point-based Stochastic Trajectory Optimization for Reactive Robot Behavior , year=

  41. [44]

    arXiv preprint arXiv:2212.00541 , year=

    Predictive sampling: Real-time behaviour synthesis with mujoco , author=. arXiv preprint arXiv:2212.00541 , year=

    work page arXiv

  42. [45]

    and Chi, X

    Li, Y. and Chi, X. and Razmjoo, A. and Calinon, S. , title=. Proc.\ Robotics: Science and Systems (

  43. [46]

    arXiv preprint arXiv:2412.05197 , year=

    A Riemannian take on distance fields and geodesic flows in robotics , author=. arXiv preprint arXiv:2412.05197 , year=

    work page arXiv

  44. [47]

    IEEE Robotics and Automation Letters , volume=

    Neural joint space implicit signed distance functions for reactive robot manipulator control , author=. IEEE Robotics and Automation Letters , volume=. 2022 , publisher=

    2022

  45. [48]

    Science Robotics , volume=

    Complex manipulation with a simple robotic hand through contact breaking and caging , author=. Science Robotics , volume=. 2021 , publisher=

    2021

  46. [49]

    The International Journal of Robotics Research , volume=

    Certified grasping , author=. The International Journal of Robotics Research , volume=. 2023 , publisher=

    2023

  47. [50]

    The International Journal of Robotics Research , pages=

    Caging in time: A framework for robust object manipulation under uncertainties and limited robot perception , author=. The International Journal of Robotics Research , pages=. 2025 , publisher=

    2025

  48. [51]

    2025 IEEE-RAS 24th International Conference on Humanoid Robots (Humanoids) , pages=

    Scaling whole-body multi-contact manipulation with contact optimization , author=. 2025 IEEE-RAS 24th International Conference on Humanoid Robots (Humanoids) , pages=. 2025 , organization=

    2025

  49. [52]

    Science Robotics , volume=

    Learning contact-rich whole-body manipulation with example-guided reinforcement learning , author=. Science Robotics , volume=. 2025 , publisher=

    2025

  50. [53]

    Advanced Robotics , volume=

    A survey of robotic caging and its applications , author=. Advanced Robotics , volume=. 2017 , publisher=

    2017

  51. [54]

    The International Journal of Robotics Research , pages=

    Robust pushing: Exploiting quasi-static belief dynamics and contact-informed optimization , author=. The International Journal of Robotics Research , pages=. 2025 , publisher=

    2025

  52. [55]

    2017 IEEE-RAS 17th international conference on humanoid robotics (Humanoids) , pages=

    Approximate hybrid model predictive control for multi-contact push recovery in complex environments , author=. 2017 IEEE-RAS 17th international conference on humanoid robotics (Humanoids) , pages=. 2017 , organization=

    2017

  53. [56]

    The International Journal of Robotics Research , volume=

    Reactive planar non-prehensile manipulation with hybrid model predictive control , author=. The International Journal of Robotics Research , volume=. 2020 , publisher=

    2020

  54. [57]

    The International Journal of Robotics Research , volume=

    A direct method for trajectory optimization of rigid bodies through contact , author=. The International Journal of Robotics Research , volume=. 2014 , publisher=

    2014

  55. [58]

    2022 International Conference on Robotics and Automation (ICRA) , pages=

    Non-prehensile planar manipulation via trajectory optimization with complementarity constraints , author=. 2022 International Conference on Robotics and Automation (ICRA) , pages=. 2022 , organization=

    2022

  56. [59]

    The International Journal of Robotics Research , volume=

    Inverse dynamics trajectory optimization for contact-implicit model predictive control , author=. The International Journal of Robotics Research , volume=. 2026 , publisher=

    2026

  57. [60]

    2017 IEEE/RSJ international conference on intelligent robots and systems (IROS) , pages=

    Domain randomization for transferring deep neural networks from simulation to the real world , author=. 2017 IEEE/RSJ international conference on intelligent robots and systems (IROS) , pages=. 2017 , organization=

    2017

  58. [61]

    Conference on Robot Learning , pages=

    Domain randomization for simulation-based policy optimization with transferability assessment , author=. Conference on Robot Learning , pages=. 2018 , organization=

    2018

  59. [62]

    2018 IEEE international conference on robotics and automation (ICRA) , pages=

    Using simulation and domain adaptation to improve efficiency of deep robotic grasping , author=. 2018 IEEE international conference on robotics and automation (ICRA) , pages=. 2018 , organization=

    2018

  60. [63]

    2020 IEEE international conference on robotics and automation (ICRA) , pages=

    Meta reinforcement learning for sim-to-real domain adaptation , author=. 2020 IEEE international conference on robotics and automation (ICRA) , pages=. 2020 , organization=

    2020

  61. [64]

    The International Journal of Robotics Research , pages=

    Robust contact-rich manipulation through implicit motor adaptation , author=. The International Journal of Robotics Research , pages=. 2024 , publisher=

    2024

  62. [65]

    The International Journal of Robotics Research , pages=

    Dexterous contact-rich manipulation via the contact trust region , author=. The International Journal of Robotics Research , pages=. 2025 , publisher=

    2025

  63. [67]

    2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages=

    Minimax iterative dynamic game: Application to nonlinear robot control tasks , author=. 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages=. 2018 , organization=

    2018

  64. [68]

    2019 American Control Conference (ACC) , pages=

    Robust kinodynamic motion planning using model-free game-theoretic learning , author=. 2019 American Control Conference (ACC) , pages=. 2019 , organization=

    2019

  65. [69]

    2022 International Conference on Robotics and Automation (ICRA) , pages=

    Robust reinforcement learning via genetic curriculum , author=. 2022 International Conference on Robotics and Automation (ICRA) , pages=. 2022 , organization=

    2022

  66. [71]

    Proc.\ Robotics: Science and Systems (

    Shi, Fan and Zhang, Chong and Miki, Takahiro and Lee, Joonho and Hutter, Marco and Coros, Stelian , title=. Proc.\ Robotics: Science and Systems (

  67. [72]

    2015 IEEE International Conference on Robotics and Automation (ICRA) , pages=

    Nonprehensile whole arm rearrangement planning on physics manifolds , author=. 2015 IEEE International Conference on Robotics and Automation (ICRA) , pages=. 2015 , organization=

    2015

  68. [73]

    Advances in neural information processing systems , volume=

    Incorporating second-order functional knowledge for better option pricing , author=. Advances in neural information processing systems , volume=

  69. [74]

    and Qiu, J

    Li, Y. and Qiu, J. and Calinon, S. , title=. International Journal of Robotics Research (

  70. [75]

    The International Journal of Robotics Research 42(4-5): 249--262

    Aceituno-Cabezas B, Ballester J and Rodriguez A (2023) Certified grasping. The International Journal of Robotics Research 42(4-5): 249--262

    2023

  71. [76]

    In: 2015 IEEE International Conference on Robotics and Automation (ICRA)

    Allen TF, Rimon E and Burdick JW (2015) Robust three-finger three-parameter caging of convex polygons. In: 2015 IEEE International Conference on Robotics and Automation (ICRA). IEEE, pp. 4318--4325

    2015

  72. [77]

    Mathematical Programming 105(1): 113--143

    Anitescu M (2006) Optimization-based simulation of nonsmooth rigid multibody dynamics. Mathematical Programming 105(1): 113--143

    2006

  73. [78]

    In: 2020 IEEE international conference on robotics and automation (ICRA)

    Arndt K, Hazara M, Ghadirzadeh A and Kyrki V (2020) Meta reinforcement learning for sim-to-real domain adaptation. In: 2020 IEEE international conference on robotics and automation (ICRA). IEEE, pp. 2725--2731

    2020

  74. [79]

    O nol A \

    Barreiros JA, \"O nol A \"O , Zhang M, Creasey S, Goncalves A, Beaulieu A, Bhat A, Tsui KM and Alspach A (2025) Learning contact-rich whole-body manipulation with example-guided reinforcement learning. Science Robotics 10(105): eads6790

    2025

  75. [80]

    Science Robotics 6(54): eabd2666

    Bircher WG, Morgan AS and Dollar AM (2021) Complex manipulation with a simple robotic hand through contact breaking and caging. Science Robotics 6(54): eabd2666

    2021

  76. [81]

    (2018) Using simulation and domain adaptation to improve efficiency of deep robotic grasping

    Bousmalis K, Irpan A, Wohlhart P, Bai Y, Kelcey M, Kalakrishnan M, Downs L, Ibarz J, Pastor P, Konolige K et al. (2018) Using simulation and domain adaptation to improve efficiency of deep robotic grasping. In: 2018 IEEE international conference on robotics and automation (ICRA). IEEE, pp. 4243--4250

    2018

  77. [82]

    IEEE Transactions on Automation Science and Engineering 15(3): 919--931

    Bunis HA, Rimon ED, Allen TF and Burdick JW (2018) Equilateral three-finger caging of polygonal objects using contact space search. IEEE Transactions on Automation Science and Engineering 15(3): 919--931

    2018

  78. [83]

    In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition

    Chen D, Mirebeau JM and Cohen LD (2016) A new finsler minimal path model with curvature penalization for image segmentation and closed contour detection. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. pp. 355--363

    2016

  79. [84]

    arXiv preprint arXiv:2511.05809

    Chen Y, He B, Mao Y, Jakobsson A, Ke J, Aloimonos Y, Shi G, Choset H, Mao J and Ichnowski J (2025) Adversarial game-theoretic algorithm for dexterous grasp synthesis. arXiv preprint arXiv:2511.05809

    work page arXiv 2025

  80. [85]

    SIAM Journal on Scientific Computing 36(5): A2478--A2505

    Clawson Z, Chacon A and Vladimirsky A (2014) Causal domain restriction for eikonal equations. SIAM Journal on Scientific Computing 36(5): A2478--A2505

    2014

Showing first 80 references.