Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 68
Página 39
7 : A Depth - First Search Tree Algorithm : Depth - First Search 1 . If the initial
state is a goal state , quit and return success . 2 . Otherwise , do the following until
success or failure is signaled : ( a ) Generate a successor , E , of the initial state .
7 : A Depth - First Search Tree Algorithm : Depth - First Search 1 . If the initial
state is a goal state , quit and return success . 2 . Otherwise , do the following until
success or failure is signaled : ( a ) Generate a successor , E , of the initial state .
Página 128
We return to it in Chapter 7 . But now let ' s return briefly to the problem of
representing a changing problem state . We could do it by simply starting with a
description of the initial state and then making changes to that description as
indicated ...
We return to it in Chapter 7 . But now let ' s return briefly to the problem of
representing a changing problem state . We could do it by simply starting with a
description of the initial state and then making changes to that description as
indicated ...
Página 338
Detecting a Solution A planning system has succeeded in finding a solution to a
problem when it has found a sequence of operators that transforms the initial
problem state into the goal state . How will it know when this has been done ?
Detecting a Solution A planning system has succeeded in finding a solution to a
problem when it has found a sequence of operators that transforms the initial
problem state into the goal state . How will it know when this has been done ?
Comentarios de la gente - Escribir un comentario
No encontramos ningún comentario en los lugares habituales.
Contenido
What Is Artificial Intelligence? | 3 |
Problems Problem Spaces and Search | 29 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 21 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
active addition agents algorithm allow answer apply approach assertions becomes belief build called Chapter clauses combined complete concept consider consistent constraints contains corresponding define dependency described discussed domain elements example fact Figure function given goal heuristic important initial input instance interpretation John kinds knowledge knowledge base labeled language learning logic look match meaning methods move natural necessary node object occur operators output particular path perform position possible predicate present problem procedure produce properties question reasoning relation represent representation result robot rules semantic sentence shown in Figure shows simple single situation slot solution solve space specific statements step stored structure Suppose task techniques things tree true understanding units usually variables weights