summaryrefslogtreecommitdiffhomepage
path: root/digital/io/src/move_cb.c
blob: de7ce204e4dd3de5718285069de1dc941da6718a (plain)
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
/* move_cb.c */
/*  {{{
 *
 * Copyright (C) 2008 NĂ©lio Laranjeiro
 *
 * APBTeam:
 *        Web: http://apbteam.org/
 *      Email: team AT apbteam DOT org
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 *
 * }}} */
#include "common.h"
#include "fsm.h"
#include "move_cb.h"

#include "path.h"
#include "asserv.h"
#include "playground.h"
#include "move.h"
#include "sharp.h"

#include "main.h"      /* main_post_event_for_top_fsm */
#include "modules/math/fixed/fixed.h"	/* fixed_* */

#include "debug.host.h"

/**
 * The real radius of the obstacle.
 */
#define MOVE_REAL_OBSTACLE_RADIUS 150

/**
 * The sharp distance between the bot and the obstacle.
 */
#define MOVE_SHARP_DISTANCE 300

/**
 * The distance between the axis of the bot and the front sharp.
 */
#define MOVE_AXIS_FRONT_SHARP 150

/**
 * The standard distance of the obstacle.
 */
#define MOVE_OBSTACLE_DISTANCE \
    (MOVE_REAL_OBSTACLE_RADIUS + MOVE_SHARP_DISTANCE + MOVE_AXIS_FRONT_SHARP)

/**
 * The radius of the obstacle for the path module.
 * It corresponds to the real radius of the obstacle plus the distance you
 * want to add to avoid it.
 */
#define MOVE_OBSTACLE_RADIUS (MOVE_REAL_OBSTACLE_RADIUS + 250)

/**
 * The generic validity time (in term of number of cyles).
 */
#define MOVE_OBSTACLE_VALIDITY (4 * 225)

/**
 * Cycles count to ignore sharp event in the main loop.
 */
#define MOVE_MAIN_IGNORE_SHARP_EVENT (3 * 225)

/**
 * Number of cycles to wait before trying to read the sharps values again when
 * we are stopped.
 */
#define MOVE_WAIT_TIME_FOR_POOLING_SHARP (50)

/**
 * Easier function to get the next intermediate positon from the path module.
 * @param dst new destination position computed by the path module
 * @return
 *   - 0 if no path could be found ;
 *   - 1 if a path has been found.
 */
uint8_t
move_get_next_position (move_position_t *dst)
{
    /* Get the current position */
    asserv_position_t current_pos;
    asserv_get_position (&current_pos);
    /* Give the current position of the bot to the path module */
    path_endpoints (current_pos.x, current_pos.y,
		    move_data.final.x, move_data.final.y);
    /* Update the path module */
    path_update ();

    /* Retrieve next path coordinate */
    if (main_always_stop_for_obstacle || !path_get_next (&dst->x, &dst->y))
      {
	DPRINTF ("Could not compute any path to avoid obstacle!\n");
	return 0;
      }
    main_sharp_ignore_event = MOVE_MAIN_IGNORE_SHARP_EVENT;
    DPRINTF ("Computed path is (%d ; %d)\n", dst->x, dst->y);
    return 1;
}

/**
 * Compute the obstacle position assuming it is right in front of us.
 * @param cur current position
 * @param obstacle the obstacle position computed
 */
void
move_compute_obstacle_position (asserv_position_t cur,
				move_position_t *obstacle)
{
    /* Convert the angle */
    uint32_t angle = cur.a;
    /* Change angle when going backward */
    if (asserv_get_moving_direction () == 2)
	angle += 0x8000;
    angle = angle << 8;
    DPRINTF ("We are at (%d ; %d ; %x)\n", cur.x, cur.y, cur.a);
    /* X */
    obstacle->x = cur.x + fixed_mul_f824 (fixed_cos_f824 (angle),
					  MOVE_OBSTACLE_DISTANCE);
    /* Y */
    obstacle->y = cur.y + fixed_mul_f824 (fixed_sin_f824 (angle),
					  MOVE_OBSTACLE_DISTANCE);
    DPRINTF ("Computed obstacle (%d ; %d)\n", obstacle->x, obstacle->y);
}
/**
 * Unique function to compute the obstacle position from here.
 */
