Agents on Campus: A NetLogo Example

In the past I have blogged on how one can use Repast Simphony to get agents to move around a network, which also inspired a similar model in  GeoMason (see here for the movie). Keeping with this theme Yang has recently finished a NetLogo model whereby agents use an A-star algorithm to find the shortest path between two locations. The movie below shows the basic model functionality.


For more information and code click here.