Loading

IIT-M RL-ASSIGNMENT-2-TAXI

Solution for submission 129605

A detailed solution for submission 129605 submitted for challenge IIT-M RL-ASSIGNMENT-2-TAXI

arnav_anil_mhaske_cs17b110

What is the notebook about?

Problem - Taxi Environment Algorithms

This problem deals with a taxi environment and stochastic actions. The tasks you have to do are:

  • Implement Policy Iteration
  • Implement Modified Policy Iteration
  • Implement Value Iteration
  • Implement Gauss Seidel Value Iteration
  • Visualize the results
  • Explain the results

How to use this notebook? 📝

  • This is a shared template and any edits you make here will not be saved.You should make a copy in your own drive. Click the "File" menu (top-left), then "Save a Copy in Drive". You will be working in your copy however you like.

  • Update the config parameters. You can define the common variables here

Variable Description
AICROWD_DATASET_PATH Path to the file containing test data. This should be an absolute path.
AICROWD_RESULTS_DIR Path to write the output to.
AICROWD_ASSETS_DIR In case your notebook needs additional files (like model weights, etc.,), you can add them to a directory and specify the path to the directory here (please specify relative path). The contents of this directory will be sent to AIcrowd for evaluation.
AICROWD_API_KEY In order to submit your code to AIcrowd, you need to provide your account's API key. This key is available at https://www.aicrowd.com/participants/me

Setup AIcrowd Utilities 🛠

We use this to bundle the files for submission and create a submission on AIcrowd. Do not edit this block.

In [25]:
!pip install aicrowd-cli > /dev/null

AIcrowd Runtime Configuration 🧷

Get login API key from https://www.aicrowd.com/participants/me

In [61]:
import os

AICROWD_DATASET_PATH = os.getenv("DATASET_PATH", os.getcwd()+"/13d77bb0-b325-4e95-a03b-833eb6694acd_a2_taxi_inputs.zip")
AICROWD_RESULTS_DIR = os.getenv("OUTPUTS_DIR", "results")
In [62]:

API Key valid
Saved API Key successfully!
13d77bb0-b325-4e95-a03b-833eb6694acd_a2_taxi_inputs.zip: 100% 31.2k/31.2k [00:00<00:00, 326kB/s]
In [66]:
!unzip $AICROWD_DATASET_PATH
Archive:  /content/13d77bb0-b325-4e95-a03b-833eb6694acd_a2_taxi_inputs.zip
replace inputs/inputs_base.npy? [y]es, [n]o, [A]ll, [N]one, [r]ename: A
  inflating: inputs/inputs_base.npy  
  inflating: inputs/inputs_1.npy     
  inflating: inputs/inputs_0.npy     
  inflating: inputs/inputs_2.npy     
  inflating: targets/targets_2.npy   
  inflating: targets/targets_0.npy   
  inflating: targets/targets_1.npy   
  inflating: targets/targets_base.npy  
In [69]:
DATASET_DIR = 'inputs/'

Taxi Environment

Read the environment to understand the functions, but do not edit anything

In [70]:
import numpy as np

class TaxiEnv_HW2:
    def __init__(self, states, actions, probabilities, rewards, initial_policy):
        self.possible_states = states
        self._possible_actions = {st: ac for st, ac in zip(states, actions)}
        self._ride_probabilities = {st: pr for st, pr in zip(states, probabilities)}
        self._ride_rewards = {st: rw for st, rw in zip(states, rewards)}
        self.initial_policy = initial_policy
        self._verify()

    def _check_state(self, state):
        assert state in self.possible_states, "State %s is not a valid state" % state

    def _verify(self):
        """ 
        Verify that data conditions are met:
        Number of actions matches shape of next state and actions
        Every probability distribution adds up to 1 
        """
        ns = len(self.possible_states)
        for state in self.possible_states:
            ac = self._possible_actions[state]
            na = len(ac)

            rp = self._ride_probabilities[state]
            assert np.all(rp.shape == (na, ns)), "Probabilities shape mismatch"
        
            rr = self._ride_rewards[state]
            assert np.all(rr.shape == (na, ns)), "Rewards shape mismatch"

            assert np.allclose(rp.sum(axis=1), 1), "Probabilities don't add up to 1"

    def possible_actions(self, state):
        """ Return all possible actions from a given state """
        self._check_state(state)
        return self._possible_actions[state]

    def ride_probabilities(self, state, action):
        """ 
        Returns all possible ride probabilities from a state for a given action
        For every action a list with the returned with values in the same order as self.possible_states
        """
        actions = self.possible_actions(state)
        ac_idx = actions.index(action)
        return self._ride_probabilities[state][ac_idx]

    def ride_rewards(self, state, action):
        actions = self.possible_actions(state)
        ac_idx = actions.index(action)
        return self._ride_rewards[state][ac_idx]
  File "<ipython-input-70-fc88f85c3b0f>", line 1
    Aimport numpy as np
                ^
