GPOPS-II

GPOPS-II

Developer(s)	Michael Patterson,^[1] Anil V. Rao^[1]
Initial release	January 2013 (2013-01)

Stable release	2.0 / 1 September 2015 (2015-09-01)
Written in	MATLAB
Operating system	Mac OS X, Linux, Windows
Available in	English
Type	Numerical optimization software
License	Proprietary, Free-of-charge for K - 12 or classroom use. Licensing fees apply for all academic, not-for profit, and commercial use (outside of classroom use)
Website	gpops2.com

GPOPS-II (pronounced "GPOPS 2") is a general-purpose MATLAB software for solving continuous optimal control problems using hp-adaptive Gaussian quadrature collocation and sparse nonlinear programming. The acronym GPOPS stands for "General Purpose OPtimal Control Software", and the Roman numeral "II" refers to the fact that GPOPS-II is the second software of its type (that employs Gaussian quadrature integration).

Problem Formulation

GPOPS-II^[2] is designed to solve multiple-phase optimal control problems of the following mathematical form (where $P$ is the number of phases):

\min J=\phi ({\mathbf {e}}^{(1)},\ldots ,{\mathbf {e}}^{(P)})

subject to the dynamic constraints

{\dot {\mathbf {y}}}^{(p)}(t)={\mathbf {a}}^{(p)}({\mathbf {y}}^{(p)}(t),{\mathbf {u}}^{(p)}(t),t,{\mathbf {s}}),\quad (p=1,\ldots ,P),

the event constraints

{\mathbf {b}}_{\min }\leq {\mathbf {b}}({\mathbf {e}}^{(1)},\ldots ,{\mathbf {e}}^{(P)},{\mathbf {s}})\leq {\mathbf {b}}_{\max },

the inequality path constraints

{\mathbf {c}}_{\min }^{(p)}\leq {\mathbf {c}}({\mathbf {y}}^{(p)}(t),{\mathbf {u}}^{(p)}(t),t,{\mathbf {s}})\leq {\mathbf {c}}_{\max }^{(p)},\quad (p=1,\ldots ,P),

the static parameter constraints

{\mathbf {s}}_{\min }\leq {\mathbf {s}}\leq {\mathbf {s}}_{\max },

and the integral constraints

{\mathbf {q}}_{\min }^{(p)}\leq {\mathbf {q}}^{(p)}\leq {\mathbf {q}}_{\max }^{(p)},\quad (p=1,\ldots ,P),

where

{\mathbf {e}}^{(p)}=\left[{\mathbf {y}}^{(p)}(t_{0}^{(p)}),t_{0}^{(p)},{\mathbf {y}}^{(p)}(t_{f}^{(p)}),t_{f}^{(p)},{\mathbf {q}}^{(p)}\right],\quad (p=1,\ldots ,P),

and the integrals in each phase are defined as

q_{i}^{(p)}=\int _{t_{0}^{(p)}}^{t_{f}^{(p)}}g_{i}^{(p)}({\mathbf {y}}^{(p)}(t),{\mathbf {u}}^{(p)}(t),t,{\mathbf {s}})dt,\quad (i=1,\ldots ,n_{q}^{(p)},\;p=1,\ldots ,P).

It is important to note that the event constraints can contain any functions that relate information at the start and/or terminus of any phase (including relationships that include both static parameters and integrals) and that the phases themselves need not be sequential. It is noted that the approach to linking phases is based on well-known formulations in the literature.^[3]

Method Employed by GPOPS-II

GPOPS-II uses a class of methods referred to as $hp$ -adaptive Gaussian quadrature collocation where the collocation points are the nodes of a Gauss quadrature (in this case, the Legendre-Gauss-Radau [LGR] points). The mesh consists of intervals into which the total time interval $t^{(p)}\in [t_{0}^{(p)},t_{f}^{(p)}]$ in each phase is divided, and LGR collocation is performed in each interval. Because the mesh can be adapted such that both the degree of the polynomial used to approximate the state ${\mathbf {y}}^{(p)}(t)$ and the width of each mesh interval can be different from interval to interval, the method is referred to as an $hp$ -adaptive method (where " $h$ " refers to the width of each mesh interval, while " $p$ " refers to the polynomial degree in each mesh interval). The LGR collocation method has been developed rigorously in Refs.,^[4]^[5]^[6] while $hp$ -adaptive mesh refinement methods based on the LGR collocation method can be found in Refs., .^[7]^[8]^[9]^[10]

Development

