Commit ea70cacb authored by Jaime Arias's avatar Jaime Arias
Browse files

update readme

parent cb3643ea
......@@ -165,6 +165,18 @@ greater than the time for the thieves to steal the treasure and go away.
#### Scalability Results
We wrote an automatic generator of ADTrees and a notebook that processes the
output of our tool in order to create the figure shown below. The scripts are
detailed in the `script` folder.
The parameters of the generated ADTrees are the _depth_, the _width_
corresponding to the number of deepmost leaves, the number of _children_ for
each AND, and the total number of _nodes_. All nodes have time 1 except the
first leaf that has time _width - 1_. The results show that the number of
agents is not proportional to the width of the tree (red bars - top of
Figure), and the optimal scheduling varies according to the time of nodes
(blue bars - bottom of Figure).
![tricky Assignment](script/scalability.png)
## Authors
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment