General considerations for search - artificial intelligence, Basic Computer Science

Assignment Help:

General Considerations for Search

If we may specify the starting state, the operators and the goal check for a search problem, then we know from where to start, how to move and when to discontinue in our search. This leaves the essential question of how to decide which operator to apply to which state at any particular stage in the duration of search. We call an answer to this question a search strategy. Before we concern about exactly what strategy to use, the following need to be taken into consideration:

Path or Artefact

Broadly speaking, there are two different reasons to undertake a search: to find an artefact (a particular state), or to search a way from given state to another given state. Whether you are finding for a way or an artefact will affect several aspects of search of your agent, by including its goal test, what it records along the way and the search scheme available to you.

For example, in the jumble below, the game involves finding a route from the top left hand corner to the bottom right hand corner. We know what the exit looks like (a gap in the outer wall), so we do not find for an artefact. Rather then, the point of the search is to find a path, so the agent might remember where it has been.

 

1367_General Considerations for Search.png

However, in another search, the point of the search is to find something, and it may be immaterial how you searched it. 


Related Discussions:- General considerations for search - artificial intelligence

What do you mean by the term "robotics", Question 1 What do you mean by se...

Question 1 What do you mean by semantic networks? Explain inheritance in semantic networks Question 2 Explain Partitioned semantic networks with an example Question

Describe the binary search algorithm, QUESTION 1 Describe the binary se...

QUESTION 1 Describe the binary search algorithm using an example of your own. QUESTION 2 (a) By showing all your workings, give a big-O estimate for f(x) = (x + 1)lo

Heuristic search strategies-artificial intelligence, Heuristic Search Strat...

Heuristic Search Strategies-Artificial intelligence In general speaking, a heuristic search is one which utilizes a rule of thumb to improve an agent's performance in solving p

We will compare the performance of a vector processor, In this problem we w...

In this problem we will compare the performance of a vector processor with a system that contains a scalar processor and a GPU-based coprocessor. In the hybrid system, the host pr

Socket programming, Important: • No cheating will be tolerated. • No late s...

Important: • No cheating will be tolerated. • No late submissions. Total Points for this programming assignment: 100 The goal of your programming assignment is to build and experim

Quiz for your learning activity, The development of your learning module is...

The development of your learning module is very time consuming, so it is recommended that you begin creating your learning module during this first week. Before you begin, download

Data structure, #question.a tree has 0 off springs at each node. if it had ...

#question.a tree has 0 off springs at each node. if it had a label L, what will be the maximum number of nodes that the tree can have. only an expression involving the number of no

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