Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOptimal impact strategies for asteroid deflection
223
0
0.0
(
0
)
Added by
Massimiliano Vasile
Publication date
2011
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
This paper presents an analysis of optimal impact strategies to deflect potentially dangerous asteroids. To compute the increase in the minimum orbit intersection distance of the asteroid due to an impact with a spacecraft, simple analytical formulas are derived from proximal motion equations. The proposed analytical formulation allows for an analysis of the optimal direction of the deviating impulse transferred to the asteroid. This ideal optimal direction cannot be achieved for every asteroid at any time; therefore, an analysis of the optimal launch opportunities for deviating a number of selected asteroids was performed through the use of a global optimization procedure. The results in this paper demonstrate that the proximal motion formulation has very good accuracy in predicting the actual deviation and can be used with any deviation method because it has general validity. Furthermore, the characterization of optimal launch opportunities shows that a significant deviation can be obtained even with a small spacecraft.
rate research
Read More
We consider a production-inventory control model with finite capacity and two different production rates, assuming that the cumulative process of customer demand is given by a compound Poisson process. It is possible at any time to switch over from the different production rates but it is mandatory to switch-off when the inventory process reaches the storage maximum capacity. We consider holding, production, shortage penalty and switching costs. This model was introduced by Doshi, Van Der Duyn Schouten and Talman in 1978. Our aim is to minimize the expected discounted cumulative costs up to infinity over all admissible switching strategies. We show that the optimal cost functions for the different production rates satisfy the corresponding Hamilton-Jacobi-Bellman system of equations in a viscosity sense and prove a verification theorem. The way in which the optimal cost functions solve the different variational inequalities gives the switching regions of the optimal strategy, hence it is stationary in the sense that depends only on the current production rate and inventory level. We define the notion of finite band strategies and derive, using scale functions, the formulas for the different costs of the band strategies with one or two bands. We also show that there are examples where the switching strategy presented by Doshi et al. is not the optimal strategy.
For hybrid Markov decision processes, UPPAAL Stratego can compute strategies that are safe for a given safety property and (in the limit) optimal for a given cost function. Unfortunately, these strategies cannot be exported easily since they are computed as a very long list. In this paper, we demonstrate methods to learn compact representations of the strategies in the form of decision trees. These decision trees are much smaller, more understandable, and can easily be exported as code that can be loaded into embedded systems. Despite the size compression and actual differences to the original strategy, we provide guarantees on both safety and optimality of the decision-tree strategy. On the top, we show how to obtain yet smaller representations, which are still guaranteed safe, but achieve a desired trade-off between size and optimality.
We investigate the optimal portfolio deleveraging (OPD) problem with permanent and temporary price impacts, where the objective is to maximize equity while meeting a prescribed debt/equity requirement. We take the real situation with cross impact among different assets into consideration. The resulting problem is, however, a non-convex quadratic program with a quadratic constraint and a box constraint, which is known to be NP-hard. In this paper, we first develop a successive convex optimization (SCO) approach for solving the OPD problem and show that the SCO algorithm converges to a KKT point of its transformed problem. Second, we propose an effective global algorithm for the OPD problem, which integrates the SCO method, simple convex relaxation and a branch-and-bound framework, to identify a global optimal solution to the OPD problem within a pre-specified $epsilon$-tolerance. We establish the global convergence of our algorithm and estimate its complexity. We also conduct numerical experiments to demonstrate the effectiveness of our proposed algorithms with both the real data and the randomly generated medium- and large-scale OPD problem instances.
Most analyses of manipulation of voting schemes have adopted two assumptions that greatly diminish their practical import. First, it is usually assumed that the manipulators have full knowledge of the votes of the nonmanipulating agents. Second, analysis tends to focus on the probability of manipulation rather than its impact on the social choice objective (e.g., social welfare). We relax both of these assumptions by analyzing optimal Bayesian manipulation strategies when the manipulators have only partial probabilistic information about nonmanipulator votes, and assessing the expected loss in social welfare (in the broad sense of the term). We present a general optimization framework for the derivation of optimal manipulation strategies given arbitrary voting rules and distributions over preferences. We theoretically and empirically analyze the optimal manipulability of some popular voting rules using distributions and real data sets that go well beyond the common, but unrealistic, impartial culture assumption. We also shed light on the stark difference between the loss in social welfare and the probability of manipulation by showing that even when manipulation is likely, impact to social welfare is slight (and often negligible).
A price-maker company extracts an exhaustible commodity from a reservoir, and sells it instantaneously in the spot market. In absence of any actions of the company, the commoditys spot price evolves either as a drifted Brownian motion or as an Ornstein-Uhlenbeck process. While extracting, the company affects the market price of the commodity, and its actions have an impact on the dynamics of the commoditys spot price. The company aims at maximizing the total expected profits from selling the commodity, net of the total expected proportional costs of extraction. We model this problem as a two-dimensional degenerate singular stochastic control problem with finite fuel. To determine its solution, we construct an explicit solution to the associated Hamilton-Jacobi-Bellman equation, and then verify its actual optimality through a verification theorem. On the one hand, when the (uncontrolled) price is a drifted Brownian motion, it is optimal to extract whenever the current price level is larger or equal than an endogenously determined constant threshold. On the other hand, when the (uncontrolled) price evolves as an Ornstein-Uhlenbeck process, we show that the optimal extraction rule is triggered by a curve depending on the current level of the reservoir. Such a curve is a strictly decreasing $C^{infty}$-function for which we are able to provide an explicit expression. Finally, our study is complemented by a theoretical and numerical analysis of the dependency of the optimal extraction strategy and value function on the models parameters.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
