arXiv (OAI Expanded)
open access
TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics
Semidefinite programming (SDP) provides a principled framework for convex relaxations of nonconvex geometric constraints in motion planning, yet existing solvers are too computationally expensive for real-time control, particularly on resource-constrained embedded systems. To address this gap, we in
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
- Fast Algorithms for Sparse PCA and Robust Sparse Estimation#996529
- A hybrid fungal growth and differential evolution algorithm for energy-efficient UAV trajectory planning in MEC.#239668
- A Globally Convergent Third-Order Newton Method via Unified Semidefinite Programming Subproblems#662410
- A Globally Convergent Third-Order Newton Method via Unified Semidefinite Programming Subproblems#661360
- A Data-Driven Koopman-Behavioral Distance for Nonlinear Dynamical Systems#974954
Record · ID 1123088
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