arXiv (All)
open access
ElastiQP: An Always-Feasible QP Solver for Constrained Robot Control
As robot capabilities increase, quadratic programming (QP)-based controllers must account for a similarly increasing number of constraints to ensure safe, reliable operation. Yet, with each added constraint, this introduces more chances of momentary conflict: in which case, a QP solver that returns
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Real-Time Control-Constrained DDP for Underactuated Balancing of Legged Robots#926176
- Gradient-Free Neural Hamilton-Jacobi Reachability for Scalable Safety-Critical Control#1083561
- The search for an optimal means of determining the minmax control parameter using sensitivity analysis#957909
- Critic-Free Policy Iteration for Continuous-Time Zero-Sum Games: A Policy-Space Riccati Approach#999085
- UC-MESL: A MAP-Elites Skill Library with Hierarchical Policy Switching for Robust Rescue Robotics Under Sensing Uncertainty#442606
Record · ID 1013288
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive