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 22 for “"Shortest Path Algorithms"”.
-
Continuous-time dynamics shortest path algorithms
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
-
Communication complexity of distributed shortest path algorithms
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979.
-
Dynamic shortest path algorithms for IVHS applications
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1993.
-
Application of shortest path algorithms to find paths of minimum radiation dose
Presented here is the use of two path-optimization algorithms, Dijkstra's Algorithm, and the Bellman-Ford Algorithm, to find paths through radiologically contaminated environments such that the accumulated dose is minimal. Such paths will be very useful for personnel whose job requires them to …
-
Time-dependent networks : data representation techniques and shortest path algorithms with applications to transportation problems
… dynamic data, and the computation of fastest paths in continuous-time dynamic networks. We apply these methods for the following application problems: storage and communication of discrete-time dynamic transportation network data, and computation of fastest paths in traffic networks with …
-
Parallel implementations of dynamic traffic assignment models and algorithms for dynamic shortest path problems
… of macroscopic DTA models. Two loading algorithms are studied: the iterative loading algorithm and the chronological loading algorithm. For the iterative loading algorithm, two parallelization strategies are implemented: decomposition by network topology and by time. For the …
-
Performing Distance Queries on Social Networks in Sublinear Time
Shortest path computation is an important base task in many applications. While there have been improvements to the shortest path algorithms, all require preprocessing the entirety of the graph, creating inefficiencies, especially when applied to large social networks. Considering that social …
-
On labeled paths
… investigation of their intersection, the labeled paths. This dissertation examines three results in the area of labeled path problems. The first result presents an empirical analysis of two context-free labeled all-pairs shortest-path algorithms using MapReduce as the experimental platform. The …
-
Learning to route efficiently with end-to-end feedback : the value of (identifiable) networked structure
In this thesis, we introduce efficient algorithms which achieve nearly optimal instance-dependent and worst case regrets for the problem of stochastic online shortest path routing with end-to-end feedback. The setting is a natural application of the combinatorial stochastic bandits problem, a …
-
Survivability and resilience mechanisms in modern optical fibre systems
… and resilience methods are considered. Link and Path failures are discussed and Static Path Protection (SPP), Shared Backup Path Protection (SBPP), as well as Path Restoration (PR) are investigated. A Shared Backup Path Protection model and simulation tool is designed and implemented. This …
-
Enabling fast flexible planning through incremental temporal reasoning
… The ITC algorithm combines the speed of shortest-path algorithms known to network optimization with the spirit of incremental algorithms such as Incremental A* and those used within truth maintenance systems (TMS). The algorithm has been implemented and integrated into a temporal planner, …
-
Traffic prediction and navigation using historical and current information
… 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, CarTel. GPS sensor units having wireless connectivity were deployed on taxis running around the Boston area, and report …
-
Semi-automated modeling approaches to route selection in GIS
… location. The results illustrate that different shortest-path algorithms do not necessarily result in markedly different linear routes. However, differing results can occur when using different neighboring-cell links in the cell-based route network construction. Cell-based algorithmic approaches …
-
Resilient routing for MANETs
… extends to many routing metrics when used in shortest-path algorithms.
-
Models and algorithms for the optimization of traffic flows and emissions using dynamic routing and pricing
… on the development and evaluation of models and algorithms for the optimization of traffic flows and emissions via routing and pricing in dynamic traffic networks. A set of problems that arise in this context are studied. These include: (1) the development of a probabilistic approach to model …
-
Optimal Control for a Two Player Dynamic Pursuit Evasion Game; The Herding Problem
… position in the x-y grid following the local shortest path in the Euler Lagrange sense. Then, a non-holonomic realization of the two agents is proposed. In this and we show that the optimal control policy is in the form of a feedback control law that enables the pursuer to achieve the same …
-
Path planning for an autonomous vehicle
… position and arrive at a desired location. The path to this goal location must maneuver the vehicle around any obstacles and reach the goal with minimal cost. A variant of this problem tasks the UAV with tracking a moving target. In this manner the UAVs trajectory is updated through time to …
-
Enhancing OSPF to provide adaptive traffic distribution with networks for improved QoS performance
… such as OSPF in the main only use shortest-path algorithms and an arbitrarysingle metric such as hop count, for optimal path computation. Therefore, routingprotocols need to have a more complex model to support QoS requirements. The basicproblem of QoS-based routing is then to find …
-
Reliable dynamic in-vehicle navigation
… algorithm. The thesis starts by reviewing shortest path algorithms and conjectures that the most appropriate algorithm to use is A*, which forms a vital part of the approach developed. Performing multiple runs of A* forwards and backwards on the road network, efficiency of the route finding …
-
A computational model for multi-objective optimization of zero emission power plants
… to identify optimal technologies and technology pathways based on a user supplied set of evaluation criteria which allow ranking of different plants, and technology pathways, which represent different time sequences of introducing new power plant designs. This model is applied to a simple set of …
Page 1 of 2