ARTIFICIAL INTELLIGENCE UNIT-I Question-Bank Introduction -------------------------------------------------------------------------------1) What is AI Systems that think like humans Systems that act

like humans Systems that think rationally Systems that act rationally

!) "e#ine an a$ent% An a$ent is anything that can be viewed as &ercei'in$ its en'iron(ent through sensors and actin$ u&on that environment through actuators%

)) What is an a$ent #unction An agents behavior is described by the a$ent #unction that maps any given &erce&t se*uence to an action% +) "i##erentiate an a$ent #unction and an a$ent &ro$ra(% Agent Function An abstract mathematical description ,) What can Ai do todaAgent Program A concrete implementation,running on the agent Architecture.

.) What is a task en'iron(ent /o0 it is s&eci#ied Task en'iron(ents are essentially the "problems" to which rational agents are the "solutions." A Task environment is speci ied using P!AS "Per ormance, !nvironment,
Actuators, Sensors# description.

1) Gi'e an e2a(&3e o# 4EA5 descri&tion #or an auto(ated ta2i%

6) Gi'e 4EA5 descri&tion #or di##erent a$ent t-&es%

7) List the &ro&erties o# task en'iron(ents% Fully observable vs. partially observable% $eterministic vs. stochastic. !pisodic vs. se%uential Static vs, dynamic. $iscrete vs. continuous. Single agent vs. multiagent% 18) Write a #unction #or the ta93e dri'en a$ent%

11) What are the #our di##erent kinds o# a$ent &ro$ra(s

Simple re le& agents' (odel)based re le& agents' *oal)based agents' and +tility)based agents.

1!) E2&3ain a si(&3e re#3e2 a$ent 0ith a dia$ra(% 5i(&3e re#3e2 a$ents The simplest kind o agent is the si(&3e re#3e2 a$ent% These agents select actions on the basis AGENT
o the current percept, ignoring the rest o the percept history.

1)) E2&3ain 0ith a dia$ra( the (ode3 9ased re#3e2 a$ent%

1)a) E2&3ain 0ith a dia$ra( the $oa3 9ased re#3e2 a$ent%

,nowing about the current state o the environment is not always enough to decide what to do. For e&ample, at a road -unction, the ta&i can turn le t, turn right, or go straight on. The correct decision depends on where the ta&i is trying to get to. .n other words, as well as a current state description, the agent needs some sort o $oa3 in ormation that describes situations that are desirable) or e&ample, being at the passenger/s destination.

1)9) What are uti3it- 9aseda$ents

*oals alone are not really enough to generate high)%uality behavior in most environments. For e&ample, there are many action se%uences that will get the ta&i to its destination "thereby achieving the goal# but some are %uicker, sa er, more reliable, or cheaper than others. A uti3it- #unction maps a state "or a se%uence o states# onto a real number, which describes the associated degree o happiness.

1)c) What are 3earnin$ a$ents

A learning agent can be divided into our conceptual components, as shown in Fig) 0.12. The most important distinction is between the learning element, which is re) ELEMENT sponsible or making improvements, and the per ormance element, which is responsible or selecting e&ternal actions. The per ormance element is what we have previously considered to be the entire agent3 it takes in percepts and decides on actions. The learning element uses CRITIC eedback rom the critic on how the agent is doing and determines how the per ormance element should be modi ied to do better in the uture.

5earchin$ Techni*ues
1+) "e#ine the &ro93e( so3'in$ a$ent% A Problem solving agent is a $oa3-9ased agent . .t decide what to do by inding se%uence o actions that lead to desirable states. The agent can adopt a goal and aim at satis ying it. *oal ormulation is the irst step in problem solving. 1,) "e#ine the ter(s $oa3 #or(u3ation and &ro93e( #or(u3ation% Goa3 #or(u3ation,based on the current situation and the agents per ormance measure,is the irst step in problem solving. The agents task is to ind out which se%uence o actions will get to a goal state. 4ro93e( #or(u3ation is the process o deciding what actions and states to consider given a goal 1.) List the ste&s in'o3'ed in si(&3e &ro93e( so3'in$ a$ent% "i# *oal ormulation "ii# Problem ormulation

"iii# "iv# "v#

Search Search Algorithm !&ecution phase

11) "e#ine search and search a3$orith(% The process o looking or se%uences actions rom the current state to reach the goal state is called search% The search a3$orith( takes a &ro93e( as in&ut and returns a so3ution in the orm o action se*uence% 4nce a solution is ound,the e2ecution &hase consists o carrying out the recommended action.. 16) What are the co(&onents o# 0e33-de#ined &ro93e(s o The initia3 state that the agent starts in . The initial state or our agent o e&ample problem is described by In(Arad) o A 5uccessor Function returns the possible actions available to the agent. *iven a state &,S+55!SS46)F7"&# returns a set o 8action,successor9 ordered pairs where each action is one o the legal actions in state &,and each successor is a state that can be reached rom & by applying the action. For e&ample, rom the state .n"Arad#,the successor unction or the 6omania problem would return 8 :*o"Sibiu#,.n"Sibiu#;,:*o"Timisoara#,.n"Timisoara#;,:*o"<erind#,.n"<erind#; 9 o Thr $oa3 test determines whether the given state is a goal state. o A &ath cost unction assigns numeric cost to each action. For the 6omania problem the cost o path might be its length in kilometers. 17) "i##erentiate to- &ro93e(s and rea3 0or3d &ro93e(s% T:; 4R:BLE<5 REAL W:RL" 4R:BLE<5 A to- &ro93e( is intended A rea3 0or3d &ro93e( is one to illustrate various problem whose solutions people actually solving methods. .t can be care about. easily used by di erent researchers to compare the per ormance o algorithms. !8) Gi'e e2a(&3es o# rea3 0or3d &ro93e(s% "i# Touring problems "ii# Travelling Salesperson Problem"TSP# "iii# =>S. layout "iv# 6obot navigation "v# Automatic assembly se%uencing "vi# .nternet searching !1) List the criteria to (easure the &er#or(ance o# di##erent search strate$ies% o o o o Co(&3eteness 3 .s the algorithm guaranteed to ind a solution when there is one? :&ti(a3it- 3 $oes the strategy ind the optimal solution? Ti(e co(&3e2it- 3 @ow long does it take to ind a solution? 5&ace co(&3e2it- 3 @ow much memory is needed to per orm the search?

!!) "i##erentiate Unin#or(ed 5earch=B3ind search) and In#or(ed 5earch=/euristic 5earch) strate$ies% Unin#or(ed or B3ind 5earch In#or(ed or /euristic 5earch o 7o additional in ormation o (ore e ective beyond that provided in the o +ses problem)speci ic knowledge problem de inition beyond the de inition o the problem o 7ot e ective itsel . o 7o in ormation about number o steps or path cost !)) "e#ine Best-#irst-search% Aest) irst search is an instance o the general T6!!)S!A65@ or *6AP@)S!A65@ algorithm in which a node is selected or e&pansion based on the evaluation unction "n #. Traditionally,the node with the lowest evaluation unction is selected or e&pansion.

--------------UNIT-I Question Bank End ------------------