mkrandomstate.cc

c++编写的并行拉马克遗传算法的程序。实现分析对接程序

/* mkRandomState.cc */

#include <math.h>

#ifdef sgi
    #include <stdlib.h>
    #include "structs.h"
    #include "mkRandomState.h"
#else
    extern "C"
    {
	#include <stdlib.h>
	#include "structs.h"
        #include "mkRandomState.h"
    }
#endif


State mkRandomState( float xlo,
		     float xhi,
		     float ylo,
		     float yhi,
		     float zlo,
		     float zhi,
		     int   ntor,
		     float F_TorConRange[MAX_TORS][MAX_TOR_CON][2],
		     int   N_con[MAX_TORS])

{
    State now;
    register int i;
    double t;
    int I_ranCon;
    double x0, r1, r2, t1, t2;
    float a, b;

    now.ntor = ntor;

    /*
    ** Translation
    */
    now.T.x = random_range( xlo, xhi);
    now.T.y = random_range( ylo, yhi);
    now.T.z = random_range( zlo, zhi);

    /*
    ** Quaternion angular displacement
    */
    /*
    **  This should produce a uniformly distributed quaternion, according to
    **  Shoemake, Graphics Gems III.6, pp.124-132, "Uniform Random Rotations",
    **  published by Academic Press, Inc., (1992)
    */
         x0 = local_random();
         r1 = random_sign * sqrt( 1 - x0 );
         t1 = TWOPI * local_random();
    now.Q.x = sin( t1 ) * r1;
    now.Q.y = cos( t1 ) * r1;
         r2 = random_sign * sqrt(     x0 );
         t2 = TWOPI * local_random();
    now.Q.z = sin( t2 ) * r2;
    now.Q.w = cos( t2 ) * r2;

    for (i=0; i<ntor; i++) {
	if (N_con[i] > 0) {
	    if (N_con[i] > 1) {
		/* If N_con was 2, I_ranCon could be 0 or 1, never 2 */
		/* Select a random constraint */
		I_ranCon = (int)((double)N_con[i] * local_random());  
	    } else {
		/* Hobson's choice...
		*/
		I_ranCon = 0;
	    }
	    a = F_TorConRange[i][I_ranCon][LOWER];
	    b = F_TorConRange[i][I_ranCon][UPPER];
	    t = random_range(a,b);
	    now.tor[i] = WrpModRad(t);
	} else {
	    now.tor[i] = random_range( -PI, PI );
	}
    }/*i*/

    return( now );
} 
/* EOF */