Issues in the Design of Search Problem

Issues in the Design of Search Problem

• Design is a signature of human intelligence. It was more difficult and big challenge for AI. Designs shaped early ideas on automated problem solving and reasoning. It provided ever since, task for AI which are as follows:

i. Studying, explaining and modeling the faculties underlying intelligent behaviour.

ii. Engineering systems that are capable of exhibiting for a such behavior.

Issues in Engineering Design

• When basically increasing integration on one hand and distribution work on the other hand are the trends that determine the present and even more the future of engineering design. This type of situation is by no means a paradox. When result of various engineering differ, different activities should be put together. When product is complete and launched in the market, it should be efficient and quality.

• Collaborative design transforms a chaining process into a parallel one with the aim of avoding iteration and utilizing resources, more efficiently, (Gadh-1996). Concurrent engineering has an even broader focus. Acknowledgeing that, engineering design must take into account the intrinsic requirement and properties of the process that bring to life, create, maintain and re-cycle artifacts. It embraces all main life-cycle activities such as marketing, design, manufacturing, distribution, sales, operation, maintenance, disposal and re-cycling. The expectations are greater, fewer modifications, shorter time-to market, more efficient resource utilization, better process and product quality (Sohlenius, 1992) though reliable (Alting and Legarth 1995; Jansen and Krause, 1996).

1. Design Synthesis

a) Automated search

• The search problems in design have been addressed mainly by the application of greedy numerical optimization algorithm, random re-start hill-climbing, stochastic local and global search methods. The technique is best if a design problem can be coined as a combinatorial optimization problem. They are account neither for the cost nor for the bounded resources of best for computations.

Tangible result in economic rationally lies in the center of intelligent behaviour (Doyle etal, 1996; Russel, 1997)

b) Model based and functional reasoning, constraint satisfaction

• Knowledge about artifacts enables reasoning about them, even if they are only partially defined. Can constrain the design process by evaluating partial design solution can be very complex problem (McGuinness and wright, 1998).

• The design process is not self automanted, rather alternatives are generated deriving the implications of the user provided data.

• The consistency of data could be preserved in the whole interactive design process. Functional models, the traditional decomposition of function subfunction can even better direct the design process through they cannot work on multiple levels of abstraction and without human interaction (Umeda and Ismiled Tomiyama, 1997).

c) Case based approach to design

Lack of sufficient understanding of design synthesis and the resistance of expertise to formalization attempts on one hand, where the surprising complexity of automated problem solving process on the other hand led AI practitioners back to tranditional design. Practice to the re-use of previous solution. In case based design (Maher and Garza, 1997) cases are episodic descriptions of problem together with their associated solution and trace of the solution process. Reasoning goes through the steps of adapting such stored cases that are particulary relevant to a new problem. Side-stepping the main line of reasoning, new cases be added to the case-base, CBR solve any problem to essay.

Review Questions

1. How will you measure the problem solving performance?

2. What is application of BFS?

3. State on which basis search algorithms are chosen?

4. Evaluate performance of problem solving method based on DFS algorithm.

5. How a problem is formally defined? List down the components of it.

6. Formulate the 8-puzzle problem using standard formulation and 8-queen problem using incremental and complete state formulation.

7. What do you mean by state space search?

8. Discuss any 2 uniformed search methods with examples.

9. Write algorithm for BFS and DFS.

10. Write algorithm for BFS, when does one prefer it? Also discuss A* algorithm.

11. Describe in brief DFS.

12. Explain following uniformed search strategies.

i) IDDFS ii) Bidirectional search.

13. Find the state space representation of 8-puzzle problem.