In this article we will discuss about the need and types of heuristics for problem solving. Travelling Salesman Problem – Need of Heuristics: Will the control strategy which causes motion and is systematic, lead always to the solution? This is not so always, for example, consider the following problem: A salesman has a list of cities, each of which he [...]
The requisite background of intelligent systems or agents it is pertinent to discuss how a problem can be solved by these agents. An agent is anything which can be viewed as perceiving its environment through sensors and acting upon that environment through actuators. A human agent has ears, eyes and other organs for sensors and hands, legs, mouth etc., for [...]
In this article we will discuss about Green’s and Kowalski's formulations used for solving robot problems. 1. Green’s Formulation: One of the first attempts to solve robot problems was by Green (1969), who formulated them in such a way that a resolution theorem-proving system (a commutative system) could solve them. This formulation involved one set of assertions which described the [...]
In order to solve any complex problem the following tasks need to be done step wise: 1. Choose the best rule to apply the next, based on the best available heuristic information. 2. Apply the chosen rule to complete the new problem state which arises from its application. 3. Detect when a solution has been found. 4. Detect dead-ends so [...]
In this article we will discuss about:- 1. Issues Involved In Planning 2. Planning With Situation Calculus 3. Hierarchical Planning. Issues Involved In Planning: Let us assume that an agent using some standard search algorithm, say A*, is required to solve a tough real world problem; the obvious realisation would be the generation of irrelevant actions which should be avoided. [...]
In this article we will discuss about the syntax and semantics of planning to solve AI problems. Syntax of Planning: The representation of planning problems in different separable structures (states, actions and goals) syntactically should facilitate the planning algorithms of the problem. The key is to find a language which is expressive enough to describe a wide variety of problems, [...]
The following points highlight the two main planning methods used to solve AI problems. The methods are: 1. Failure of the Linear Method (Method of Repair) 2. Planning Graphs. Method # 1. Failure of the Linear Method (Method of Repair): Now let us take a difficult problem shown in Fig. 8.7. Sussman anamoly There are two ways to start with [...]