edited by
3,581 views
1 votes
1 votes

Means-Ends Analysis process centres around the detection of difference between the current state and the goal state. Once such a difference is found, then to reduce the difference one applies

  1. a forward search that can reduce the difference
  2. a backward search that can reduce the difference
  3. a bidirectional search that can reduce the difference
  4. an operator that can reduce the difference
edited by

1 Answer

2 votes
2 votes

ans is D 

Means-Ends Analysis

  • Allows both backward and forward searching.
  • This means we could solve major parts of a problem first and then return to smaller problems when assembling the final solution.
  • GPS was the first AI program to exploit means-ends analysis.
  • STRIPS (A robot Planner) is an advanced problem solver that incorporates means-ends analysis and other techniques.

Very loosely the means-ends analysis algorithm is:

  1. Until the goal is reached or no more procedures are available:
    • Describe the current state, the goal state and the differences between the two.
    • Use the difference the describe a procedure that will hopefully get nearer to goal.
    • Use the procedure and update current state.
  2. If goal is reached then success otherwise fail.http://users.cs.cf.ac.uk/Dave.Marshall/AI2/AI2_6.html
edited by
Answer:

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Jul 22, 2016
1,536 views
If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is Alternative solutionInfeasible solutionUnbounded solutionDe...
1 votes
1 votes
1 answer
2
go_editor asked Jul 22, 2016
4,328 views
The Blocks World Problem in Artificial Intelligence is normally discussed to explain aSearch techniquePlanning systemConstraint satisfaction systemKnowledge base system
0 votes
0 votes
1 answer
3