This paper aims to optimize imaging mission planning for multiple agile Earth observation satellites using a modified dynamic programming (MDP) algorithm. The mission planning problem is mathematically modeled using m...
详细信息
This paper aims to optimize imaging mission planning for multiple agile Earth observation satellites using a modified dynamic programming (MDP) algorithm. The mission planning problem is mathematically modeled using mixed-integer linear programming, which defines the objective function and constraints. An MDP algorithm is proposed to address the challenge of extended computation time inherent in typical deterministic dynamicprogramming, aiming to optimize the imaging scheduling problem. Numerical simulations are conducted under various target numbers and satellites in a relatively narrow mission area with a high target density. The simulation results illustrate the stage configuration and target observation sequence over time, and this paper investigates the achievement rate, measured as the ratio of obtained profit and target observations to the total. The trend of computation time is also analyzed across all mission scenarios. Ultimately, the validity of the MDP algorithm is confirmed, as it demonstrates superior performance compared to the genetic algorithm, the branch-and-bound method, and the greedy algorithm.
Hybrid electric vehicle (HEV) achieves good performance of power, economy and emissions through acceleration assistance, regenerative braking and energy management. The dynamics models of each power component and tran...
详细信息
ISBN:
(纸本)9781728126845
Hybrid electric vehicle (HEV) achieves good performance of power, economy and emissions through acceleration assistance, regenerative braking and energy management. The dynamics models of each power component and transmission system are established. In order to reduce the running time of the program, a modified dynamic programming algorithm is proposed to optimize the control strategy globally. The simulation results show that the vehicle dynamics performance can be satisfied, and the power battery's state of charge(SOC) can be improved significantly. It shows that the proposed energy management strategy is effective and can provide a theoretical basis for formulating the control strategy of complex hybrid system.
Hybrid electric vehicle(HEV)achieves good performance of power,economy and emissions through acceleration assistance,regenerative braking and energy *** dynamics models of each power component and transmission system ...
详细信息
ISBN:
(纸本)9781728126845
Hybrid electric vehicle(HEV)achieves good performance of power,economy and emissions through acceleration assistance,regenerative braking and energy *** dynamics models of each power component and transmission system are *** order to reduce the running time of the program,a modified dynamic programming algorithm is proposed to optimize the control strategy *** simulation results show that the vehicle dynamics performance can be satisfied,and the power battery's state of charge(SOC)can be improved *** shows that the proposed energy management strategy is effective and can provide a theoretical basis for formulating the control strategy of complex hybrid system.
For the offline segmentation of long hydrometeological time series, a new algorithm which combines the dynamicprogramming with the recently introduced remaining cost concept of branch-and-bound approach is developed....
详细信息
For the offline segmentation of long hydrometeological time series, a new algorithm which combines the dynamicprogramming with the recently introduced remaining cost concept of branch-and-bound approach is developed. The algorithm is called modified dynamic programming (mDP) and segments the time series based on the first-order statistical moment. Experiments are performed to test the algorithm on both real world and artificial time series comprising of hundreds or even thousands of terms. The experiments show that the mDP algorithm produces accurate segmentations in much shorter time than previously proposed segmentation algorithms.
This paper represents a modified dynamic programming solution to the unit commitment (UC) problem. The UC is a complex decision-making process because of multiple constraints which may not be violated while finding th...
详细信息
ISBN:
(纸本)9781424483570
This paper represents a modified dynamic programming solution to the unit commitment (UC) problem. The UC is a complex decision-making process because of multiple constraints which may not be violated while finding the optimal or suboptimal commitment schedule. There are many methods to solve the UC problem gradually. So, before we present our method, we will show the drawbacks of the standard dynamicprogramming methods which use general purpose optimization techniques to the UC problem. The priority list method, the lagrange relaxation and the mixed integer linear programming (MILP) are possible to apply to a real power system for performing the unit commitment. However, by using these methods, we could not get an optimal solution but only a suboptimal silution. Therefore we propose to get an optimal solution by using dynamicprogramming. Performing dynamicprogramming takes a lot of simulation time, so it is not optimal to use in a real power system for performing the unit commitment. Therfore, we need a modified dynamic programming method to satisfy both the simulated and the real power system to get the optimal solution. For those not familiar with UC problem, we introduce the constraints, production cost and start-up cost. The goal of the objective function is in cost minimization, so we use the economic dispatch using the lambda iteration method when we calculate the production costs. Finally, we compare the UC solution by using both methods.
A new method for computing precise depth map estimates of 3-D shape of a moving object is proposed. The 3-D shape recovery in motion stereo is formulated as a matching optimization problem of multiple stereo images. T...
详细信息
A new method for computing precise depth map estimates of 3-D shape of a moving object is proposed. The 3-D shape recovery in motion stereo is formulated as a matching optimization problem of multiple stereo images. The proposed method is a heuristic modification of dynamicprogramming applied to a 2-D optimization problem. The 3-D shape recovery using real motion stereo images demonstrates a good performance of the algorithm in terms of reconstruction accuracy. (C) 2001 Society of Photo-Optical Instrumentation Engineers.
暂无评论