Intro to Robotics
Intro to Robotics CIS 4930
Popular in Course
Popular in Computer Information Systems
Mabel Smitham PhD
verified elite notetaker
This 4 page Study Guide was uploaded by Mabel Smitham PhD on Wednesday September 23, 2015. The Study Guide belongs to CIS 4930 at University of South Florida taught by Staff in Fall. Since its upload, it has received 12 views. For similar materials see /class/212607/cis-4930-university-of-south-florida in Computer Information Systems at University of South Florida.
Reviews for Intro to Robotics
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 09/23/15
1 Final Review 11 Introduction Textbook Section 11 Final 1 short question What is Arti cial Intelligence Human Rational ldeal Thought Thinking like a human Thinking rationally Behavior Acting like a human Acting rationally Thinking like a human Solving problems using the same thought processes as another intelligent agent namely humans Closely tied to cognitive science or the study of how humans think Thinking rationally Rather than rely on the flawed intelligence of humans this view of AI prefers to use formally proven models of thought like logic as the model of intelligence Acting like a human This view is captured in the Turing test and Total Turing test Acting rationally Acting correctly relative to a prede ned set of goals 12 Search Textbook Chapter 3 Final 1 in depth question Textbook Sections 4143 Final 1 short question A search problem is made up of 3 things 1 initial state 2 successor function 3 goal description test Search strategies differ in the way they eccpand the fringe nodes Name the search strategies 9 1 A 2 BFS 3 Best rst search 4 Bi directional 5 DFS 6 Depth limited 7 Greedy 8 Iterative deepening 9 IDA What makes a heuristic admissible never overestimates What is the difference between iterative improvement and search algorithms Iterative improvement algorithms do not keep track of the path from the initial state to the current node Name the iterative improvement algorithms 4 1 Hill climbing 2 Simulated annealing 3 Local beam search 4 Genetic Algorithms 5 Ant Colony Optimization New 13 Games Textbook Sections 61 and 62 Final 1 short question What is the difference between games and other search problems Your opponents A game is de ned by 4 things H initial state 3 successor function 00 end game description test 4 utility function determines quality of end game states for each player Name the two game algorithms 1 MINIMAX 2 Alpha Beta Why is Alpha Beta better Prunes the search tree What makes a game nondeterrninistic An element of chance any game with dice card games When are evaluation functions used When you don t have time to search the entire tree 14 Logic Textbook Sections 81 and 82 Final 1 short question A predicate is either TRUE or FALSE Syntax is made up of symbols logical operators and grammar Semantics give the meaning Give the inference rule Modes Ponens a a b a b What is this equivalent to a V b gt a no And this a ch gt aAb Vac Order of operations T N V y H So p V q r a sis equivalent to p V q r a 5 What two kinds of objects exist in rst order logic Constants and variables A relation is either TRUE or FALSE A function returns an object
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'