Name
Abstract | ||
|---|---|---|
This article addresses a path planning problem for an unmanned vehicle in the presence of localization constraints. Landmarks are used for localizing the position of the vehicle at any time. The localization constraints require that at least two landmarks must be present in the sensing range of the vehicle at any time instant. This problem is formulated as a Mixed Integer Linear Program (MILP) which aims to compute an optimal path for the vehicle and the optimal locations where landmarks must be placed. The facial structure of the polytope of feasible solutions to the MILP is then analyzed, and a branch-and-cut algorithm is developed to find an optimal solution. Extensive computational results that corroborate the effectiveness of the proposed approach are also presented.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s11590-019-01435-8 | Optimization Letters |
Keywords | Field | DocType |
Branch-and-cut, Exact algorithm, Vehicle routing, Unmanned vehicles, GPS-denied environments | Motion planning,Integer,Mathematical optimization,Vehicle routing problem,Exact algorithm,Branch and cut,Polytope,Linear programming,Mathematics | Journal |
Volume | Issue | ISSN |
13 | 5 | 1862-4480 |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kaarthik Sundar | 1 | 75 | 11.68 |
| sivakumar rathinam | 2 | 13 | 2.02 |
| Rajnikant Sharma | 3 | 33 | 8.76 |