mirror of
https://github.com/NotXia/unibo-ai-notes.git
synced 2025-12-14 18:51:52 +01:00
Update _planning.tex
Sono pignolo <3
This commit is contained in:
@ -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)}$.
|
||||
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.
|
||||
The same process can be repeated for $\texttt{BUY(X, milk)}$ and $\texttt{BUY(X, banana)}$:
|
||||
\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 Otherwise, run a complete A$^*$ search.
|
||||
\end{enumerate}
|
||||
\end{description}
|
||||
\end{description}
|
||||
|
||||
Reference in New Issue
Block a user