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 214 for “"Pathfinding"”.

  1. Fast and optimal pathfinding

    Pathfinding (or navigating) from A to B is a common problem in Computer Science with broad practical applications in areas as diverse as digital entertainment, logistics and robotics. Pathfinding is made difficult when many variations, or symmetries, of the same path exist. Symmetry slows down …

    anu Repository record for Fast and optimal pathfinding (opens in a new tab)

  2. An Analog Architecture For Pathfinding

    … proposes a method to solve fixed-cost grid pathfinding problems without theneed for classical computing algorithms. This approach utilizes circuitry that facilitates grid traversal via the propagation of an electrical signal, rather than a computational method. Existing computational methods …

    umn Repository record for An Analog Architecture For Pathfinding (opens in a new tab)

  3. Pathfinding Algorithm Optimization Via Evolution

    Pathfinding is a popular computer science problem in both academic research and industrial development. The objective of pathfinding is to search for a path, often the shortest path, from one location to another on a graph. Many real world applications can be considered as pathfinding problems, …

    tamu Repository record for Pathfinding Algorithm Optimization Via Evolution (opens in a new tab)

  4. Enhancements to Hierarchical Pathfinding Algorithms

    In this thesis we study the problem of pathfinding in static grid-based maps. We apply the approach of abstraction and refinement. We abstract the grid map into 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 …

    denver Repository record for Enhancements to Hierarchical Pathfinding Algorithms (opens in a new tab)

  5. Otimização de pathfinding em GPU

    … e demonstram certo nível de paralelismo, como o pathfinding, utilizado na navegação de agentes durante o jogo, têm sido desenvolvidos em GPU e demonstrado um desempenho melhor quando comparado à CPU. De modo semelhante, este trabalho tem como proposta a investigação e o desenvolvimento de …

    brazil-ufpe Repository record for Otimização de pathfinding em GPU (opens in a new tab)

  6. Group Pathfinding Using Group Division

    Pathfinding is an important problem in video games. Good pathfinding strategy, for both player characters and non-player characters is one of the key differences between a good game and a less successful one. Finding the shortest path for one character unit in a given environment is a very …

    concordia Download PDF for Group Pathfinding Using Group Division (opens in a new tab)

  7. Mechanisms underlying neuronal growth cone pathfinding

    … the role of substrate adhesivity in growth cone pathfinding, we developed an in vivo assay for measuring filopodial-substrate adhesivity using the Til pioneer neuron pathway of the embryonic grasshopper limb. Using time lapse imaging and a combination of rhodamine-phalloidin injections and Dil …

    ubc Repository record for Mechanisms underlying neuronal growth cone pathfinding (opens in a new tab) Download PDF for Mechanisms underlying neuronal growth cone pathfinding (opens in a new tab)

  8. Multicriteria pathfinding in uncertain simulated environments

    … observability or by approximate representations. Pathfinding in partially observable environments is one significant context in which a decision-making agent must develop a plan of action that satisfies multiple criteria. In general, the partially observable multiobjective pathfinding problem …

    missouri Repository record for Multicriteria pathfinding in uncertain simulated environments (opens in a new tab)

  9. Abstraction Hierarchies for Multi-Agent Pathfinding

    Multi-Agent Pathfinding is an NP-Complete search problem with a branching factor that is exponential in the number of agents. Because of this exponential feature, it can be difficult to solve optimally using traditional search techniques, even for relatively small problems. Many recent optimal …

    denver Repository record for Abstraction Hierarchies for Multi-Agent Pathfinding (opens in a new tab)

  10. Using Map Decomposition to Improve Pathfinding

    … searches in large state spaces, i.e. for pathfinding and strategic decisions. Breaking the state space down into regions, with clear connections, can greatly benefit these algorithms, allowing decision making on a higher level and guiding searches in a more focused way through the search …

    reykjavik Repository record for Using Map Decomposition to Improve Pathfinding (opens in a new tab)

  11. A robust pathfinding algorithm using chemical composition

    Metabolic pathfinding is the task of finding preferred metabolic pathways from metabolic large reaction databases. Representing metabolism via networks enables quick enumeration of paths between two compounds. Automated pathfinding helps in working with ever increasing databases if reactions and in …

    uiuc Repository record for A robust pathfinding algorithm using chemical composition (opens in a new tab)

  12. Pathfinding med reinforcement learning i delvis observerbara miljöer

    … This makes them suitable candidates for solving pathfinding problems in a partially observable setting, where the aim is to find a path in an environment with restricted vision. This report aims to investigate how Markov decision processes and reinforcement learning can be used to model and solve …

    chalmers Repository record for Pathfinding med reinforcement learning i delvis observerbara miljöer (opens in a new tab)

  13. An Approach to Pathfinding for Real-World Situations

    People plan their routes through new environments every day, but what factors influence these wayfinding decisions? In a world increasingly dependent on electronic navigation assistance devices, finding a way of automatically selecting routes suitable for pedestrian travel is an important …

    whiterose Download PDF for An Approach to Pathfinding for Real-World Situations (opens in a new tab)

  14. A Complete Subgoal Graph Method for Ultra-Fast Pathfinding

    I introduce a new method for ultra-fast pathfinding on octile grids, called the Complete Subgoal Graph algorithm (CSG). This algorithm has much faster preprocessing times than similar algorithms, and also slightly faster online runtimes. The biggest drawback is that it requires a relatively large …

    anu Repository record for A Complete Subgoal Graph Method for Ultra-Fast Pathfinding (opens in a new tab)

  15. Automatic parameter selection for multi-speedmulti-agent pathfinding solver

    Multi-agent pathfinding is a study focused on finding collision-free paths for multiple agents in a shared environment in order for the agents to reach designated destinations. As the problem is well researched, more and more sophisticated algorithms are available that utilize different parameters …

    chalmers Repository record for Automatic parameter selection for multi-speedmulti-agent pathfinding solver (opens in a new tab)

  16. Pathfinding in hierarchical representation of large realistic virtual terrains

    Pathfinding is critical to virtual simulation applications. One of the most prominent pathfinding challenges is the fast computation of path plans in large and realistic virtual terrain environments. To tackle this problem, this work proposes the exploration of a quadtree structure in the …

    brazil-ufrgs Repository record for Pathfinding in hierarchical representation of large realistic virtual terrains (opens in a new tab)

  17. Scalable cooperative multi-agent pathfinding with tractability and completeness guarantees

    Pathfinding is the technique of finding a sequence of moves, forming a continuous path, to reach a goal. Multi-agent pathfinding is a challenging problem with numerous important applications, including robotics, logistics, military operations planning, disaster rescue, and computer games. Running a …

    anu Repository record for Scalable cooperative multi-agent pathfinding with tractability and completeness guarantees (opens in a new tab)

  18. Pathfinding Fast Radio Bursts Localizations using Very Long Baseline Interferometry

    Fast radio bursts (FRBs) are millisecond-duration, bright radio transients of extragalactic origin. The Canadian Hydrogen Intensity Mapping Experiment (CHIME) telescope’s CHIME/FRB instrument and other radio telescopes across the globe have detected hundreds of FRBs. Their origins are a mystery. …

    wvu Repository record for Pathfinding Fast Radio Bursts Localizations using Very Long Baseline Interferometry (opens in a new tab)

  19. Roles of Planar Cell Polarity Proteins in CoPA Axon Pathfinding

    … regulates anterior guidance. We examined CoPA pathfinding in various PCP mutants to determine if anterior-posterior (A-P) guidance of CoPAs is dependent on PCP signaling. We found that certain PCP mutants exhibited anterior pathfinding defects, with approximately half of all affected CoPAs …

    vcu Repository record for Roles of Planar Cell Polarity Proteins in CoPA Axon Pathfinding (opens in a new tab)

Page 1 of 11