Utility functions - artificial intelligence, Computer Engineering

Utility Functions - artificial intelligence:

A goal based on an agent for playing chess is infeasible: at every moment it decides which move to play next, it sees whether that it will move eventually lead to a checkmate. As a choice it would be better for the agent to accesses it's progress not against the overall goal, but against a localized calculation. An agent's programs often have a utility function which calculates a numerical value for each world state the agent would find it in if it undertook a particular action. Then it can verify which action would make to the top most value being returned from the set of actions it has on hand. Usually the best action with respect to a utility function is undertaken, as this is the rational thing to do. The purpose of the agent is to find something by finding, if it uses a utility function in this method is known as a best first track.                         

RHINO searched for paths from its present location to an exhibit, using the distance from the show off as a utility function. However, this was difficult by visitors getting in the way.

Posted Date: 1/9/2013 7:03:01 AM | Location : United States







Related Discussions:- Utility functions - artificial intelligence, Assignment Help, Ask Question on Utility functions - artificial intelligence, Get Answer, Expert's Help, Utility functions - artificial intelligence Discussions

Write discussion on Utility functions - artificial intelligence
Your posts are moderated
Related Questions
Q. Why do businesses need systems analysts? A computerized system allows an organization to provide accurate information and respond faster to queries, events etc. If a busines

a. What is the difference among character and block devices? b. Discuss the method to make a Kernel Driver for the PC Speaker. c. Explain the socket structure with the help o

In step by step switching line finders are connected to the (A) Calling subscriber.                   (B) Switching network. (C) Called subscriber.                    (

By default, this page is quite barren. Though, go explore the Query Page some more; you will search that you can store numerous queries on the server, so if you regularly run a cer

Program Level : It is the next level consisting of independent programs for parallelism. Coarse Granularity  size is used at this level containing ten thousands of instructions.

Difference between relocatable and self relocatable programs. A relocatable program is one which can be processed to relocate it to a selected area of memory. For illustratio

Basics of Caches: "The caches are situated on basis of blocks, the shortest amount of data which may be copied between 2 adjacent levels at a time. "If requested data by th

Define the Pulse-Triggered (Master-Slave) Flip-flops? The term pulse-triggered signify that data are entered into the flip-flop on the rising edge of the clock pulse, though th

Why do we need to code a LOOP statement in both the PBO and PAI events for each table in the screen? We require coding a LOOP statement in both PBO and PAI events for every ta

Explain path testing.   Path Testing: Testing in which all paths in the program source code are tested at least once. Path testing has been one of the first test methods, and e