Geometry Is the Contact Plan: Bringing Surface Reasoning Into MPC.

Geometry-Informed Contact Optimization and Model Predictive Control for Efficient Contact-Rich Manipulation • Sheng Liu, Lei Yan, Juyi Sheng, Pengfei Xia, Haibo Zhang, Mengyuan Liu, and Wenfu Xu • Harbin Institute of Technology–linked collaboration; complete affiliations were not exposed in accessible metadata • IEEE Robotics and Automation Letters, Vol. 11, No. 9 • 2026.

The bibliographic record identifies a seven-author, eight-page article in IEEE Robotics and Automation Letters, volume 11, issue 9, pages 10393–10400. An institutional index assigns it to the September 2026 issue, while ResearchGate labels the record January 2026—probably an online-first versus issue-assignment discrepancy, although the publisher record is needed to confirm that interpretation. The DOI and complete author list are independently present in Wenfu Xu’s ORCID record.

Research note, September 4, 2026: the DOI and bibliographic metadata are live, but neither the publisher abstract nor an author manuscript, arXiv preprint, project page, or code repository surfaced in the public sources available during this review. ResearchGate explicitly reports that no full text is available. Consequently, the exact equations, solver, benchmark tasks, ablations, and numerical results cannot be independently verified here. Rather than invent those details, this episode separates verified facts from a technically grounded reconstruction of the method implied by the title and its position in the contact-rich manipulation literature.

The Paper in One Sentence.

The central idea suggested by the title is that contact geometry should not be treated merely as something a collision detector reports after the optimizer proposes a motion. Geometry should participate directly in deciding where the robot touches, which wrench that contact can produce, and how the contact should evolve over time. That contact optimizer is then embedded in—or coupled to—a model predictive controller so that the robot can continually replan as the object moves, contacts slip, and the world deviates from the model.

That sounds like a modest conceptual change. It is not.

A conventional manipulation controller often assumes that the meaningful contacts are already known. A finger is assigned to a particular face, a pusher is placed at a fixed point, or a grasp planner supplies a set of contact locations. The controller then optimizes forces and motion around those decisions. Contact-implicit methods relax the schedule: they can decide when a candidate contact becomes active. But the underlying geometric candidates are still frequently fixed, discretized, or represented only through local distance queries.

A geometry-informed method moves the boundary itself into the planning problem. Contact location, local normal, tangent directions, lever arm, reachability, and collision feasibility become coupled quantities. The optimizer is no longer choosing only a force. It is choosing a force attached to a physically meaningful point on a curved, finite, possibly nonconvex surface.

The MPC component addresses the other half of the problem. Even a good contact plan is fragile when executed open loop. Friction is uncertain, rigid-body models are imperfect, object pose estimates drift, and contact transitions rarely happen at precisely the predicted instant. Receding-horizon replanning turns the contact plan from a one-shot trajectory into feedback.

The paper therefore appears to target a particularly important gap: high-fidelity geometric reasoning is usually expensive, while fast contact control usually simplifies geometry. Its value depends on whether it actually makes those two ends meet.

Why Contact-Rich Manipulation Remains Difficult.

Robotic motion planning was historically built around collision avoidance. Contact-rich manipulation reverses the premise. Collision is no longer a terminal constraint violation; selected collisions are the mechanism through which the robot completes the task.

Consider a simple planar push. The object motion depends on where the pusher touches, the orientation of the contact normal, the distribution of support friction, whether the pusher sticks or slides, and the distance between the contact and the object’s center of mass. Move the contact a few centimeters and the same commanded force can change from producing translation to producing rotation.

Now replace the rectangle with a curved or nonconvex object. The surface normal varies continuously. Corners introduce nonsmooth changes. A nominal contact can disappear when the object rotates. A point that is mechanically attractive may be unreachable without colliding elsewhere. If there are several fingers or robot links, these choices interact combinatorially.

The underlying dynamics are hybrid. A contact can be absent, sticking, sliding in either direction, rolling, impacting, or separating. Each mode gives the system different equations. Enumerating all mode sequences over a planning horizon quickly becomes intractable.