SyntaxError: invalid syntax

Example of Environment usage

In [71]:
def check_taxienv():
    # These are the values as used in the pdf, but they may be changed during submission, so do not hardcode anything

    states = ['A', 'B', 'C']

    actions = [['1','2','3'], ['1','2'], ['1','2','3']]

    probs = [np.array([[1/2,  1/4,  1/4],
                    [1/16, 3/4,  3/16],
                    [1/4,  1/8,  5/8]]),

            np.array([[1/2,   0,     1/2],
                    [1/16,  7/8,  1/16]]),

            np.array([[1/4,  1/4,  1/2],
                    [1/8,  3/4,  1/8],
                    [3/4,  1/16, 3/16]]),]

    rewards = [np.array([[10,  4,  8],
                        [ 8,  2,  4],
                        [ 4,  6,  4]]),

            np.array([[14,  0, 18],
                        [ 8, 16,  8]]),

            np.array([[10,  2,  8],
                        [6,   4,  2],
                        [4,   0,  8]]),]
    initial_policy = {'A': '1', 'B': '1', 'C': '1'}

    env = TaxiEnv_HW2(states, actions, probs, rewards, initial_policy)
    print("All possible states", env.possible_states)
    print("All possible actions from state B", env.possible_actions('B'))
    print("Ride probabilities from state A with action 2", env.ride_probabilities('A', '2'))
    print("Ride rewards from state C with action 3", env.ride_rewards('C', '3'))

    base_kwargs = {"states": states, "actions": actions, 
                "probabilities": probs, "rewards": rewards,
                "initial_policy": initial_policy}
    return base_kwargs

base_kwargs = check_taxienv()
env = TaxiEnv_HW2(**base_kwargs)
All possible states ['A', 'B', 'C']
All possible actions from state B ['1', '2']
Ride probabilities from state A with action 2 [0.0625 0.75   0.1875]
Ride rewards from state C with action 3 [4 0 8]

Task 1 - Policy Iteration

Run policy iteration on the environment and generate the policy and expected reward

In [72]:
# 1.1 Policy Iteration
def policy_iteration(taxienv, gamma):
    # A list of all the states
    states = taxienv.possible_states
    # Initial values
    values = {s: 0 for s in states}

    # This is a dictionary of states to policies -> e.g {'A': '1', 'B': '2', 'C': '1'}
    policy = taxienv.initial_policy.copy()

    ## Begin code here

    # Hints - 
    # Do not hardcode anything
    # Only the final result is required for the results
    # Put any extra data in "extra_info" dictonary for any plots etc
    # Use the helper functions taxienv.ride_rewards, taxienv.ride_probabilities,  taxienv.possible_actions
    # For terminating condition use the condition exactly mentioned in the pdf

    policyloop=1
    all=[]
    while policyloop:
      loop=1
      while loop:
        nv={}
        np={}
        maxdif=0
        for i in states:
          
          best_earning=0
          best_policy=0
          
          a = policy[i]
          earning = 0
          for j in range(len(states)):
            earning += taxienv.ride_probabilities(i,a)[j]*(taxienv.ride_rewards(i,a)[j] + gamma*values[states[j]])

          maxdif = max(maxdif,abs(values[i]-earning))
          nv[i] = earning
        
        if maxdif<1e-8:
          loop=0

        for i in states:
          values[i]=nv[i]
      all.append(values.copy())
      oldpolicy=policy.copy()

      for i in states:
        best_earning=0
        best_policy=0
        for a in taxienv.possible_actions(i):
          
          earning = 0
          for j in range(len(states)):
            earning += taxienv.ride_probabilities(i,a)[j]*(taxienv.ride_rewards(i,a)[j] + gamma*values[states[j]])
          
          if earning>best_earning:
            best_earning=earning
            best_policy = a

        maxdif = max(maxdif,abs(values[i]-best_earning))
        policy[i] = best_policy

      policyloop=0
      for i in policy:
        if policy[i]!=oldpolicy[i]:
          policyloop=1
    
    # Put your extra information needed for plots etc in this dictionary
    extra_info = {"all":all}

    ## Do not edit below this line

    # Final results
    return {"Expected Reward": values, "Policy": policy}, extra_info

