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 24 for “"A* algorithm"”.
-
Analysis of Dijkstra’s and A* algorithm to find the shortest path
There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. In this study, two algorithms will be focused on. This study compares the Dijkstra’s, and A* algorithm to estimate search time and distance of algorithms …
-
Enhancements to Hierarchical Pathfinding Algorithms
… a graph representation, and use the classic A* algorithm to search for a path in the abstract space, and then refine it into low-level path.</p> <p>We started with a 2013 entry program to the Grid-based Path Planning Competition, and implemented several enhancements to experiment with the …
-
Performance Evaluation of Competing Data Structures in Pathfinding
… video games and robot navigation. A pathfinding algorithm usually finds a path from the given starting point to the endpoint. Many different implementations of pathfinding solutions exist in the industry. One of the most known and used of these algorithms is A*. A* will find the shortest path …
-
Towards practical theory : Bayesian optimization and optimal exploration
… search, which includes several planning algorithms (e.g., the A* algorithm and the UCT algorithm), several optimization methods (e.g., Bayesian optimization and Lipschitz optimization), and some learning algorithms (e.g., PAC-MDP algorithms). For Bayesian optimization, this work solves an …
-
Static-task scheduling incorporating precedence constraints and deadlines in a heterogeneous-computing environment / Michael D Niedert
… Nonetheless, the choice of a heuristic algorithm greatly affects the speed of solution. This work evaluates a greedy algorithm, an A* algorithm, and a simulated annealing algorithm applied to the heterogeneous scheduling problem with deadline and dependency constraints. Tradeoffs of …
-
Implementation Of Path Planning Methods To Detect And Avoid GPS Signal Degradation In Urban Environments
… and are used as part of the path planning algorithm to provide better navigation strategies. This thesis aims to provide an implementation of A* algorithm in combination with RRT* path planning algorithm to detect and avoid areas with degraded GPS signals. The trajectory generation will …
-
Plánovaní optimální trajektorie Rn manipulátoru v prostoru s překážkami
Tato práce se zabývá navigací manipulátorů v prostoru s překážkami s využitím upraveného algoritmu A*.
-
Schedules for Dynamic Bidirectional Simulations on Parallel Computers
… of the parallel reversal schedules. First a algorithm was constructed which carries out the ``forward'' calculation and distributes checkpoints in a way, such that the reversal calculation can be started at any time. This approach provides adaptive parallel reversal schedules for simulations …
-
A perturbation approach to control of rotational/translational maneuvers of flexible space vehicles
… equations. The solution method presented is a algorithm that generates successive approximations similar to quasi-linearization. A perturbed linear optimal control problem is solved for each approximation. Examples are presented which illustrate the effectiveness of the solution methods for …
-
A* Node Search and Nonlinear Optimization for Satellite Relative Motion Path Planning
… complex constraints based on a grid search A* algorithm and compares solution results against a state-of-the-art nonlinear optimization method. Trajectories are investigated that include nonlinear constraints, such as complex keep-out-regions and thruster plume impingement, that may be required …
-
Data-driven Target Tracking and Hybrid Path Planning Methods for Autonomous Operation of UAV
… tracking method and a distributed path planning algorithm for multiple Unmanned Aerial Vehicle (UAV) operations with local dynamic networks, which can provide flexible scalability, enabling autonomous operation of a large number of UAVs in dynamically changing environment. Traditional dynamic …
-
Algoritmo numérico para projeto de sistemas hidráulicos
This work aims at the development of a algorithm within the Fluids Mechanical area to the computational installations and hydraulic systems design. It mainly consists of the development of a method of hydraulic systems design compatible to the use of computational methods connected with the design …
-
Pore-scale characterization of rock images: geometrical analysis and hydrodynamic simulation
L'abstract è presente nell'allegato / the abstract is in the attachment
-
The dynamics of geometrically compliant mooring systems
… and Newmark’s method, the generalized-a algorithm has the advantages of second-order accuracy, controllable numerical dissipation, and improved stability when applied to the nonlinear problem. The numerical program is validated using results from laboratory and field experiments. Field …
-
Optimal sensor placement for linear systems
… of the sensor placement problem to derive three algorithms. Furthermore, existing algorithms, which do not use the convex reformulation of the optimization problem, were implemented. The algorithms are compared extensively relating to execution time, performance of the chosen sensors, and the …
-
On the use of optimal search algorithms with artificial potential field for robot soccer navigation : Computer Science, Master of Science
… field with a selection of optimal search algorithms. This work investigates the performance of the method when using different optimal search algorithms such as the A* algorithm and the any-angle path-planning Theta* Search, in combination with different types of artifcial potential field …
-
Shortest Path Problems: Domain Restriction, Anytime Planning, and Multi-objective Optimization
… by an alternative version of the classical A* algorithm on graphs. We illustrate the advantages of our approach on continuous isotropic examples in 2D and 3D. We compare its efficiency and accuracy to previous domain restriction techniques and analyze the behavior of errors under the grid …
-
Patterns in the Variation of CDOM Spectral Slopes in the Western Lake Erie Basin
… of <i>S</i> variations on satellite retrieval algorithms.</p><p>In 2011, absorption spectra for over 100 Western Basin water samples were measured with a spectrophotometer, and <i>S</i>, was calculated for each sample. The spectral slope values were tested for correlation with contemporaneous …
-
Neural networks applied to ocean colour remote sensing for environmental monitoring
… leaving signal can be isolated and different algorithms exist to retrieve chlorophyll a. In open waters, blue-green ratios perform well (O’Reilly et al., 1998). In coastal waters, other water constituents (dissolved matter and sediments) make both the atmospheric correction process and the …
-
The synthesis of nearest neighbour compliant quantum circuits
… qubits from one layout to another, the A* algorithm is guaranteed to find the smallest circuit. The time complexity of A* depends on the quality of the heuristic, and this thesis proposes a new heuristic which significantly outperforms the previous heuristic, and in some circumstances is …
Page 1 of 2