Abstract
This work presents a new search process for composite decision processes (CDPs; also known as a tree-search problems [1]) that is especially suited to problems represented by grammars. Many of the methods that are used to find an optimal or near-optimal solution in a large tree have been developed for path-planning problems (like A* [2]) and thus have requirements that are not well suited to design problems. With the recent attention on grammars in design, we find that design trees are often produced but difficult to search. Since existing path-planning methods are sensitive to the size of the space, and often put a low priority on the number of objective function evaluations, it is imperative to develop new search methods that can find the best solution within a large tree by doing the least number of evaluations as possible. In a previous paper, an interactive algorithm for searching in a graph grammar representation was presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kanal LM, Kumar V (1988) Search in artificial intelligence. Springer, London, p 482
Russell SJ (1995) Artificial intelligence: modern approach. Prentice Hall, Englewood Cliffs
Campbell MI, Rai R, Kurtoglu T (2009) A stochastic graph grammar algorithm for interactive search. In: Proceedings of the ASME 2009 international design engineering technical conferences IDETC/CIE 2009, vol 2009
Campbell MI, Rai R, Kurtoglu T (2012) A stochastic tree-search algorithm for generative grammars. J Comput Inf Sci Eng
Pahl G, Beitz W (1996) Engineering design: a systematic approach. Springer, London
Ehrig H, Rozenberg G, Kreowski H-J, Montanari U (eds) (1997) Handbook of graph grammars and computing by graph transformation. World Scientific Publishing Company, Singapore
Radhakrishnan P, Campbell MI (2010) A graph grammar based scheme for generating and evaluating planar mechanisms. In: Gero JS (ed) Design computing and cognition’10. Kluwer, Dordrecht, pp 663–679
Swantner A, Campbell MI (2010) Automated synthesis and optimization of expanded gear train topologies. Eng Optim (under review)
Lin Y-S, Shea K, Johnson A, Coultate J, Pears J (2009) A method and software tool for automated gearbox synthesis. In: Engineering conference, pp 1–11
Patel J, Campbell MI (2010) An approach to automate and optimize concept generation of sheet metal parts by topological and parametric decoupling. J Mech Des 132(5):51001
Shea K, Cagan J, Fenves SJ (1997) A shape annealing approach to optimal truss design with dynamic grouping of members. J Mech Des 119:388–394
Campbell MI (2012) GraphSynth | GraphSynth2: software for generative grammars and creative search. Available online: graphsynth.com. Last accessed 01 June 2012
Königseder C, Shea K, Campbell MI (2012) Comparing a graph-grammar approach to genetic algorithms for computational synthesis of PV arrays. In: CIRP design 2012—Sustainable product development
Hundal MS (1990) A systematic method for developing function structures, solutions and concept variants. Mech Mach Theory 25(3):243–256
Ward AC, Seering WP (1993) The performance of a mechanical design ‘compiler’. J Mech Des 115(3):341
Pearl J, Korf RE (1987) Search techniques. Ann Rev Comput Sci 2(8):451–467
Schmidt LC, Cagan J (1995) Recursive annealing: a computational model for machine design. Res Eng Des 7:102–125
Gielen C (1994) Genetic programming. Neurocomputing 6(1):120–122
Esram T, Chapman PL (2007) Comparison of photovoltaic array maximum power point tracking techniques. IEEE Trans Energy Convers 22(2):439–449
Dougal RA, Iotova AP (2009) Parallel-connected solar PV system to address partial and rapidly fluctuating shadow conditions. IEEE Trans Industr Electron 56(5):1548–1556
Kumar M, Campbell MI (2010) Organizing a design space of disparate component topologies. In: Gero JS (ed) Design computing and cognition’10. Kluwer, Dordrecht
Kurtoglu T, Swantner A, Campbell MI (2010) Automating the conceptual design process: from black box to component selection. AI EDAM 24(01):49–62
Kurtoglu T, Campbell MI (2006) Automated synthesis of electromechanical design configurations from empirical analysis of function to form mapping. Res Eng Des (6) (in review)
Kurtoglu T, Campbell MI (2009) Automated synthesis of electromechanical design configurations from empirical analysis of function to form mapping. J Eng Des 20(1):83–104
Acknowledgments
The authors would like to acknowledge the support of the Institute for Advanced Study at the Technical University of Munich for funding this collaborative research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Kumar, M., Campbell, M.I., Königseder, C., Shea, K. (2014). Rule Based Stochastic Tree Search. In: Gero, J. (eds) Design Computing and Cognition '12. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-9112-0_31
Download citation
DOI: https://doi.org/10.1007/978-94-017-9112-0_31
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-017-9111-3
Online ISBN: 978-94-017-9112-0
eBook Packages: EngineeringEngineering (R0)