Section 4: NetLogo

Key Learning Points

• Use NetLogo, a multiagent programmable modelling environment.

Activities

1. Download and install NetLogo, and read the user manual.
2. Do the following exercises:
   1. Implement a NetLogo program where the patches are randomly set to one of three colours: black, red, and green. There is a turtle in this world that can only move north, south, east, and west one patch at a time. Each time it lands in a patch in receives a reward determined by the colour of the patch: black is 0, red is −1, and green is 1. The turtle’s movement is noisy, so when it decides to move north it ends up at the desired north tile with probability .5, and the tile northeast of its current location (a diagonally adjacent tile) with probability .25, and at the tile northwest of its current location with a probability of .25. Implement the VALUE-ITERA algorithm for this domain and find the optimal policy. You may want to refer to the videos: Overview of Value Iteration Implementation in NetLogo and Value Iteration Implementation in NetLogo (Dynamic Programming)