Computer Science Technical Reports
CS at VT

KKT conditions satisfied using adaptive neighboring in hybrid cellular automata for topology optimization

Penninger, Charles L. and Tovar, Andres and Watson, Layne T. and Renaud, John E. (2009) KKT conditions satisfied using adaptive neighboring in hybrid cellular automata for topology optimization. Technical Report TR-09-18, Computer Science, Virginia Tech.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
hcaJCISE09.pdf (400240)


The hybrid cellular automaton (HCA) method is a biologically inspired algorithm capable of topology synthesis that was developed to simulate the behavior of the bone functional adaptation process. In this algorithm, the design domain is divided into cells with some communication property among neighbors. Local evolutionary rules, obtained from classical control theory, iteratively establish the value of the design variables in order to minimize the local error between a field variable and a corresponding target value. Karush-Kuhn-Tucker (KKT) optimality conditions have been derived to determine the expression for the field variable and its target. While averaging techniques mimicking intercellular communication have been used to mitigate numerical instabilities such as checkerboard patterns and mesh dependency, some questions have been raised whether KKT conditions are fully satisfied in the final topologies. Furthermore, the averaging procedure might result in cancellation or attenuation of the error between the field variable and its target. Several examples are presented showing that HCA converges to different final designs for different neighborhood configurations or averaging schemes. Although it has been claimed that these final designs are optimal, this might not be true in a precise mathematical sense—the use of the averaging procedure induces a mathematical incorrectness that has to be addressed. In this work, a new adaptive neighboring scheme will be employed that utilizes a weighting function for the influence of a cell’s neighbors that decreases to zero over time. When the weighting function reaches zero, the algorithm satisfies the aforementioned optimality criterion. Thus, the HCA algorithm will retain the benefits that result from utilizing neighborhood information, as well as obtain an optimal solution.

Item Type:Departmental Technical Report
Keywords:Structural optimization, Optimality conditions, Mathematical programming
Subjects:Computer Science > Algorithms and Data Structure
ID Code:1084
Deposited By:Administrator, Eprints
Deposited On:29 July 2009