SingletonGenAlgAPI.h

Go to the documentation of this file.

/***************************************************************************
 *   Copyright (C) 2005-2009 by Robot Group Leipzig                        *
 *    martius@informatik.uni-leipzig.de                                    *
 *    fhesse@informatik.uni-leipzig.de                                     *
 *    der@informatik.uni-leipzig.de                                        *
 *    guettler@informatik.uni-leipzig.de                                   *
 *    jhoffmann@informatik.uni-leipzig.de                                  *
 *    joergweide84@aol.com (robot12)                                       *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program is distributed in the hope that it will be useful,       *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
 *   GNU General Public License for more details.                          *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************
 *                                                                         *
 *   This class is a facade for the gen. alg. It covert all function to    *
 *   work with the alg.                                                    *
 *                                                                         *
 *   $Log: SingletonGenAlgAPI.h,v $
 *   Revision 1.11  2009/10/21 14:08:06  robot12
 *   add restore and store functions to the ga package
 *
 *   Revision 1.10  2009/08/11 12:57:38  robot12
 *   change the genetic algorithm (first crossover, second select)
 *
 *   Revision 1.9  2009/07/28 13:20:40  robot12
 *   add some clean ups and add member variable m_cleanStrategies
 *
 *   Revision 1.8  2009/07/21 08:39:01  robot12
 *   rename "crosover" to crossover
 *
 *   Revision 1.7  2009/07/15 12:53:36  robot12
 *   some bugfix's and new functions
 *
 *   Revision 1.6  2009/07/06 15:06:35  robot12
 *   bugfix
 *
 *   Revision 1.5  2009/07/02 15:24:53  robot12
 *   update and add new class InvertedFitnessStrategy
 *
 *   Revision 1.4  2009/06/30 14:20:49  robot12
 *   finishing the gen API and add some comments
 *
 *   Revision 1.3  2009/05/11 14:08:51  robot12
 *   patch some bugfix....
 *
 *   Revision 1.2  2009/05/06 13:28:22  robot12
 *   some implements... Finish
 *
 *   Revision 1.1  2009/05/04 15:27:55  robot12
 *   rename of some files and moving files to other positions
 *    - SingletonGenAlgAPI has one error!!! --> is not ready now
 *
 *   Revision 1.4  2009/04/30 11:35:53  robot12
 *   some changes:
 *    - insert a SelectStrategie
 *    - insert a MutationStrategie
 *    - reorganisation of the design
 *
 *   Revision 1.3  2009/04/29 14:32:29  robot12
 *   some implements... Part4
 *
 *   Revision 1.2  2009/04/29 11:36:41  robot12
 *   some implements... Part3
 *
 *   Revision 1.1  2009/04/27 10:59:34  robot12
 *   some implements
 *
 *
 ***************************************************************************/

#ifndef SINGLETONGENALGAPI_H_
#define SINGLETONGENALGAPI_H_

//includes
#include <string>
#include <list>
#include <selforg/randomgenerator.h>

//forward declaration
class Gen;
class GenPrototype;
class GenContext;
class Individual;
class Generation;
class IMutationStrategy;
class IMutationFactorStrategy;
class ISelectStrategy;
class IGenerationSizeStrategy;
class IRandomStrategy;
class IValue;
class IFitnessStrategy;

//forward declaration for LPZROBOTS
class PlotOptionEngine;
class PlotOption;

//ga_tools includes
#include "SingletonGenEngine.h"

/**
 * This is a facade for the gen. alg.
 *
 * Over this is the class as singleton concepted. Only one API for a run.
 */
class SingletonGenAlgAPI{
public:
        // Action
        /**
         * starts the selection
         * @param createNextGeneration (bool) normal=true should be the next generation be prepare?
         */
        void select(bool createNextGeneration=true);
        /**
         * create the children from to fill up the next generation
         * @param random (RandGen*) random generator
         */
        void crossover(RandGen* random);
        /**
         * update the internal statistical data
         * @param factor (double) normal=1.5 is needed for the whisker distance
         */
        void update(double factor = 1.5);
        /**
         * prepares the first generation and optional the enabled measure
         * @param startSize (int) Number of individual at begin of the gen. alg.
         * @param startChildren (int) Number of individual which will be created by crossover
         * @param random (RandGen*) A random generator
         * @param withUpdate (bool) is needed for "generateFirstGeneration"
         */
        void prepare(int startSize, int numChildren, RandGen* random, bool withUpdate = true);
        /**
         * prepares the next generation and optional the enabled measure
         */
        void prepare();
        /**
         * makes a step in the measure
         * @param time (double) time stamp in the measure
         */
        void measureStep(double time);
        /**
         * start the sequenz of select, crossover, update in a automatically loop
         * @param startSize (int) Number of individual at begin of the gen. alg.
         * @param numChildren (int) Number of individual which will be created by crossover
         * @param numGeneration (int) Number of generation which the alg. max. runs
         * @param random (RandGen*) random generator
         */
        void runGenAlg(int startSize, int numChildren, int numGeneration, RandGen* random);