Task 2 - Policy Iteration for multiple values of gamma

Ideally this code should run as is

In [73]:
# 1.2 Policy Iteration with different values of gamma
def run_policy_iteration(env):
    gamma_values = np.arange(5, 100, 5)/100
    results, extra_info = {}, {}
    for gamma in gamma_values:
        results[gamma], extra_info[gamma] = policy_iteration(env, gamma)
    return results, extra_info

results, extra_info = run_policy_iteration(env)

Task 3 - Modifed Policy Iteration

Implement modified policy iteration (where Value iteration is done for fixed m number of steps)

In [74]:
# 1.3 Modified Policy Iteration
def modified_policy_iteration(taxienv, gamma, m):
    # A list of all the states
    states = taxienv.possible_states
    # Initial values
    values = {s: 0 for s in states}

    # This is a dictionary of states to policies -> e.g {'A': '1', 'B': '2', 'C': '1'}
    policy = taxienv.initial_policy.copy()

    ## Begin code here
    all=[]
    policyloop=1
    while policyloop:
      loop=1
      for k in range(m):
        nv={}
        np={}
        maxdif=0
        for i in states:
          
          best_earning=0
          best_policy=0
          
          a = policy[i]
          earning = 0
          for j in range(len(states)):
            earning += taxienv.ride_probabilities(i,a)[j]*(taxienv.ride_rewards(i,a)[j] + gamma*values[states[j]])

          maxdif = max(maxdif,abs(values[i]-earning))
          nv[i] = earning

        for i in states:
          values[i]=nv[i]
      all.append(values.copy())
      oldpolicy=policy.copy()

      for i in states:
        best_earning=0
        best_policy=0
        for a in taxienv.possible_actions(i):
          
          earning = 0
          for j in range(len(states)):
            earning += taxienv.ride_probabilities(i,a)[j]*(taxienv.ride_rewards(i,a)[j] + gamma*values[states[j]])
          
          if earning>best_earning:
            best_earning=earning
            best_policy = a

        maxdif = max(maxdif,abs(values[i]-best_earning))
        policy[i] = best_policy

      policyloop=0
      for i in policy:
        if policy[i]!=oldpolicy[i]:
          policyloop=1

    # Hints - 
    # Do not hardcode anything
    # Only the final result is required for the results
    # Put any extra data in "extra_info" dictonary for any plots etc
    # Use the helper functions taxienv.ride_rewards, taxienv.ride_probabilities,  taxienv.possible_actions
    # For terminating condition use the condition exactly mentioned in the pdf

    
    # Put your extra information needed for plots etc in this dictionary
    extra_info = {"all":all}

    ## Do not edit below this line


    # Final results
    return {"Expected Reward": values, "Policy": policy}, extra_info

Task 4 Modified policy iteration for multiple values of m

Ideally this code should run as is

In [75]:
def run_modified_policy_iteration(env):
    m_values = np.arange(1, 15)
    gamma = 0.9
    results, extra_info = {}, {}
    for m in m_values:
        results[m], extra_info[m] = modified_policy_iteration(env, gamma, m)
    return results, extra_info

results, extra_info = run_modified_policy_iteration(env)

Task 5 Value Iteration

Implement value iteration and find the policy and expected rewards

In [76]:
# 1.4 Value Iteration
def value_iteration(taxienv, gamma):
    # A list of all the states
    states = taxienv.possible_states
    # Initial values
    values = {s: 0 for s in states}

    # This is a dictionary of states to policies -> e.g {'A': '1', 'B': '2', 'C': '1'}
    policy = taxienv.initial_policy.copy()

    ## Begin code here

    # Hints - 
    # Do not hardcode anything
    # Only the final result is required for the results
    # Put any extra data in "extra_info" dictonary for any plots etc
    # Use the helper functions taxienv.ride_rewards, taxienv.ride_probabilities,  taxienv.possible_actions
    # For terminating condition use the condition exactly mentioned in the pdf
    all=[]
    loop=1
    while loop:
      nv={}
      np={}
      maxdif=0
      for i in states:
        
        best_earning=0
        best_policy=0
        for a in taxienv.possible_actions(i):
          
          earning = 0
          for j in range(len(states)):
            earning += taxienv.ride_probabilities(i,a)[j]*(taxienv.ride_rewards(i,a)[j] + gamma*values[states[j]])
          
          if earning>best_earning:
            best_earning=earning
            best_policy = a

        maxdif = max(maxdif,abs(values[i]-best_earning))
        nv[i] = best_earning
        np[i] = best_policy
      
      if maxdif<1e-8:
        loop=0

      for i in states:
        values[i]=nv[i]
        policy[i]=np[i]
      all.append(values.copy())
      



    # Put your extra information needed for plots etc in this dictionary
    extra_info = {"all":all}

    ## Do not edit below this line

    # Final results
    return {"Expected Reward": values, "Policy": policy}, extra_info

