Search results for "DYNAMIC PROGRAMMING"
showing 10 items of 61 documents
Power allocation in multi-channel cognitive radio networks with channel assembling
2011
Accepted version of a paper in the book: 2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC). Published version available from the IEEE:http://dx.doi.org/10.1109/SPAWC.2011.5990485 Consider power allocation for Secondary User (SU) packet transmissions over multiple channels with variable Primary User (PU) arrival rates in cognitive radio networks. Two problems are studied in this paper: The first one is to minimize the collision probability with PUs and the second one is to maximize the data rate while keeping the collision probability bounded. It is shown that the optimal solution for the first problem is to allocate all power onto the bes…
Dynamic programming and Munkres algorithm for optimal photovoltaic arrays reconfiguration
2015
Abstract In this paper, an original formulation of the control problem for optimal PV array reconfiguration, following a Total Cross Tied layout, is proposed. The formulation follows the well-known subset sum problem, which is a special case of the knapsack problem. The reconfiguration is a measure devoted to mitigate the mismatch effect and maximize the output power of small photovoltaic plants under non-homogeneous working conditions. Therefore, reconfiguration means changing the connections of the solar panels adaptively by a dynamic switching matrix. The control system implements an easy dynamic programming algorithm to change the switches layout. The use of the Munkres assignment metho…
Increasing efficiency of photovoltaic systems under non-homogeneous solar irradiation using improved Dynamic Programming methods
2017
Abstract The paper presents a complete technique, based on the combination of algorithms, devoted to minimize losses and increase efficiency of Total Cross Tied (TCT) connected photovoltaic (PV) systems under non-homogeneous solar irradiation, based on irradiance equalization criterion. Irradiance equalization is achieved by changing the connections of the solar panels adaptively by a dynamic switching matrix so that total solar radiation on parallel circuits is the most equalized. In this paper, the authors introduce two algorithms. The first one is SmartChoice (SC) algorithm, which is combined with Dynamic Programming (DP) in order to create a hybrid method and obtain better results as co…
Predictive Energy Management for Hybrid Vehicles Based on Driving Cycle Recognition
2017
International audience; This article presents a novel approach to design an optimum energy management for a series plug-in hybrid electric vehicle based on driving cycle recognition. Thanks to an intensive study of driver habits, an important part of cycles is predictable. Optimized energy management can be developed for representative cycles via DP. Those results can be applied to the same cycle with slight adaptations thereafter with quality factors above 98%.
Optimizing Fuel Consumption and Pollutant Emissions of a Spark Ignition Engine for Eco-driving Applications
2018
VPPC 2018, Vehicle Power and Propulsion Conference, Chicago, ETATS-UNIS, 27-/08/2018 - 30/08/2018; The transportation sector is a major contributor to both air pollution and greenhouse gas emissions. While optimizing fuel consumption reduces CO2 emissions, it can increase fuel-rich operation and cause higher HC and CO emissions. A simplified emissions model is thus introduced in order to account for the impact of air/fuel ratio on both the exhaust concentration of regulated pollutants and the catalyst efficiency. This model is used to solve the eco-driving problem with dynamic programming and a weighted objective function. An emission-centered and a consumption-centered scenario are compare…
A Perturbation Approach to Continuous-Time Portfolio Selection Under Stochastic Investment Opportunities
2013
This paper studies portfolio selection in continuous-time models with stochastic investment opportunities. We consider asset allocation problems where preferences are specified as power utility derived from terminal wealth as well as consumption-savings problems with recursive utility Epstein-Zin preferences. The paper approximates the associated dynamic programming problem by perturbing the coefficients of the stochastic dynamics. We represent the Hamilton-Jacobi-Bellman equation as a series of partial differential equations that can be solved iteratively in closed-form through computer algebra software, at any desired accuracy.
Cyclic admissible contraction and applications to functional equations in dynamic programming
2015
In this paper, we introduce the notion of T-cyclic $( \alpha ,\beta ) $ -contraction and give some common fixed point results for this type of contractions. The presented theorems extend, generalize, and improve many existing results in the literature. Several examples and applications to functional equations arising in dynamic programming are also given in order to illustrate the effectiveness of the obtained results.
Checkpointing Workflows for Fail-Stop Errors
2017
International audience; We consider the problem of orchestrating the exe- cution of workflow applications structured as Directed Acyclic Graphs (DAGs) on parallel computing platforms that are subject to fail-stop failures. The objective is to minimize expected overall execution time, or makespan. A solution to this problem consists of a schedule of the workflow tasks on the available processors and of a decision of which application data to checkpoint to stable storage, so as to mitigate the impact of processor failures. For general DAGs this problem is hopelessly intractable. In fact, given a solution, computing its expected makespan is still a difficult problem. To address this challenge,…
Maintenance Planning For The Reliability Maximization In A Large System With Vagueness In The Reliability Values Of Some Components
2015
This paper tackles the problem to single out the maintenance actions to be executed on a production system during the planned stop of given length. In detail, from a reliability viewpoint the system is assimilated as a series-parallel multi-component system and the maintenance actions need to maximize the system reliability up to the next planned stop. Moreover, it is assumed that some components reliability values are affected by vagueness within a given range. To solve the considered problem, an exact dynamic programming algorithm suitable to quickly point out the maintenance scheduling is developed and, moreover, it is formulated a proper parameter able to express the robustness of the o…
GSWABE: faster GPU-accelerated sequence alignment with optimal alignment retrieval for short DNA sequences
2014
In this paper, we present GSWABE, a graphics processing unit GPU-accelerated pairwise sequence alignment algorithm for a collection of short DNA sequences. This algorithm supports all-to-all pairwise global, semi-global and local alignment, and retrieves optimal alignments on Compute Unified Device Architecture CUDA-enabled GPUs. All of the three alignment types are based on dynamic programming and share almost the same computational pattern. Thus, we have investigated a general tile-based approach to facilitating fast alignment by deeply exploring the powerful compute capability of CUDA-enabled GPUs. The performance of GSWABE has been evaluated on a Kepler-based Tesla K40 GPU using a varie…