The Duckietown Challenge
The Duckietown Roadway is illustrated, including each of the 12 goal nodes. A complete challenge requires your vehicle to navigate through 10 goal nodes. They will be selected randomly and given to you in the form of 11 integers---the first of which is the random start node selected for your robot. For example, for a robot that starts at node #2, a complete route could be 2-6-3-1-10-7-6-4-9-1-3.
The roadway definition is a graph structure where goal nodes are connected by edges that define a sequence of path controllers that get you through the immediate intersection and then use visual lane following to get to the next intersection. For example, this structure is illustrated as a graph and as a table below---use this model of the roadway to represent Duckietown.
Your robot must plan a path through the goal nodes between every consecutive pair of nodes in your route. For example, a (sub)route 2-6 expands into a path 2-8-6.
Each team's vehicle starts with 40 points (a perfect score). Your robot will be scored as it procedes through ten goals worth of exposure to penalties (below).
Penalties for the Duckietown Challenge: