The snow and ice in The Eastern Himalayas have shrunk by an astonishing 30% since the 1970s!
For every 2000 pounds of paper (1 ton) recycled, we save 7,000 gallons of pure water.
2% of the household batteries in the UK are collected for recycling. Councils involved need to step up their efforts to reach their target which is 25% by 2012 and 45% by 2016.
Pesticide usage worldwide has quadrupled over the last 40 years, from an average of 0.5 Kg per hectare in 1961 To 2kg per hectare in 2004!
Only 50% of Nairobi's water supply actually reaches the customer!The other half is lost through leakages and illegal connections
It is estimated that up to 1 trillion plastic bags are consumed worldwide each year, more than one million per minute.*
Build a bot that can automatically reach the destination in an arena finding its way through obstacles.
You can either use on board sensors to detect the presence of obstacles in the arena or you can use the webcam feed that will be provided to a system.
You can write your own code to detect the presence of obstaclesfrom the given image.
Arena will be a 4 m x 4 m square split into an 8x8 grid. Size of each grid will be 50cm.
Obstacles will be painted black and the path will be painted white.
The size of each obstacle will be 50cm x 50 cm x 15cm (Length x Width x Height). A sample arena is given below.
The size of the bot should not exceed 25cm x 25cm x 30 cm. The potential difference between any two points on the bot should not exceed 24 V. There is no limit on the amount of current. The bot should have a power supply on board. NO EXTERNAL POWER SUPPLY WILL BE PROVIDED.
Rules:
Each team can contain a maximum of 4 members.
Members can be from different colleges.
Each team will be given a maximum of 15 minutes to complete a run.
Only one Run will be given to a team. A second run will not be given under any circumstance except a tie.
In case of damage to the arena, the bot will be disqualified.
Readymade bots and toys will not be permitted.
Members must carry their college ID cards.
The bot that reaches the destination in the shortest time will be declared winner.
If none of the bots reach the destination, the bot that is nearest to the destination will be declared the winner.
If more than one bot stop at the same point, the bot that took the least time will be the winner.
In case of a tie in all the above conditions, the bots will be given a second run.
The judges’ decision will be FINAL. No further arguments will be encouraged.
A system with MATLAB will be provided for the participants who decide to use the webcam feed.
In case you need a software package other than MATLAB, you must bring it with you while coming.
