Soy: An Efficient MILP Solver for Piecewise-Affine Systems

Author name not available (Why is that?)

Publication date: 23 March 2023

Abstract: Piecewise-affine (PWA) systems are widely used for modeling and control of robotics problems including modeling contact dynamics. A common approach is to encode the control problem of the PWA system as a Mixed-Integer Convex Program (MICP), which can be solved by general-purpose off-the-shelf MICP solvers. To mitigate the scalability challenge of solving these MICP problems, existing work focuses on devising efficient and strong formulations of the problems, while less effort has been spent on exploiting their specific structure to develop specialized solvers. The latter is the theme of our work. We focus on efficiently handling one-hot constraints, which are particularly relevant when encoding PWA dynamics. We have implemented our techniques in a tool, Soy, which organically integrates logical reasoning, arithmetic reasoning, and stochastic local search. For a set of PWA control benchmarks, Soy solves more problems, faster, than two state-of-the-art MICP solvers.

Has companion code repository: https://github.com/stanford-centaur/soy

This page was built for publication: Soy: An Efficient MILP Solver for Piecewise-Affine Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6430680)