Skip to content
arXiv cs.RO·· 2 days agoAI score69

CS-Pi: Constraint-Satisfying Flow Policy Sampling at Inference Time

Summary

CS-Pi proposes a "sample-project-renoise" flow-matching policy sampler that satisfies constraints absent from demonstrations at inference time while keeping actions plausible under the policy. The method projects each sample onto the nearest safe action, then adds noise back according to the size of the projection displacement and reruns the original policy until the sample is safe. On a 7-DoF shelf grasping task it achieves an 81% safe success rate, and 55% in zero-shot deployment on Franka, versus 55% and 40% for projection alone. The paper has been accepted to CoRL 2026.

This page provides a summary and source link only. Read the full article at the source.

Source: arXiv cs.RO · arxiv.org