7 citations · 16 across the 10 of their papers we have counts for
4 papers · 1 filter
Lift, Partition, and Project: Parametric Complexity Certification of Active-Set QP Methods in the Presence of Numerical Errors
Daniel Arnström, Daniel Axehill
When Model Predictive Control (MPC) is used in real-time to control linear systems, quadratic programs (QPs) need to be solved within a limited time frame. Recently, several parame…
BnB-DAQP: A Mixed-Integer QP Solver for Embedded Applications
Daniel Arnström, Daniel Axehill
We propose a mixed-integer quadratic programming (QP) solver that is suitable for use in embedded applications, for example, hybrid model predictive control (MPC). The solver is ba…
Robust Lattice-based Motion Planning
Abhishek Dhar, Carl Hynén, Johan Löfberg +1
This paper proposes a robust lattice-based motion-planning algorithm for nonlinear systems affected by a bounded disturbance. The proposed motion planner utilizes the nominal distu…
Overall Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Quadratic Programming
Shamisa Shoja, Daniel Arnström, Daniel Axehill
This paper presents a method to certify the computational complexity of a standard Branch and Bound method for solving Mixed-Integer Quadratic Programming (MIQP) problems defined a…