Good-Point Array (or Good-Point Set or Good-Node Set)

To produce M points distributed more evenly in the decision space ([0,1]^N) than the uniformly random method does.

% Assume to find M points distributed evenly among the decision space,[0,1]^N.

% The Good-Point Array (or the Good Nodes Set, the Good Point Set) can provide

% a set of point coordinates which distribute in a more even and more stable

% way than the uniformly random points set.

% This algorithm provides the Good-Point Array with while inputting M and N.

% where M is the number of points; N is the dimensionality of each point;

% The output is an M*N array in which each row represent a point coordinate

% in the [0,1]^N decision space.

% Reference:

% [1]Chixin Xiao, Zixing Cai, and Yong Wang, “A good nodes set

% evolution strategy for constrained optimization,” in 2007 IEEE Congress on

% Evolutionary Computation, 2007, pp. 943–950.

% Email: [e-mail] , Chixin Xiao, UoW ,AU , 23 May 2019