Artificial Intelligence Exam 1 || Questions & Answers (Graded A+)

Artificial Intelligence Exam 1 || Questions & Answers (Graded A+) Artificial Intelligence Exam 1 || Questions & Answers (Graded A+) uninformed search algorithms - ANSWER - algorithms that know nothing more about the problem other than its definition Ie, blind expands nodes, bfs/dfs/itt/depth limited informed search algorithm - ANSWER - uses node info to look for solutions Ie, uses node info or heuristics to decide what to expand next goal formulation - ANSWER - for a problem-solving agent, determine what the desired goal is problem formulation - ANSWER - decide what actions and states to consider, given a goal solution - ANSWER - after the process of looking at sequences of possible actions (or a search), the search algorithm finds this in the terms a fixed action sequence works best in a static environment execution - ANSWER - after a solution is found, the agent can began the action sequence. It's call this phase open-loop - ANSWER - defines a system that ignores percepts while executing an action initial state - ANSWER - A component of a problem: the state that the agent starts in actions - ANSWER - A component of a problem: possible next things that an agent can do in any state. Only some might be applicable for a particular state transition model - ANSWER - A component of a problem: a function that maps a state and action to a next state successor - ANSWER - any state reachable by the current state through an action successor function - ANSWER - a function that returns all possible successors state space - ANSWER - state of states reachable from the initial state by a sequence of actions. acting humanly