void
move_obstacle_here (void)
{
    /* Get the current position of the bot */
    asserv_position_t current;
    asserv_get_position (&current);
    /* Compute the obstacle position */
    move_compute_obstacle_position (current, &move_data.obstacle);
    /* Give it to the path module */
    path_obstacle (0, move_data.obstacle.x, move_data.obstacle.y,
		   MOVE_OBSTACLE_RADIUS, MOVE_OBSTACLE_VALIDITY);
}

/**
 * Unique function after moving backward to have unique code.
 * @return the value of the move_get_next_position.
 */
uint8_t
move_after_moving_backward (void)
{
    /* Give the current position of the bot to the path module */
    if (move_get_next_position (&move_data.intermediate))
      {
	/* Go to the next position */
	if (move_data.backward_movement_allowed)
	    asserv_goto_back (move_data.intermediate.x, move_data.intermediate.y);
	else
	    asserv_goto (move_data.intermediate.x, move_data.intermediate.y);
	return 1;
      }
    else
	return 0;
}

/*
 * WAIT_FOR_CLEAR_PATH =wait_finished=>
 * no_obstacle => MOVING_TO_FINAL_POSITION
 *   check for obstacle using stored moving direction
 *   try to go the final position
 * obstacle => WAIT_FOR_CLEAR_PATH
 *   check for obstacle using stored moving direction
 *   post an event for the top FSM to be waked up later
 */
fsm_branch_t
move__WAIT_FOR_CLEAR_PATH__wait_finished (void)
{
    if (!sharp_path_obstrued (move_data.cached_moving_direction))
      {
	/* Try to go to the final position */
	if (move_data.backward_movement_allowed)
	    asserv_goto_back (move_data.final.x, move_data.final.y);
	else
	    asserv_goto (move_data.final.x, move_data.final.y);
	return move_next_branch (WAIT_FOR_CLEAR_PATH, wait_finished, no_obstacle);
      }
    else
      {
	/* Post an event for the top FSM to be waked up later */
	main_move_wait_cycle = MOVE_WAIT_TIME_FOR_POOLING_SHARP;
	return move_next_branch (WAIT_FOR_CLEAR_PATH, wait_finished, obstacle);
      }
}

/*
 * IDLE =start=>
 *  => MOVING_TO_FINAL_POSITION
 *   ask the asserv to go to the final position
 */
fsm_branch_t
move__IDLE__start (void)
{
    /* Go to the destination position */
    if (move_data.backward_movement_allowed)
	asserv_goto_back (move_data.final.x, move_data.final.y);
    else
	asserv_goto (move_data.final.x, move_data.final.y);
    return move_next (IDLE, start);
}

/*
 * MOVING_TO_INTERMEDIATE_POSITION =bot_move_succeed=>
 * final_position => IDLE
 *   post an event for the top FSM to tell we have finished
 * position_intermediary => MOVING_TO_INTERMEDIATE_POSITION
 *   go to the next intermediate position computed by the path module
 * no_intermediate_path_found => WAIT_FOR_CLEAR_PATH
 *   store current moving direction
 *   stop the bot
 *   post an event for the top FSM to be waked up later
 */
