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 129 for “"Path-finding"”.
-
Path finding in 2d games
… interest (situated in the vicinity of the direct path from the Source to the Target) are dynamically triangulated using a triangulation algorithm. The result of such a triangulation is a 2D mesh situated in the empty space available for movement. None of the edges generated by triangulation will …
-
Framework for multi-agent path finding A framework for multi-agent path finding with focus on transport systems
It is desirable to apply multi agent path finding (MAPF) algorithms to vehicles in transport systems, as it has the potential to reduce transit time and fuel consumption. However, the application is hampered by the high level of abstraction that these problems are typically solved at. This work …
-
Topographic Maps: Image Processing and Path-Finding
… presents a system to automate the process of finding routes on scanned images of topographic maps. The system allows users to select any two points on a topographic map and identify their specific preferences for their route. This system extracts terrain and contour line data from topographic …
-
Energetic Path Finding Across Massive Terrain Data
… a human-centered cost metric. By comparing the paths generated by our software with known historical trails, we demonstrate how the tool can indicate likely trails used by ancient travelers. In addition, this new tool provides novel visualizations to better help the user understand alternate …
-
Delay-tolerant Multi-Agent Path Finding: Delay-tolerant methods for solving multi-agent path finding problems in autonomous systems
Multi-agent path finding algorithms find collision-free paths that agents should follow according to a schedule. The schedules found by multi-agent path finding algorithms are strict, meaning that when a robot in an autonomous system is delayed and fall behind schedule, the schedule is invalidated …
-
Deterministic path-finding techniques for multiple gravity assist trajectories
A new deterministic algorithm is presented for automating the search for multiple gravity assist trajectories with deep space maneuvers. Unlike traditional methods that solve the integer sequencing problem independently of the search for the continuous variables, the new method simultaneously …
-
Nagivation Mesh Construction and Path-Finding for Architecture Environment
… fast development of computer science technology, path finding is kept a hot topic in research area; especially it plays an important role in game industry, video and film industry, and large model simulation. However, these approaches and underlying data structure construction are not suitable for …
-
Distributed algorithms for file sorting and shortest path finding.
… a new decentralized algorithm in shortest path finding in a distributed and synchronous network, in particular we focus on the termination detection problem. The analysis of this algorithm shows an improved complexity over previous methods. Moreover, in chapters two and three we discuss …
-
DECENTRALIZED MULTIAGENT METAREASONING APPLICATIONS IN TASK ALLOCATION AND PATH FINDING
Decentralized task allocation and path finding are two problems for multiagent systems where no single fixed algorithm provides the best solution in all environments. Past research has considered metareasoning approaches to these problems that take in map, multiagent system, or communication …
-
A* ATTACK: A NOVEL PATH-FINDING APPROACH TO ADVERSARIAL EXAMPLES
This paper presents a novel approach to exploiting a key vulnerability of deep neural networks (DNNs) to adversarial examples with a focus on the black-box machine learning as a service (MLaaS) environment. We introduce A* Attack, a unique adversarial example attack that leverages the A* Search …
-
Path-Finding With Differential Constraints In Real Time Strategy Video Games
<p>Path-finding is commonly used in video games, and is a critical feature in real time strategies. This game genre uses path-finding to move an agent such as a soldier or a vehicle from one place to another, but currently these paths are unrealistic for agents that possess differential …
-
Subdimensional expansion method for multi-agent path finding with long narrow corridors
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2027-08-01
-
New Transition State Optimization and Reaction Path Finding Algorithm with Reduced Internal Coordinates
… Chapter 4, a new algorithm to exploring reaction pathways based on redundant internal coordinates is illustrated with real chemical reactions. Last but not least, in Chapter 6, a systematic test to explore the optimal methods in each procedure is presented. A well-performed combination of …
-
Generalized Heuristic Search Algorithms with Applications to Motion Planning and Multi-Agent Path Finding Problems
… notions of relevancy to more efficiently solve path planning, motion planning and multi-agent path finding problems. The main focus of this thesis is to demonstrate how using generalized heuristics based on the relaxed notions of relevancy helps the hereto developed search algorithms focus their …
-
The combination of a global routing algorithm and a path-finding algorithm for an unmanned moving vehicle.
… routing algorithm can be used to find an optimal path from one point to another. A survey was undertaken to find an algorithm best suited for this use. Dynamic programming was selected and in combination with Lim's path-finding algorithm proved to be successful in simulated vehicle explorations …
-
Models and Algorithms for Addressing Travel Time Variability: Applications from Optimal Path Finding and Traffic Equilibrium Problems
An optimal path finding problem and a traffic equilibrium problem are two important, fundamental, and interrelated topics in the transportation research field. Under travel time variability, the road networks are considered as stochastic, where the link travel times are treated as random variables …
-
Probabilistically Robust Continuous-time Multi-Agent Path Finding Dynamic Risk Allocation and Chance-Constrained Planning under Execution Uncertainty
… and multi-robot systems use Multi-Agent Path Finding (MAPF) algorithms to coordinate collision-free routes. In real-world industrial deployments, execution uncertainties such as mechanical variations and friction inevitably cause delays. Current robust MAPF algorithms handle this either …
-
The role of calcium dependent neurotransmission in axon path finding, myelination and maintenance of specified cortical projection neuron populations
<p>The thesis examines the mechanisms involved in regulation of myelination during mammalian cortical development and the subsequent maintenance of the myelin in cortical projection neurons during adult life. Myelin in the central nervous system is produced by oligodendrocytes to ensure fast …
-
Analyse de réseaux et intégration d'une approche déductive aux systèmes d'information géographique : l'exemple du transport routier des matières dangereuses.
… and more specifically the problem of safe path finding for the transportation of dangerous goods. Most of the path finding algorithms use impedance as a unique variable for optimisation. This approach is limited, especially in the domain of dangerous goods, where quantitative and …
Page 1 of 7