An attribute-space representation and algorithm for concurrent engineering

Artificial Intelligence for Engineering Design, Analysis and Manufacturing: AIEDAM

Volumn 10, Issue 1, 1996, Pages 21-36

  Darr, Timothy P ^a   Birmingham, William P ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Agent Architectures; Concurrent Engineering; Constraint Satisfaction Problems; Distributed Artificial Intelligence; Distributed Design

Indexed keywords

ALGORITHMS; COMPUTER AIDED DESIGN; COMPUTER ARCHITECTURE; CONCURRENT ENGINEERING; CONSTRAINT THEORY; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; PROBLEM SOLVING; PRODUCT DESIGN;

AGENT ARCHITECTURE; CONSTRAINT AGENTS; DISTRIBUTED DESIGN; DISTRIBUTED DYNAMIC INTERVAL CONSTRAINT SATISFACTION PROBLEM;

ARTIFICIAL INTELLIGENCE;

EID: 0029734816     PISSN: 08900604     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0890060400001268     Document Type: Article

References (51)

1. Balkany, A., Birmingham, W.P., & Runkel, J.T. (1994). Solving Sisyphus by design. International Journal of Human-Computer Studies 40(2), 221-241.
2. Balkany, A., Birmingham, W.P., & Tommelein, I.D. (1993). An analysis of several design tools. AI EDAM 7(1), 1-17.
3. Bowen, J., & Bahler, D. (1992). Supporting multiple perspectives: a constraint-based approach to concurrent engineering. In Artificial Intelligence in Design '92, pp. 85-96. Kluwer Academic Publishers, Dordrecht, the Netherlands.
4. Bowen, J., O'Grady, P., & Smith, L. (1990). A constraint programming language for Life-Cycle Engineering. Artificial Intelligence in Engineering 5(4), 206-220.
5. Bradley, S.R., & Agogino, A.M. (1991). An intelligent real time design methodology for catalog selection. Design Theory and Methodology - ASME 1991, 201-208.
6. Bradley, S.R., & Agogino, A.M. (1993). Computer-assisted catalog selection with multiple objectives. Design Theory and Methodology-ASME 1993, 139-147.
7. Conry, S.E., Kuwabara, K., Lesser, V.R., & Meyer, R.A. (1991). Multistage negotiation for distributed constraint satisfaction. IEEE Transactions on Systems, Man, and Cybernetics 21(6), 1462-1477.
8. Cooper, M.C. (1989). An optimal k-consistency algorithm. Artificial Intelligence 41(1), 89-95.
9. Cutkosky, M.R., Engelmore, R.S., Fikes, R.E., Genesereth, M.R., Gruber, T.R., Mark, W.S., Tenenbaum, J.M., & Weber, J.C. (1993). PACT: an experiment in integrating concurrent engineering systems. IEEE Computer 26(1), 28-37.
10. Darr, T.P., & Birmingham, W.P. (1993). Concurrent engineering: an automated design-space exploration approach. In Concurrent Engineering: Methodology and Applications (Gu, P., & Kusiak, A., Eds.), pp. 91-115. Elsevier Science Publishers, New York.
11. Darr, T.P., & Birmingham, W.P. (1994). Automated design for concurrent engineering. IEEE Expert 9(5), 35-42.
12. Davis, E. (1987). Constraint propagation with interval labels. Artificial Intelligence 32(3), 281-331.
13. Dechter, R. (1990). Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artificial Intelligence 41(3), 273-312.
14. Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence 49(1-3), 61-95.
15. Dechter, R., & Pearl, J. (1985). The anatomy of easy problems: a constraint-satisfaction formulation. In Proc. Ninth International Joint Conference on Artificial Intelligence, 1066-1072.
16. Dechter, R., & Pearl, J. (1988). Tree-clustering schemes for constraint processing. In Proc. Seventh National Conference on Artificial Intelligence, 150-154.
17. Deville, Y., & Van Hentenryck, P. (1991). An efficient arc consistency algorithm for a class of CSP problems. In Proc. 12th International Joint Conference on Artificial Intelligence, pp. 325-330. Morgan Kaufmann Publishers, San Mateo, California.
18. Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., & Berthier, F. (1988). The constraint logic programming language CHIP. In Proc. International Conference on Fifth Generation Computer Systems, 693-702.
19. Faltings, B. (1994). Arc-consistency for continuous variables. Artificial Intelligence 65(2), 363-376.
20. Fishburn, P.C. (1970). Utility Theory and Decision Making. John Wiley & Sons, New York.
21. Freuder, E.C. (1978). Synthesizing constraint expressions. Communications of ACM 21(11), 958-966.
22. Freuder, E.C. (1990). Complexity of K-tree structured constraint satisfaction problems. In Eighth National Conference on Artificial Intelligence (AAAI-90), pp. 4-9. AAAI Press/MIT Press, Boston.
23. Gupta, A.P., Birmingham, W.P., & Siewiorek, D.P. (1993). Automating the design of computer systems. IEEE Transactions on Computer-Aided Design of integrated Circuits and Systems 12(4), 473-487.
24. Haralick, R.M., & Elliott, G.L. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14(3), 263-313.
25. Huyhn, P.N., Genesereth, M.R., & Letsinger, R. (1993). Automated concurrent engineering in Designworld. IEEE Computer 26(1), 74-76.
26. Hyvonen, E. (1992). Constraint reasoning based on interval arithmetic: the tolerance propagation approach. Artificial Intelligence 58(1-3), 71-112.
27. Kannapan, S.M., Bell, D.G., & Taylor, D.L. (1993). Structuring information and coordinating teams in product development. Design Theory and Methodology - ASME 1993, 233-242.
28. Kannapan, S.M., & Marshek, K.M. (1991). A schema for negotiation between intelligent design agents in concurrent engineering. IFIP WG 5.2 Working Conference on Intelligent CAD, IntCAD '91 Preprints, 233-242.
29. Kumar, V. (1992). Algorithms for constraint-satisfaction problems: a survey. AI Magazine 13(1), 32-44.
30. Lander, S.E. & Lesser, V.R. (1992). Negotiated search: organizing cooperative search among heterogeneous expert agents. Proc. Fifth International Symposium on Artificial Intelligence, Applications in Manufacturing and Robotics, 351-358.
31. Lander, S-E. & Lesser, V.R. (1993). Understanding the role of negotiation in distributed search among heterogeneous agents. Proc. 13th International Joint Conference on Artificial Intelligence, 438-444.
32. Lesser, V.R. (1991). A retrospective of FA/C distributed problem solving. IEEE Transactions on Systems, Man, and Cybernetics 21(6), 1347-1362.
33. Mackworth, A.K. (1977). Consistency in networks of relations. Artificial Intelligence 8(1), 99-118.
34. Marcus, S., Stout, J., & McDermott, J. (1988). VT: an expert elevator designer that uses knowledge-based backtracking. AI Magazine 9(1), 95-112.
35. Mittal, S., & Falkenhainer, B. (1990). Dynamic constraint satisfaction problems. Proc. Eighth National Conference on Artificial Intelligence (AAAI-90), 25-32.
36. Mittal, S., & Frayman, F. (1987). COSSACK: a constraints-based expert system for configuration tasks. Proc. 2nd International Conference on Applications of AI to Engineering, Boston.
37. Navinchandra, D., & Rinderle, J.R. (1990). Interval approaches for concurrent evaluation of design constraints. Winter Annual Meeting of the American Society of Mechnical Engineers Symposium on Concurrent Product and Process Design, 101-108.
38. Pan, J.Y.C., & Tenenbaum, J.M. (1991). An intelligent agent framework for enterprise integration. IEEE Transactions on Systems, Man, and Cybernetics 21(6), 1391-1408.
39. Park, H., Cutkosky, M.R., Conru, A.B., & Lee, S.-H. (1994). An agentbased approach to concurrent cable harness design. AI EDAM 8(1), 45-61.
40. Ramana Reddy, Y.V., Srinivas, K., Jagannathan, V., & Karinthi, R. (1993). Computer support for concurrent engineering. IEEE Computer 26(1), 12-16.
41. Runkel, J.T., & Birmingham, W.P. (1994). Solving VT by reuse. In Proceedings of the 8th Banff Knowledge-Acquisition for Knowledge Based Systems Workshop, pp. 42.1-42.28, SRDG Publications, Department of Computer Science, University of Calgary, Calgary, Alberta, Canada.
42. Smailagic, A., & Siewiorek, D. (1993). The design and implementation of the VuMan wearable computer. Carnegie-Mellon University Engineering Design Research Center Technical Report EDRC 18-45-93.
43. Sycara, K., Roth, S., Sadeh, N., & Fox, M. (1991). Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics 21(6), 1446-1461.
44. van Beek, P. (1992). On the minimality and decomposability of constraint networks. Tenth National Conference on Artificial Intelligence (AAAI-92), 447-452.
45. Van Hentenryck, P., & Dincbas, M. (1986). Domains in logic programming. Fifth National Conference on Artificial Intelligence (AAAI-86), 759-765.
46. Van Hentenryck, P., Simonis, H., & Dincbas, M. (1992). Constraint satisfaction using logic programming. Artificial Intelligence 58(1-3), 113-159.
47. Ward, A.C., Lozano-Perez, T., & Seering, W. (1990). Extending the constraint propagation of intervals. AI EDAM 4(1), 47-54.
48. Ward, A.C., & Seering, W.P. (1989). The performance of a mechamcal design "compiler." MIT AI Memo 1084.
49. Ward, A.C., & Seering, W.P. (1993). Quantitative inference in a mechanical design compiler. ASME Journal of Mechanical Design 115(1), 29-35.
50. Werkman, K.J. (1992). Multiple agent cooperative design evaluation using negotiation. In Artificial Intelligence in Design '94, pp. 161-180, Kluwer Academic Publishers, Dordrecht, the Netherlands.
51. Yokoo, M., Durfee, E.H., Ishida.T., & Kuwabara, K. (1992). Distributed constraint satisfaction for formalizing distributed problem solving. In Twelfth international Conference on Distributed Computing Systems, pp. 614-621, IEEE Computer Society, Los Alamitos, California.