# Introduction to Artificial Intelligence

## Environment simulator and agents for the EU refugee problem

In this first exercise you are asked to implement an environment simulator that runs a variant of the Canadian traveller problem (CTP). Then, you will implement some agents that live in the environment and evaluate their performance.

In the Canadian traveller problem, we are given a weighted graph, and the goal is to travel as cheaply as possible from a given start vertex to a given goal vertex. However, unlike standard shortest path problems in graphs, which have easy known solutions (e.g. the Dijkstra algorithm), here the problem is that some of the edges (an edge being an abstraction of a road in the real world) may be blocked by snow or ice, this being the Canadian traveller problem.

In the open research problem version of CTP, the agent can only tell which edges are blocked when visiting an incedent vertex. This leads to a problem of shortest path under uncertainty, with which we are not ready to deal yet. Instead, we will introduce a variant, relevant to recent world events, called the EU refugee problem. This problem has certain knowledge, but also add ways block and unblock paths, making this an interesting search problem. In this problem there are two types of agents: refugees (AKA illegal migrants, depends on whose side you are on), and Hungarian border police. Refugees begin at some graph node, and need to reach a goal - a node presumably representing Germany, or Sweden. Hungarian border police attempt to stop illegal migrants from entering the EU. A refugee can travel an edge if the arrival vertex is not blocked by police, and if carrying a sufficient amount of food. The food is consumed along the way. An aid package, originaly residing at a node, contains food that can be picked up. Your program should first act as an environment simulator. Then, then take up the task of a refugee's planning a path (and later on a policy) to the goal.

### EU refugee problem environment

The environment consists of a weighted unidrected graph. Each node can contain aid packages, and be visited by either refugees or Hungarian police. Some vertices are considered "the border" to be blocked by the police. The environment can contain one or more agents of each type, each with known starting location, and a required goal location (refugees only). For each agent, there are state variables designating its current location, and for refugees also the amount of food being carried.

An agent (refugee or police) can apply 2 types of action: traverse (like move in the standard CTP), and no-op. The no-op action does nothing, except consuming 1 unit of food if the agent is a refugee (refugee dies if its turn arrives and if carrying no food and no aid package at node). The results of a traverse (from a current vertex V to a specific adjacent vertex U) action is as follows. A traverse operation by police always succeeds. A traverse operation by a refugee is successful if there are no police at U and a sufficient amount of food is carried: at least equal to the weight of the edge. The amount of food being carried is reduced by the weight of the edge. Any aid packages at U are automatically picked up. However, if the traversal is unsuccessful the refugee dies.

The cost of actions is as follows: no-op has a cost 1 traverse has a cost equal to the edge weight, multiplied by (the amount of food carried when starting the action plus 1). Actions resulting in death have infinite cost.

The simulator should keep track of score, i.e. the number of actions done by each agent, and the total cost encurred by the agent for traversing edges, etc.

### Implementation part I: simulator + simple agents

Initially you will implement the environment simulator, and several simple (non-AI) agents. The environment simulator should start up by reading the graph from a file, in a format of your choice. We suggest using a simple adjancency list in an ASCII file, that initially specifies the number of vertices. For example (comments beginning with a semicolon):

```#V 4    ; number of vertices n in graph (from 1 to n)

#E 1 2 W1  ; Edge from vertex 1 to vertex 2, weight 1
#E 3 4 W1  ; Edge from vertex 3 to vertex 4, weight 1
#E 2 3 W1  ; Edge from vertex 2 to vertex 3, weight 1
#E 1 3 W4  ; Edge from vertex 1 to vertex 3, weight 4
#E 2 4 W5  ; Edge from vertex 2 to vertex 4, weight 5
#F 1 A6    ; Vertex 1 initially contains 6 units of food
#B 2       ; Vertex 2 is a border vertex
```

The simulator should query the user about the number of agents and what agent program to use for each of them, from a list defined below. Initialization parameters for each agent (initial and goal position) are also to be queried from the user.

After the above initialization, the simulator should run each agent in turn, performing the actions retured by the agents, and update the world accordingly. Additionally, the simulator should be capable of displaying the state of the world after each step, with the appropriate state of the agents and their score. A simple screen display in ASCII is sufficient (no bonuses for fancy graphics - this is not the point in this course!).

Each agent program (a function) works as follows. The agent is called by the simulator, together with a set of observations. The agent returns a move to be carried out in the current world state. The agent is allowed to keep an internal state (for example, a computed optimal path, or anything else desired) if needed. In this assignment, the agents can observe the entire state of the world.

You should implement the following agents:

1. A human agent, i.e. read the next move from the user, and return it to the simulator.
2. A greedy refugee agent, that works as follows: the agent should compute the shortest currently unblocked path to its goal, and try to follow it. If there is no such path, do no-op.
3. A greedy Hungarian police agent, that works as follows: the agent should compute the shortest path (counting each edge as 1, ignoring the weights) to the border location closest to a refugee that does not already have police presence, and traverse the first edge on that path. Prefer the lowest-numbered node in case of ties. If there is no such path, or reaching such a node requires moving police from a closer border vertex, do no-op.

At this stage, you should run the environment with three agents participating in each run: one Hungarian police agent, one refugee, and one other agents that can be chosen by the user. Your program should display and record the scores. In particular, you should run the greedy agent with various initial configurations. Also, test your environment with several agents in the same run, to see that it works correctly. You would be advised to do a good job here w.r.t. program extensibility, modularity, etc. much of this code may be used for some of the following assignments as well.

### Implementation part II: search agents

Now, after chapter 4, you will be implementing intelligent refugee agents (this is part 2 of the assignment) that need to act in this environment. Each agent should assume that it is acting alone, regardless of whether it is true. You will be implementing a "search" agent as defined below. All the algorithms will use a heuristic evaluation function of your choice.

1. A greedy search agent, that picks the move with best immediate heuristic value.
2. An agent using A* search, with the same heuristic.
3. An agent using a simplified version of real-time A*.

The performance measure will be composed of two parts: S, the agent's score, and T, the number of search expansion steps performed by the search algorithm. The performance of an agent will be:

```   P = f * S + T
```

Clearly, a better agent will have P as small as possible. The parameter f is a weight constant. You should compare the performance of the three agents (each acting alone) for the following values of f: 1, 100, 10000. Note that the higher the f parameter, the more important it is to expend computational resources in order to get a better score!

Bonus version: construct a refugee search agent as above, but in addition allow two (greedy) Hungarian police agents also acting in the environment. Your search agent needs to take this into account. Observe that although this seems to be a multi-agent problem, the fact that Hungarian police agents are perfectly predictable makes this in essence a single agent search problem.

Addtional bonus - theoretical (new): What is the computational complexity of the EU Refugee Problem (single agent)? This is a minor seemingly open problem. Can you prove that it is NP-hard? Or is it in P? If the latter, can you design an algorithm that solves the problem in polynomial time?

## Deliverables

The program and code sent to the grader, by e-mail or otherwise as specified by the grader, a printout of the code and results. A document stating the heuristic function you used and the rationale for selecting this function. Set up a time for frontal grading checking of the delivered assignment, in which both members of each team must demonstrate at least some familiarity with their program...

Due date for part 1 (recommended, not enforced): Thursday, November 5.

For the complete assignment: Thursday, November 19.