        //measure
        /**
         * enables data measure with more than one plotOption.
         * @param plotOptions (list<PöotOption>&) the list
         */
        void enableMeasure(std::list<PlotOption>& plotOptions);
        /**
         * enables da : public Storableta measure.
         * @param plotOption (PlotOption&) the plot option
         */
        void enableMeasure(PlotOption& plotOption);
        /**
         * returns the active plotOptionEngine for data measure.
         * @return (PlotOptionEngine*) the plot option engine
         */
        inline PlotOptionEngine* getPlotOptionEngine(void)const {return m_plotEngine;}
        /**
         * enable data measure inside the GenContexts with more than one plotOption
         * @param plotOptions (list<PlotOption>&) the list
         */
        void enableGenContextMeasure(std::list<PlotOption>& plotOptions);
        /**
         * enable data measure inside the GenContexts.
         * @param plotOption (PlotOption&) the plot option
         */
        void enableGenContextMeasure(PlotOption& plotOption);
        /**
         * returns the active plotOptionEngine for data measure inside the GenContexts.
         * @return (PlotOptionEngine*) the plot option engine.
         */
        inline PlotOptionEngine* getPlotOptionEngineForGenContext(void)const {return m_plotEngineGenContext;}

        // set static strategies
        /**
         * set the generation size strategy
         * @param strategy (IGenerationSizeStrategy*) the strategy
         */
        inline void setGenerationSizeStrategy(IGenerationSizeStrategy* strategy) {SingletonGenEngine::getInstance()->setGenerationSizeStrategy(strategy);}
        /**
         * set the fitness strategy
         * @param strategy (IFitnessStrategy*) the strategy
         */
        inline void setFitnessStrategy(IFitnessStrategy* strategy) {SingletonGenEngine::getInstance()->setFitnessStrategy(strategy);}
        /**
         * set the select strategy
         * @param strategy (ISelectStrategy*) the strategy
         */
        inline void setSelectStrategy(ISelectStrategy* strategy) {SingletonGenEngine::getInstance()->setSelectStrategy(strategy);}

        // gets
        /**
         * returns the GenAlgEngine
         * @return (SingletonGenEngine*) the engine
         */
        SingletonGenEngine* getEngine(void)const;

        // default interface creation
        /**
         * creates a SumFitnessStrategy. This strategy make the sum of all gens with a double value.
         * @return (IFitnessStrategy*) the strategy
         */
        IFitnessStrategy* createSumFitnessStrategy()const;
        /**
         * creates a EuclidicFitnessStrategy. This strategy calculate the euclidic distance of all gens with a double value.
         * @return (IFitnessStrategy*) the strategy
         */
        IFitnessStrategy* createEuclidicDistanceFitnessStrategy()const;
        /**
         * creates a TestFitnessStrategy which is the hardest test for a gen. alg. Only a smale area has a fitness. All other gives no information!
         * @param fitness (IFitnessStrategy*) a other fitness strat* Over this is the class as singleton concepted. Only one engine for a run.egy which define the smal area.
         * @return (IFitnessStrategy*) the strategy
         */
        IFitnessStrategy* createExtreamTestFitnessStrategy(IFitnessStrategy* fitness)const;
        /**
         * creates the test function fitness strategy from the papper tp this alg.
         * f(x,y) = 10.0 * (x² + 2.5y² - y) * exp(1 - (x² + y²)) + 2.4 + 0.1x² + 0.1y²
         * @return (IFitnessStrategy*) the strategy
         */
        IFitnessStrategy* createTestFitnessStrategy()const;
        /**
         * returns a fitness strategy which calculate the inverse value from a other strategy.
         * @param strategy (IFitnessStrategy*) the other strategy
         * @return (IFitnessStrategy*) the resulting strategy
         */
        IFitnessStrategy* createInvertedFitnessStrategy(IFitnessStrategy* strategy)const;
        /**
         * creates a random strategy for double values.
         * The values will be generated in the intervals [base-epsilon:-epsilon] or [epsilon:factor+base+epsilon]
         *
         * This means a random value in the interval [0:1] will be mul. with factor => [0:factor]
         * After this it will be shifted by base => [base:factor+base]
         * And than divided at the point zero and moved away by epsilon from the point zero
         * => [base-epsilon:-epsilon], [epsilon:factor+base+epsilon]
         *
         * For example:
         * We want values in the intervals [-10:-5] and [5:10].
         * ==> epsilon=5
         * ==> [-5:5]
         * ==> base=-5
         * ==> [0:10]
         * ==> factor=10
         *
         * @param random (RandGen*) random generator
         * @param base (double) normal=0.0 moves the ground interval
         * @param factor (double) normal=1.0 resize the interval
         * @param epsilon (double) normal=0.0 devided the interval at the point zero and move the
         *                      values by epsilon away from point zero
         * @return (IRandomStrategy*) the strategy
         */
        IRandomStrategy* createDoubleRandomStrategy(RandGen* random, double base=0.0, double factor=1.0, double epsilon = 0.0)const;
        /**
         * creates mutation strategy which change the old values by add a other value
         * @param strategy (IMutationFactorStrategy*) this strategy define what the other value is.
         * @param mutationProbability (int) the probability of mutation in one per tausend (1/1000)
         * @return (IMutationStrategy*) the strategy
         */
        IMutationStrategy* createValueMutationStrategy(IMutationFactorStrategy* strategy, int mutationProbability)const;
        /**
         * creates a mutation factor strategy with a fix value
         * @param value (IValue*) the fix value.
         * @return (IMutationFactorStrategy*) the strategy
         */
        IMutationFactorStrategy* createFixMutationFactorStrategy(IValue* value)const;
        /**
         * creates a mutation factor strategy with a optimized value (varianz about all existing gens)
         * @return (IMutationFactorStrategy*) the strategy
         */
        IMutationFactorStrategy* createStandartMutationFactorStrategy(void)const;
        /**
         * creates a generation size strategy with a fix value
         * @param value (int) the size of the generation
         * @return (IGenerationSizeStrategy*) the strategy
         */
        IGenerationSizeStrategy* createFixGenerationSizeStrategy(int value)const;
        /**
         * creates a generation size strategy with a optimized size for the generation (changing by speed of development)
         * @param startSize (int) the size at the start time
         * @param numGeneration (int) number of generation. (needed for the speed calculation
         * @return (IGenerationSizeStrategy*) the strategy
         */
        IGenerationSizeStrategy* createStandartGenerationSizeStrategy(int startSize, int numGeneration)const;
        /**
         * creates a elite select strategy
         * @return (ISelectStrategy*) the strategy
         */
        ISelectStrategy* createEliteSelectStrategy(void)const;
        /**
         * creates a tournament SelctStrategy. By this strategy will two individual fight again
         * (the individual with the higher fitness lives longer).
         * @param random (RandGen*) random generator
         * @return (ISelectStrategy*) the strategy
         */
        ISelectStrategy* createTournamentSelectStrategy(RandGen* random)const;
        /**
         * creates a random select strategy. By this strategy will a random selected individual fight again a random number.
         * If the random number higher than the fitness from the individual, than it will be die.
         * @param random (RandGen*) ranom generator
         * @return (ISelectStrategy*) the strategy
         */
        ISelectStrategy* createRandomSelectStrategy(RandGen* random)const;
        /**
         * creates a IValue (TemplateValue<double) from type double.
         * @param value (double) the value
         * @return (IValue*) the new object
         */
        IValue* createDoubleValue(double value)const;

