Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 77 for “"value iteration"”.
-
Solving Large MDPs Quickly with Partitioned Value Iteration
Value iteration is not typically considered a viable algorithm for solving large-scale MDPs because it converges too slowly. However, its performance can be dramatically improved by eliminating redundant or useless backups, and by backing up states in the right order. We present several methods …
-
Improved worst-case regret bounds for randomized least-squares value iteration
… work studies regret minimization with randomized value functions in reinforcement learning. In tabular finite-horizon Markov Decision Processes, we introduce a clipping variant of one classical Thompson Sampling (TS)-like algorithm, randomized least-squares value iteration (RLSVI). Our …
-
Two essays on dynamic programming and reinforcement learning
… both dynamic programming (DP) methods, i.e., value iteration and policy iteration, are commonly used to solve MDPs/SMDPs, value iteration is easier to apply than policy iteration. The existing value iteration algorithms for average reward SMDPs have some noteworthy limitations, which are …
-
Uniform positive recurrence and long term behavior of Markov decision processes, with applications in sensor scheduling
… relating to stability, optimal control, and value iteration algorithms for discrete-time Markov decision processes (MDPs). First, we adapt two recent results in controlled diffusion processes to suit countable state MDPs by making assumptions that approximate continuous behavior. We show that …
-
Acceleration of Iterative Methods for Markov Decision Processes
… widely employed to solve MDP problems include value iteration and policy iteration. Although simple to implement, these approaches are, nevertheless, limited in the size of problems that can be solved, due to excessive computation required to find close-to-optimal solutions. My thesis proposes …
-
Value methods for efficiently solving stochastic games of complete and incomplete information
… problems, we develop novel and efficient value iteration algorithms to solve for game theoretic solutions. We empirically evaluate these algorithms on a range of problems, including well known benchmarks and show that our value iteration algorithms perform better than current policy …
-
GPU-based Markov decision process solver
… of MDPs various different approaches exists. Value Iteration is an algorithm which falls under the class of Dynamic Programming methods and can be used to solve MDPs. In recent years Graphics Processing Units have been evolving rapidly from being very limited processing devices with the sole …
-
Stochastic Resource Control in Heterogeneous Wireless Networks
… computationally efficient algorithms, Structured Value Iteration and Structured Update Value Iteration. These algorithms can be used to determine the optimal policy in terms of thresholds. Although the first one is closer in its operation to the conventional Value Iteration algorithm, the second …
-
Improving Deep Reinforcement Learning Using Graph Convolution and Visual Domain Transfer
… Among these contributions is the generalized value iteration network (GVIN) algorithm, which is an end-to-end neural network planning module extending the work of Value Iteration Networks (VIN). GVIN emulates the value iteration algorithm by using a novel graph convolution operator, which …
-
Approximate Dynamic Programming with Applications
… control problem is characterized by the optimal value function. For a large class of problems the optimal value function must satisfy a Hamilton-Jacobi-Bellman type equation. Two common methods for solving such equations are policy iteration and value iteration. Both these methods are studied in …
-
Localisation and navigation in GPS-denied environments using RFID tags
… tags are used for localisation, subsequently value iteration is used to navigate to a defined goal. Results are presented, concluding that it is feasible to localise and navigate using only RFID tags, in simulation. Localisation feasibility is also confirmed by experimental measurements.
-
Dynamic routing and information sharing for connected and autonomous vehicles
… based on the freeway instance and employ the value iteration algorithm to solve the problem by finding optimal policy. Numerical experiments, which are conducted on different networks, reveal the similar results about MDP model for a single CAV: if the vehicle gets the incident information, …
-
Piecewise linear Markov decision processes with an application to partially observable Markov models
… improvement and successive approximation or value iteration to a general class of Markov decision processes with discounted costs. In particular, a class of Markov decision processes, called piecewise-linear, is studied. Piecewise-linear processes are characterized by the property that the …
-
Stability analysis and optimal control of large-scale stochastic systems
… property relating the running cost to the value function which is the solution of the average cost problem. In addition, we show that the value iteration algorithm converges to this solution. Further, we show that the suboptimal policies provided by the rolling horizon truncation of the …
-
SPORTS STRATEGY ANALYTICS USING PROBABILISTIC MODEL CHECKING AND MACHINE LEARNING
… approach to team sports, using an approximated value iteration algorithm combined with Adaptive Q-value Tree Search to approximate winning chance accurately. This new method is generic and can be applied beyond sports analytics into other domains.
-
Interference Management and Call Admission Control in Two-Tier Cellular Wireless Networks
… formulated as Semi-Markov Decision Process and Value Iteration Algorithm is used to obtain optimal admission control policy. Performance of this framework is evaluated through simulations. The performance evaluation results show that the proposed framework outperforms traditional non-optimized …
-
Challenges and Strategies in Neuromorphic Algorithm Development: A Comparative Study Across the Stack
… Markov reward and decision processes with value iteration, and performance of inference tasks in extreme conditions at the edge. In addition to highlighting challenges and strategies, this work contributes to the growing library and foundational knowledge of algorithms for neuromorphic …
-
Runtime Adaptation in Embedded Computing Systems using Markov Decision Processes
… The novel solver algorithm, Sparse Parallel Value Iteration (SPVI), makes use of the parallel processing capabilities provided by such GPUs, and also exploits the sparsity that typically exists in MDPs when used to model and control ECSs. To extend the applicability of the runtime adaptation …
-
On the Optimality of the Greedy Policy for Battery Limited Energy Harvesting Communications
… is analyzed for several examples. Furthermore, value iteration method is applied for solving the Bellman equation to obtain the optimal power allocation policy. The optimal policy is analyzed for several examples.
Page 1 of 4