| タイトル | Mixed Integer Programming and Heuristic Scheduling for Space Communication |
| 本文（外部サイト） | http://hdl.handle.net/2060/20130013562 |
| 著者（英） | Lee, Charles H.; Cheung, Kar-Ming |
| 著者所属（英） | California Inst. of Tech. |
| 発行日 | 2013-05-01 |
| 言語 | eng |
| 内容記述 | Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible. |
| NASA分類 | Space Communications, Spacecraft Communications, Command and Tracking |
| レポートNO | NPO-48485 |
| 権利 | Copyright, Distribution as joint owner in the copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/237754 |
|
