Optimum Placement of Satellite Components with Genetic Algorithms
Abstract
In this paper, the formulation and the solution procedure for optimal placement of satellite components is given. Satellite internal space is discretized into three- dimensional grid (cubes) such as each cube represents a unit volume. Components or subsystems are approximated by a box with integer dimensions based on its largest three dimensions. The placement problem is formulated as a discreet optimization problem and solved with genetic algorithms. The optimization variables represent the location of the center of mass of each component. Different constraints and requirements including the non- intersection of components are also applied. The solution procedure was tested with simple two-dimensional test cases.
Optimum Placement of Satellite Components with Genetic Algorithms
In this paper, the formulation and the solution procedure for optimal placement of satellite components is given. Satellite internal space is discretized into three- dimensional grid (cubes) such as each cube represents a unit volume. Components or subsystems are approximated by a box with integer dimensions based on its largest three dimensions. The placement problem is formulated as a discreet optimization problem and solved with genetic algorithms. The optimization variables represent the location of the center of mass of each component. Different constraints and requirements including the non- intersection of components are also applied. The solution procedure was tested with simple two-dimensional test cases.