The development of GPOPS-II began in 2007. The code development name for the software was OptimalPrime, but was changed to GPOPS-II in late 2012 in order to keep with the lineage of the original version of GPOPS ^[11] which implemented global collocation using the Gauss pseudospectral method. The development of GPOPS-II continues today, with improvements that include the open-source algorithmic differentiation package ADiGator ^[12] and continued development of $hp$ -adaptive mesh refinement methods for optimal control.

Applications of GPOPS-II

GPOPS-II has been used extensively throughout the world both in academia and industry. Published academic research where GPOPS-II has been used includes Refs.,^[13]^[14]^[15] where the software has been used in applications such as performance optimization of Formula One race cars, Ref.^[16] where the software has been used for minimum-time optimization of low-thrust orbital transfers,^[17] where the software has been used for human performance in cycling, Ref.^[18] where the software has been used for soft lunar landing, and Ref.^[19] where the software has been used to optimize the motion of a bipedal robot.

References

1 2 http://vdol.mae.ufl.edu/People/People.html
↑ Patterson, M. A.; Rao, A. V. (2014). "GPOPS-II: A MATLAB Software for Solving Multiple-Phase Optimal Control Problems Using hp-Adaptive Gaussian Quadrature Collocation Methods and Sparse Nonlinear Programming". ACM Transactions on Mathematical Software. 41 (1): 1:1–1:37. doi:10.1145/2558904.
↑ Betts, John T. (2010). Practical Methods for Optimal Control and Estimation Using Nonlinear Programming. Philadelpha: SIAM Press. ISBN 9780898718577.
↑ Garg, D.; Patterson,, M. A.; Hager, W. W.; Rao, A. V.; Benson, D. A.; Huntington, G. T. (2010). "A Unified Framework for the Numerical Solution of Optimal Control Problems Using Pseudospectral Methods". Automatica. 46 (11): 1843–1851. doi:10.1016/j.automatica.2010.06.048.
↑ Garg, D.; Hager, W. W.; Rao, A. V.; et al. (2011). "Pseudospectral Methods for Solving Infinite-Horizon Optimal Control Problems". Automatica. 47 (4): 829–837. doi:10.1016/j.automatica.2011.01.085.
↑ Garg, D.; Patterson,, M. A.; Darby, C. L.; Francolin, C.; Huntington, G. T.; Hager, W. W.; Rao, A. V.; et al. (2011). "Direct Trajectory Optimization and Costate Estimation of Finite-Horizon and Infinite-Horizon Optimal Control Problems Using a Radau Pseudospectral Method". Computational Optimization and Applications. 49 (2): 335–358.
↑ Darby, C. L.; Hager, W. W.; Rao, A. V.; et al. (2011). "An hp-Adaptive Pseudospectral Method for Solving Optimal Control Problems". Optimal Control Applications and Methods. 32 (4): 476–502. doi:10.1002/oca.957.
↑ Darby, C. L.; Hager, W. W.; Rao, A. V.; et al. (2011). "Direct Trajectory Optimization Using a Variable Low-Order Adaptive Pseudospectral Method". Journal of Spacecraft and Rockets. 48 (3): 433–445. doi:10.2514/1.52136.
↑ Patterson, M. A.; Hager, W. W.; Rao, A. V. (2011). "A ph Mesh Refinement Method for Optimal Control". Optimal Control Applications and Methods. 36 (4): 398–421.
↑ Liu, F.; Hager, W. W.; Rao, A. V. (2015). "Adaptive Mesh Refinement for Optimal Control Using Nonsmoothness Detection and Mesh Size Reduction". Journal of the Franklin Institute - Engineering and Applied Mathematics. 352 (10): 4081–4106. doi:10.1016/j.jfranklin.2015.05.028.
↑ Rao, A. V.; Benson, D. A.; Darby, C. L.; Patterson, M. A.; Francolin, C.; Sanders, I.; Huntington, G. T. (2010). "GPOPS: A MATLAB Software for Solving Multiple-Phase Optimal Control Problems Using the Gauss Pseudospectral Method". ACM Transactions on Mathematical Software. 37 (2): 22:1–22:39. doi:10.1145/1731022.1731032.
↑ Weinstein, M. J.; Rao, A. V. "ADiGator: A MATLAB Toolbox for Algorithmic Differentiation Using Source Transformation via Operator Overloading". ADiGator.
↑ Perantoni, G.; Limebeer, D. J. N. (2015). "Optimal Control of a Formula One Car on a Three-Dimensional Track. Part 1: Track Modelling and Identification". ASME Journal of Dynamic Systems, Measurement, and Control. In Press: 021010. doi:10.1115/1.4028253.
↑ Limebeer, D. J. N.; Perantoni, G. (2015). "Optimal Control of a Formula One Car on a Three-Dimensional Track Part 2: Optimal Control". ASME Journal of Dynamic Systems, Measurement, and Control. In Press: 051019. doi:10.1115/1.4029466.
↑ Limebeer, D. J. N.; Perantoni, G.; Rao, A. V. (2014). "Optimal Control of Formula One Car Energy Recovery Systems". International Journal of Control. 87 (10): 2065–2080. doi:10.1080/00207179.2014.900705.
↑ Graham, K. F.; Rao, A. V. (2015). "Minimum-Time Trajectory Optimization of Many Revolution Low-Thrust Earth-Orbit Transfers". Journal of Spacecraft and Rockets. 52 (3): 711–727. doi:10.2514/1.a33187.
↑ Dahmen, T.; Saupeand, D. (2014). "Optimal pacing strategy for a race of two competing cyclists". Journal of Science and Cycling. 3 (2).
↑ Moon, Y; Kwon, S. "Lunar Soft Landing with Minimum-Mass Propulsion System Using H2O2/Kerosene Bipropellant Rocket System". Acta Astronautica. 99 (May - June): 153–157. doi:10.1016/j.actaastro.2014.02.003.
↑ Haberland, M.; McClelland, H.; Kim, S.; Hong, D. "The Effect of Mass Distribution on Bipedal Robot Efficiency". International Journal of Robotics Research. 25 (11): 1087–1098.