Contact-implicit trajectory optimization was developed largely to escape that enumeration. In the classic formulation associated with Posa, Cantu, and Tedrake, contact forces and separation distances are optimized together under complementarity constraints. A positive normal force requires a closed contact, while a separated contact must carry no normal force. This lets an optimizer discover contact timing without receiving a prescribed mode sequence.

But complementarity is numerically awkward. Its feasible set contains sharp intersections, and friction adds further nonsmoothness. Later work has explored reformulations for dynamic object manipulation, smoother pressure-field or hydroelastic contact models, and local smoothing of quasi-dynamic models. These approaches are different, but they all confront the same trade-off: preserving enough contact physics to produce useful behavior without making every control update an intractable nonlinear program.

Geometry creates another source of difficulty that is sometimes hidden by simple benchmarks. If every object is a box and every contact is assigned to the middle of an edge, geometry looks solved. In general manipulation, it is not. The optimizer must connect abstract variables such as “normal force” and “tangential velocity” to an actual surface location whose frame changes with object pose.

The title of Liu and colleagues’ paper is therefore revealing. It does not say only “contact-implicit MPC” or “fast contact dynamics.” It foregrounds geometry-informed contact optimization. That suggests that the authors view geometric contact selection—not merely contact activation—as a central computational bottleneck.

What Geometry-Informed Contact Optimization Likely Means.

Because the manuscript is unavailable, the exact geometric representation cannot be confirmed. It could be based on meshes, convex primitives, signed distance fields, point clouds, support planes, or some combination. Still, any method deserving this title must expose roughly the following structure to the optimizer.

Contact is more than a binary variable.

A useful contact variable needs to identify a location on a surface. On a triangle mesh, that might mean a triangle index plus barycentric coordinates. On a parameterized surface, it might be a pair of local coordinates. With a signed distance field, the contact point could be represented in Cartesian space and constrained to lie on the zero level set.

Once a location is known, geometry supplies the local normal. Tangent directions span the plane in which friction acts. The vector from the object’s center of mass to the contact determines the torque produced by a force. The robot’s kinematics determine whether its finger or link can reach that point with an acceptable orientation and without unwanted collision.

These quantities are coupled. Sliding a contact over a curved surface changes the normal and therefore rotates the friction cone. It also changes the moment arm and the joint configuration required to maintain contact. A geometry-informed optimizer should update all of these effects together rather than selecting a point using one metric and optimizing motion around it afterward.

This matters because the best contact is task dependent. To rotate an object, the optimizer may prefer a large moment arm. To translate it, a contact whose normal passes closer to the center of mass may be better. To stabilize a grasp, it may choose locations whose friction cones provide complementary wrench directions. To avoid a kinematic singularity, it may sacrifice some mechanical advantage for reachability.

Turning surfaces into optimization constraints.

The central geometric constraint is nonpenetration. In words, the signed gap between the robot and object must be nonnegative. At an active contact, that gap should be zero. A normal force must push rather than pull, and it should vanish when the bodies are separated.

A contact-implicit formulation expresses this using complementarity or a relaxation of complementarity. A contact-explicit formulation may instead optimize a point that is constrained to remain on the surface and assume that the selected contact stays active over a local segment of the trajectory.

Tangential behavior then requires a friction model. The simplest representation limits the tangential force to a cone whose radius grows with the normal force. Practical optimizers often approximate this cone with planar facets. Sticking contact constrains relative tangential velocity to zero. Sliding contact aligns friction against the slip direction, although that exact Coulomb rule is difficult to optimize and is frequently relaxed.

Geometry also determines the contact Jacobian: the mapping from generalized robot and object velocities to relative velocity at the contact. Because contact location may itself be optimized, this Jacobian is not fixed. Efficiently differentiating it is likely one of the important implementation issues behind the paper.

Why geometry can make optimization faster.

At first glance, adding geometric decision variables seems certain to increase computation. The key is that an informed representation may remove a much larger discrete search.

