Project Presentation 6 May 2011 | 08:07 pm

Final Project 6 May 2011 | 06:48 am

%prepare the planner for a new graph laser "resetplanner" laser "scanget" laser "resetlocalizer" %---------------------------------------------- %add nodes to the graph laser "addpoint pno=1 x=0.5 ...

Exercise 11, Problem 4 30 Mar 2011 | 07:03 am

Cleaning the box. Make a program that 'cleans' the box by going from side to side and back in a pattern that covers the hold box. Aulocalize should be used to assure correct position in the box. N=10...

Exercise 11, Problem 3 30 Mar 2011 | 07:02 am

Boxdriving with Kalman Localization. Change   the   code   from  problem  two   so   it   uses   kalman   updates   from  the localizer plugin. periodic Kalman filtering N=10 laser "addline startx...

Exercise 11, Problem 2 30 Mar 2011 | 07:00 am

Generation of Boxdriving in SMRCL Make smrcl  code  that  makes an smr  follow  the  targetposes starting  in  the middle   of   the   box  then   going   to   the   corners and   then   continueing ...

Exercise 11, Problem 1 30 Mar 2011 | 06:54 am

 Initialization of the localiser. laser cmd="addline startx=-0.9 starty=0.9 endx=0.9 endy=0.9 name='N'" laser cmd="addline startx=-0.9 starty=-0.9 endx=0.9 endy=-0.9 name='S'" laser cmd="addline star...

Exercise 8, Problem 2.2 29 Mar 2011 | 06:14 am

After fervently fighting for hours with correct matrix sizing, we can see that the system is now more accurate.

Exercise 12, Task 6 29 Mar 2011 | 05:42 am

The function below creates a file that contains instructions for the robot depending on the resulted list of cells. function SMRfile(q) fid = fopen('SMRcommand.txt','w'); for i=1:(size(q,1)-1) x=...

Exercise 12, Task 5 29 Mar 2011 | 01:06 am

The results for the given case are: distmap = 3.41   3.00      0      0      0      0      0       0      0   0 3.00   2.00      0  14.82  15.23  15.64  16.05 16.46  16.87   0 0   3.00      0  13...

Exercise 12, Task 4 29 Mar 2011 | 12:51 am

After computing the distance map with the previous function, the following one finds the minimum distance route from the start point to the final one. function route = findroute(startcell,finalcell,d...