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 82 for “"graph search"”.
-
INTERACTIVE GRAPH SEARCH: ALGORITHMS AND ANALYSES
The interactive graph search (IGS) problem aims to locate an initially unknown target node in hierarchy leveraging sequential interactive queries. The main efficiency goal asks for the minimum number of queries to identify the correct target node. In this thesis, we develop cost-effective …
-
Large-vocabulary continuous-speech recognition using partitioned graph search
Thesis (Ph. D.)--Michigan State University. Department of Electrical Engineering, 1993
-
Towards a concurrent implementation of keyword search over relational databases.
… keyword queries. We further this by implementing graph search, allowing users to automatically discover related facts of information. The effects of performing graph search concurrently are explored, revealing a substantial reduction in graph search run-time over the serial implementation.
-
Deep reinforcement learning on 1-layer circuit routing problem
… the routing problem is solved using graph search techniques such as Lee’s algorithm. The result produced by graph search algorithms relies heavily on the order of routing. While some simple heuristics are available, the result is not stable because simple heuristics take greedy …
-
On End Vertices of Search Algorithms
Given a graph G=(V,E), a vertex ordering of G is a total order v1,v2,...,vn of V. A graph search algorithm is a systematic method for visiting each vertex in a graph, naturally producing a vertex ordering of the graph. We explore the problem of determining whether a given vertex in a graph can be …
-
Path Planning For Persistent Surveillance Applications Using Fixed-Wing Unmanned Aerial Vehicles
… elevate the importance of optimized paths. Researchers have devel oped a diverse range of solutions for persistent surveillance applications but few directly address dynamic maneuver constraints. The key feature of C1 is a two stage sequential solution that discretizes the problem so that …
-
A disassembly model for end-of-life products recycling
The proposed research focuses on reducing the volume of solid waste and extending the life cycle of nature's resources. Today, most electromechanical products cannot be recycled because they cannot be easily disassembled. Simultaneously dealing with the disassembly constraints, cost, and material …
-
Planning With Adaptive Dimensionality
… the state-space. It iteratively constructs and searches a hybrid state-space consisting of both abstract and non-abstract states. Initially the state-space consists only of abstract states, and regions of non-abstract states are selectively introduced into the state-space in order to maintain …
-
Complex Relation Discovery from the Semantic Web
… between entities in a dataset based on graph search model. We considered three fictitious datasets for the experiment. The outcome showed sequences and connections among the nodes and how the nodes are semantically inter-related.
-
Computational modelling of agent based path planning and the representation of human wayfinding behaviour within egress models
… of the environment, implementation of graph search algorithms to generate choice set of routes for the agents to choose from, determination of factors that influence people‟s wayfinding behaviour and the development/integration of the agent based wayfinding model within the …
-
Advanced Path Planning and Collision Avoidance Algorithms for UAVs
… aircraft. Particularly it contributes to research on path optimization, tra jectory tracking and collision avoidance with two algorithms designed respectively for path planning and navigation. The complete system generates the shortest path from start to target avoiding known obstacles …
-
MATRIX: Manipulator Avoidance Trajectories via Reactive, Integrated eXtreme-scale computing
… motion planning algorithms using parallel graph search techniques. Two progressively refined implementations are introduced, each designed to balance computational efficiency with manipulator compatibility. Building on this foundation, a hash-distributed multi-goal graph search algorithm is …
-
DISCRETE COMPLIANT MOTION PLANNING SYSTEM FOR ROBOTIC ASSEMBLY
… they are connected is modeled with an adjacency graph/sub-graph, where nodes represent qualitative contact states and spatially adjacent contact states are connected by arcs. Each arc represents a desired contact state transition. The CMSP receives contact state transition event from an on-line …
-
Propagating A* searching state graphs in order to find a valid instrument approach configuration
… intelligent path planning and computer graphics-based collision detection techniques are used to find valid approach procedures that are compliant with the requirements set forth by the Federal Aviation Administration. A variant of the classic A* graph search algorithm is introduced that …
-
Collision Free and Energitaclly Optimized Motion Planning of Manipulators in Partially-Known Environment Using Modified D* Life Algorithm
… of the modeling phase of the study is fed to the graph search algorithm as an input. Graph search algorithm deals with the start-to-goal node problem in which the best path in a network of nodes is desired. D* Lite algorithm is one the most well-known algorithms in dealing efficiently with the …
-
Visualization tools for moving objects
… PRMs are roadmap-based methods that generate a graph or roadmap where the nodes represent collision-free configurations and the edges represent feasible paths between those configurations. PRMs typically consist of two phases: roadmap con- struction, where a roadmap is built, and query, where …
-
Optimizing dynamic mesh colliders using search algorithms
… objects near the larger mesh. Smart-Mesh uses graph search algorithms, including Best-First Search and Breadth-First Search, to find and collect a set of vertices that are closest to other colliding objects. Through these optimizations and others mentioned in this report, the complexity of …
-
Probabilistic roadmaps in uncertain environments
… are an efficient method for generating motion graphs through the robot's configuration space, but do not inherently represent any uncertainty in the environment. In this thesis, the physical domain is abstracted into a graph search problem where the states of some edges are unknown. This is …
-
Cache-Efficient Graph Algorithms for Near Neighbor Search
Graph search has recently become one of the most successful algorithmic trends for near neighbor search. Several of the most popular and empirically successful algorithms are, at their core, a simple walk along a pruned near neighbor graph. Such methods consistently outperform other approaches and …
-
Leveraging multiple sources of information to search continuous spaces
… problem and makes it an active area of research in robotics and beyond.</p> <p>This thesis demonstrates how different types of information can be leveraged to solve the path planning problem more effectively. Optimization-specific information can guide the search towards high-quality …
Page 1 of 5