Imagine selecting contacts by sampling one thousand points over an object mesh. A controller must either evaluate many candidates or commit early to a small subset. A continuous surface representation can replace this catalog with two or three local coordinates. The optimizer can move the contact over the surface using gradients rather than repeatedly testing disconnected candidates.

Geometry can also provide better local models. Surface normals and curvature indicate how far a linearized contact approximation can be trusted. A flat face supports relatively large updates. Near an edge or region of high curvature, the optimizer should take smaller steps or consider an adjacent feature. This is closely related to trust-region reasoning, but the region is shaped by contact geometry rather than imposed as a generic Euclidean ball.

Another possible efficiency gain is hierarchical optimization. A geometry stage could choose a compact set of mechanically useful, reachable contact regions. The MPC would then optimize motion and force within those regions. This avoids asking the online controller to search the entire object surface at every cycle.

Alternatively, the stages could be tightly integrated through alternating updates: first refine contact locations using the current predicted trajectory, then optimize states and controls with contact geometry held locally fixed, and repeat. That is often easier numerically than one monolithic nonlinear program.

The title alone does not reveal which design Liu and colleagues use. Nor does it reveal whether contacts are continuous over surfaces or selected from geometry-informed candidates. That distinction is important. A continuous formulation is more ambitious but must manage feature transitions. A candidate-based formulation is simpler and may still be highly effective if geometry sharply reduces the candidate set.

Dynamics: the decisive missing detail.

A second unverified detail is whether the contact optimizer uses full rigid-body dynamics, quasi-static dynamics, or a quasi-dynamic approximation.

Full dynamics account for inertia, impact, and transient acceleration. They are necessary for fast pushing, throwing, catching, or dynamic reorientation. They also make the optimization larger and more sensitive to integration and contact stiffness.

Quasi-static models assume that inertial effects are negligible compared with contact and support forces. This can be extremely effective for slow pushing, assembly, and in-hand repositioning. Quasi-dynamic models retain selected velocity or regularization effects while avoiding the full complexity of rigid-body dynamics.

The word “efficient” makes a simplified model plausible, but that is only an inference. The experimental task speed and hardware control rate would tell us whether the efficiency comes from a reduced physical model, a better geometric parameterization, a specialized solver, or all three.

Reconstructing the MPC Formulation.

Whatever the specific contact model, the model predictive controller would begin from an estimated state: robot joint positions and velocities, object pose and possibly object velocity, together with the status or location of currently observed contacts.

It then predicts the system over a finite horizon. The decision variables would ordinarily include robot commands and predicted states. In a contact-rich controller, they may also include contact forces, contact activation variables, surface locations, and possibly slip velocities.

Only the first control command is executed. The system is measured again, the horizon shifts forward, and the optimization is solved again. This repeated correction is what turns imperfect contact dynamics into usable feedback.

The objective.

A likely MPC objective contains several competing terms.

The primary term measures object-task error: distance from the target position and orientation, deviation from a desired path, or error in a task-specific geometric relation. For assembly, that relation might be alignment with an opening. For pushing, it might be an SE(2) object pose. For in-hand manipulation, it could be the object pose relative to the palm.

Robot regularization penalizes large control actions, abrupt joint motion, or postures near limits. Contact-force regularization discourages unnecessarily large forces and rapid force changes. A slip penalty encourages sticking where stable sticking is useful. A contact-location penalty may discourage the optimizer from moving the nominal contact unrealistically far between adjacent timesteps.

There may also be costs for penetration, complementarity violation, or distance from the local surface chart. Strictly speaking, these should be constraints, but soft penalties often improve numerical robustness. The danger is that excessive relaxation produces nonphysical solutions—forces acting through a visible gap or bodies passing slightly through one another.

A geometry-aware terminal cost could be especially valuable. Rather than evaluating only the object’s final pose, it could reward ending the horizon in a contact configuration from which future progress remains possible. That helps prevent the classic short-horizon MPC failure in which the controller makes immediate progress but pushes itself into a poor or unreachable contact state.

The constraints.

