Autonomous rational an agents, Computer Engineering

Assignment Help:

Autonomous Rational an Agents:

In many cases, it is inaccurate to talk about a single program or a single robot, as the multi-purpose and multi-tasking system of hardware and software in some intelligent systems is considerably more complicated. Instead, we'll follow the rule-regulation of Russell and Norving and describe "AI" through the autonomous, rational intelligent an agents paradigm. We're going to use the definitions from chapter 2 of Russell and Norvig's textbook, starting with these two: 

An agent is anything that can be viewed as perceiving its environment through sensors and acting upon that environment through effectors. 

A rational an agent is one that does the right thing. 

We see that the word 'an agent' covers humans (where the sensors are the senses and the effectors are the physical body parts) as well as robots (where the sensors are things like cameras and touch pads and the effectors are various motors) and personal computers (where the sensors are the keyboard and mouse and the effectors are the monitor and speakers).

To verify whether an agent has acted rationally, we require an objective measure of how successful it has been and we need to worry about when to make an evaluation using this measure. When designing an agent, it is important to think hard about how to evaluate its performance, and this evaluation should be independent from any internal measures that the an agent undertakes (for example as part of a heuristic search  -  see the next lecture). The performance should be measured in terms of how rationally the program acted, which depends not only on how well it did at a particular assignment but also on what the an agent experienced from its environment, what the an agent knew about its surrounding areas and what reactions the an agent could actually assume.


Related Discussions:- Autonomous rational an agents

What is expansion swap, What is Expansion swap? At the time when any pr...

What is Expansion swap? At the time when any process needs more memory than it is currently allocated, the Kernel performs Expansion swap. To do this Kernel reserves enough spa

Towers of hanoi problem, The Towers of Hanoi Problem Towers of Hanoi pro...

The Towers of Hanoi Problem Towers of Hanoi problem is described. There are three pegs on which disks are "threaded" (there are holes in the disks to allow them to be placed on

What are the different database integrities, What are the different databas...

What are the different database integrities? Semantic Integrity. Relational Integrity. Primary Key Integrity. Value Set Integrity. Foreign Key integrity and

Explain recursion, What is recursion? Recursion: - Recursion is describ...

What is recursion? Recursion: - Recursion is described as a technique of defining a set or a process in terms of itself.

Short notes on model primitives in director mx 2004, Question: (a) Prep...

Question: (a) Prepare short notes on the model primitives in Director MX 2004. (b) Therefore using the box primitive write codes to prepare a new model resource of length 50

Analysis of amdahls law, The outcomes of analysis of Amdahl's law are: 1...

The outcomes of analysis of Amdahl's law are: 1) To optimize the performance of parallel computers, modified compilers need to be developed which should aim to decrease the numb

Analysis of website, In this part you are required to review and critique a...

In this part you are required to review and critique a website of a café or a restaurant of your choice. Your report should be a minimum 500 words with a maximum of 1000 words. You

What is winchester technology, What is Winchester technology? The disk ...

What is Winchester technology? The disk and the read/write heads are placed in a sealed air-filtered enclosure known as Winchester technology.

Explain Not recently used page replacement algorithm, Not Recently Used Pag...

Not Recently Used Page Replacement Algorithm The not recently used abbreviated as NRU page replacement algorithm works on the subsequent principle: while a page is referenced,

Give an example of first fit and best fit algorithms, Given memory partiti...

Given memory partitions of 100k, 500k, 200k, 300k, and 600k (in order), apply first fit and best fit algorithms to place processes with the space requirement of 212k, 417k, 112k an

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd