Rosa Laura Zavala

Multi-Agent (NetLogo) Models

N Queens [Run it] [Source code]
This is the implementation of the Asynchronous Weak-Commitment Search for the n-queens problem. It also shows the number of messages sent by each agent. It behaves different that the Adopt algorithm in which a few agents end up sending the great majority of the messages. Here, the messages sent are better distributed among the agents.

Tileworld [Run it] [Source code]
For this problem we recreated the Tileworld, as described in pages 37-39 of "Introduction to Multiagent Systems" by Mike Wooldridge. The goal was to solve the tileworld problem.

Target tracking [Run it] [Source code]
This problem was inspired by a DARPA-sponsored project we, along with MAS researchers from other universities, worked on. The problem involves a set of radars laid out in a field and their need to coordinate in order to track some moving targets.

The Mailmen Problem [Run it] [Source code]
We implemented a solution to the famous mailman problem. The mailman problem is an instance of the task allocation problem which is discussed in "Introduction to Multiagent Systems" by Mike Wooldridge, Chapter 7.3.1.

Incentive Compatible Package Delivery [Run it] [Source code]
The basic problem is that we have a number of agents (known as "deliverators"), each one is assigned a number of deliveries. The deliverators try to get some other unsuspecting deliverator to do the next task that they have to deliver for them.