Robotics Guidelines 2015

Foundation University
College of Computer Studies

Dumaguete City
AUTONOMOUS ROBOTICS CHALLENGE 2015
GENERAL RULES FOR THE CONTEST
A. Contestants
1. Each school representative is composed of 2 teams; team A and team B
2. Each team is composed of 2 students only.
3. Each team per school is only allowed to play once; either elimination or final round.
4. Only the registered teams are allowed to play.
5. The school must submit the names of the participants and the coach in its official letter
head duly certified by the head of the school college/university on or before February
18, 2015 to the College of Computer Studies office, Foundation University.
5.1
Official list of names can also be submitted via email to
[email protected] or [email protected]
6. There shall be two consecutive rounds: the Elimination Round, 8:30 a.m. at the LG
Sinco IT Laboratory and the Final Round, 1:30 p.m. on February 24, 2015 at the Atrium
of Robinsons Place Dumaguete City.
7. Coaches and Contestants are required to attend the Briefing on February 24, 2015,
8:00am to 8:30 a.m., at the LG Sinco IT Laboratory, Foundation University in preparation
for the Contest. Failure to attend shall mean disqualification from the contest.
B. Technical Team
1. The Technical team is on stand-by during the period of the contest.
2. The Technical team is allowed to interrupt during the competition to check their
program for safety purposes only.
3. The technical team will not approve programs with logical-errors that are hazardous
to the robot. The error will be explained to the team (e.g. infinite loop)
4. The technical team is only limited in explaining the hazardous error to the team. They
are not allowed to provide hints, answers and anything that will give the team an
advantage in the contest.
C. Preliminary Round
1. The preliminary/elimination round is composed of three batches in no specific order.
2. Each batch is composed of 15 school representatives or less depending to the total
number of participants.
3. Each school may send their Team A or Team B but not both during the preliminary
round. Refer to section A
4. The qualifying school will send the other team in the final round. Refer to section
A.3
5. There shall be one common problem during the elimination round.
6. Contestants are given an hour to solve the given problem.
7. Each team is allowed to download and test their program once on the robot.
8. The test will not be more than 2 minutes.
9. The number of available robots is limited so the test will be a first-come-first-serve
basis.
Dumaguete City
10.When the team completes their program, the team will raise their flag signifying the
time it took to finish their program. The flag should remain in its standing position
after submission.
11.The teams can no longer test the robot after the 1-hour time limit. Refer to section
D.6.
12.The team with the shortest time in solving the problem will advance to the Final
Elimination Round.
13.Should there be tie in determining the top 3 shortest time(s), the involved teams that
tied will be judged according to the shortest solution or line of code.
14.If sections D.12 and D.13 still cannot decide the top 3, the program committee
chairman and its members will review the program codes.
Determine the score according to:
14.i. Simplicity of code: minimal use of necessary resources and processes such as
waiting time, functions and other elements of the program enough to solve the
problem.
14.ii. Logic: Clarity and simplicity of algorithm. Only perform what is asked from the
given problem.
D. Final Round
1. Only the top 3 schools during the preliminary round will advance to the Final Round.
2. The team who played during the elimination round is not allowed in the Final Round;
hence the other team of the school will play. (Refer to section A)
3. Contestants are given an hour to solve the problems.
4. Each team is allowed to download and test their programs on the robot but not more
than 8 times.
5. Each test is limited to 2 minutes.
6. The number of available robots is limited so the test will be a first-come-first-serve
basis.
7. The team can no longer test the robot after the 1 hour time limit. Refer to section
D.3.
8. When the team completes their programs or decides to stop and submit, the team will
raise their flag signifying the time it took to finish their program.
9. There will be 4 different problems with their classification and equivalent points:
9.i.
Class C : 5 points
9.ii. Class B : 20 points
9.iii. Class A : 40 points
9.iv. Class S : 50 points
10.Each team may solve any given problems.
11.The point system will primarily decide the ranking of winners as mentioned in E.9.
12.If Section E.10 cannot decide the ranking of winners, the team with the shortest time
will get top rank.
13.If Section E.11 still cannot decide the ranking, the program codes will be reviewed
by the program committee chairman and members and will be decided based on the
following:
Dumaguete City
14.iii.
14.iv.
Simplicity of code: minimal use of necessary resources and processes such as

waiting time, functions and other elements of the program enough to solve
the problem.
Logic: Clarity and simplicity of algorithm. Only perform what is asked from the
given problem.
E. Winners
1. The Final Round: Execution of the program codes in autonomous mode, will be held
at Robinsons Main Atrium.
2. Winners will be judged fairly and accordingly as indicated in section D.
3. Prizes are given to the winners by the end of this competition.
Champion:
P 2,000 cash with certificate and trophy
1st Runner-up: P1,500 cash and certificate and trophy
2nd Runner-up: P1,000 cash and certificate and trophy

Robotics Guidelines 2015

Uploaded by

Copyright:

Available Formats

Robotics Guidelines 2015

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Robotics Guidelines 2015

Uploaded by

Copyright:

Available Formats

Foundation University

College of Computer Studies

Simplicity of code: minimal use of necessary resources and processes such as

You might also like