fsm_branch_t
move__MOVING_TO_INTERMEDIATE_POSITION__bot_move_succeed (void)
{
    if ((move_data.final.x == move_data.intermediate.x) &&
	(move_data.final.y == move_data.intermediate.y))
      {
	/* Post an event for the top FSM to tell we have finished */
	main_post_event_for_top_fsm = TOP_EVENT_move_fsm_finished;
	return move_next_branch (MOVING_TO_INTERMEDIATE_POSITION, bot_move_succeed, final_position);
      }
    else
      {
	/* Get next position */
	if (move_get_next_position (&move_data.intermediate))
	  {
	    /* Go to the next intermediate position */
	    if (move_data.backward_movement_allowed)
		asserv_goto_back (move_data.intermediate.x, move_data.intermediate.y);
	    else
		asserv_goto (move_data.intermediate.x, move_data.intermediate.y);
	    return move_next_branch (MOVING_TO_INTERMEDIATE_POSITION, bot_move_succeed, position_intermediary);
	  }
	else
	  {
	    /* Store current moving direction */
	    move_data.cached_moving_direction = asserv_get_moving_direction ();
	    /* Stop the bot */
	    asserv_stop_motor ();
	    /* Post an event for the top FSM to be waked up later */
	    main_move_wait_cycle = MOVE_WAIT_TIME_FOR_POOLING_SHARP;
	    return move_next_branch (MOVING_TO_INTERMEDIATE_POSITION, bot_move_succeed, no_intermediate_path_found);
	  }
      }
}

/*
 * MOVING_TO_INTERMEDIATE_POSITION =bot_move_obstacle=>
 * intermediate_path_found => MOVING_TO_INTERMEDIATE_POSITION
 *   compute the obstacle position
 *   get next intermediate position from path module
 *   go to next intermediate position
 * no_intermediate_path_found => WAIT_FOR_CLEAR_PATH
 *   compute the obstacle position
 *   get next intermediate position from path module failed
 *   store current moving direction
 *   stop the bot
 *   post an event for the top FSM to be waked up later
 */
fsm_branch_t
move__MOVING_TO_INTERMEDIATE_POSITION__bot_move_obstacle (void)
{
    /* Compute obstacle position */
    move_obstacle_here ();
    /* Get next position */
    if (move_get_next_position (&move_data.intermediate))
      {
	/* Go to the next intermediate position */
	if (move_data.backward_movement_allowed)
	    asserv_goto_back (move_data.intermediate.x, move_data.intermediate.y);
	else
	    asserv_goto (move_data.intermediate.x, move_data.intermediate.y);
	return move_next_branch (MOVING_TO_INTERMEDIATE_POSITION, bot_move_obstacle, intermediate_path_found);
      }
    else
      {
	/* Store current moving direction */
	move_data.cached_moving_direction = asserv_get_moving_direction ();
	/* Stop the bot */
	asserv_stop_motor ();
	/* Post an event for the top FSM to be waked up later */
	main_move_wait_cycle = MOVE_WAIT_TIME_FOR_POOLING_SHARP;
	return move_next_branch (MOVING_TO_INTERMEDIATE_POSITION, bot_move_obstacle, no_intermediate_path_found);
      }
}

/*
 * MOVING_TO_INTERMEDIATE_POSITION =bot_move_failed=>
 *  => MOVING_BACKWARD
 *   store the current position of the obstacle
 *   move backward to turn freely
 */
fsm_branch_t
move__MOVING_TO_INTERMEDIATE_POSITION__bot_move_failed (void)
{
    /* Compute obstacle position */
    move_obstacle_here ();
    /* Go backward */
    asserv_move_linearly (-PG_MOVE_DISTANCE); 
    return move_next (MOVING_TO_INTERMEDIATE_POSITION, bot_move_failed);
}

/*
 * MOVING_BACKWARD =bot_move_failed=>
 * intermediate_path_found => MOVING_TO_INTERMEDIATE_POSITION
 *   get next intermediate position from path module
 * no_intermediate_path_found => WAIT_FOR_CLEAR_PATH
 *   get next intermediate position from path module, failed
 *   stop the bot
 *   post an event for the top FSM to be waked up later
 */
fsm_branch_t
move__MOVING_BACKWARD__bot_move_failed (void)
{
    /* Call generic function */
    if (move_after_moving_backward ())
      {
	return move_next_branch (MOVING_BACKWARD, bot_move_failed, intermediate_path_found);
      }
    else
      {
	/* Stop the bot */
	asserv_stop_motor ();
	/* Post an event for the top FSM to be waked up later */
	main_move_wait_cycle = MOVE_WAIT_TIME_FOR_POOLING_SHARP;
	return move_next_branch (MOVING_BACKWARD, bot_move_failed, no_intermediate_path_found);
      }
}

