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

Update _planning.tex

Browse Source 
Sono pignolo <3
This commit is contained in:
Luca Domeniconi
2024-12-10 12:19:12 +01:00
committed by GitHub
parent ae191b0d1d
commit 6d2ae1b3a3
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/year1/fundamentals-of-ai-and-kr/module1/sections/_planning.tex
View File

@ -559,7 +559,7 @@ def resolveThreats(plan):
\item Now, we choose as action $\texttt{BUY(X, drill)}$ and as unsolved precondition $\texttt{sells(X, drill)}$. \item Now, we choose as action $\texttt{BUY(X, drill)}$ and as unsolved precondition $\texttt{sells(X, drill)}$.
This can be solved from the action $\texttt{start}$ with effect $\texttt{sells(hws, drill)}$. This can be solved from the action $\texttt{start}$ with effect $\texttt{sells(hws, drill)}$.
We make the substitution $\texttt{X}/\texttt{drill}$ and We make the substitution $\texttt{X}/\texttt{hws}$ and
add $\langle \texttt{start}, \texttt{BUY(hws, drill)}, \texttt{sells(hws, drill)} \rangle$ to the causal links. add $\langle \texttt{start}, \texttt{BUY(hws, drill)}, \texttt{sells(hws, drill)} \rangle$ to the causal links.
The same process can be repeated for $\texttt{BUY(X, milk)}$ and $\texttt{BUY(X, banana)}$: The same process can be repeated for $\texttt{BUY(X, milk)}$ and $\texttt{BUY(X, banana)}$:
\begin{center} \begin{center}
@ -1036,4 +1036,4 @@ Heuristic planner based on Graphplan, hill climbing and A$^*$.
\item If there is a successor $S'$ better than $S$, move into it and return to point 1. \item If there is a successor $S'$ better than $S$, move into it and return to point 1.
\item Otherwise, run a complete A$^*$ search. \item Otherwise, run a complete A$^*$ search.
\end{enumerate} \end{enumerate}
\end{description} \end{description}