Since this is a competition, it would be very unfair if you were just given a solution, but as a help to get you started...Look at the 2D floor plan and think of yourself as the robot - how would you go ahead finding and placing the boxes?Each time you make a decision that changes course, pick up a box, place a box etc. you make a numbered note (writing it down of course).

This way you get the "minimum terms" for each sub operation - a state list, you may say and then you just have to translate each state into something your 'bot can use.Shouldn't be hard to get it done in an afternoon.

If I had to do this, I would make a test field with the same elements (lines and boxes etc.) to test it out, but not necessarily the entire field - just the sections that is unique; like where the boxes are initially placed, but just a single one, as the rest is exactly like it.

Logged

Regards,Søren

A rather fast and fairly heavy robot with quite large wheels needs what? A lot of power?Please remember...Engineering is based on numbers - not adjectives

Does the order matter or just the colors? Once you can identify the colors then all you have to do is use a maze following algorithm to prevent the bot from taking the same path again. Might not be optimal but gets the job done. After that you can work on tweaking it and maybe pre-program some of the paths so it knows to choice the best return path based on the color.

well you also have to devise a way to detect the color (an LDR and some colored LEDs could work) of the box, since the boxes are subjected to shuffling .so choose a generic pattern to go from starting point to random box, check its color, and decide your destination accordingly.[off topic] what university do you belong to? UET , NUST , or QUAS etc? cause i may be able to guide you personally if you are from UETlhr.