Search heuristics for constraint-aided embodiment design

Artificial Intelligence for Engineering Design, Analysis and Manufacturing: AIEDAM

Volumn 23, Issue 2, 2009, Pages 175-195

  Chenouard, R ^a,b   Granvilliers, L ^b   Sebastian, P ^a  

^a CNRS   (France)

^b UNIVERSITÉ DE NANTES   (France)

Author keywords

Constraint satisfaction; Embodiment design; Heuristic; Search

Indexed keywords

CONSTRAINT SATISFACTION; CONSTRAINT SATISFACTION TECHNIQUES; CONSTRAINT-BASED; DESIGN APPLICATIONS; EMBODIMENT DESIGN; HEURISTIC; PIECE-WISE; PRODUCT REQUIREMENTS; REAL-WORLD PROBLEM; SEARCH; SEARCH HEURISTICS;

HEURISTIC ALGORITHMS; HEURISTIC METHODS; PRODUCT DEVELOPMENT; PROJECT MANAGEMENT; STEELMAKING;

DESIGN;

EID: 68349146644     PISSN: 08900604     EISSN: 14691760     Source Type: Journal    
DOI: 10.1017/S0890060409000055     Document Type: Article

References (33)

1. Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., & Pitassi, T. (1995). The relative complexity of NP search problems. Proc. 27th Annual ACM Symp. Theory of Computing, STOC '95, pp. 303-314. New York: ACM Press.
2. Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Computing Surveys 35(3), 268-308.
3. Benhamou, F., Goualard, F., Granvilliers, L., & Puget, J.-F. (1999). Revising hull and box consistency. Int. Conf. Logic Programming, pp. 230-244. Cambridge, MA: MIT Press.
4. Bliek, C., Neveu, B., & Trombettoni, G. (1998). Using graph decomposition for solving continuous CSPs. CP'98, Pisa, Italy.
5. Collavizza, H., Delobel, F., & Rueher, M. (1999). Extending consistent domains of numeric CSPs. IJCAI'99, Stockholm, Sweden.
6. Cook, S.A., & Mitchell, D.G. (1997). Finding hard instances of the satisfiability problem: a survey. DIMACS Series in Discrete Math and Theoretical Computer Science 35, 1-17.
7. Fischer, X., Sébastian, P., Nadeau, J.-P., & Zimmer, L. (2004). Constraint based approach combined with metamodeling techniques to support embodiment design. SCI'04, Orlando, FL.
8. Gelle, E., & Faltings, B. (2003). Solving mixed and conditional constraint satisfaction problems. Constraints 8, 107-141.
9. Goldsztejn, A., & Jaulin, L. (2006). Inner and outer approximations of exis-tentially quantified equality constraints. CP'06, Nantes, France.
10. Granvilliers, L., & Benhamou, F. (2006). Algorithm 852: realpaver: an interval solver using constraint satisfaction techniques. ACM TOMS 32(1), 138-156.
11. Hyvönen, E. (1989). Constraint reasoning based on interval arithmetic. IJCAI'89, Detroit.
12. Jégou, P., & Terrioux, C. (2003). Hybrid backtracking bounded by tree decomposition of constraint networks. Artificial Intelligence 146, 43-75.
13. Kearfott, R.B. (1996). Rigorous Global Search: Continuous Problems. Nonconvex Optimization and Its Applications. New York: Kluwer Academic.
14. Lhomme, O. (1993). Consistency techniques for numeric CSPs. IJCAI'93, Chambéry, France.
15. Mailharro, D. (1998). A classification and constraint-based framework for configuration. Artificial Intelligence for Engineering Design, Analysis and Manufacturing 12(4), 383-397.
16. Mittal, S., & Falkenhainer, B. (1990). Dynamic constraint satisfaction problems. AAAI'90, Boston.
17. Moore, R. (1966). Interval Analysis. Englewood Cliffs, NJ: Prentice-Hall.
18. Neveu, B., Chabert, G., & Trombettoni, G. (2006). When interval analysis helps interblock backtracking. CP'06, Nantes, France.
19. O'Sullivan, B. (2001). Constraint-Aided Conceptual Design. London: Professional Engineering Publishing.
20. Pahl, G., & Beitz, W. (1996). Engineering Design: A Systematic Approach. Berlin: Springer.
21. Richardson, D. (1968). Some unsolvable problems involving elementary functions of a real variable. Journal of Symbolic Logic 33, 514-520.
22. Rossi, F., van Beek, P., & Walsh, T. (2006). Handbook of Constraint Programming. New York: Elsevier.
23. Rothwell, R., & Gardiner, P. (1990). Robustness and Product Design Families, Design Management: A Handbook of Issues and Methods (Oakley, M., Ed.), pp. 279-292. Cambridge, MA: Blackwell.
24. Sabin, M., Freuder, E.C., & Wallace, R.J. (2003). Greater efficiency of conditional constraint satisfaction. CP'03, Kinsale, Ireland.
25. Sam-Haroud, D., & Faltings, B. (1996). Consistency techniques for continuous constraints. Constraints 1, 85-118.
26. Sebastian, P., Chenouard, R., Nadeau, J.-P., & Fischer, X. (2006). The embodiment design constraint satisfaction problem of the BOOTSTRAP facing interval analysis and genetic algorithm based decision support tools. Proc. Virtual Concept 2006, Mexico.
27. Stumptner, M., Friedrich, G., & Haselböck, A. (1998). Generative constraintbased configuration of large technical systems. Artificial Intelligence for Engineering Design, Analysis and Manfacturing 12(4), 307-320.
28. Van-Hentenryck, P., Mc Allester, D., & Kapur, D. (1997). Solving polynomial systems using branch and prune approach. SIAM Journal on Numerical Analysis 34(2), 797-827.
29. Vareilles, E., Aldanondo, M., Gaborit, P., & Hadj-Hamou, K. (2005). Using interval analysis to generate quadtrees of piecewise constraints. IntCP '05, Barcelona, Spain.
30. Vu, X., Sam-Haroud, D., & Silaghi, M. (2002). Approximation techniques for non-linear problems with continuum of solutions. SARA'02, Kan-anaskis, Canada.
31. Wang, P.S. (1974). The undecidability of the existence of zeros of real elementary functions. Journal of ACM 21(4), 586-589.
32. Yannou, B., Simpson, T.W., & Barton, R.R. (2003). Towards a conceptual design explorer using metamodeling approaches and constraint programming. ASME DETC '03, Chicago.
33. Zimmer, L., & Zablit, P. (2001). Global aircraft predesign based on constraint propagation and interval analysis. CEAS-MADO '01, Koln, Germany.