Two fundamental approaches can be applied to satellite-formation mission design: active control, where satellites exert forces with their thrusters to maintain a constant or periodic geometry for all or part of each o...
详细信息
Two fundamental approaches can be applied to satellite-formation mission design: active control, where satellites exert forces with their thrusters to maintain a constant or periodic geometry for all or part of each orbit, and natural, where satellite orbits are designed to naturally assemble a geometry for all or part of each orbit to within a tolerance defined from scientific requirements. An actively controlled formation can be labeled virtual rigid body (VRB) because geometry is precisely maintained as if the satellites were rigidly connected. This work describes a hierarchical optimization method for minimizing mission design computational complexity and applies this method to the design of VRB, natural-orbit, and multi-impulse solutions for a tetrahedron formation applicable to the proposed magnetospheric multiscale mission. Cost is defined in terms of total fuel per second of observation and tetrahedron geometric quality factor. Although both natural-orbit and active solutions are feasible, the active solutions substantially increase average data quality and observation time per orbit at minimum fuel cost, and the multi-impulse solution does not require thruster use during data collection periods.
The piecewise linear control allocation problem that use a linearprogramming approach was solved for implementing in a digital flight-control system. It was found that the nonlinear optimization problem can be cast a...
详细信息
The piecewise linear control allocation problem that use a linearprogramming approach was solved for implementing in a digital flight-control system. It was found that the nonlinear optimization problem can be cast as a linearprogramming problem where a subset of the decision variables are subject to restricted basis entry rules. It was shown that a simplex algorithm that enforces the restricted basis entry rules can be solved fast enough for use in a real-time flight-control system. The early termination of the simplex algorithm must be addressed to ensure that when a feasible solution to the control allocation problem exists, it is always found.
A fuel-minimization and near-miss avoidance control are developed for clustered satellites. A penalty function of class C2 with respect to the distances between satellites is imposed on the fuel-consumption index. It ...
详细信息
A fuel-minimization and near-miss avoidance control are developed for clustered satellites. A penalty function of class C2 with respect to the distances between satellites is imposed on the fuel-consumption index. It is found enough to solve just the two-point boundary-value problem even if unspecified multiple near misses occur between satellites. The proposed simulation procedure is to repeat shooting searches and to increase the height of the penalty function.
In this paper, we develop a new mathematical programming formulation for minimizing the schedule length in ad hoc wireless networks based on the optimal joint scheduling of transmissions across the multi-access commun...
详细信息
In this paper, we develop a new mathematical programming formulation for minimizing the schedule length in ad hoc wireless networks based on the optimal joint scheduling of transmissions across the multi-access communication links and allocation of transmit power levels, while meeting the requirements on the signal-to-interference and noise ratio (SINR) at intended receivers. We prove that the problem can be represented as a mixed integer linear programming (MILP) and show that the latter yields a solution that consists of transmit power levels that are strongly Pareto optimal. We demonstrate that our MILP formulation can be used effectively to derive optimal scheduling and power levels for networks with as many as 30 designated communication links. We exhibit that the MILP formulation can be also effectively solved to provide tight upper and lower bounds (corresponding to an approximation factor /spl Delta/) for the optimum schedule length of networks with as many as 100 designated links. We prove that the integrated link scheduling and power control problem is NP-complete. Consequently, we develop and investigate a heuristic algorithm of polynomial complexity (O|LO|/sup 5/) for solving the problem in a timely and practical manner. Our algorithm is based on the properties of a novel interference graph (the power-based interference graph) that we have introduced. We demonstrate that the frame length of schedules realized by our heuristic schemes reside in the 25 percentile of those attained by the optimal mechanism for randomly generated topologies.
We consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, our objective is to schedule them in a minimum number of time slots...
详细信息
We consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, our objective is to schedule them in a minimum number of time slots, so that each slot schedule is free of self-interferences and meets desired SINR constraints. Additionally, the transmit power vector corresponding to each slot schedule should be minimal. We consider two different versions of the problem, a per-slot version and a per-frame version, and develop mixed integer linear programming models which can be used for solving the problems optimally. In addition, we propose a heuristic algorithm for the per-slot version.
We consider the performance of various algorithms to maximize the lifetime of a given multicast connection in wireless networks that use directional antennas and have limited energy resources. Based on the IMILP (mixe...
详细信息
We consider the performance of various algorithms to maximize the lifetime of a given multicast connection in wireless networks that use directional antennas and have limited energy resources. Based on the IMILP (mixed integer linear programming) formulation [S. Guo et al, 2005], which provides a globally optimal solution to this problem for a small or medium network, we can evaluate the realistic performance of different heuristic algorithms. Experimental results show that minimum total power consumption does not guarantee maximum lifetime for either broadcasting or multicasting, and the algorithms S-DPMT and D-DPMT [S. Guo et al, 2004] outperform other energy-aware multicast algorithms significantly in terms of multicast lifetime.
To enable the huge saving of the kit-breakdown, we developed MaxIt v1.2 to generate an optimal capacity plan at the kit component level for the mid-range build plan in multi-factory environment. We describe the MILP (...
详细信息
To enable the huge saving of the kit-breakdown, we developed MaxIt v1.2 to generate an optimal capacity plan at the kit component level for the mid-range build plan in multi-factory environment. We describe the MILP (mixed integer linear programming) model and system architecture of MaxIt v1.2. We also conduct detailed sensitivity analysis on parameter setting and objective prioritizing. With the implementation in the Intel Shanghai and Manila sites, we have significantly improved data integrity and enabled a -US/spl ges/ cost savings.
In this paper, predictive energy management strategies that utilize the previewed traffic pattern and terrain information are developed. A generalized predictive optimal control framework is used to find the condition...
详细信息
In this paper, predictive energy management strategies that utilize the previewed traffic pattern and terrain information are developed. A generalized predictive optimal control framework is used to find the conditions under which the predictive strategies, will give superior fuel economy to that of the instantaneous strategies. mixed integer linear programming methodology, with no assumptions on the control structure, is used to find the predictive energy management strategies. It is shown, by using theoretical work and simulation, that certain conditions are needed to make the predictive strategies, that utilize the previewed driving pattern and terrain information, give superior fuel economy to the instantaneous ones.
In this paper, we present an algebraic decision diagram (ADD) based approach to determine and implicitly represent the leakage value for all input vectors of a combinational circuit. In its exact form, our technique c...
详细信息
In this paper, we present an algebraic decision diagram (ADD) based approach to determine and implicitly represent the leakage value for all input vectors of a combinational circuit. In its exact form, our technique can compute the leakage value of each input vector. To broaden the applicability of our technique, we present an approximate version of our algorithm as well. The approximation is done by limiting the total number of discriminant nodes in any ADD. Previous sleep vector computation techniques can find either the maximum or minimum sleep vector. Our technique computes the leakages for all vectors, storing them implicitly in an ADD structure. We experimentally demonstrate that these approximate techniques produce results which have reasonable errors. We also show that limiting the number of discriminants to a value between 12 and 16 is practical, allowing for good accuracy and lowered memory utilization.
This paper studies the capacitated minimum spanning tree problem, which is one of the most fundamental and significant problems in the optimal design of communication networks. A solution method using combined neighbo...
详细信息
ISBN:
(纸本)0769523161
This paper studies the capacitated minimum spanning tree problem, which is one of the most fundamental and significant problems in the optimal design of communication networks. A solution method using combined neighborhood search and branch and bound technique is introduced and its performance is presented. The advantage of the algorithm is shown while the process of searching for the optimal solution is illustrated. Computational experiences demonstrate that the proposed strategy significantly improves the efficiency of the previous arc-orientated branch and bound algorithm.
暂无评论