/*
 * MOVING_BACKWARD =bot_move_succeed=>
 * intermediate_path_found => MOVING_TO_INTERMEDIATE_POSITION
 *   get next intermediate position from path module
 * no_intermediate_path_found => WAIT_FOR_CLEAR_PATH
 *   get next intermediate position from path module, failed
 *   stop the bot
 *   post an event for the top FSM to be waked up later
 */
fsm_branch_t
move__MOVING_BACKWARD__bot_move_succeed (void)
{
    /* Call generic function */
    if (move_after_moving_backward ())
      {
	return move_next_branch (MOVING_BACKWARD, bot_move_succeed, intermediate_path_found);
      }
    else
      {
	/* Stop the bot */
	asserv_stop_motor ();
	/* Post an event for the top FSM to be waked up later */
	main_move_wait_cycle = MOVE_WAIT_TIME_FOR_POOLING_SHARP;
	return move_next_branch (MOVING_BACKWARD, bot_move_succeed, no_intermediate_path_found);
      }
}

/*
 * MOVING_TO_FINAL_POSITION =bot_move_failed=>
 *  => MOVING_BACKWARD
 *   compute the obstacle position
 *   store current moving direction (for possible failed of path module)
 *   move backward to turn freely
 */
fsm_branch_t
move__MOVING_TO_FINAL_POSITION__bot_move_failed (void)
{
    /* Compute obstacle position */
    move_obstacle_here ();
    /* Store current moving direction */
    move_data.cached_moving_direction = asserv_get_moving_direction ();
    /* Move backward to turn freely */
    asserv_move_linearly (-PG_MOVE_DISTANCE);
    return move_next (MOVING_TO_FINAL_POSITION, bot_move_failed);
}

/*
 * MOVING_TO_FINAL_POSITION =bot_move_succeed=>
 *  => IDLE
 *   post an event for the top FSM to tell we have finished
 */
fsm_branch_t
move__MOVING_TO_FINAL_POSITION__bot_move_succeed (void)
{
    /* Post an event for the top FSM to tell we have finished */
    main_post_event_for_top_fsm = TOP_EVENT_move_fsm_finished;
    return move_next (MOVING_TO_FINAL_POSITION, bot_move_succeed);
}

/*
 * MOVING_TO_FINAL_POSITION =bot_move_obstacle=>
 * intermediate_path_found => MOVING_TO_INTERMEDIATE_POSITION
 *   compute the obstacle position
 *   get next intermediate position from path module
 *   go to next intermediate position
 * no_intermediate_path_found => WAIT_FOR_CLEAR_PATH
 *   compute the obstacle position
 *   get next intermediate position from path module failed
 *   store current moving direction
 *   stop the bot
 *   post an event for the top FSM to be waked up later
 */
fsm_branch_t
move__MOVING_TO_FINAL_POSITION__bot_move_obstacle (void)
{
    /* Compute obstacle position */
    move_obstacle_here ();
    /* Get next position */
    if (move_get_next_position (&move_data.intermediate))
      {
	/* Go to the next intermediate position */
	if (move_data.backward_movement_allowed)
	    asserv_goto_back (move_data.intermediate.x, move_data.intermediate.y);
	else
	    asserv_goto (move_data.intermediate.x, move_data.intermediate.y);
	return move_next_branch (MOVING_TO_FINAL_POSITION, bot_move_obstacle, intermediate_path_found);
      }
    else
      {
	/* Store current moving direction */
	move_data.cached_moving_direction = asserv_get_moving_direction ();
	/* Stop the bot */
	asserv_stop_motor ();
	/* Post an event for the top FSM to be waked up later */
	main_move_wait_cycle = MOVE_WAIT_TIME_FOR_POOLING_SHARP;
	return move_next_branch (MOVING_TO_FINAL_POSITION, bot_move_obstacle, no_intermediate_path_found);
      }
}