arXiv subjects

Yaashia Gautam

Publications and source records attributed to Yaashia Gautam.

4 recordsLinked to original sources

arXiv2026

Compliant Explicit Reference Governor for Contact Friendly Robotic Manipulators

This paper introduces the Compliant Explicit Reference Governor (CERG), a modular reference management system that enables robots to interact physically with their environment under provable guarantees. The CERG is an intermediate layer that can be placed between a high-level planner and a low-level controller: it enforces operational constraints and enables smooth transitions between free-motion and contact operations. The CERG ensures safety by limiting the total energy available to the robotic arm at the time of contact. In the absence of contact, however, the CERG does not penalize the system performance. Simulation and hardware experiments validate the CERG on increasingly complex systems.

cs.RO↗

arXiv2026

Moving On, Even When You're Broken: Fail-Active Trajectory Generation via Diffusion Policies Conditioned on Embodiment and Task

Robot failure is detrimental and disruptive, often requiring human intervention to recover. Our vision is 'fail-active' operation, allowing robots to safely complete their tasks even when damaged. Focusing on 'actuation failures', we introduce DEFT, a diffusion-based trajectory generator conditioned on the robot's current embodiment and task constraints. DEFT generalizes across failure types, supports constrained and unconstrained motions, and enables task completion under arbitrary failure. We evaluate DEFT in both simulation and real-world scenarios using a 7-DoF robotic arm. DEFT outperforms its baselines over thousands of failure conditions, achieving a 99.5% success rate for unconstrained motions versus RRT's 42.4%, and 46.4% for constrained motions versus differential IK's 30.9%. Furthermore, DEFT demonstrates robust zero-shot generalization by maintaining performance on failure conditions unseen during training. Finally, we perform real-world evaluations on two multi-step tasks, drawer manipulation and whiteboard erasing. These experiments demonstrate DEFT succeeding on tasks where classical methods fail. Our results show that DEFT achieves fail-active manipulation across arbitrary failure configurations and real-world deployments.

cs.RO↗

arXiv2023

Finite-Time Computation of Polyhedral Input-Saturated Output-Admissible Sets

The paper introduces a novel algorithm for computing the output admissible set of linear discrete-time systems subject to input saturation. The proposed method takes advantage of the piecewise-affine dynamics to propagate the output constraints within the non-saturated and saturated regions. The constraints are then shared between regions to ensure a proper transition from one region to another. The resulting algorithm generates a set that is proven to be polyhedral, safe, positively invariant, and finitely determined. Moreover, the set is also proven to be strictly larger than the maximal output admissible set that would be obtained by treating input saturation as a constraint.

math.OC↗

arXiv2023

Stability Analysis of Hypersampled Model Predictive Control

This paper introduces a new framework for analyzing the stability of discrete-time model predictive controllers acting on continuous-time systems. The proposed framework introduces the distinction between discretization time (used to generate the optimal control problem) and sampling time (used to implement the controller). The paper not only shows that these two time constants are independent, but also motivates the benefits of selecting a sampling time that is smaller than the discretization time. The resulting approach, hereafter referred to as Hypersampled Model Predictive Control, overcomes the traditional trade-off between performance and computational complexity that arises when selecting the sampling time of traditional discrete-time model predictive controllers.

eess.SY↗