AIAA Guidance, Navigation and Control Conference and Exhibit · 2007 · 12 citations · 12 references
ComputingAutonomous SystemsOptimizationPath PlanningTerrain AnalysisInteger ProgrammingLinear ProgrammingObstacle AvoidanceRoute PlanningTerrain ModelingTrajectory OptimizationConstraintsInteger Linear ProgrammingMixed-integer Linear ProgrammingMixed-integer ProgrammingPath OptimizationPiecewise FunctionsTerrain AvoidanceTerrain-aware Path Planning
This paper presents a new algorithm for optimal path planning subject to terrain avoidance constraints. The new method extends an existing approach based on Mixed-Integer Linear Programming (MILP) to oer significant improvements in computational eciency, while guaranteeing globally optimal solution of the path-planning problem. This improvement is the result of three key enhancements. First, the terrain representation is reformulated as a piecewise ane function, resulting in a better conditioned MILP problem. Second, an ecient method of approximating and simplifying real terrain data is developed. Finally, an iterative MILP solution approach is adopted, reducing computational eort by avoiding the application of redundant constraints. The new method is shown to oer significant reductions in solution time for only small loss of performance in terms of the planning objective.
12
Proceedings of AIChE 2011 Annual Meeting
Vikram Sreedharan, Bjørn H. Hjertager, Tron Solberg · 2011 · 208 citations
Fast Polygonal Approximation of Terrains and Height Fields
Michael Garland · 1998 · 201 citations