/* 
* PSO algorithm
* Tyler Simon
* 7/1/2010
* vi(t+1)=a*vi(t)+b1*r1(Pi1 - xi(t)) + b2r2(pi2 - xi(t))
* xi(t+1)=xi(t)+vi(t+1)
* a=1
* b1=b2=2
* r1=r2 random [0,1]
*/


#include <stdlib.h>
#include <stdio.h>


/*Function Defs*/
int particle_init(int);
int evaluate(int);
int update_past(int);
int update_neighborhood_best(int,float);
int move(int,float);

/*Globals*/
typedef struct particle{
     double x; /* x location*/
     double y; /* y location*/
     double v; /* z location*/
     double vx; /* velocity  */
     double vy; /* velocity  */
     double vz; /* velocity  */
}particle;
struct particle *particles;
struct particle *tmp;

struct {double x; double y;}best;

int beta1=2; //learning factors, positive acceleration coeffs.
int beta2=2; //learning factors, positive acceleration coeffs.

double r1,r2;
int alpha=1;

int main( int argc, char **argv){
int MAX, tstep;
int i;
if(argc > 2){ 
MAX=atoi(argv[1]);
tstep=atoi(argv[2]);
FILE *fp;
r1=drand48();
r2=drand48();

particle_init(MAX);
best.x=0.8;
best.y=0.8;

fp=fopen("input.dat", "w");
//fprintf(fp, "#%d\n", MAX);

while(tstep--)
	{
	update_past(MAX);
	
	for (i=0; i<MAX; i++)
	{
	fprintf(fp, "%d %2.3f %2.3f %2.3f\n", tstep, particles[i].x, particles[i].y, particles[i].v);
	}
	fprintf(fp, "\n\n");	
	}//end tstep
fclose(fp);
	


return(0);
free(tmp);
free(particles);
}//end while
else
printf("%s <max particles> <time step>\n", argv[0]);
exit(0);
}//end main

particle_init(int N)
{
int i,j;
particles=malloc(N*(sizeof(struct particle)));
//printf ("Creating %d molecules in 2d space in \"input.dat\"\n", N);
srand48( (unsigned int)time( NULL ) );
for(i=0; i<N; i++)
	{
	particles[i].x=drand48();
	particles[i].y=drand48();
	particles[i].v=drand48();
	}
printf("plot \"input.dat\" u 1:2 pt 7 ps 2;\n");
return 0;
}


int evaluate(int N){}
int update_past(int N)
{
int i;
tmp=malloc(N*(sizeof(struct particle)));
for(i=0; i<N; i++)
	{
	tmp[i].x=particles[i].x;
	tmp[i].y=particles[i].y;
	tmp[i].v=particles[i].v;
	particles[i].x=(tmp[i].x*tmp[i].v);
	particles[i].y=(tmp[i].y*tmp[i].v);
	}
return 0;
}

int update_neighborhood_best(int N,float k){}
int move(int N,float v){}