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 125 for “"A* Algorithm"”.
-
A* Algorithm for Multicore Graphics Processors
… is a well known best-first shortest path finding algorithm, commonly used in computer games and robotics, to quickly find a good path in real time. We have implemented A* in CUDA, NVIDIA’s programming platform for graphics processors. Our graphics processor A* implementation is faster and more …
-
Extensions and applications of the A* algorithm
… on planning a minimum cost path using the A* algorithm. We begin by proving new theorems comparing the performance of A* to other (generalized) path finding algorithms. In some cases, A* is an optimal method in a large class of algorithms. This means, roughly speaking, that A* explores a …
-
Using the A* algorithm to build DNA nanostructures
… DNA behavior. Furthermore, the A* search algorithm was used to construct a sequence of simplex DNA strands used to build a desired DNA structure. DNA nanotechnology is a subfield of nanotechnology where DNA is used as structural material. DNA origami is an example of an accomplishment in …
-
Decomposing non-product form queueing lattices through autorouting with A* algorithm
… modes. In this thesis, Autorouting with A* algorithm is adapted to decompose it as solvable subsets which can be solved sequentially and independently. Autorouting with A* algorithm is heuristics in problem solving. It also is one of a class of global optimization problems that are difficult …
-
The Cooperative Sorting Strategy for Connected and Automated Vehicle Platoons - Online Processing A* Algorithm
… start permutation to the target permutation. A* algorithm wrote in Python could perform better with the help of the hash table and PyPy3. However, the time complexity problem still exists, which blocks it from extensive applications. Model-free Reinforcement Learning (RL) method suffers from the …
-
A greedy next-hop selection module for vehicular ad-hoc network routing using the A* algorithm method
… selection method, based on the A* path search algorithm. In addition, we developed a next-hop search-space limiting mechanism using the GLAR protocol’s baseline and DIST (distance) concepts. We utilised the EstiNet simulator to model and evaluate our designs in terms of unicast outgoing and …
-
Evaluation and Adaptation of a Constraint Optimization and Distributed, Anytime A* Algorithm to Design-To-Criteria Scheduling Problem
Scheduling complex problem solving tasks where tasks are interrelated and there are multiple different ways to go about achieving a particular task is a computationally challenging problem. In this thesis, we study current approaches to solving such complex scheduling problems, and propose two new …
-
Galvosūkio žaidimo sprendimas su A* paieška /
The essence of the work is to apply the A* algorithm in solving various puzzle games by creating artificial intelligence that will have a flair for the game and will be able to evaluate various game positions by using heuristic calculation and develop potential moves with existing knowledge that …
-
Real-time route prediction of emergency vehicles
… of Nordic Way 3. In this thesis project, an algorithm for predicting which specific path is chosen by emergency vehicle drivers is developed and implemented. The current position and destination of the emergency vehicle, as well as live data regarding traffic and incidents on the roads is …
-
Roll the Ball žaidimo sprendimas pasitelkiant euristinius metodus /
In this paper, informed algorithms for the game Roll the Ball were analyzed. Two different heuristics have been proposed in the course of the work, which are able to compute a heuristic estimate of the game position. The first heuristic was based on state endpoints, and the second one on tile …
-
Obousměrné plánování cesty
Táto bakalářská práce se zabývá plánováním cesty mobilního robota pomocí algoritmů umělé inteligence. V teoretické části jsou popsány různé přístupy k plánování cesty se zaměřením na jejich obousměrné modifikace. Dále je pozornost věnována vybraným algoritmům. V praktické části práce je kladen …
-
Μελέτη μεθόδων μη παραμετρικής φασματικής ανάλυσης για την απεικόνιση εναέριων στόχων με την χρήση ραντάρ αντίστροφης συνθετικής απεικόνισης
… the C&A complex spectral lines' estimation algorithm, the recently introduced non parametric spectral analysis method PAPES (Parameterized APES) and the recently introduced spectral lines' estimation algorithm CPAPES. Additionally a study of the performance of the recently introduced …
-
COMPARISON BETWEEN A* BASED SPLINES AND STATE LATTICE PATH PLANNING FOR AUTONOMOUS VEHICLES
… any autonomous vehicle. Path generated using the algorithms should satisfy the constraints posed by the vehicle for which the path is being generated. Along with this, the path should also be smooth enough to avoid any jerky movements by the vehicle. Many algorithms have been designed to solve …
-
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. We started with a 2013 entry program to the Grid-based Path Planning Competition, and implemented several enhancements to experiment with the tradeoff …
-
Analysis of Failures of Decoders for LDPC Codes
… using low complexity sub-optimal decoding algorithms. Iterative decoders are one such class of decoders that work on a graphical representation of a code known as the Tanner graph. Their properties have been well understood in the asymptotic limit of the code length going to infinity. …
-
Πλοήγηση αυτόνομων ρομποτικών συστημάτων
… capabilities of a robotic system. The A* algorithm is one of the most widely used path-planning methods; however, it presents limitations in terms of computational efficiency and the geometric smoothness of the paths it generates. These challenges become more pronounced in agricultural …
-
Žemėlapio reprezentacijos įtaka formuotę išlaikančiam agentų judėjimo planavimui /
… map representations -- a grid with a modified A* algorithm, Theta* search with any-angle motion and a navigation mesh with funnel post-processing -- and to identify the conditions under which each representation provides the best formation integrity and path quality. An experimental system was …
-
Algorithms and hardware for the solution of set partitioning problems
… solve these problems more efficiently. Two new algorithms, one that could exploit such hardware, are presented and evaluated in this thesis. They are similar in that they use the same bounding procedure. The first is a branch-and-bound algorithm, and the second uses the more sophisticated A* …
-
Integrating Data-driven Control Methods with Motion Planning: A Deep Reinforcement Learning-based Approach
… to address the growing need for efficient algorithms in this area. In this dissertation, a scenario and machine learning-based data-driven control approach is proposed for a path-tracking controller. Firstly, a Deep Reinforcement Learning model is developed to facilitate the control of …
Page 1 of 7