        //Storable
        /** stores the object to the given file stream (binary).
         */
        bool storeGA(FILE* f) const;

        /** loads the object from the given file stream (binary).
         */
        bool restoreGA(FILE* f) const;

        // inserts
        /**
         * add a GenPrototype to the alg.
         * @param prototype (GenPrototype*) the prototype
         */
        void insertGenPrototype(GenPrototype* prototype);

        // object creation
        /**
         * create a prototype.
         * @param name (STRING) THE NAME OF THE PROTOTYPE
         * @param randomStrategy (IRandomStrategy*) the random strategy to generate values of the type
         * which the prototype represent
         * @param mutationStrategy (IMutationStrategy*) the mutation strategy to change a value (Gen)
         * @return (GenPrototype*) the prototype
         */
        GenPrototype* createPrototype(std::string name, IRandomStrategy* randomStrategy, IMutationStrategy* mutationStrategy)const;

        // singleton
        /**
         * returns the one and only API to the alg.
         * @return (SingletonGenAlgAPI*) the api
         */
        inline static SingletonGenAlgAPI* getInstance(void) {if(m_api==0)m_api = new SingletonGenAlgAPI();return m_api;}
        /**
         * destroy the api
         * @param cleanStrategies (bool) default = false set a flag to clean the strategies, which are seted.
         */
        inline static void destroyAPI(bool cleanStrategies=false) {getInstance()->m_cleanStrategies=cleanStrategies; if(m_api!=0){delete m_api;m_api=0;}}

        // data access
        /**
         * returns the best individual which the alg. have found
         * @return (Individual*) the best
         */
        inline Individual* getBestIndividual(void)const {return SingletonGenEngine::getInstance()->getBestIndividual();}

protected:
        /**
         * the api
         */
        static SingletonGenAlgAPI* m_api;

        /**
         * plot option engine for data measure
         */
        PlotOptionEngine* m_plotEngine;

        /**
         * plot option engine for gen contexts
         */
        PlotOptionEngine* m_plotEngineGenContext;

private:
        /**
         * disable the default contructor
         */
        SingletonGenAlgAPI();
        /**
         * disable the default destructor
         */
        virtual ~SingletonGenAlgAPI();

        /**
         * help declaration for prepare
         */
        void* m_generation;

        /**
         * help declaration for prepare
         */
        void* m_inspectable;

        /**
         * Flag for clean the strategies
         */
        bool m_cleanStrategies;
};

#endif /* SINGLETONGENALGAPI_H_ */

---