Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 42
Página 68
... block and put it on the table ; pick up one block and put it on another one ) that were used in Section 2.3.1 . Suppose we use the following heuristic function : Local : Add one point for every block that is resting on the thing it is ...
... block and put it on the table ; pick up one block and put it on another one ) that were used in Section 2.3.1 . Suppose we use the following heuristic function : Local : Add one point for every block that is resting on the thing it is ...
Página 69
... block in the support structure . For each block that has an incorrect support structure , subtract one point for every block in the existing support structure . Using this function , the goal state has the score 28 ( 1 for B , 2 for C ...
... block in the support structure . For each block that has an incorrect support structure , subtract one point for every block in the existing support structure . Using this function , the goal state has the score 28 ( 1 for B , 2 for C ...
Página 332
... blocks . The actions it can perform include : • UNSTACK ( A , B ) -Pick up block A from its current position on block B. The arm must be empty and block A must have no blocks on top of it . • STACK ( A , B ) -Place block A on block B ...
... blocks . The actions it can perform include : • UNSTACK ( A , B ) -Pick up block A from its current position on block B. The arm must be empty and block A must have no blocks on top of it . • STACK ( A , B ) -Place block A on block B ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's