Iterative MILP Methods for Vehicle Control Problems
Matthew Earl, Raffaello D'Andrea
Abstract
Mixed integer linear programming (MILP) is a powerful tool for planning and control problems because of its modeling capability and the availability of good solvers. However, for large models, MILP methods suffer computationally. In this paper, we present iterative MILP algorithms that address this issue. We consider trajectory generation problems with obstacle avoidance requirements and minimum time trajectory generation problems. The algorithms use fewer binary variables than standard MILP methods and require less computational effort.
Create a lesson
Related papers
cuRoboV2-Fast: Fast Torque-Limited Collision-Free Motion Planning
Balakumar Sundaralingam, Adithyavairavan Murali, Stan Birchfield
Perceptive Humanoid Motion from Simulation
Siyuan Hu, Abulikemu Abuduweili, Yue Meng et al.
VABAR: A Variational Automation Benchmark for Agentic Robotics
Shuangyu Xie, Kaiyuan Chen, Uksang Yoo et al.
Rethinking Self-Repair in Code-as-Policy Agents: What Drives Retry Success?
Siddharth Aphale, Ayushman Singh
ConDR: Conservative Reachability through Neural Hamilton-Jacobi Subsolutions
Kendra Givens, Taylor T. Johnson, Bryan C. Ward et al.
PyRUA-REAL: Robot Exploration and Adaptive Learning through RSI in the Real World
Qiang Wang, Jianxin Bi, Shulong Jiang et al.