Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas A revision of an established text for undergraduate and postgraduate Artificial Intelligence courses, this text incorporates the latest research and methods. |
Dentro del libro
Resultados 1-3 de 80
Página 77
... points to its successors . Each successor in turn points to its successors , and so forth , until each branch terminates with a node that either is still on OPEN or has no successors . So to propagate the new cost downward , do a depth ...
... points to its successors . Each successor in turn points to its successors , and so forth , until each branch terminates with a node that either is still on OPEN or has no successors . So to propagate the new cost downward , do a depth ...
Página 570
... points connecting the initial position of the robot to its desired position . If the robot is so small as to be considered a point , the problem can be solved straightforwardly by constructing a visibility graph . Let S be the set ...
... points connecting the initial position of the robot to its desired position . If the robot is so small as to be considered a point , the problem can be solved straightforwardly by constructing a visibility graph . Let S be the set ...
Página 573
... points in configuration space , as shown in Figure 21.13 . First , we compute the set of points in c - space from which we are guaranteed to reach the goal state in a single compliant motion , assuming a certain degree of uncertainty in ...
... points in configuration space , as shown in Figure 21.13 . First , we compute the set of points in c - space from which we are guaranteed to reach the goal state in a single compliant motion , assuming a certain degree of uncertainty in ...
Contenido
What Is Artificial Intelligence? | 3 |
5 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 25 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott agents algorithm answer apply approach ARMEMPTY assertions attributes axioms backpropagation backtracking backward belief best-first search breadth-first search Caesar called Chapter chess clauses complete concept conceptual dependency consider constraints contains contradiction corresponding define depth-first depth-first search described discussed domain example fact function game tree goal grammar graph heuristic Horn clauses important inference inheritance input instance interpretation isa links John justification knowledge base knowledge representation labeled learning Marcus match minimax move MYCIN natural language node object ON(B ON(C operators output parsing particular path perceptron perform players possible preconditions predicate logic problem problem-solving procedure produce PROLOG represent result robot rules script Section semantic semantic net sentence shown in Figure simple slot solution solve specific step structure Suppose syntactic task techniques theorem things tree truth maintenance system understanding variables version space