DocumentCode :
381341
Title :
A stochastic optimization tool for determining spacecraft avionics box placement
Author :
Jackson, Brian
Author_Institution :
Ball Aerosp. & Technol. Corp., Boulder, CO, USA
Volume :
5
fYear :
2002
fDate :
2002
Firstpage :
172882
Abstract :
In the preliminary design of spacecraft, one particularly difficult task is determining the optimal placement of avionics boxes on the spacecraft panels and decks. This is actually a multi-objective optimization problem, as there are multiple competing constraints that must be satisfied simultaneously. These constraints include minimizing the amount of harness wiring between boxes (and thus the wire harness mass), minimizing the length of RF cable runs (to minimize attenuation), keeping the thermal loading of all panels/decks within prescribed limits, and keeping the mass imbalance of the spacecraft within prescribed limits. This task is generally performed manually, based on prior experience and similarity to previous designs. This type of manual process tends to be highly iterative, wastes valuable time and resources, and is guaranteed to always produce sub-optimal results. As the complexity of the spacecraft increases, this problem becomes increasingly formidable. The avionics box placement problem is shown to be a variant of the classical traveling salesman problem (TSP), which is a well-known problem in combinatorial optimization. The classical TSP and its variants are of the class NP-hard, and thus cannot be solved to optimality in polynomial time due to the vastness of the solution space. Global search techniques that use a stochastic engine to explore diverse regions of the solution space (such as genetic algorithms and simulated annealing) have been employed with great success against such problems. This paper examines the utility of implementing a box placement optimization tool using a stochastic global search algorithm. A candidate algorithm is presented, run against a simplified representative avionics box placement problem, and the results documented. The utility of the algorithm is assessed, and recommendations are made for additional enhancements that would increase algorithm performance and make the algorithm more suitable for actual applications.
Keywords :
avionics; computational complexity; genetic algorithms; minimisation; search problems; simulated annealing; space vehicle electronics; space vehicles; stochastic processes; thermal management (packaging); travelling salesman problems; wiring; NP-hard class problems; RF cable run length minimization; TSP; attenuation minimization; avionics box optimal placement; combinatorial optimization; genetic algorithms; global search techniques; inter-box harness wiring minimization; iterative manual placement design sub-optimal results; multi-objective optimization problems; panels/decks thermal loading limits; polynomial time solution space; preliminary spacecraft design; simulated annealing; simultaneously satisfied multiple competing constraints; solution space exploration; spacecraft avionics box placement stochastic optimization tool; spacecraft design complexity; spacecraft mass imbalance limits; spacecraft panels/decks; stochastic engines; stochastic global search algorithms; traveling salesman problems; wire harness mass; Aerospace electronics; Attenuation; Constraint optimization; Radio frequency; Space vehicles; Stochastic processes; Thermal loading; Traveling salesman problems; Wire; Wiring;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Aerospace Conference Proceedings, 2002. IEEE
Print_ISBN :
0-7803-7231-X
Type :
conf
DOI :
10.1109/AERO.2002.1035410
Filename :
1035410
Link To Document :
بازگشت