2024-12-14
00:13 |
Calculating Electric Vehicle Range Using Dynamic Programming with Battery Current and Velocity Setpoints
Sedláček, O. ; Uglickich, Evženie
This work was made during an internship at Institute of Information Theory and Automation organized by Otevřená věda. The effort put into this internship resulted in a program simulating and predicting the range of a BMW i3 60 Ah electric car using Bayesian estimation of regression model and optimal control with dynamic programming. After a dataset is entered, the program trains models to be used for the simulation and then allows you to set setpoints to a vehicle speed or battery current. Once the simulation with the setpoints is completed, it will return the speed at which the car was traveling, how much current was drawn from the battery, and the range of the electric vehicle traveling at that speed. In addition, the graph of the ride of the simulated car is shown after the computation. We have used the driving data of the BMW i3 60 Ah electric car from publicly available datasets.
Úplný záznam
|
2024-12-14
00:13 |
DISTRIBUTION STRATEGY PLANNING FOR LAST-MILE DELIVERY AMID POTENTIAL URBAN POLICY TRAFFIC CHANGES: A DECISION MAKING MODEL APPROACH
Plajner, Martin ; Petřík, T.
In our prior research, we formulated a technique for planning distribution strategy amid future uncertainties. Conventional planning methods, which involve designing potential scenarios and defining probabilities, frequently face difficulties because of unforeseeable future events. Suboptimal strategies can emerge if the probabilities were assigned incorrectly at the beginning. The contribution of this article is a new method that avoids making rigid assumptions about the exact probability of each future scenario. Instead, it explores the entire allowable probability space and selects an optimal strategy in most situations. In the case study, the method’s usability is shown on a real-world company operating in Prague. We use it to model the impact of a city policy on the company’s operations within the city limits. Due to the frequent traffic restrictions in other major European cities and the overall trend of following more environmentally friendly policies, Prague is also expected to take this path. Accordingly, the company's operations could be significantly affected. By utilizing historical delivery data from the company and specialized simulation software, we model diverse distribution network scenarios under potential traffic restrictions, already in effect in other European cities, and probabilistically assess the future the company is facing.
Úplný záznam
|
2024-11-26
10:48 |
A tribute to Klir’s research on entropy for belief functions
Jiroušek, Radim ; Kratochvíl, Václav
This is a short paper to remind us that although Prof. George Klir passed away eight years ago, his ideas are still alive. He was one of the first to have the idea to extend information theory beyond probability theory and to see the potential of fuzzy sets and belief functions. Some of the problems he raised have not yet been satisfactorily solved. In this paper, we take a fresh look at the problem of what properties entropy should have if it is to be considered a measure of information. Based on these requirements, we consider 24 definitions of entropy for belief functions and study how well they satisfy the proposed conditions.
Úplný záznam
|
2024-11-26
10:48 |
On cardinalities of different degrees of Belief functions conjunctive conflictness
Daniel, Milan ; Kratochvíl, Václav
This paper examines mutual conflict behavior between belief function structures across different discernment frame sizes (\(\Omega\)). Through experiments on \(\Omega_2\) to \(\Omega_6\), we observe that as frame size increases, non-conflicting pairs and higher-order hidden conflicts become exceedingly relatively rare despite the exponential growth of cardinalities of their classes. The super-exponential growth of possible belief structures complicates exhaustive analysis, leading us to employ random sampling. Our findings reveal that the cardinality of a class of first-degree hidden conflicts (HC\(_1\)) grows faster than non-conflicts as frame size increases, highlighting the challenges and implications of applying belief function theory in complex decision-making scenarios.
Úplný záznam
|
2024-11-26
10:48 |
Úplný záznam
|
2024-11-10
00:01 |
On combinatorial descriptions of faces of the cone of supermodular functions
Studený, Milan
This paper is to relate five different ways of combinatorial description of non-empty faces of the cone of supermodular functions on the power set of a finite basic set N. Instead of this cone we consider its subcone of supermodular games; it is also a polyhedral cone and has the same (= isomorphic) lattice of faces. This step allows one to associate supermodular games with certain polytopes in N-dimensional real Euclidean space, known as cores (of these games) in context of cooperative game theory, or generalized permutohedra in context of polyhedral geometry. Non-empty faces of the supermodular cone then correspond to normal fans of those polytopes. This (basically) geometric way of description of faces of the cone then leads to the combinatorial ways of their description.\n\nThe first combinatorial way is to identify the faces with certain partitions of the set of enumerations of N, known as rank tests in context of algebraic statistics. The second combinatorial way is to identify faces with certain collections of posets on N, known as (complete) fans of posets in context of polyhedral geometry. The third combinatorial way is to identify the faces with certain coverings of the power set of N, introduced relatively recently in context of cooperative game theory under name core structures. The fourth combinatorial way is to identify the faces with certain formal conditional independence structures, introduced formerly in context of multivariate statistics under name structural semi-graphoids.\nThe fifth way is to identify the faces with certain subgraphs of the permutohedral graph, whose nodes are enumerations of N. We prove the equivalence of those six ways of description of non-empty faces of the supermodular cone. This result also allows one to describe the faces of the polyhedral cone of (rank functions of) polymatroids over N and the faces of the submodular cone over N: this is because these cones have the same face lattice as the supermodular cone over N. The respective polytopes are known as base polytopes in context of optimization and (poly)matroid theory.
Úplný záznam
|
2024-11-02
00:00 |
Economic Policy Uncertainty in Europe: Spillovers and Common Shocks
Baxa, Jaromír ; Šestořád, T.
This paper proposes a novel approach to decompose the Economic Policy Uncertainty indices of European countries into the common and country-specific components using the time-varying total connectedness. Then, by employing a Bayesian panel VAR model, we assess how common and country-specific uncertainty shocks influence economic activity, prices, and monetary policy, with the shocks identified using zero and sign restrictions. Our results reveal that only common shocks have significant effects on all macroeconomic variables. This result is robust across alternative samples and structural identifications. Therefore, our findings imply that policymakers should focus on uncertainty shocks that are synchronized across countries.
Úplný záznam
|
2024-11-02
00:00 |
Uncertain trends in economic policy uncertainty
Buliskeria, Nino ; Baxa, Jaromír ; Šestořád, T.
The news-based Economic Policy Uncertainty indices (EPU) of Germany, France, and the United Kingdom display discernible trends that can be found neither in other European countries nor in other uncertainty indicators. Therefore, we replicate the EPU index of European countries and show that these trends are sensitive to the rather arbitrary choice of normalizing the raw counts of news related to economic policy uncertainty by the count of all newspaper articles. We show that an alternative normalization by news on economic policy leads to different long-term dynamics\nwith less pronounced trends and markedly lower uncertainty during recent periods of uncertainty such as Brexit or the COVID-19 pandemic. Consequently, our results suggest that the effects of uncertainty related to these events on economic activity may have been overestimated.
Úplný záznam
|
2024-09-14
00:04 |
Applicable Adaptive Discounted Fully Probabilistic Design of Decision Strategy
Molnárová, Soňa
The work addresses the issue of decreased utility of future rewards, referred to as discounting, while utilizing fully probabilistic design (FPD) of decision strategies. FPD obtains the optimal strategy for decision tasks using only probability distributions, which is its main asset. The standard way of solving decision tasks is provided by Markov decision processes (MDP), which FPD covers as a special case. Methods of solving discounted MDPs have already been introduced. However, the use of FPD might be advantageous when solving tasks with an unknown system model. Due to its probabilistic nature, FPD is able to obtain a more precise estimation of this model. After previously introducing discounting and system model estimation to FPD, the current work examines the effect of discounting on decision processes and its possible advantages when dealing with an unknown system model.
Úplný záznam
|
2024-03-24
00:07 |
Central Moments and Risk-Sensitive Optimality in Markov Reward Processes
Sladký, Karel
In this note we consider discrete- and continuous-time Markov decision processes with finite state space. There is no doubt that usual optimality criteria examined in the literature on optimization of Markov reward processes, e.g. total discounted or mean reward, may be quite insufficient to select more sophisticated criteria that reflect also the variability-risk features of the problem. In this note we focus on models where the stream of rewards generated by the Markov process is evaluated by an exponential utility function with a given risk sensitivity coefficient (so-called risk-sensitive models).For the risk sensitive case, i.e. if the considered risk-sensitivity coefficient is non-zero, we establish explicit formulas for growth rate of expectation of the exponential utility function. Recall that in this case along with the total reward also it higher moments are taken into account. Using Taylor expansion of the utility function we present explicit formulas for calculating variance a higher central moments of the total reward generated by the |Markov reward process along with its asymptotic behaviour.
Úplný záznam
|
|
|
|
host ::
