-
Notifications
You must be signed in to change notification settings - Fork 0
/
vel_optimal.cpp
539 lines (467 loc) · 12.9 KB
/
vel_optimal.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
#include "vel_optimal.h"
#include "math.h"
COMMAND VSET[VSET_NUM] = { 0 };
OBSTACLE obs[OBS_SENSOR] = { 0 };
POSITION target_pos(int dis_L, int dis_R) //get target position
{
int x, y, temp;
int d_line;
float S, H, P, Ltheta, cosine, theta;
float L, R, D;
POSITION pos;
//robot view triangle frame
L = dis_L * 1.0;
R = dis_R * 1.0;
D = DIS * 1.0;
// sprintf( up2pc, "L:%lf R:%lf D:%lf ", L, R, D );
// sonar_to_pc( up2pc, sizeof(up2pc) );
P = (L + R + D) / 2;
S = sqrt( P * (P-L) * (P-R) * (P-D) );
H = 2 * S / D;
cosine = (L*L + D*D - R*R)/(2.0*L*D);
Ltheta = acos(cosine);
// sprintf( up2pc, "P:%lf S:%lf H:%lf cos: %lf theta: %lf\n", P, S, H, cosine, Ltheta*180/3.14 );
// sonar_to_pc( up2pc, sizeof(up2pc) );
x = L * cosine - D/2.0;
y = H;
d_line = sqrt(x*x + y*y);
// sprintf( up2pc, "X:%d Y:%d d_line:%d \n", x, y, d_line );
// sonar_to_pc( up2pc, sizeof(up2pc) );
//translate to robot frame
temp = x;
x = y;
y = -1 * temp;
theta = atan(1.0*y/x);
pos.x = x;
pos.y = y;
pos.theta = theta/PI*180;
//printf("%.2f, %.2f, %.2f\n", pos.x, pos.y, pos.theta);
return pos;
}
STATUS initial_vset(COMMAND *set) //initial speed set
{
int i = 0, j = 0;
float vset[V_NUM], wset[W_NUM];
#ifdef DEBUG
FILE *fp;
fp = fopen("VSET.txt", "w+");
#endif // DEBUG
for (i = 0; i < W_NUM; i++) //initial_wset=[-90,-85,...0,5,...,85,90], num = 37
wset[i] = -90 + 5 * i;
for (i = 0; i < V_NUM; i++) //initial_vset=[0,0.05,...,0.95,1.00], num = 21
vset[i] = 0.05*i;
for (i = 0; i < W_NUM; i++) //initial_VSET=[]
{
for (j = 0; j < V_NUM; j++)
{
set[21 * i + j].w = wset[i];
set[21 * i + j].v = vset[j];
#ifdef DEBUG
//printf("set[%d].w=%f set[%d].v=%f\n", 21 * i + j, wset[i], 21 * i + j, vset[j]);
fprintf(fp, "set[%d].w=%f set[%d].v=%f\n", 21 * i + j, wset[i], 21 * i + j, vset[j]);
#endif
}
}
#ifdef DEBUG
fclose(fp);
#endif // DEBUG
return TRUE;
}
//input: 2 position p1: last_pos, p2: cur_pos
//output: vel & orient
STATE predictor(POSITION p1, POSITION p2) //predict the target state: speed and orient
{
STATE sta;
float vel;
float ort;
float dx;
float dy;
dx = p2.x - p1.x;
dy = p2.y - p1.y;
vel = sqrt( dx*dx + dy*dy ) / CONTROL_PERIOD;
if (dx > 0)
{
ort = atan2(dy, dx);
}
else
{
ort = PI / 2 + atan2(dy, dx);
}
sta.velocity = vel;
sta.orient = ort;
return sta;
}
/*
input: p1 = target last position, p2 = target current position
obs = obstacle position
*/
COMMAND optimal_vel( POSITION p1, POSITION p2, POSITION obs)
{
POSITION current_target, future_target, current_obs;
POSITION future_robot;
STATE target_state;
COMMAND cmd;
float current_gama, future_current, delta_theta, current_beta;
current_target = p2; //current & future target position
target_state = predictor(p1, p2);
future_target.x = current_target.x + target_state.velocity*T*cos(target_state.orient);
future_target.y = current_target.y + target_state.velocity*T*sin(target_state.orient);
current_obs = obs; //get current obstacle position
//update cost
update_index(VSET, current_target, future_target, current_obs);
//give a certain command, caculate the optimal index
//for item in VSET:
// item.cost = index_cal( item, )
//if there is no obstacle, the current visible angle is positive
#ifdef DEBUG
printf("x = %f y= %f\n", future_target.x, future_target.y);
#endif // DEBUG
return find_optimal(VSET);
}
COMMAND find_optimal(COMMAND *cmd) //找到最优解
{
COMMAND pos_result, neg_result;
int i = 0;
pos_result.v = 0;
pos_result.w = 0;
pos_result.index = 0;
neg_result.v = 0;
neg_result.w = 0;
neg_result.index = -1000000;
for (i = 0; i < VSET_NUM; i++)
{
if (cmd[i].index > 0)
{
if (cmd[i].index > pos_result.index)
pos_result = cmd[i];
}
else
{
if (cmd[i].index > neg_result.index)
neg_result = cmd[i];
}
}
if (neg_result.index != 0)
return neg_result;
else
return pos_result;
}
//calculate speed command
STATUS index_cal(COMMAND *cmd, POSITION target)
{
POSITION future_robot;
future_robot.x = cmd->v * T * cos(cmd->w);
future_robot.y = cmd->v * T * sin(cmd->w);
return TRUE;
}
//update the optimal index
STATUS update_index(COMMAND *cmd, POSITION current_target, POSITION future_target, POSITION current_obs)
{
int i;
POSITION future_robot;
float current_theta, future_theta, current_beta, future_beta, current_gama, future_gama;
float delta_theta;
current_gama = atan2(current_target.y, current_target.x); //get the current target angel gama
current_beta = atan2(current_obs.y, current_obs.x); //obstacle angel: beta
/*get current theta*/
if (current_gama > 0) //if target is in the left flat
{
if ((current_beta) > vision) //if obstalce is outside of sensor vision
{
current_theta = vision - current_gama;
}
else
{
current_theta = current_beta - current_gama;
}
}
else //right flat
{
if (current_beta < -1 * vision)
{
current_theta = vision - current_gama;
}
else
{
current_theta = current_beta - current_gama;
}
}
/* caculate future theta and delta_theta */
/* the maxsium negative delta_theta means theta is growing rapidly
the maxsium positive delta_theta means theta is decreasing slowly
*/
for (i = 0; i < VSET_NUM; i++)
{
if (cmd[i].w != 0) //update future robot's position caused by speed command
{
future_robot.x = cmd[i].v * T * cos(cmd[i].w / 180.0*3.14);
future_robot.y = cmd[i].v * T * sin(cmd[i].w / 180.0*3.14);
}
else
{
future_robot.x = cmd[i].v * T;
future_robot.y = 0;
}
future_gama = atan2(future_target.y - future_robot.y, future_target.x - future_robot.x);
future_beta = atan2(current_obs.y - future_robot.y, current_obs.x - future_robot.x);
if (future_gama > 0) //if target is in the left flat, here is the opposite to upside,
{ // just handle left flat or right flat mark?
if ((future_beta) > vision)
{
future_theta = vision - future_gama;
}
else
{
future_theta = future_beta - future_gama;
}
}
else //right flat
{
if (future_beta < -1 * vision)
{
future_theta = vision - future_gama;
}
else
{
future_theta = future_beta - future_gama;
}
}
delta_theta = current_theta - future_theta;
if (delta_theta != 0)
{
cmd[i].index = current_theta / delta_theta;
}
else
{
cmd[i].index = -0.000001; //define the index that indicating no change for theta
}
}//for interator
return TRUE;
}
//更新代价,无障碍物
STATUS update_cost_noObs(COMMAND *cmd, float current_theta, POSITION future_target)
{
int i;
POSITION future_robot;
float future_gama, future_theta, R, fai;
for (i = 0; i < VSET_NUM; i++)
{
if (cmd[i].w != 0)
{
fai = cmd[i].w * T;
R = cmd[i].v / cmd[i].w; //motion radius
future_robot.x = R*cos(fai / 180.0*PI);
future_robot.y = R*sin(fai / 180.0*PI);
future_theta = atan2(future_robot.y - future_target.y, future_robot.x - future_target.x) - cmd[i].w*T;
cmd[i].index = current_theta - future_gama;
}
else
{
R = cmd[i].v * T;
future_robot.x = R;
future_robot.y = future_robot.y;
future_gama = future_gama = atan2(future_robot.y - future_target.y, future_robot.x - future_target.x) - cmd[i].w*T;
cmd[i].index = current_theta - future_gama;
}
}
return TRUE;
}
//update optimal index when there is obstalce around
STATUS update_cost_Obs(COMMAND *cmd, float current_theta, POSITION future_target, POSITION current_Obs)
{
int i;
POSITION future_robot,future_obs;
float future_gama, future_beta, R, fai;
for (i = 0; i < VSET_NUM; i++)
{
if (cmd[i].w != 0)
{
fai = cmd[i].w * T;
R = cmd[i].v / cmd[i].w; //motion radius
future_robot.x = R*cos(fai / 180.0*PI);
future_robot.y = R*sin(fai / 180.0*PI);
future_beta = (current_Obs.y - future_robot.y, current_Obs.x - future_robot.x) - cmd[i].w * T;
if (future_beta > vision)
{
future_gama = atan2(future_robot.y - future_target.y, future_robot.x - future_target.x) - cmd[i].w*T;
}
else
{
}
cmd[i].index = current_theta - future_gama;
}
else
{
R = cmd[i].v * T;
future_robot.x = R;
future_robot.y = future_robot.y;
future_gama = future_gama = atan2(future_robot.y - future_target.y, future_robot.x - future_target.x) + cmd[i].w*T;
cmd[i].index = current_theta - future_gama;
}
}
return TRUE;
}
COMMAND find_max(COMMAND *cmd)
{
COMMAND result;
int i;
result = cmd[0];
for (i = 0; i < VSET_NUM; i++)
{
if (result.index < cmd[i].index)
{
result = cmd[i];
}
}
return result;
}
/*
A map is construct, the frame used in map is graphic frame,
that means the grid in the left top of screen is NO.1 and the grid in
the right bottom is NO.(m*n).
Robot is at the center of the bottom of screen. The position set as (0, 0).
To initial a map is to reset all grid state as vacant and caclulate the center position of
each grid (corresponding to robot frame).
*/
STATUS initial_map(MAP *map)
{
int v = 0, h = 0;
int robot_x = 30, robot_y = 0;
int abs_y = 0, abs_x = 0; //reobot frame
map->width = MAP_HORIZON; //MAP_HORIZON is 60 grids
map->height = MAP_VERTICAL; //MAP_VERTICAL is 30 grids
clear_map(map);
for(v=0; v<MAP_VERTICAL; v++)
{
for(h=0; h<MAP_HORIZON; h++)
{
abs_y = fabs( h - MAP_HORIZON/2 + 0.5 ) * GRID_WIDTH; //caculate y distance to robot position
abs_x = (MAP_VERTICAL - v - 0.5) * GRID_HEIGHT; //caculate x distance to robot position
map->grid_center[v][h] = sqrt(abs_x * abs_x + abs_y * abs_y);
printf("%4d ", map->grid_center[v][h]);
}
printf("\n");
}
return TRUE;
}
STATUS clear_map(MAP *map)
{
int v = 0, h = 0;
for(v=0; v<MAP_VERTICAL; v++)
{
for(h=0; h<MAP_HORIZON; h++)
{
map->grid[v][h] = VACANT;
}
}
return TRUE;
}
/*
input: all sensor data
output: map with obstacle information
*/
STATUS update_map(int sensor[OBS_SENSOR], MAP* map)
{
/*
1st: caculate three points: center & 2 heads
2nd:
*/
POSITION header_1, header_2; //2 headers
int width, height, index;
float radius, cur_theta;
float detect_vision;
int w, h;
clear_map(map);
detect_vision = 15.0 /180.0 * PI;
for(index=0; index<OBS_SENSOR; index++)
{
// theta used here is in common frame rather than robot frame
// the right one is the first and the left is the last
if( 0 == index )
{
cur_theta = 0;
header_1.x = sensor[index] * cos(cur_theta);
header_1.y = sensor[index] * sin(cur_theta);
cur_theta = 7.5 /180.0 * PI;
header_2.x = sensor[index] * cos(cur_theta);
header_2.y = sensor[index] * sin(cur_theta);
}
else if( 12 == index )
{
cur_theta = (180.0 - 7.5)/180.0 * PI;
header_1.x = sensor[index] * cos(cur_theta);
header_1.y = sensor[index] * sin(cur_theta);
cur_theta = 7.5 /180.0 * PI;
header_2.x = sensor[index] * cos(cur_theta);
header_2.y = sensor[index] * sin(cur_theta);
}
else
{
cur_theta = (15 * index - 7.5)/180.0 * PI;
header_1.x = sensor[index] * cos(cur_theta);
header_1.y = sensor[index] * sin(cur_theta);
cur_theta = (15 * index + 7.5)/180.0 * PI;
header_2.x = sensor[index] * cos(cur_theta);
header_2.y = sensor[index] * sin(cur_theta);
}
draw_map(header_1, header_2, sensor[index], map);
}
return TRUE;
}
//according to sensor data & obstalce data, draw information in map
void draw_map(POSITION p1, POSITION p2, int radius, MAP* map)
{
int v_min, v_max; //define v,h in graphic frame to determine the index of grid
int h_min, h_max;
int x_tmp[2], y_tmp[2];
int ver, hor;
if(p1.y < 0) // frame transform: from common xy to graphic grid index
{
x_tmp[0] = MAP_VERTICAL - p1.x/GRID_HEIGHT -1;
y_tmp[0] = p1.y/GRID_WIDTH;
}
else
{
x_tmp[0] = MAP_VERTICAL - p1.x/GRID_HEIGHT -1;
y_tmp[0] = p1.y/GRID_WIDTH + MAP_HORIZON/2;
}
if(p2.y < 0) // frame transform: from common xy to graphic grid index
{
x_tmp[1] = MAP_VERTICAL - p1.x/GRID_HEIGHT -1;
y_tmp[1] = p1.y/GRID_WIDTH;
}
else
{
x_tmp[1] = MAP_VERTICAL - p1.x/GRID_HEIGHT -1;
y_tmp[1] = p1.y/GRID_WIDTH + MAP_HORIZON/2;
}
//locate the ractange that contains the arc
if(x_tmp[0] < x_tmp[1])
{
v_min = x_tmp[0];
v_max = x_tmp[1];
}
else
{
v_min = x_tmp[1];
v_max = x_tmp[0];
}
if(y_tmp[0] < y_tmp[1])
{
h_min = y_tmp[0];
h_max = y_tmp[1];
}
else
{
h_min = y_tmp[1];
h_max = y_tmp[0];
}
//draw map
for(ver=v_min; ver<=v_max; ver++)
for(hor=h_min; hor<=h_max; hor++)
{
// if the (center-radius)<GRID_HEIGHT/2, it is ouccupied
if(fabs(map->grid_center[ver][hor] - radius) < GRID_HEIGHT/2)
map->grid[ver][hor] = OCCUPIED;
}
}