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 8 of 8 for “"Stochastic Shortest Path Problem"”.
-
Stochastic shortest path algorithm based on Lagrangian relaxation
… widely used and graph structure can model many problems. As technology continues to scale into nanometer design, the effects of process variation become more crucial and design parameters also change. Hence, taking stochastic variations into account, probability distributions are used as edge …
-
Balancing actuation energy and computing energy in low-power motion planning
… we identify a new class of motion planning problems in which the energy consumed by the computer while planning a path can be as large as the energy consumed by the actuators during the execution of the path. As a result, minimizing energy requires minimizing both actuation energy and …
-
Acceleration of Iterative Methods for Markov Decision Processes
… will impact the ones made the day after. Problems in Engineering, Science, and Business often pose similar challenges: a large number of options and uncertainty about the future. MDP is one of the most powerful tools for solving such problems. There are several standard methods for finding …
-
Modeling Customer Behavior for Revenue Management
… decision making upon the revenue maximization problem of a monopolist firm. First, we study the revenue maximization problem of a monopolist firm selling a homogeneous good to a market of risk-averse, strategic customers. Using a discrete (but arbitrary) valuation distribution, we show how the …
-
LEARNING UNDER STRUCTURE AND UNCERTAINTY: ALGORITHMS FOR BANDIT AND ONLINE DECISION MAKING
… captures a wide range of sequential decision problems and serves as the unifying perspective for the contributions of this thesis. We address this challenge across four distinct, fundamental problems in online learning. First, we address settings in which the learner receives no additional …
-
Risk-bounded Programming using Constrained, Hierarchical, Stochastic Shortest Path Problems
… by first framing a constrained and hierarchical stochastic shortest path problem (HC-SSP) and then solving it using an anytime algorithm. In this thesis, we present an executive named Zeppelin, which employs a divide-and- conquer approach to solving HC-SSP, leveraging the hierarchical structure …
-
Freight demand modeling and logistics planning for assessment of freight systems' environmental impacts
… to address a large-scale freight delivery problem in the U.S. freight zones and an individual truck routing problem on stochastic congested roadway networks. Following the four-step freight demand forecasting framework, we first propose a methodology to estimate future freight demand for …
-
Fast numerical algorithms for optimal robot motion planning
… requires solving the optimal motion planning problem for a mobile robot. For example, to reach the desired destination on time, a self-driving car must quickly navigate streets and avoid hazardous obstacles such as buildings or other cars, as well as provide safety for pedestrians. Our …