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 192 for “"DIjkstra"”.
-
Rineke Dijkstra and Contemporary Subjectivity
… work of contemporary Dutch photographer Rineke Dijkstra (b. 1959) complicates how we understand subjectivity, or the way that humans come into being and exist in the world, by both reinforcing and countering the idea that the subject is a product of social relations. Dijkstra's large-scale …
-
Dijkstra-like ordered upwind methods for solving static Hamilton-Jacobi equations
… of equations can be efficiently computed using a Dijkstra-like method in a single pass through the grid nodes in order of nondecreasing value. We develop two Dijkstra-like methods for solving two subclasses of static HJ PDEs. The first method is an extension of the Fast Marching Method for …
-
Explaining the Performance of Bidirectional Dijkstra and A* on Road Networks
… networks community, however, often build upon Dijkstra's algorithm and use Bidirectional Dijkstra's algorithm as their baseline. This thesis investigates the performance of A* and Bidirectional Dijkstra in road networks to see how they compare and to see if there is a principled explanation for …
-
Hybrid PSO-PWL-Dijkstra approach for path planning of non holonomic platforms in dense contexts
Planning is an essential capability for autonomous robots. Many applications impose a diversity of constraints and traversing costs in addition to the usually considered requirement of obstacle avoidance. In applications such as route planning, the use of dense properties is convenient as these …
-
Simulación heurística basado en Algoritmos Dijkstra para el suministro constante de mineral en la chancadora primaria en una mina a tajo abierto en el sur de Perú
… un sistema de simulación heurístico denominado DijkstraMine, integrando el algoritmo de Dijkstra para el ruteo dinámico de la flota de camiones en tiempo real. La investigación abarca el modelado topográfico y la simulación de eventos discretos de las rutas operativas desde los frentes de …
-
Online Unmanned Ground Vehicle Mission Planning using Active Aerial Vehicle Exploration
… Both identify frontiers for exploration with the Dijkstra Frontier method using Dijkstra's Algorithm to identify a frontier with unknown space, and the other uses a bi-directional RRT to identify multiple frontiers for selection. The final algorithm developed was for to give the UGV partial plans …
-
The Approach-dependent, Time-dependent, Label-constrained Shortest Path Problem and Enhancements for the CART Algorithm with Application to Transportation Systems
… Shortest Path (PSP) algorithm and the Heap-Dijkstra (HP-Dijkstra) algorithm, and present related theoretical complexity results. In addition, we also explore various heuristic methods to curtail the search. We explore an Augmented Ellipsoidal Region Technique (A-ERT) and a Distance-Based …
-
SAFE NAVIGATION: ROUTE PLANNING IN CONTESTED ENVIRONMENTS USING SHORTEST PATH ALGORITHMS
… segments for analysis. Utilizing DP algorithms Dijkstra and A*, we show safe-path finding (SPF) solutions across the two road networks. Our results demonstrate that the A* algorithm on safety-annotated graphs improves computational performance from baseline Dijkstra, and DP solutions can …
-
Kompiuterinio žaidimo "Pilies gynimas" kūrimas naudojant Unity platformą /
… two equal genres. An analysis of the A* and Dijkstra algorithms has been added for comparison of these two algorithms. In the part of the methodology, the main idea of the game is revealed – to change the fixed map of the usual "Tower Defence" game to a dynamically changing one in order to …
-
Optimization Algorithms for the Flight Planning Problem
… and is on average 20 times faster than the Dijkstra algorithm. In a classical TDSPP setting with piecewise-linear travel time functions, our A* outperforms the state-of-the-art approach by a factor of 15. We also propose a "pruning" technique for significantly reducing the search space of …
-
Techniques and algorithms for solving the multiobjective path optimisation problem for car navigation
… are proposed. In addition, algorithms such as Dijkstra, A* and GA are reviewed and algorithms that are applicable for solving the MOPO problems are suggested. Furthermore, new algorithms for solving least-node path (LNP) problem, corresponding to the objective of passed intersections, as well …
-
Simplificación de los procesos de decisión de Markov mediante reglamentación de acciones y priorización de estados
… más corta tales como el clásico algoritmo de Dijkstra, que está basado en colas de prioridad, han sido aplicados exitosamente a la solución de procesos de decisión de Markov de ruta determinística más corta. En esta tesis se propone un nuevo algoritmo de iteración de valor basado en el …
-
Performance Comparison of Four Token Rings in Simulated Distributed Computing Environment
… of self-stabilization was first proposed by Dijkstra. A self-stabilization token ring can make guarantee for a system to recover to a legal state in finite time, regardless of what illegal state the system is in. This property makes it a very preferable way to tolerate arbitrary transient …
-
Understanding how young people grow up well despite early childhood adversity
… is based on a previous review by Langeland and Dijkstra (1995) and critically evaluates the methodology of papers included in the review. The second paper is a piece of qualitative research using Interpretative Phenomenological Analysis to explore the lived experience of young people who witness …
-
Global Routing Protocols for Wireless Body Area Networks
… Global routing protocols are considered. The Dijkstra`s algorithm was modified using a novel link cost function in order to perform energy balancing across the network. The proposed protocol makes optimal use of the network energy and increases the network lifetime. Hardware experiments …
-
Plánování cesty pro formace robotů
… algoritmus pre jedného robota - algoritmus Dijkstra. Na základe cesty vypočítanej týmto algoritmom vypočíta navrhnutý algoritmus cestu pre každého robota formácie tak, aby sa udržal tvar formácie počas jej presunu k cielu.
-
Interaction Trees and Formal Specifications
… First, it demonstrates how to apply the Dijkstra monads (Swamy et al., 2013; Maillard et al., 2019) approach to Interaction Trees. Second, it demonstrates how to analyze the information flow properties of Interaction Trees, enabling security analysis for any programs with Interaction Tree …
-
Shortest secure path in a Voronoi Diagram
… combination of the continuous and discrete Dijkstra algorithms. We also implemented the algorithm using CGAL.
-
Collaborative Truck--Multi-Drone Delivery Systems: Scheduling and En-Route Operational Optimization
… as well as heuristic, dynamic programming, and Dijkstra-based exact methods for the truck-stop scenario. For randomly located points, Sequential Greedy consistently outperforms Parallel Greedy, achieving more deliveries, faster execution, and requiring fewer drones, particularly for smaller …
-
Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation
… 5) a family of algorithms including C*-P, C-Dijkstra, O*-MST, O*-SCDMST, O*- Dijkstra, and O*-Greedy is identified, and case studies are performed on path finding in transportation networks, and/or fully connected graphs, either directed or undirected; and 6) O*- SCDMST is adopted to …
Page 1 of 10