Task 6 Value Iteration with multiple values of gamma

Ideally this code should run as is

In [77]:
def run_value_iteration(env):
    gamma_values = np.arange(5, 100, 5)/100
    results = {}
    results, extra_info = {}, {}
    for gamma in gamma_values:
        results[gamma], extra_info[gamma] = value_iteration(env, gamma)
    return results, extra_info
  
results, extra_info = run_value_iteration(env)

Task 7 Gauss Seidel Value Iteration

Implement Gauss Seidel Value Iteration

In [78]:
# 1.4 Gauss Seidel Value Iteration
def gauss_seidel_value_iteration(taxienv, gamma):
    # A list of all the states
    # For Gauss Seidel Value Iteration - iterate through the values in the same order
    states = taxienv.possible_states

    # Initial values
    values = {s: 0 for s in states}

    # This is a dictionary of states to policies -> e.g {'A': '1', 'B': '2', 'C': '1'}
    policy = taxienv.initial_policy.copy()

    # Hints - 
    # Do not hardcode anything
    # For Gauss Seidel Value Iteration - iterate through the values in the same order as taxienv.possible_states
    # Only the final result is required for the results
    # Put any extra data in "extra_info" dictonary for any plots etc
    # Use the helper functions taxienv.ride_rewards, taxienv.ride_probabilities,  taxienv.possible_actions
    # For terminating condition use the condition exactly mentioned in the pdf

    ## Begin code here
    all=[]
    loop=1
    while loop:
      maxdif=0
      for i in states:
        
        best_earning=0
        best_policy=0
        for a in taxienv.possible_actions(i):
          
          earning = 0
          for j in range(len(states)):
            earning += taxienv.ride_probabilities(i,a)[j]*(taxienv.ride_rewards(i,a)[j] + gamma*values[states[j]])
          
          if earning>best_earning:
            best_earning=earning
            best_policy = a

        maxdif = max(maxdif,abs(values[i]-best_earning))
        values[i] = best_earning
        policy[i] = best_policy
      all.append(values.copy())
      
      if maxdif<1e-8:
        loop=0
    
    # Put your extra information needed for plots etc in this dictionary
    extra_info = {"all":all}

    ## Do not edit below this line

    # Final results
    return {"Expected Reward": values, "Policy": policy}, extra_info

Task 8 Gauss Seidel Value Iteration with multiple values of gamma

Ideally this code should run as is

In [79]:
def run_gauss_seidel_value_iteration(env):
    gamma_values = np.arange(5, 100, 5)/100
    results = {}
    results, extra_info = {}, {}
    for gamma in gamma_values:
        results[gamma], extra_info[gamma] = gauss_seidel_value_iteration(env, gamma)
    return results, extra_info

results, extra_info = run_gauss_seidel_value_iteration(env)

Generate Results ✅

In [80]:
# Do not edit this cell
def get_results(kwargs):

    taxienv = TaxiEnv_HW2(**kwargs)

    policy_iteration_results = run_policy_iteration(taxienv)[0]
    modified_policy_iteration_results = run_modified_policy_iteration(taxienv)[0]
    value_iteration_results = run_value_iteration(taxienv)[0]
    gs_vi_results = run_gauss_seidel_value_iteration(taxienv)[0]

    final_results = {}
    final_results["policy_iteration"] = policy_iteration_results
    final_results["modifed_policy_iteration"] = modified_policy_iteration_results
    final_results["value_iteration"] = value_iteration_results
    final_results["gauss_seidel_iteration"] = gs_vi_results

    return final_results
In [81]:
# Do not edit this cell, generate results with it as is
if not os.path.exists(AICROWD_RESULTS_DIR):
    os.mkdir(AICROWD_RESULTS_DIR)

for params_file in os.listdir(DATASET_DIR):
  kwargs = np.load(os.path.join(DATASET_DIR, params_file), allow_pickle=True).item()
  results = get_results(kwargs)
  idx = params_file.split('_')[-1][:-4]
  np.save(os.path.join(AICROWD_RESULTS_DIR, 'results_' + idx), results)

