Artificial Intelligence |
Dentro del libro
Resultados 1-3 de 82
Página 178
2 : A Sample of the Rules for Solving the 8 - Puzzle Reason backward from the
goal states . Begin building a tree of move sequences that might be solutions by
starting with the goal configuration ( s ) at the root of the tree . Generate the next ...
2 : A Sample of the Rules for Solving the 8 - Puzzle Reason backward from the
goal states . Begin building a tree of move sequences that might be solutions by
starting with the goal configuration ( s ) at the root of the tree . Generate the next ...
Página 342
This time , when we compare the top element of the goal stack , ON ( B , A ) , to
the world model , we see that it is satisfied . So we pop it off and consider the next
goal , CLEAR ( B ) . It , too , is already true in the world model , although it was ...
This time , when we compare the top element of the goal stack , ON ( B , A ) , to
the world model , we see that it is satisfied . So we pop it off and consider the next
goal , CLEAR ( B ) . It , too , is already true in the world model , although it was ...
Página 347
It would be better if there were a plan - finding procedure that could construct
efficient plans directly . In the next section , we present a technique for doing this .
13 . 5 Nonlinear Planning Using Constraint Posting The goal - stack planning ...
It would be better if there were a plan - finding procedure that could construct
efficient plans directly . In the next section , we present a technique for doing this .
13 . 5 Nonlinear Planning Using Constraint Posting The goal - stack planning ...
Comentarios de la gente - Escribir un comentario
Crítica de los usuarios - Marcar como inadecuado
very good
Contenido
Problems Problem Spaces and Search | 29 |
7 | 61 |
Knowledge Representation Issues | 105 |
Derechos de autor | |
Otras 11 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 choose 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