The controller must enforce robot and object dynamics, joint and actuator limits, and collision constraints for unintended contacts. Intended contacts need unilateral force constraints and a friction model. If contact location is optimized, the corresponding point must remain on an allowable surface region.

Reachability is another important constraint. A mathematically excellent object contact is irrelevant if the robot cannot realize it. Depending on the formulation, reachability may be enforced directly through forward kinematics, through a reduced task-space model, or by restricting the optimizer to a precomputed feasible contact manifold.

For multiple contacts, internal forces become relevant. Two fingers can apply forces that cancel at the object level while still loading the hardware. The MPC should regulate these forces rather than caring only about net object wrench. Multi-contact problems also need to avoid inconsistent commands in which different contacts demand incompatible object velocities.

Warm starts and temporal coherence.

Real-time MPC usually succeeds because consecutive optimization problems are similar. The previous trajectory is shifted by one timestep and used to initialize the next solve. Contact-rich MPC makes this more complicated: a small state change can alter the active contact feature or switch between sticking and sliding.

A geometry-informed representation can help maintain temporal coherence. Instead of rediscovering a contact from scratch, the controller can propagate its surface coordinates and update the local normal and tangent frame. If the predicted contact approaches an edge, a feature-transition mechanism can move it to a neighboring chart.

This is more than a speed optimization. Warm-start quality strongly affects which local optimum a nonconvex contact problem finds. Preserving the identity of a useful contact can prevent jitter, chattering, and unnecessary contact switching.

How feedback changes contact planning.

The real advantage of MPC is not merely trajectory tracking. It can revise the contact strategy itself.

Suppose a pusher begins to slip because the true friction coefficient is lower than modeled. A conventional tracker tries harder to follow the nominal trajectory, potentially increasing force while preserving a bad contact. A contact-optimizing MPC can reduce tangential demand, shift the contact toward a region with a better normal direction, or deliberately break contact and approach from somewhere else.

Likewise, if object pose estimation reveals that the object rotated more than predicted, the controller can update the moment arm and friction frame rather than treating the discrepancy as a generic tracking error. Geometry gives that feedback a physical interpretation.

The Likely Contributions.

The exact contribution list from the paper cannot be quoted, but its title and field context point to three substantive claims.

The first is a geometry-aware contact representation or optimizer that incorporates object shape when selecting and refining contact. The important question is whether it handles continuous surfaces and changing contact frames without an exhaustive candidate search.

The second is an MPC formulation that connects contact selection to closed-loop motion and force control. This is stronger than computing contacts offline and tracking them with a conventional controller. The contact decision must remain revisable as state estimates and physical interactions change.

The third is computational efficiency sufficient for practical manipulation. In this area, “efficient” must mean more than solving one trajectory faster. It should include predictable convergence, warm-start behavior, and a control update rate compatible with the task.

This emphasis is complementary to several established research directions. Contact-implicit trajectory optimization focuses on avoiding explicit mode schedules. Hydroelastic and smoothed-contact approaches focus on creating derivatives that are useful for optimization. Inverse-dynamics trajectory optimization focuses on numerical structure that can support contact-implicit MPC. Global methods based on smoothed local models or graphs of reachable sets focus on escaping the locality of a single trajectory optimizer.

A geometry-informed contact optimizer attacks a different axis: even if contact dynamics are tractable, which point on which surface should the controller use? If the paper solves that problem without losing feedback speed, it fills a meaningful gap rather than merely proposing another contact regularization.

The authors’ broader publication context also makes the combination plausible. Lei Yan and Wenfu Xu have worked on model-based manipulation and impact-aware bimanual catching, while the author list includes researchers associated in public records with HIT and vision or learning-oriented institutions. That mix is consistent with a project combining geometric representation, optimization, and physical control, although the article’s exact division of labor is not public.

Experimental Results: What Is and Is Not Verifiable.

This is where source limitations matter most. No accessible source exposed the experiment section, figures, task names, hardware platform, baseline table, success rates, control frequencies, or solve-time statistics. Any precise claim about those results would therefore be fabricated.