External links

Mathematical optimization software

Data formats	LP MPS nl OptML OSiL sol xMPS

Modeling tools	AIMMS AMPL APMonitor CMPL CVX CVXOPT CVXPY ECLiPSe-CLP GAMS GNU MathProg JuMP LINDO OPL MPL OptimJ PICOS PuLP Pyomo ROML TOMLAB Xpress-Mosel YALMIP ZIMPL

LP, MILP^∗ solvers	ABACUS^∗ APOPT^∗ Artelys Knitro^∗ BCP^∗ BDMLP BPMPD BPOPT CLP CBC^∗ CPLEX^∗ CSDP DSDP FortMP^∗ GCG^∗ GIPALS32 GLPK/GLPSOL^∗ Gurobi^∗ HOPDM LINDO^∗ lp_solve^∗ LOQO MINOS MINTO^∗ MOSEK^∗ OOPS OOQP PCx QSopt SAS/OR^∗ SCIP^∗ SoPlex SOPT-IP^∗ Sulum Optimization Tools^∗ SYMPHONY^∗ XA^∗ Xpress-Optimizer^∗

QP, MIQP^∗ solvers	APOPT^∗ Artelys Knitro^∗ BPMPD BPOPT BQPD CBC^∗ CLP CPLEX^∗ FortMP^∗ GloMIQO^∗ Gurobi^∗ IPOPT LINDO^∗ LSSOL LOQO MINOS MOSEK^∗ OOPS OOQP QPOPT QPSOL SCIP^∗ XA Quadratic Solver Xpress-Optimizer^∗

QCP, MIQCP^∗ solvers	APOPT^∗ Artelys Knitro^∗ BPMPD BPOPT CPLEX^∗ GloMIQO^∗ Gurobi^∗ IPOPT LINDO^∗ LOQO MINOS MOSEK^∗ SCIP^∗ Xpress-Optimizer^∗ Xpress-SLP^∗

SOCP, MISOCP^∗ solvers	CPLEX^∗ DSDP Gurobi^∗ LINDO^∗ LOQO MOSEK^∗ SCIP^∗ SDPT3 SeDuMi Xpress-Optimizer^∗

SDP, MISDP^∗ solvers	CSDP DSDP MOSEK PENBMI PENSDP SCIP-SDP^∗ SDPA SDPT3 SeDuMi

NLP, MINLP^∗ solvers	ALGENCAN AlphaECP^∗ ANTIGONE^∗ AOA^∗ APOPT^∗ Artelys Knitro^∗ BARON^∗ Bonmin^∗ BPOPT CONOPT Couenne^∗ DICOPT^∗ FilMINT^∗ FilterSQP Galahad library ipfilter IPOPT LANCELOT LINDO^∗ LOQO LRAMBO MIDACO^∗ MILANO^∗ MINLP BB^∗ MINOS Minotaur^∗ MISQP^∗ NLPQLP NPSOL OQNLP^∗ PATHNLP PENNON SBB^∗ SCIP^∗ SNOPT^∗ SQPlab WORHP Xpress-SLP^∗

GO solvers	BARON Couenne^∗ LINDO SCIP

CP solvers	Artelys Kalis Choco Comet CPLEX CP Optimizer Gecode Google CP Solver JaCoP OscaR

Metaheuristic solvers	OptaPlanner LocalSolver

List of optimization software Comparison of optimization software

This article is issued from Wikipedia - version of the 9/29/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.