I think if this is a university project, you should have the skills to figure this stuff out yourself. Surely, you can't expect us to hand it to you? Do your research, do some work and come back with your results, if things go bad and we can see if we can be of any help to you.

If all fails, use The Google, I am pretty sure I will find plenty of hits when I type in "path planning algorithms". You may even find some older topics touching on this very subject on these very forums.

Final projects are about showing off how good you are at novel, independent research, not how good you are at copying stuff from the net.

= Xander

i want only the start point

I want a little help, not full project

Did you search on Google about the different path planning algorithms out there? There's wavefront, A* and probably others, too.

= Xander

I gave you lots of starting points in my post. The link shows exactly how wavefront propagation works. There are hundreds of examples of Dijkstra's and A* on the web. As Xander said, you will not get anything just handed to you.

i know these algorithms but i don't know how to implement in RobotC

Wouldn't part of your final project be to figure that stuff out?

= Xander

i know all planning algorithms, but i don't know how to start in robotC, if you give me a little help i will implement the project

There are many ROBOTC examples included with the IDE, and the manual is pretty extensive IIRC.

can you give me a link for download planning examples?

I mean general ROBOTC examples (you said you don't know how to start in ROBOTC).

I am going to lock this thread. You were told how to look for examples of ROBOTC, including curriculum, you were told which path planning algorithms are out there. There is nothing we can show you, short of doing your research project for you and that will never happen.

Regards,
Xander