2006 IEEE Conference on Emerging Technologies and Factory Automation 2006
DOI: 10.1109/etfa.2006.355225
|View full text |Cite
|
Sign up to set email alerts
|

Using MILP for UAVs Trajectory Optimization under Radar Detection Risk

Abstract: This paper presents an approach to trajectories optimization for Unmanned Aerial Vehicle (UAV) in presence of obstacles, waypoints, and threat zones such as radar detection regions, using Mixed Integer Linear Programming (MILP). The main result is the linear approximation of a nonlinear radar detection risk function with integer constraints and indicator 0-1 variables. Several results are presented to show that the approach can yields trajectories depending on the acceptable risk of detection.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
23
0
1

Year Published

2008
2008
2024
2024

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 28 publications
(24 citation statements)
references
References 6 publications
0
23
0
1
Order By: Relevance
“…For each pop-up the system generates at planning-time several feasible evasion manoeuvres, qualified by a set of route parameters (fuel consumption, assumed risk and spent time) used at flight-time as decision variables to optimize the route. The work extends our preliminary results on trajectory generation over static environment (Ruz et al, 2006), taking into account the knowledge about pop-ups in the trajectory design. The route planner that is proposed in this work allows the UAV to make a decision among several alternative routes considering both, current state of the UAV and probabilities of pop-up threats appearance in future time.…”
mentioning
confidence: 58%
See 1 more Smart Citation
“…For each pop-up the system generates at planning-time several feasible evasion manoeuvres, qualified by a set of route parameters (fuel consumption, assumed risk and spent time) used at flight-time as decision variables to optimize the route. The work extends our preliminary results on trajectory generation over static environment (Ruz et al, 2006), taking into account the knowledge about pop-ups in the trajectory design. The route planner that is proposed in this work allows the UAV to make a decision among several alternative routes considering both, current state of the UAV and probabilities of pop-up threats appearance in future time.…”
mentioning
confidence: 58%
“…In the arrival constraints, (x f ,y f ,z f ) is the target location, λ t is a binary indicator variable to enable/disable each constraint, and t arrival is the time to be included as a term of the objective function to be minimized (Ruz et al, 2006).…”
Section: Target Reaching Constraintsmentioning
confidence: 99%
“…Finding the optimal solution to the route planning problem is NPcomplete ( [14]) and so the problem has been approached with different heuristics such as A* [17], [15], MILP [10], [6], [11], nonlinear programming [9] and others. The planners based on those techniques deal with a simplified version of the original problem (point-mass dynamics, discretising the solution space, and, in some of them, linearizing the objective function and the constraints) where the addition of new constraints or objective indexes is a difficult task.…”
Section: Introductionmentioning
confidence: 99%
“…In the literature, UAV path planning problems have attracted a large variety of optimization applications, including A* [10], [11], Mixed-Integer Linear Programming [12], [13], Nonlinear Programming [14], Voronoi Diagram [15], [16] and Evolutionary Algorithms (EAs) [1], [4], [9], [18]- [29], [35]. One of the difficult problems in the field of the UAV path planning is to plan a feasible path in a scenario with obstacles.…”
Section: Introductionmentioning
confidence: 99%