Available Problems
In this section you will get an overview of the already implemented problems in PaGMO (a complete list of problems with detailed information can be found in the PaGMO documentation):
PaGMO offers a number of famous standard functions commonly used to benchmark the performance of different solvers. These include Ackley, Rosenbrock, Rastrigin, Schwefel, Griewank function for continuous box-constrained single objective optimization, Golomb-ruler, Knapsack for integer programming and others....
The European Space Agency GTOP database researchers are making available several difficult interplanetary trajectory optimisation problems as black box functions to invite the operational research community and the aerospace engineers to develop, apply and compare different derivative-free solvers on these test problems. PaGMO offers a straight interface to these challenging real-life optimization problems. Box-constrained, non linear-constrained single objective optimization problems are included in this set.
Famous interplanetary trajectories such as the one of the Cassini spacecraft (to Saturn), or Rosetta (to the comet 67P/Churyumov-Gerasimenko) or Messenger (to Mercury) are included. Also the challenging use of ion-thruster in reaching interior planets (Mercury) or gas giants (Jupiter and Saturn) is provided in the form of a complex global non linear programming optimisation problem.
Evolutionary Robotics is a promising technique to provide future space robots with a superior artificial intelligence. These types of computations can be considered as stochastic non linear optimization problems. PaGMO has been interfaced to these types of ALife computations and release V1.0 is planned to be provided with a few examples of evolution of neurocontrollers. Check our project on robotic islands.
