Layout candidate schemes for small Satellite based on multi-objective optimization algorithm
- Paper number
IAC-22,C2,IP,31,x71984
- Author
Mr. Anuphong Sangthon, Thailand, National Astronomical Research Institute of Thailand (NARIT)
- Coauthor
Dr. Peerapong Torteeka, Thailand, National Astronomical Research Institute of Thailand (NARIT)
- Coauthor
Dr. Phongsatorn Saisutjarit, Thailand, King Mongkut's University of Technology North Bangkok
- Year
2022
- Abstract
In the system design phase of a space mission, the selection of satellite architecture has been driven by a mission requirement for high performance, low production rates, and non-recurrent fabrication costs. Nowadays, a modular-based architecture was frequently used as a reference to be a microsatellite structural design baseline for the feasibility of low-cost satellites using Commercial-Off-The-Shelf devices; this is a new trend in the space industry. Although modular-based architecture can reduce the development costs by allowing standardization, reuse of an existing design, decoupling of manufacturing, finding the optimum layout of satellite components and/or subsystems is still done based on the engineer's experience. In this research, we are addressing the three-dimensional modular-based microsatellite layout design problems with behavioral constraints. The proposed method has variables to be considered, i.e., a center of gravity, a moment of inertia, inertia angle, and thermal distribution via a multi-objective methodology based on a genetic algorithm combined with Computer-Aided Design (CAD) tools. As a case study, the design methodology applies to the layout optimization of a Thai Space Consortium satellite in a comprehensive framework for automatic modeling and finding an appropriate solution under a complex environment, which greatly restricts the optimal layout candidate schemes and exploration.
- Abstract document
- Manuscript document
IAC-22,C2,IP,31,x71984.pdf (🔒 authorized access only).
To get the manuscript, please contact IAF Secretariat.