What can be confirmed is that the work appears as a completed RA-L article rather than merely a project title or unpublished manuscript. It occupies pages 10393–10400 of the September 2026 issue.

For a paper making this particular claim, a convincing evaluation should address five dimensions.

First is optimization efficiency. The relevant measurements are median and worst-case solve time, number of iterations, failure rate, and the fraction of MPC deadlines met. An average can hide occasional multi-second failures that make a controller unusable.

Second is task performance. This should include object pose accuracy, completion time, success rate over repeated trials, and behavior across initial conditions. If the method is meant for arbitrary geometry, it should be tested on more than boxes and cylinders.

Third is contact quality. Useful metrics include unintended separation, cumulative slip, peak contact force, penetration in simulation, and consistency between predicted and measured contact. These reveal whether a fast optimizer is obtaining efficiency by weakening the physics too aggressively.

Fourth is feedback robustness. The natural tests are perturbations to object pose, friction, mass, or contact timing. MPC’s value should become visible here. A purely nominal comparison does not establish why receding-horizon contact optimization is needed.

Fifth is geometric generality. The most informative experiment would vary shape while holding the task objective roughly constant. A geometry-informed method should show an advantage when normals, curvature, finite face boundaries, or nonconvex features matter.

The most important ablation would remove the geometry-informed component while keeping the MPC horizon, dynamics model, solver budget, and low-level controller fixed. Another should compare online contact adaptation with tracking a contact plan computed only once. A third should disable warm starting or surface-coordinate propagation to expose where the runtime improvement comes from.

Without the actual tables, the significance has to remain conditional. If the paper demonstrates real-hardware feedback control over changing contacts, nontrivial geometry, and model perturbations at a stable online rate, it is a strong systems contribution. If the evidence is limited to short-horizon simulation on simple shapes, the method may still be useful, but the “efficient contact-rich manipulation” claim would be narrower.

Why This Direction Matters.

The deeper significance is that geometry may become a control variable, not just an environmental constraint.

Modern robot stacks often separate geometry from dynamics. Perception builds a mesh or point cloud. Collision checking answers distance queries. A planner selects a motion. A controller tracks it. That modularity is convenient, but contact-rich tasks expose the information lost at each boundary.

A mesh contains more than collision information. It determines which forces can be applied, which torques those forces create, how contacts evolve under object motion, and where a robot can gain mechanical advantage. Geometry-informed optimization attempts to preserve those relationships all the way into the controller.

This is particularly relevant for nonprehensile manipulation. Pushing, pivoting, rolling, levering, and using environmental fixtures all depend on selecting useful interactions rather than merely maintaining a grasp. It is also relevant for whole-body manipulation, where arms, forearms, torso surfaces, and the environment may all become contact resources.

The idea complements rather than opposes learning-based manipulation. A learned policy can provide a task-level strategy or initialize contact regions. A geometry-informed MPC can then enforce local physical feasibility and react to force or pose feedback. Conversely, the optimizer can generate demonstrations for behavior cloning or provide a critic that scores learned contact proposals.

For vision-language-action systems, this offers a plausible division of labor. A foundation model may understand that a large box should be pivoted against the floor rather than lifted. It need not directly produce high-frequency torques. It can specify a target relation or candidate contact region, leaving the geometry-aware optimizer to produce dynamically and frictionally coherent motion.

The same framework could serve as a safety layer. If a learned action proposes a contact that is unreachable, outside the object surface, or unable to generate the required wrench under the friction model, the optimizer can reject or modify it. That is more meaningful than clipping joint commands after the fact.

How a Roboticist Might Build on It.

An implementation inspired by this paper would start with the geometry backend. For known objects, a watertight CAD mesh or signed distance field is the obvious choice. For unknown objects, a reconstructed surface would need not only distance queries but reasonably stable normals. Contact optimization is highly sensitive to noisy normals, especially near edges.

The next step is to expose differentiable queries: signed gap, nearest point, normal, tangent frame, and derivatives with respect to robot and object pose. If a mesh is used directly, the system needs a policy for feature switches. If an SDF is used, the smoothing scale should be checked carefully because rounded edges can alter the optimal contact strategy.

