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 14 of 14 for “"Stochastic shortest path"”.
-
Stochastic shortest path games : theory and algorithms
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.
-
Stochastic shortest path algorithm based on Lagrangian relaxation
… and design parameters also change. Hence, taking stochastic variations into account, probability distributions are used as edge weights to form statistical graph structures. General applications in VLSI circuit design, such as timing analysis, buffer insertion, and maze routing, can be formulated …
-
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 …
-
Traffic prediction and navigation using historical and current information
… with uncertainty of road traffic conditions by stochastic modeling of road networks. Our system consists of a data collecting system, a data management system, and a path planning system. First, the data collecting system gathers real-time travel time data using a mobile sensor network system, …
-
Energy-efficient relay cooperation for lifetime maximization
… finite transmission power levels, we propose a stochastic shortest path approach which gives the optimal relay selection decision to maximize the network lifetime. Due to the high computational complexity, a suboptimal prediction-based relay selection algorithm, directly coming from previous …
-
Combining local and global optimization for planning and control in information space
… formulated abstractly as a partially observable stochastic shortest path (POSSP) problem. We assume that the feature-based map of a region is available to assist the robot's decision-making. The POBRM is a two-phase algorithm that combines local and global optimization. In an offline phase, we …
-
Balancing actuation energy and computing energy in low-power motion planning
… 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 computing energy since computing energy is no longer negligible. We propose …
-
Acceleration of Iterative Methods for Markov Decision Processes
… cost problems that can be formulated as the stochastic shortest path problem. The performance improvement is significant, while the implementation of the operator into the value iteration is trivial. Numerical studies show that the accelerated methods can be hundreds of times more efficient …
-
Adaptive optimization problems under uncertainty with limited feedback
… of a quantity known as regret. First, we study stochastic shortest path problems with a deadline imposed at the destination when the objective is to minimize a risk function of the lateness. To capture distributional ambiguity, we assume that the arc travel times are only known through …
-
Completion Delay Minimization for Instantly Decodable Network Coding
… then formulate the completion delay problem as a stochastic shortest path (SSP) problem, which turns out to be of extremely large dimensions that makes its optimal solution intractable. Nonetheless, we exploit the structure of this SSP and the evolution of the coding opportunities to design …
-
Modeling Customer Behavior for Revenue Management
… is shown to be equivalent to a two-dimensional stochastic shortest path problem, with continuous state and control space, and solved using approximate dynamic programming. We calibrate the golfer model to professional and amateur player data, and use the calibrated model to answer several …
-
LEARNING UNDER STRUCTURE AND UNCERTAINTY: ALGORITHMS FOR BANDIT AND ONLINE DECISION MAKING
… submodular functions. Finally, we consider the Stochastic Shortest Path problem, where the additional structure is dictated by an underlying Markov Decision Process. We analyze the impact of sparse cost feedback, demonstrating that standard methods fail to exploit it. We design a novel family of …
-
Freight demand modeling and logistics planning for assessment of freight systems' environmental impacts
… 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 all commodity types that begin and end in each geographical region in the U.S., …
-
Fast numerical algorithms for optimal robot motion planning
… the proposed numerical algorithms to solve a stochastic optimal motion planning problem.