.png){kind=icon}
.png){kind=icon}
Return
Inter-sample avoidance in trajectory optimizers using mixed-integer linear programming
.png){kind=icon}
PRE
AI
DOI：10.1002/rnc.3101.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes an extension to trajectory optimization using mixed-integer linear programming. The purpose of the extension is to ensure that avoidance constraints are respected at all times between discrete samples, not just at the sampling times themselves. The method is very simple and involves applying the same switched constraints at adjacent time steps. This requires fewer additional constraints than the existing approach and is shown to reduce computation time. A key benefit of efficient inter-sample avoidance is the facility to reduce the number of time steps without having to compensate by enlarging the obstacles. A further extension to the principle is presented to account for curved paths between samples, proving useful in cases where narrow passageways are traversed. Copyright (c) 2013 John Wiley & Sons, Ltd.
Keywords:
trajectory optimization
mixed integer linear programming
collision avoidance
Journal
IF:
3.2
Papers:
6.9K
Citations:
1.4W