Check your local score

This score is not your final score, and it doesn't use the marks weightages. This is only for your reference of how arrays are matched and with what tolerance.

In [82]:
# Check your score on the given test cases (There are more private test cases not provided)
target_folder = 'targets'
result_folder = AICROWD_RESULTS_DIR

def check_algo_match(results, targets):
    param_matches = []
    for k in results:
        param_results = results[k]
        param_targets = targets[k]
        policy_match = param_results['Policy'] == param_targets['Policy']
        rv = [v for k, v in param_results['Expected Reward'].items()]
        tv = [v for k, v in param_targets['Expected Reward'].items()]
        rewards_match = np.allclose(rv, tv, rtol=3)
        equal = rewards_match and policy_match
        param_matches.append(equal)
    return np.mean(param_matches)

def check_score(target_folder, result_folder):
    match = []
    for out_file in os.listdir(result_folder):
        res_file = os.path.join(result_folder, out_file)
        results = np.load(res_file, allow_pickle=True).item()
        idx = out_file.split('_')[-1][:-4]  # Extract the file number
        target_file = os.path.join(target_folder, f"targets_{idx}.npy")
        targets = np.load(target_file, allow_pickle=True).item()
        algo_match = []
        for k in targets:
            algo_results = results[k]
            algo_targets = targets[k]
            algo_match.append(check_algo_match(algo_results, algo_targets))
        match.append(np.mean(algo_match))
    return np.mean(match)

if os.path.exists(target_folder):
    print("Shared data Score (normalized to 1):", check_score(target_folder, result_folder))
Shared data Score (normalized to 1): 1.0

Visualize results of Policy Iteration with multiple values of gamma

Add code to visualize the results

In [83]:
import matplotlib.pyplot as plt

A=[]
B=[]
C=[]
gammas = [x/100.0 for x in range(10,100,10)]
for i in range(10,100,10):
  res,_ = policy_iteration(env, i/100.0)
  #print(res)
  A.append(res['Expected Reward']['A'])
  B.append(res['Expected Reward']['B'])
  C.append(res['Expected Reward']['C'])
plt.plot(gammas,A)
plt.plot(gammas,B)
plt.plot(gammas,C)
plt.show()

Subjective questions

1.a How are values of $\gamma$ affecting results of policy iteration

As gamma approches 1, the final values the PI conversges on increases.

1.b For modified policy itetaration, do you find any improvement if you choose m=10.

Both take only 3 steps to converge. This is becasue the state space is very small, and the algorithm converges very fast.

In [84]:
_, res1 = modified_policy_iteration(env, .7, 10)
_, res2 = policy_iteration(env, .7)
print(len(res1["all"]),len(res2["all"]))
3 3

1.c Compare and contrast the behavior of Value Iteration and Gauss Seidel Value Iteraton

Add code/markdown as required

In [85]:
_,res1 = value_iteration(env, .7)
_,res2 = gauss_seidel_value_iteration(env, .7)
print(len(res1["all"]),len(res2["all"]))
60 54

As can be seen, the gauss seidel algorithm converges a little faster. This is because the Jis are updated on the fly even in between an iteration allowing it to converge faster.

Submit to AIcrowd 🚀

