Shared Flashcard Set

Details

AI Midterm
jksdasoup
22
Pharmacology
3rd Grade
11/05/2009

Additional Pharmacology Flashcards

 


 

Cards

Term
Breadth-First Search
Definition
Uninformed Search
CPU intensive
Memory intensive
Optimal in steps
Complete
Exhaustive
Term
Greedy Search
Definition
Informed Search
Not CPU intensive
Not memory intensive
not optimal
not complete
exhaustive
Term
Uniform Cost Search
Definition
Uninformed search
CPU intensive
Memory intensive
Optimal in cost or distance
Complete
Exhaustive
Term
A*
Definition
Informed
Somewhat CPU intensive
Somewhat Memory intensive
Optimal in cost or distance if heuristic is admissible
Complete
Exhaustive
Term
Depth-First Search
Definition
Uninformed Search
CPU intensive
Memory friendly. Only requires enough memory to store the call stack.
Not optimal - returns the first solution it finds
Not complete - it may go in the wrong direction and never return.
Exhaustive
Term
Iteratively Deepening Depth-First Search
Definition
Uninformed
CPU intensive
Memory friendly
Optimal(is depth is iterated one step at a time) in steps
Complete
Exhaustive
Term
When is A* complete?
Definition
When the heuristic is admissible!!!!!!!!!!
Term
What does uninformed mean?
Definition
The search doesn't have information about its prior moves or the goal
Term
What does informed mean?
Definition
The search has information about its prior moves and it's goal
Term
What does Optimal mean?
Definition
how"good" the solution is
Term
What does complete mean?
Definition
If the solution is guaranteed
Term
What does exhaustive mean?
Definition
Will find a solution is the state space is finite.
Term
What is heuristic cost?
Definition
Cost to the goal
Term
What is given cost?
Definition
Cost from the begining
Term
What is the final cost?
Definition
F = G + H * hw(heuristic weight)
Term
What are the required components of a waypoint
Definition
location
connections (vector of edges)
Term
What are the required components of an edge?
Definition
Waypoint* neighbor
cost
Term
What is the neighbour of an waypoint?
Definition
The successor
Term
What are teh benefits and weaknesses to trial and error searches?
Definition
minimal CPU time and memory
Suffer from lack of foresight, and may fail to even find a path
Term
How do you find given cost?
Definition
node->givenCost = parent->givenCost + node->tile->weight * distance(node, parent);
Term
What are the benefits and disadvantages to Depth-First search?
Definition
Benefits:
Low Memory usage

Problems:
Has no memory of past events
takes a long time to execute
is neither nor complete

Term
How do you calculate the given cost for a waypoint?
Definition
current->givenCost + current->waypoint->connections[i]->cost;
Supporting users have an ad free experience!