tailieunhanh - Artificial Intelligence and Soft Computing P2

There is no formal algorithm for its realization, ., given a starting and a goal state, one cannot say prior to execution of the tasks the sequence of steps required to get the goal from the starting state. Such problems are called the ideal AI problems. | instance is an ideal AI Problem. There is no formal algorithm for its realization . given a starting and a goal state one cannot say prior to execution of the tasks the sequence of steps required to get the goal from the starting state. Such problems are called the ideal AI problems. The well-known water-jug problem 35 the Travelling Salesperson Problem TSP 35 and the n-Queen problem 36 are typical examples of the classical AI problems. Among the non-classical AI problems the diagnosis problems and the pattern classification problem need special mention. For solving an AI problem one may employ both AI and non-AI algorithms. An obvious question is what is an AI algorithm Formally speaking an AI algorithm generally means a non-conventional intuitive approach for problem solving. The key to AI approach is intelligent search and matching. In an intelligent search problem sub-problem given a goal or starting state one has to reach that state from one or more known starting or goal states. For example consider the 4-puzzle problem where the goal state is known and one has to identify the moves for reaching the goal from a pre-defined starting state. Now the less number of states one generates for reaching the goal the better is the AI algorithm. The question that then naturally arises is how to control the generation of states. This in fact can be achieved by suitably designing some control strategies which would filter a few states only from a large number of legal states that could be generated from a given starting intermediate state. As an example consider the problem of proving a trigonometric identity that children are used to doing during their schooldays. What would they do at the beginning They would start with one side of the identity and attempt to apply a number of formulae there to find the possible resulting derivations. But they won t really apply all the formulae there. Rather they identify the right candidate formula that fits there best such that .