In [87]:
!DATASET_PATH=$AICROWD_DATASET_PATH aicrowd notebook submit -c iit-m-rl-assignment-2-taxi -a assets
No jupyter lab module found. Using jupyter notebook.
Using notebook: /content/Copy%20of%20IITM_Assignment_2_Taxi_Release.ipynb for submission...
Removing existing files from submission directory...
No jupyter lab module found. Using jupyter notebook.
Scrubbing API keys from the notebook...
Collecting notebook...
No jupyter lab module found. Using jupyter notebook.
Validating the submission...
Executing install.ipynb...
[NbConvertApp] Converting notebook /content/submission/install.ipynb to notebook
[NbConvertApp] Executing notebook with kernel: python3
[NbConvertApp] Writing 1056 bytes to /content/submission/install.nbconvert.ipynb
Executing predict.ipynb...
[NbConvertApp] Converting notebook /content/submission/predict.ipynb to notebook
[NbConvertApp] Executing notebook with kernel: python3
[NbConvertApp] ERROR | unhandled iopub msg: colab_request
[NbConvertApp] ERROR | unhandled iopub msg: colab_request
[NbConvertApp] ERROR | unhandled iopub msg: colab_request
[NbConvertApp] ERROR | unhandled iopub msg: colab_request
[NbConvertApp] ERROR | unhandled iopub msg: colab_request
[NbConvertApp] ERROR | unhandled iopub msg: colab_request
[NbConvertApp] ERROR | Error while converting '/content/submission/predict.ipynb'
Traceback (most recent call last):
  File "/usr/local/lib/python2.7/dist-packages/nbconvert/nbconvertapp.py", line 408, in export_single_notebook
    output, resources = self.exporter.from_filename(notebook_filename, resources=resources)
  File "/usr/local/lib/python2.7/dist-packages/nbconvert/exporters/exporter.py", line 179, in from_filename
    return self.from_file(f, resources=resources, **kw)
  File "/usr/local/lib/python2.7/dist-packages/nbconvert/exporters/exporter.py", line 197, in from_file
    return self.from_notebook_node(nbformat.read(file_stream, as_version=4), resources=resources, **kw)
  File "/usr/local/lib/python2.7/dist-packages/nbconvert/exporters/notebook.py", line 32, in from_notebook_node
    nb_copy, resources = super(NotebookExporter, self).from_notebook_node(nb, resources, **kw)
  File "/usr/local/lib/python2.7/dist-packages/nbconvert/exporters/exporter.py", line 139, in from_notebook_node
    nb_copy, resources = self._preprocess(nb_copy, resources)
  File "/usr/local/lib/python2.7/dist-packages/nbconvert/exporters/exporter.py", line 316, in _preprocess
    nbc, resc = preprocessor(nbc, resc)
  File "/usr/local/lib/python2.7/dist-packages/nbconvert/preprocessors/base.py", line 47, in __call__
    return self.preprocess(nb, resources)
  File "/usr/local/lib/python2.7/dist-packages/nbconvert/preprocessors/execute.py", line 381, in preprocess
    nb, resources = super(ExecutePreprocessor, self).preprocess(nb, resources)
  File "/usr/local/lib/python2.7/dist-packages/nbconvert/preprocessors/base.py", line 69, in preprocess
    nb.cells[index], resources = self.preprocess_cell(cell, resources, index)
  File "/usr/local/lib/python2.7/dist-packages/nbconvert/preprocessors/execute.py", line 424, in preprocess_cell
    raise CellExecutionError.from_cell_and_msg(cell, out)
CellExecutionError: An error occurred while executing the following cell:
------------------
Aimport numpy as np

class TaxiEnv_HW2:
    def __init__(self, states, actions, probabilities, rewards, initial_policy):
        self.possible_states = states
        self._possible_actions = {st: ac for st, ac in zip(states, actions)}
        self._ride_probabilities = {st: pr for st, pr in zip(states, probabilities)}
        self._ride_rewards = {st: rw for st, rw in zip(states, rewards)}
        self.initial_policy = initial_policy
        self._verify()

    def _check_state(self, state):
        assert state in self.possible_states, "State %s is not a valid state" % state

    def _verify(self):
        """ 
        Verify that data conditions are met:
        Number of actions matches shape of next state and actions
        Every probability distribution adds up to 1 
        """
        ns = len(self.possible_states)
        for state in self.possible_states:
            ac = self._possible_actions[state]
            na = len(ac)

            rp = self._ride_probabilities[state]
            assert np.all(rp.shape == (na, ns)), "Probabilities shape mismatch"
        
            rr = self._ride_rewards[state]
            assert np.all(rr.shape == (na, ns)), "Rewards shape mismatch"

            assert np.allclose(rp.sum(axis=1), 1), "Probabilities don't add up to 1"

    def possible_actions(self, state):
        """ Return all possible actions from a given state """
        self._check_state(state)
        return self._possible_actions[state]

    def ride_probabilities(self, state, action):
        """ 
        Returns all possible ride probabilities from a state for a given action
        For every action a list with the returned with values in the same order as self.possible_states
        """
        actions = self.possible_actions(state)
        ac_idx = actions.index(action)
        return self._ride_probabilities[state][ac_idx]

    def ride_rewards(self, state, action):
        actions = self.possible_actions(state)
        ac_idx = actions.index(action)
        return self._ride_rewards[state][ac_idx]
------------------

  File "<ipython-input-5-fc88f85c3b0f>", line 1
    Aimport numpy as np
                ^
SyntaxError: invalid syntax

SyntaxError: invalid syntax (<ipython-input-5-fc88f85c3b0f>, line 1)

