Environment: a 1 m x 1 m field.

Five agents (A,B,C,D,E) can move up and down and left and right, one centimeter in every step.

Assume the agents have unlimited power supply.

For each agent, there are five targets to collect. For example for agent A the targets are TA1 to TA5.

Whenever a relevant target (for example TA3) is reachable by its related agent, the object is considered as collected and will disappear from the field.

All targets and agents are randomly scattered all over the field. Agents do not have any information about the location of none of the targets and other agents.

Agents have location sensor (x,y) to locate itself.

Agents have been given (x1,y1) and (x2,y2) so they can identify the border of the domain.

Agents never run out of fuel.

Every agent has a Radar to sense targets or other agents. The Radar can sense the type (which agent belongs to) and locate every target or agent in 10 centimeter radius. Whenever an agent locates a target (or an agent), it will receive the coordinates (x,y) of the target (or agent).

A target (or agent) is reachable by an agent if it falls into its Radar range (10cm).

Every agent has two communication channels: First is a public channel for broadcasting. In broadcast mode, the message sent by an agent will be received by all other agents. Second, a private channel to send private messages to a specific agent.

In both channels, agents can send any type of message but a mandatory message will be sent in broadcast mode by an agent that collected its all targets.

Agents avoid colliding each other. They will never remain reachable by other agents.

The game will be over as soon as one of the agents collects all its targets.

Only public communication channel is open for all agents. The private channels are closed. Agents can broadcast anything including right or wrong information about the location of other targets.

The game is not over until all agents collect their own targets.

Both public and private channels are open. Example of a private communication: Agent Allocates TB1. It may or may not notify the agent B the location of TB1.

The game will be over as soon as one of the agents collects all its targets.

Both public and private channels are open. Example of a private communication: Agent Allocates target TB1. It may or may not notify the agent B the location of TB1.

Your simulation generates a CSV file with the following columns. The name of this CSV is: G[your group number]_1.csv

 a. Scenario number (1,2 or 3)
 b. Iteration number
 c. Agent number
 d. Number of collected targets by the agent
 e. Number of steps taken by the agent at the end of iteration
 f. Agent happiness: d/(e+1)
 g. Maximum happiness in each iteration
 h. Minimum happiness in each iteration
 i. Average happiness in each iteration
 j. Standard deviation of happiness in each iteration
 k. Agent competitiveness: (f-h)/(g-h)

Your simulation generates another csv file from the previous CSV with the following columns. The name of this CSV is: G[your group number]_2.csv

 a. Scenario number (1,2 and 3)
 b. Average of column “i” for the iterations of same scenario
 c. Average of column “k” for the iterations of same scenario

A simple graphical interface is necessary for the simulation.

We expect your simulation is capable of many iterations (10 to 100 times) with random setup.

Deliverables: Two above mentioned CSV file in right format> since a script will read and process the files, any other format will not be accepted and marks will be deducted. You has to send the files before your demo via blackboard messaging.

You will present your simulation according to s schedule will be posted later.