dignea  1.0.0
Diverse Instance Generator with Novelty Search and Evolutionary Algorithms
MapElites.h File Reference
#include <dignea/generator/EIG.h>
#include <algorithm>
#include <array>
#include <cstdint>
#include <iterator>
#include <map>
#include <numeric>
#include <ranges>
#include <tuple>
#include <utility>
#include <vector>
#include "NumCpp.hpp"

Go to the source code of this file.

Classes

class  MapElites< IP, IS, OP, OS >
 Instance Generation Algorithm. Known as Meta-Evolutionary Algorithm (MapElites). This algorithm uses a Weighted Fitness Function (WFF) to evaluate how biased and diverse are the instances generated during the evolutionary process. The instances generated should be biased to the performance of the target algorithm in the portfolio but also should show some diversity between them. More...
 

Typedefs

using FeatureInfo = std::tuple< float, float, int >
 FeatureInfo defines the information for a specific feature. More...
 
using Features = std::map< int, FeatureInfo >
 Features defines the information a feature. More...
 
using Key = std::array< float, 8 >
 
using Bins = nc::NdArray< float >
 

Detailed Description

Author
Alejandro Marrero (amarr.nosp@m.erd@.nosp@m.ull.e.nosp@m.du.e.nosp@m.s)
Version
0.1
Date
2023-03-29

Typedef Documentation

◆ FeatureInfo

using FeatureInfo = std::tuple<float, float, int>

FeatureInfo defines the information for a specific feature.

  • Lower Limit of the values
  • Upper Limit of the values
  • Number of bins to create

◆ Features

using Features = std::map<int, FeatureInfo>

Features defines the information a feature.

  • ID of the feature.
  • FeatureInfoType