Abstract

We present a mixed-integer nonlinear programming (MINLP) formulation of a UAV path optimization problem, and attempt to find the global optimum solution. As objective functions in UAV path optimization problems tend to be non-convex, traditional optimization solvers (typically local solvers) are prone to local optima, which lead to severely sub-optimal controls. For the purpose of this study, we choose a target tracking application, where the goal is to optimize the kinematic controls of UAVs while maximizing the target tracking performance. First, we compare the performance of two traditional solvers numerically - MATLAB's fmincon and knitro. Second, we formulate this UAV path optimization problem as a mixed-integer nonlinear program (MINLP). As this MINLP tends to be computationally expensive, we present two pruning methods to make this MINLP tractable. We also present numerical results to demonstrate the performance of these methods.

Original languageEnglish (US)
Title of host publication2017 American Control Conference, ACC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages406-411
Number of pages6
ISBN (Electronic)9781509059928
DOIs
StatePublished - Jun 29 2017
Event2017 American Control Conference, ACC 2017 - Seattle, United States
Duration: May 24 2017May 26 2017

Other

Other2017 American Control Conference, ACC 2017
CountryUnited States
CitySeattle
Period5/24/175/26/17

Fingerprint

Nonlinear programming
Unmanned aerial vehicles (UAV)
Target tracking
MATLAB
Kinematics

Keywords

  • fmincon
  • knitro
  • mixed-integer nonlinear programming
  • target tracking
  • UAV path optimization

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Ragi, S., & Mittelmann, H. (2017). Mixed-integer nonlinear programming formulation of a UAV path optimization problem. In 2017 American Control Conference, ACC 2017 (pp. 406-411). [7962987] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.23919/ACC.2017.7962987

Mixed-integer nonlinear programming formulation of a UAV path optimization problem. / Ragi, Shankarachary; Mittelmann, Hans.

2017 American Control Conference, ACC 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 406-411 7962987.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ragi, S & Mittelmann, H 2017, Mixed-integer nonlinear programming formulation of a UAV path optimization problem. in 2017 American Control Conference, ACC 2017., 7962987, Institute of Electrical and Electronics Engineers Inc., pp. 406-411, 2017 American Control Conference, ACC 2017, Seattle, United States, 5/24/17. https://doi.org/10.23919/ACC.2017.7962987
Ragi S, Mittelmann H. Mixed-integer nonlinear programming formulation of a UAV path optimization problem. In 2017 American Control Conference, ACC 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 406-411. 7962987 https://doi.org/10.23919/ACC.2017.7962987
Ragi, Shankarachary ; Mittelmann, Hans. / Mixed-integer nonlinear programming formulation of a UAV path optimization problem. 2017 American Control Conference, ACC 2017. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 406-411
@inproceedings{e391a687e33346ca8e081c0c36bb4556,
title = "Mixed-integer nonlinear programming formulation of a UAV path optimization problem",
abstract = "We present a mixed-integer nonlinear programming (MINLP) formulation of a UAV path optimization problem, and attempt to find the global optimum solution. As objective functions in UAV path optimization problems tend to be non-convex, traditional optimization solvers (typically local solvers) are prone to local optima, which lead to severely sub-optimal controls. For the purpose of this study, we choose a target tracking application, where the goal is to optimize the kinematic controls of UAVs while maximizing the target tracking performance. First, we compare the performance of two traditional solvers numerically - MATLAB's fmincon and knitro. Second, we formulate this UAV path optimization problem as a mixed-integer nonlinear program (MINLP). As this MINLP tends to be computationally expensive, we present two pruning methods to make this MINLP tractable. We also present numerical results to demonstrate the performance of these methods.",
keywords = "fmincon, knitro, mixed-integer nonlinear programming, target tracking, UAV path optimization",
author = "Shankarachary Ragi and Hans Mittelmann",
year = "2017",
month = "6",
day = "29",
doi = "10.23919/ACC.2017.7962987",
language = "English (US)",
pages = "406--411",
booktitle = "2017 American Control Conference, ACC 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Mixed-integer nonlinear programming formulation of a UAV path optimization problem

AU - Ragi, Shankarachary

AU - Mittelmann, Hans

PY - 2017/6/29

Y1 - 2017/6/29

N2 - We present a mixed-integer nonlinear programming (MINLP) formulation of a UAV path optimization problem, and attempt to find the global optimum solution. As objective functions in UAV path optimization problems tend to be non-convex, traditional optimization solvers (typically local solvers) are prone to local optima, which lead to severely sub-optimal controls. For the purpose of this study, we choose a target tracking application, where the goal is to optimize the kinematic controls of UAVs while maximizing the target tracking performance. First, we compare the performance of two traditional solvers numerically - MATLAB's fmincon and knitro. Second, we formulate this UAV path optimization problem as a mixed-integer nonlinear program (MINLP). As this MINLP tends to be computationally expensive, we present two pruning methods to make this MINLP tractable. We also present numerical results to demonstrate the performance of these methods.

AB - We present a mixed-integer nonlinear programming (MINLP) formulation of a UAV path optimization problem, and attempt to find the global optimum solution. As objective functions in UAV path optimization problems tend to be non-convex, traditional optimization solvers (typically local solvers) are prone to local optima, which lead to severely sub-optimal controls. For the purpose of this study, we choose a target tracking application, where the goal is to optimize the kinematic controls of UAVs while maximizing the target tracking performance. First, we compare the performance of two traditional solvers numerically - MATLAB's fmincon and knitro. Second, we formulate this UAV path optimization problem as a mixed-integer nonlinear program (MINLP). As this MINLP tends to be computationally expensive, we present two pruning methods to make this MINLP tractable. We also present numerical results to demonstrate the performance of these methods.

KW - fmincon

KW - knitro

KW - mixed-integer nonlinear programming

KW - target tracking

KW - UAV path optimization

UR - http://www.scopus.com/inward/record.url?scp=85027076914&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027076914&partnerID=8YFLogxK

U2 - 10.23919/ACC.2017.7962987

DO - 10.23919/ACC.2017.7962987

M3 - Conference contribution

AN - SCOPUS:85027076914

SP - 406

EP - 411

BT - 2017 American Control Conference, ACC 2017

PB - Institute of Electrical and Electronics Engineers Inc.

ER -