{"title":"MILP optimal path planning for real-time applications","authors":"Cedric Ma, Robert H. Miller","doi":"10.1109/ACC.2006.1657504","DOIUrl":null,"url":null,"abstract":"This paper presents several efficient solution techniques specific to the optimal path planning of an autonomous vehicle. Mixed-integer linear programming (MILP) is the underlying problem formulation, from which an optimal solution can be obtained through the use of a commercially available MILP solver such as CPLEX. The solution obtained is optimal in terms of the cost function specified in terms of fuel, time, altitude, etc. Several techniques are introduced to reduce the complexity of the underlying mathematical problems as to help make the path planning approach suitable for running in a mission-critical real-time environment. Some of these techniques may be applicable to other optimal path planning approaches","PeriodicalId":265903,"journal":{"name":"2006 American Control Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"50","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACC.2006.1657504","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 50
Abstract
This paper presents several efficient solution techniques specific to the optimal path planning of an autonomous vehicle. Mixed-integer linear programming (MILP) is the underlying problem formulation, from which an optimal solution can be obtained through the use of a commercially available MILP solver such as CPLEX. The solution obtained is optimal in terms of the cost function specified in terms of fuel, time, altitude, etc. Several techniques are introduced to reduce the complexity of the underlying mathematical problems as to help make the path planning approach suitable for running in a mission-critical real-time environment. Some of these techniques may be applicable to other optimal path planning approaches