Mode Graph Agent

class or_suite.agents.ambulance.mode_graph.modeAgent(epLen)

Agent that implements a mode heuristic algorithm for the ambulance graph environment

reset()

clears data and call_locs which contain data on what has occurred so far in the environment

update_config()

(UNIMPLEMENTED)

pick_action(state, step)

locations are chosen by finding the k modes of the arrival data so far, where k is the number of ambulances

epLen

(int) number of time steps to run the experiment for

data

(int list list) a list of all the states of the environment observed so far

call_locs

(int list) the node locations of all calls observed so far

__init__(epLen)

Parameters

epLen – (int) number of time steps to run the experiment for

greedy(state, timestep, epsilon=0)

Chooses the k nodes where calls have arrived most frequently in the past, where k is the number of ambulances.

update_obs(obs, action, reward, newObs, timestep, info)

Adds newObs, the most recently observed state, to data adds the most recent call arrival, found in info[‘arrival’] to call_locs.

update_policy(k)

Update internal policy based upon records.

Not used, because a greedy algorithm does not have a policy.