Contact locations can then be represented using local surface coordinates. Restricting each contact to a chart or candidate region makes the optimization smaller and prevents discontinuous jumps across unrelated parts of the object. A higher-level search can change charts when the local controller becomes trapped.

For the dynamic layer, begin with the simplest model compatible with the task. Quasi-static pushing and slow assembly do not need a full impact model. Dynamic reorientation does. Using unnecessary fidelity can consume the entire computational budget without improving closed-loop behavior.

The MPC should initially use soft contact constraints with explicit diagnostics for their violation. It is easier to debug a controller that reports two millimeters of virtual penetration or a small force-at-distance error than one that simply declares the nonlinear program infeasible. Once the formulation is stable, those relaxations can be tightened.

A separate high-fidelity simulator or collision checker should validate the optimizer’s predictions. Optimization models often become internally consistent while drifting away from the intended physics. Comparing predicted and simulated contact points, normals, impulses, and slip directions is essential.

Finally, evaluate the controller as a real-time system, not just an optimization algorithm. Record deadline misses, fallback activations, perception latency, contact-estimation errors, and sensitivity to initialization. For MPC, tail latency matters as much as average latency.

Open Questions and Limitations.

Geometry does not eliminate nonconvexity. It gives the optimizer better information, but several contact locations may remain locally optimal. A short-horizon solver can still choose a contact that makes immediate progress and leads to a dead end.

Continuous surface optimization is also only locally smooth. Mesh triangle changes, sharp edges, self-occlusion, and transitions between separated and active contact create discontinuities. A successful method needs either robust feature-transition logic or a deliberately smoothed representation.

Friction remains a major uncertainty. A perfectly modeled surface with an incorrect friction coefficient can produce a confidently wrong contact plan. Online friction estimation, robust optimization, or uncertainty-aware costs would strengthen the framework.

Rigid contact geometry is insufficient for soft fingertips, skin, suction cups, or deformable objects. In those settings, the effective contact patch, normal, and pressure distribution depend on force. Treating contact as a single point may misrepresent both wrench capability and stability.

State estimation may be an even larger bottleneck than optimization. During occluded manipulation, object pose and contact location can be difficult to observe. A controller that relies on exact geometry should ideally reason over uncertainty or fuse vision with force and tactile sensing.

Multi-contact scalability is another concern. Each additional contact adds location, force, and mode variables, while also coupling through object dynamics. Geometry may reduce the search space per contact, but it does not remove the combinatorics of deciding which contacts should exist.

Finally, the MPC horizon limits strategic reasoning. Some manipulation tasks require temporarily moving away from the goal, breaking a stable contact, or regrasping. A local controller may need a global planner, learned value function, or contact roadmap to supply longer-range guidance. Recent work on globally informed contact planning and graphs of reachable sets reflects precisely this local-versus-global tension.

Final Takeaway.

The most important idea in Geometry-Informed Contact Optimization and Model Predictive Control for Efficient Contact-Rich Manipulation is not simply that geometry matters. Roboticists have always known that.

The stronger proposition is that geometry should remain inside the optimization loop, where it can shape contact location, normal direction, frictional capability, moment arm, and reachability at the same time—and that this reasoning can be made efficient enough to run repeatedly as MPC.

That is a compelling direction because contact-rich manipulation is simultaneously geometric, dynamic, and hybrid. Simplifying any one of those dimensions makes computation easier but often removes the behavior we actually want. A successful geometry-informed MPC would preserve more of the task’s physical structure while still exploiting feedback and warm starts.

The presently accessible public record is insufficient to validate the paper’s exact formulation or quantitative claims. In particular, its geometry representation, contact model, solver, hardware tasks, control frequency, and baseline results remain unverified. But the problem it targets is central, and the proposed coupling points toward an increasingly important architecture: global or learned reasoning chooses what interaction is useful, while a geometry-aware model predictive controller determines how to realize and continually repair that interaction in the physical world.