Optimal layout design of a satellite module

Layout design of a satellite module directly concerns its structure, performance, service life, and cost of assembly and maintenance. It is an important and NP-complete problem. The main difficulties consist of combinatorial optimizations in mathematics and system complexity in engineering practice, and relevant researches are far from enough. This paper proposes a basic solution strategy for the optimal layout design of a satellite module, which consists of two stages, global (or loose) layout design and detailed layout design. Corresponding algorithms are then developed while taking the layout design of an international commercial communication satellite as an example. They are the centripetal balancing method for global layout design and a quasi Traveling Salesman Problem (TSP) model-based Ant Colony Optimization (ACO) algorithm for layout optimization. The proposed method demonstrates its feasibility and validity on an application instance. Existing problems and further research directions are finally discussed.

[1]  Douglas B. Lenat,et al.  On the thresholds of knowledge , 1987, Proceedings of the International Workshop on Artificial Intelligence for Industrial Applications.

[2]  Hong-fei Teng,et al.  Layout optimization for the objects located within a rotating vessel - a three-dimensional packing problem with behavioral constraints , 2001, Comput. Oper. Res..

[3]  Marco Dorigo,et al.  An Investigation of some Properties of an "Ant Algorithm" , 1992, PPSN.

[4]  Teng Hong-fei,et al.  Layout Optimization for the Dishes Installed on a Rotating Table——The Packing Problem With Equilibrium Behavioural Constraints , 1994 .

[5]  Marco Dorigo,et al.  Mobile agents for adaptive routing , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[6]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[7]  V. Milenkovic,et al.  Compaction and separation algorithms for non-convex polygons and their applications☆ , 1995 .

[8]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[9]  Cyril Fonlupt,et al.  Parallel Ant Colonies for the quadratic assignment problem , 2001, Future Gener. Comput. Syst..

[10]  D. S. Linden,et al.  Wire antennas optimized in the presence of satellite structures using genetic algorithms , 2000, 2000 IEEE Aerospace Conference. Proceedings (Cat. No.00TH8484).

[11]  Teng Hong.  Complex layout optimization problem: layout scheme design of spacecraft module , 2001 .

[12]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[13]  Janet Bruten,et al.  Ant-like agents for load balancing in telecommunications networks , 1997, AGENTS '97.

[14]  Jonathan Cagan,et al.  A survey of computational approaches to three-dimensional layout problems , 2002, Comput. Aided Des..

[15]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[16]  Toshiharu Taura,et al.  Adaptive-growth-type 3D representation for configuration design , 1999, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[17]  Ilan Kroo,et al.  Collaborative Approach to Launch Vehicle Design , 1997 .

[18]  Kamlesh Mathur,et al.  Value considerations in three-dimensional packing -- A heuristic procedure using the fractional knapsack problem , 1994 .

[19]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[20]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[21]  Irène Charon,et al.  Application of the noising method to the travelling salesman problem , 2000, Eur. J. Oper. Res..