notxia/unibo-ai-notes
1
0
Fork 0
mirror of https://github.com/NotXia/unibo-ai-notes.git synced 2025-12-15 19:12:22 +01:00
Code Issues Packages Projects Releases Wiki Activity

Fix typos <noupdate>

Browse Source
This commit is contained in:
Tian Cheng (Riccardo) Xia
2023-12-06 09:14:25 +01:00
parent 635a4fc1a5
commit 4fb97c58d2
3 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/fundamentals-of-ai-and-kr/module1/sections/_local_search.tex
View File

@ -91,7 +91,7 @@ Can be seen as a search process over graphs:
\end{subfigure} \end{subfigure}
\end{figure} \end{figure}
Meta heuristics finds a balance between: Meta heuristics aim to find a balance between:
\begin{descriptionlist} \begin{descriptionlist}
\item[Intensification] \marginnote{Intensification} \item[Intensification] \marginnote{Intensification}
Look for moves near the neighborhood. Look for moves near the neighborhood.

2
src/fundamentals-of-ai-and-kr/module1/sections/_search.tex
View File

@ -335,7 +335,7 @@ The fringe is ordered according the estimated scores.
\end{tabular} \end{tabular}
\end{center} \end{center}
In generally, it is better to use heuristics with large values (i.e. heuristics that don't underestimate too much). In general, it is better to use heuristics with large values (i.e. heuristics that don't underestimate too much).
\begin{figure}[ht] \begin{figure}[ht]
\centering \centering

6
src/fundamentals-of-ai-and-kr/module1/sections/_swarm_intelligence.tex
View File

@ -74,8 +74,8 @@ They also tend to prefer paths marked with the highest pheromone concentration.
\item[Pheromone update] \item[Pheromone update]
After each step, the pheromone trail is updated depending on an evaporation factor $\rho \in [0, 1]$: After each step, the pheromone trail is updated depending on an evaporation factor $\rho \in [0, 1]$:
\[ \tau_{ij} = (1 - \rho) \tau_{ij} + \sum_{k=1}^{n_\text{ants}} \Delta \tau_{ij}^{(k)} \] \[ \tau_{ij} = (1 - \rho) \tau_{ij} + \sum_{k=1}^{n_\text{ants}} \Delta \tau_{ij}^{(k)} \]
$\tau_{ij}^{(k)}$ of the $k$-th ant is defined as: $\Delta \tau_{ij}^{(k)}$ of the $k$-th ant is defined as:
\[ \tau_{ij}^{(k)} = \begin{cases} \[ \Delta \tau_{ij}^{(k)} = \begin{cases}
\frac{1}{L_k} & \text{if ant } k \text{ used the arch } (i, j) \\ \frac{1}{L_k} & \text{if ant } k \text{ used the arch } (i, j) \\
0 & \text{otherwise} 0 & \text{otherwise}
\end{cases} \] \end{cases} \]
@ -172,7 +172,7 @@ In a bird flock, the movement of the individuals tend to:
\item Stay in the flock. \item Stay in the flock.
\item Avoid collisions. \item Avoid collisions.
\end{itemize} \end{itemize}
However, a model based on the these rules does not have a common objective. However, a model based on these rules does not have a common objective.
PSO introduces as common objective the search of food. PSO introduces as common objective the search of food.
Each individual that finds food can: Each individual that finds food can: