În afara temei aiqbench
Această știre a fost preluată de la o sursă pe care o urmărim, dar nu ține de domeniul AI sau cuantic, așa că nu există o perspectivă aiqbench pentru ea.
Belief Space Planning for Risk Signal Temporal Logic via Mixed-Integer Convex Programming
arXiv:2610.16696v1 Announce Type: new Abstract: Signal Temporal Logic (STL) specifies robot tasks with spatio-temporal requirements, and its robustness semantics allow planning by trajectory optimization. In practice, robots estimate their state from noisy measurements, and when the information gained from a measurement depends on the state, the robot can actively reduce its uncertainty by planning in the belief space. The resulting problem is, however, generally non-convex, for which gradient-based methods are neither complete nor globally optimal. In this paper, we consider Risk STL (RiSTL) planning in Gaussian belief space and show that an information-form parameterization of the belief, together with a convex relaxation of the belief dynamics, yields a mixed-integer convex program (MICP). We prove that the MICP is sound and complete, and that the relaxation preserves the globally optimal input trajectories. We validate the effectiveness of our method in numerical simulations.
Abstract:Signal Temporal Logic (STL) specifies robot tasks with spatio-temporal requirements, and its robustness semantics allow planning by trajectory optimization. In practice, robots estimate their state from noisy measurements, and when the information gained from a measurement depends on the state, the robot can actively reduce its uncertainty by planning in the belief space. The resulting problem is, however, generally non-convex, for which gradient-based methods are neither complete nor globally optimal. In this paper, we consider Risk STL (RiSTL) planning in Gaussian belief space and show that an information-form parameterization of the belief, together with a convex relaxation of the belief dynamics, yields a mixed-integer convex program (MICP). We prove that the MICP is sound and complete, and that the relaxation preserves the globally optimal input trajectories. We validate the effectiveness of our method in numerical simulations.
Robotics (cs.RO)
arXiv:2610.16696 [cs.RO]
(or arXiv:2610.16696v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2610.16696 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 229 cuvinte
