arXiv (All)
open access
Solving quantified constraint satisfaction problems with applications to control
Many problems in control can be expressed as quantified constraints, such as robust forward and backward reachability, synthesis of controllers, solutions to motion planning problems. In this paper, we develop a method for computing inner and outer approximations of global solutions to very general
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
- Ordinal Neural Collapse as a Representation Prior for Visual Navigation#1014750
- Simple Hierarchical Planning with Diffusion#436424
- Probabilistic motion planning and optimization incorporating chance constraints#644974
- Trajectory Planning without Trajectory Data: A Manifold-Guided Approach#1232902
- MAVP: Map-Aware Visuomotor Policies for Mobile Manipulation#1062274
Record · ID 1491171
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