โ•ญโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€ Traceback (most recent call last) โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฎ
โ”‚ /usr/local/bin/aicrowd:8 in <module>                                         โ”‚
โ”‚                                                                              โ”‚
โ”‚   5 from aicrowd.cli import cli                                              โ”‚
โ”‚   6 if __name__ == '__main__':                                               โ”‚
โ”‚   7 โ”‚   sys.argv[0] = re.sub(r'(-script\.pyw|\.exe)?$', '', sys.argv[0])     โ”‚
โ”‚ โฑ 8 โ”‚   sys.exit(cli())                                                      โ”‚
โ”‚                                                                              โ”‚
โ”‚ /usr/local/lib/python3.7/dist-packages/click/core.py:829 in __call__         โ”‚
โ”‚                                                                              โ”‚
โ”‚    826 โ”‚                                                                     โ”‚
โ”‚    827 โ”‚   def __call__(self, *args, **kwargs):                              โ”‚
โ”‚    828 โ”‚   โ”‚   """Alias for :meth:`main`."""                                 โ”‚
โ”‚ โฑ  829 โ”‚   โ”‚   return self.main(*args, **kwargs)                             โ”‚
โ”‚    830                                                                       โ”‚
โ”‚    831                                                                       โ”‚
โ”‚    832 class Command(BaseCommand):                                           โ”‚
โ”‚                                                                              โ”‚
โ”‚ /usr/local/lib/python3.7/dist-packages/click/core.py:782 in main             โ”‚
โ”‚                                                                              โ”‚
โ”‚    779 โ”‚   โ”‚   try:                                                          โ”‚
โ”‚    780 โ”‚   โ”‚   โ”‚   try:                                                      โ”‚
โ”‚    781 โ”‚   โ”‚   โ”‚   โ”‚   with self.make_context(prog_name, args, **extra) as c โ”‚
โ”‚ โฑ  782 โ”‚   โ”‚   โ”‚   โ”‚   โ”‚   rv = self.invoke(ctx)                             โ”‚
โ”‚    783 โ”‚   โ”‚   โ”‚   โ”‚   โ”‚   if not standalone_mode:                           โ”‚
โ”‚    784 โ”‚   โ”‚   โ”‚   โ”‚   โ”‚   โ”‚   return rv                                     โ”‚
โ”‚    785 โ”‚   โ”‚   โ”‚   โ”‚   โ”‚   # it's not safe to `ctx.exit(rv)` here!           โ”‚
โ”‚                                                                              โ”‚
โ”‚ /usr/local/lib/python3.7/dist-packages/click/core.py:1259 in invoke          โ”‚
โ”‚                                                                              โ”‚
โ”‚   1256 โ”‚   โ”‚   โ”‚   โ”‚   Command.invoke(self, ctx)                             โ”‚
โ”‚   1257 โ”‚   โ”‚   โ”‚   โ”‚   sub_ctx = cmd.make_context(cmd_name, args, parent=ctx โ”‚
โ”‚   1258 โ”‚   โ”‚   โ”‚   โ”‚   with sub_ctx:                                         โ”‚
โ”‚ โฑ 1259 โ”‚   โ”‚   โ”‚   โ”‚   โ”‚   return _process_result(sub_ctx.command.invoke(sub โ”‚
โ”‚   1260 โ”‚   โ”‚                                                                 โ”‚
โ”‚   1261 โ”‚   โ”‚   # In chain mode we create the contexts step by step, but afte โ”‚
โ”‚   1262 โ”‚   โ”‚   # base command has been invoked.  Because at that point we do โ”‚
โ”‚                                                                              โ”‚
โ”‚ /usr/local/lib/python3.7/dist-packages/click/core.py:1259 in invoke          โ”‚
โ”‚                                                                              โ”‚
โ”‚   1256 โ”‚   โ”‚   โ”‚   โ”‚   Command.invoke(self, ctx)                             โ”‚
โ”‚   1257 โ”‚   โ”‚   โ”‚   โ”‚   sub_ctx = cmd.make_context(cmd_name, args, parent=ctx โ”‚
โ”‚   1258 โ”‚   โ”‚   โ”‚   โ”‚   with sub_ctx:                                         โ”‚
โ”‚ โฑ 1259 โ”‚   โ”‚   โ”‚   โ”‚   โ”‚   return _process_result(sub_ctx.command.invoke(sub โ”‚
โ”‚   1260 โ”‚   โ”‚                                                                 โ”‚
โ”‚   1261 โ”‚   โ”‚   # In chain mode we create the contexts step by step, but afte โ”‚
โ”‚   1262 โ”‚   โ”‚   # base command has been invoked.  Because at that point we do โ”‚
โ”‚                                                                              โ”‚
โ”‚ /usr/local/lib/python3.7/dist-packages/click/core.py:1066 in invoke          โ”‚
โ”‚                                                                              โ”‚
โ”‚   1063 โ”‚   โ”‚   """                                                           โ”‚
โ”‚   1064 โ”‚   โ”‚   _maybe_show_deprecated_notice(self)                           โ”‚
โ”‚   1065 โ”‚   โ”‚   if self.callback is not None:                                 โ”‚
โ”‚ โฑ 1066 โ”‚   โ”‚   โ”‚   return ctx.invoke(self.callback, **ctx.params)            โ”‚
โ”‚   1067                                                                       โ”‚
โ”‚   1068                                                                       โ”‚
โ”‚   1069 class MultiCommand(Command):                                          โ”‚
โ”‚                                                                              โ”‚
โ”‚ /usr/local/lib/python3.7/dist-packages/click/core.py:610 in invoke           โ”‚
โ”‚                                                                              โ”‚
โ”‚    607 โ”‚   โ”‚   args = args[2:]                                               โ”‚
โ”‚    608 โ”‚   โ”‚   with augment_usage_errors(self):                              โ”‚
โ”‚    609 โ”‚   โ”‚   โ”‚   with ctx:                                                 โ”‚
โ”‚ โฑ  610 โ”‚   โ”‚   โ”‚   โ”‚   return callback(*args, **kwargs)                      โ”‚
โ”‚    611 โ”‚                                                                     โ”‚
โ”‚    612 โ”‚   def forward(*args, **kwargs):  # noqa: B902                       โ”‚
โ”‚    613 โ”‚   โ”‚   """Similar to :meth:`invoke` but fills in default keyword     โ”‚
โ”‚                                                                              โ”‚
โ”‚ /usr/local/lib/python3.7/dist-packages/aicrowd/cmd/notebook.py:92 in         โ”‚
โ”‚ submit_subcommand                                                            โ”‚
โ”‚                                                                              โ”‚
โ”‚    89 โ”‚   โ”‚   output,                                                        โ”‚
โ”‚    90 โ”‚   โ”‚   notebook_name,                                                 โ”‚
โ”‚    91 โ”‚   โ”‚   no_verify,                                                     โ”‚
โ”‚ โฑ  92 โ”‚   โ”‚   dry_run,                                                       โ”‚
โ”‚    93 โ”‚   )                                                                  โ”‚
โ”‚                                                                              โ”‚
โ”‚ /usr/local/lib/python3.7/dist-packages/aicrowd/notebook/submit.py:88 in      โ”‚
โ”‚ create_submission                                                            โ”‚
โ”‚                                                                              โ”‚
โ”‚   85 ):                                                                      โ”‚
โ”‚   86 โ”‚   bundle_submission(assets_dir, submission_zip_path, notebook_name)   โ”‚
โ”‚   87 โ”‚   if not no_verify:                                                   โ”‚
โ”‚ โฑ 88 โ”‚   โ”‚   verify_submission()                                             โ”‚
โ”‚   89 โ”‚   if not dry_run:                                                     โ”‚
โ”‚   90 โ”‚   โ”‚   submit_to_aicrowd(                                              โ”‚
โ”‚   91 โ”‚   โ”‚   โ”‚   challenge=challenge,                                        โ”‚
โ”‚                                                                              โ”‚
โ”‚ /usr/local/lib/python3.7/dist-packages/aicrowd/notebook/submit.py:32 in      โ”‚
โ”‚ verify_submission                                                            โ”‚
โ”‚                                                                              โ”‚
โ”‚   29 โ”‚   for notebook in ["install.ipynb", "predict.ipynb"]:                 โ”‚
โ”‚   30 โ”‚   โ”‚   print(f"Executing {notebook}...")                               โ”‚
โ”‚   31 โ”‚   โ”‚   if execute_command(nbconvert_cmd.format(kernel, SUBMISSION_DIR, โ”‚
โ”‚ โฑ 32 โ”‚   โ”‚   โ”‚   raise RuntimeError(f"{notebook} failed to execute")         โ”‚
โ”‚   33                                                                         โ”‚
โ”‚   34                                                                         โ”‚
โ”‚   35 def bundle_submission(                                                  โ”‚
โ•ฐโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฏ
RuntimeError: predict.ipynb failed to execute
In [ ]:

117

Comments

You must login before you can post a comment.

Execute