# CP1 Experimental Project


📗 In this project, you will plan the routes of 2 drones to pick up passengers on a map.
➩ Picking up each passenger will earn 1 dollar per unit of distance traveled, plus a tip based on the passenger. Your goal is the maximize the total revenue from a maximum of 10 trips.
➩ It takes time proportional to the distance traveled for each drone to move towards a passenger, and to move towards their destination after the passenger is picked up. The speed in which all drones travel is the same, regardless of whether they are moving with or without a passenger.
➩ Your plan should take into consideration of other students' routes: each passenger can only be picked up by the first drone that reaches their location. In case of ties, the passenger will be picked up by the drone with an ID closer to the passenger's.
➩ Your plan for each drone should be in the form of a complete binary tree with a maximum height of 10: each node represents which passenger to go to; its left child represents the next passenger to go to after the current passenger is delivered to their destination; and the right child represents the next passenger to go to if the current passenger is picked up by someone else.

# Data


📗 You initial position is based on your Wisc Net ID (if your Wisc email is xyz123@wisc.edu, please enter xyz123): . Please enter your ID and click this: .
➩ You initial position will be: .

📗 You can choose to be in one of two groups, and the lists of passengers will be different for these two groups. In the lists, there are 200 passengers, and each passenger has the following properties (in this order).
➩ ID (4 digit unique ID),
➩ Icon (text),
➩ Initial location x coordinate,
➩ Initial location y coordinate,
➩ Destination location x coordinate,
➩ Destination location y coordinate,
➩ Amount of tip

Group 1 Data

Group 2 Data


# Submission


📗 Please use the following form to generate a text file and submit it to the Canvas Assignment CP1.

📗 Wisc Net ID (the ??? in ???@wisc.edu):
📗 Group (either 1 or 2):
📗 Player Icon (text from this list):
📗 Player ID (a number between 0 and 9999):
📗 Drone 1 binary tree (level order traversal):
📗 Drone 2 binary tree (level order traversal):

📗 Output file:


# Grading


📗 The better of the two rankings from the trial competition and the final competition will determine your grade (out of 15).
➩ Any valid submission: 5 points.
➩ Outperforming the randomly generated submission: 5 points.
➩ The remaining 10 points are based on the ranking in the class (44 students + 1 random generated submission based on the ID "test").
➩ Top 2 submissions: 10 points.
➩ Next 3 submissions (Top 5): 9 points.
➩ Next 5 submissions (Top 10): 8 points.
➩ Next 5 submissions (Top 15): 7 points.
➩ Next 5 submissions (Top 20): 6 points.
➩ Next 5 submissions (Top 25): 5 points.
➩ Next 5 submissions (Top 30): 4 points.
➩ Next 5 submissions (Top 35): 3 points.
➩ Next 5 submissions (Top 40): 2 points.
➩ Next 5 submissions (Top 45): 1 points.

# Competition


📗 Submissions:

📗 Group:
📗 Run:

📗 Output:






Last Updated: November 25, 2025 at 1:46 AM