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.
@article{arxiv.cs/0505042,
title = {Iterative MILP Methods for Vehicle Control Problems},
author = {Matthew Earl and Raffaello D'Andrea},
journal= {arXiv preprint arXiv:cs/0505042},
year = {2007}
}
Comments
22 pages, 9 figures, submitted to IEEE Transactions on Robotics, for associated web page see http://control.mae.cornell.edu/earl/milp2