dalek example over

doc/report/dalek.tex

@@ -23,7 +23,7 @@ Again, just like in our previous example, we shall consider agent and variable t
 In our example, the cost function will be defined as a maximisation of the surveillance space covered.
 In this case, Daleks who are the only ones capable of covering an area should be highly rewarded for doing so, and areas which can be covered by two Daleks who can also cover another area should ultimately be surveiled only by one of them.
 
-Considering the position of the 5 Daleks, we can model the prolem as the following constraints graph:
+Considering the position of the 5 Daleks, we can model the prolem as the following constraints graph (see \ref{fig:dalek}):
 
 \begin{figure}
     \centering
@@ -46,7 +46,7 @@ Considering the position of the 5 Daleks, we can model the prolem as the followi
     \label{fig:dalek}
     \end{figure}
 
-    With utility functions modeled as follows, translating the necessity to cover a maximal number of zones.
+    With utility functions modeled as given in \ref{tab:dalek-utilities}, translating the necessity to cover a maximal number of zones.
 
     \begin{table}[ht]
 
@@ -227,11 +227,6 @@ Considering the position of the 5 Daleks, we can model the prolem as the followi
 
         \end{tabular}
 
-        
-        
-
-        
-
         \caption{Binary utility functions according to surveillance directions}
         \label{tab:dalek-utilities}
     \end{table}
@@ -420,6 +415,9 @@ Considering the position of the 5 Daleks, we can model the prolem as the followi
 
 \subsection{Modelling of the problem with SCADCOP API}
 
+This problem can be modelled as follows with the scadcop library.
+
+
 \begin{lstlisting}
 object DalekSurveillanceSystem extends App {
   val n = NominalValue("North")