Matlab path searching, I need more explanations

[Saruman]

We have to write an algorithm that makes three robots go from their start position to three goals. We have four different tipes of movements 1: the robot goes an square forward 2: the robot turns left without moving 3: the robot turns right 4:the robot doesn´t move

But we have 2 obstacles with this shapes (I, L, U), that the robot can´t cross.

We are given a 60x60 matrix called map, with 3 1s (the goals), 0s (were the robot can go) and -1s(the obstacles).

We are also given a 3x3 matrix called state that shows us the inital place of the robots and their orientation:

row of the robot i= state(i,1)
column of the robot I=state(i,2)
initial direction of the robot i= (i,3)

- the initial direction uses this instructions:
1 North:were the row value goes down
2 East: were the column value goes down
3 South: were the row value goes up
4 West: were the column value goes up


This are the general explanations of the work.
We have to write an algorithm that works with all maps and states and the faster and shorter it is the better.

If you could give the algorithm to us or explain us how to do it it would be great.
If you can´t some good advices would be also of great help

 

[Lewish]

Sounds like you want the group to do your senior term project for you. I suggest you do the work.
Do you know how to use an internet search engine? There is lots of stuff available out there. Go do your assignment.