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 230 for “"Heuristic Search"”.
-
Speeding Up the Convergence of Online Heuristic Search and Scaling Up Offline Heuristic Search
… problem in Artificial Intelligence are heuristic search algorithms. The main contributions of this research are new heuristic search algorithms that are either faster or scale up to larger problems than existing algorithms. Our contributions apply to both online and offline tasks. For …
-
Metareasoning for Heuristic Search Using Uncertainty
Heuristic search methods are widely used in many real-world autonomous systems. Yet, people always want to solve search problems that are larger than time allows. To address these challenging problems, even suboptimally, a planning agent should be smart enough to intelligently allocate its …
-
Accelerating Heuristic Search for AI Planning
AI Planning is an important research field. Heuristic search is the most commonly used method in solving planning problems. Despite recent advances in improving the quality of heuristics and devising better search strategies, the high computational cost of heuristic search remains a barrier that …
-
Experiential Analysis of Heuristic Search Algorithms
… Algorithms responsible for this task are called search algorithms. Heuristic search techniques are an important subset of the search algorithms because of the minimum amount of time they need to find a solution. Their one drawback is the fact that they may not find the optimal solution. This …
-
Heuristic search under time and cost bounds
… problem. Therefore it makes good sense that heuristic search is a foundational topic in artificial intelligence. In this context "search" refers to the process of finding a solution to the problem by considering a large, possibly infinite, set of potential plans of action. "Heuristic" refers …
-
Motion Planning for Manipulation With Heuristic Search
Heuristic searches such as A* search are a popular means of finding least-cost plans due to their generality, strong theoretical guarantees on completeness and optimality, simplicity in implementation, and consistent behavior. In planning for robotic manipulation, however, these techniques are …
-
Example-based model refactoring using heuristic search
… these design defects. We propose to adapt three heuristic methods to suggest refactorings: 1. A single-objective optimization method based on structural similarities between a given model (i.e., the model to be refactored) and a set of examples of models (i.e., models that have undergone some …
-
Experiments in heuristic search utilizing sampling and precomputation
… size of the game tree is too large for current searching techniques to solve. One goal described in this paper is to produce a bridge-playing program that can overcome these two difficulties. This program, referred to as the Bridge-player, used two ideas, sampling and precomputation, to assist …
-
Formal symbolic verification using heuristic search and abstraction techniques
… exhaustive algorithms can be replaced with search algorithms that are directed by heuristics. Methods based on heuristics generally scale well. This thesis investigates non-exhaustive model checking algorithms and focuses on error detection in system verification. The approach is based on a …
-
Finding resilience-friendly compiler optimizations using meta-heuristic search techniques
… overall resilience. Due to the large size of the search space, we use search heuristic algorithms to efficiently explore the space and find an optimal sequence of optimizations for a given program. We find that the resulting optimization sequences have significantly higher error resilience than …
-
Tighter Bidirectional Heuristic Search and Lazy Optimal Sampling-Based Motion Planning
Heuristic search is a core area of artificial intelligence (AI) that explores state spaces using heuristic estimates to support planning and decision-making. In robotics, motion planning is a fundamental problem of computing feasible robot motion under constraints. A central challenge shared by …
-
Capability-based software project scheduling with system dynamics and heuristic search
<p>Software project management, a peculiar area in project management, is concerned with activities involved in ensuring that software is delivered on time and on schedule. Software project management is unique because software products are perceived as intangible and flexible. In software …
-
Genetic algorithms for the development of real-time multi-heuristic search strategies
Search of an unknown space by a physical agent (such as an autonomous vehicle) is unique in search as the customarily most important goal (to reduce the computation time required to obtain the shortest distance) is not as important as minimal movement. there is a real-time aspect since the agent is …
-
A heuristic search method of selecting range-range sites for hydrographic surveys
… planner in selecting navigation control sites. A search program is presented which uses a number of heuristics to select sites and guide the search for an optimal solution. The program was tested in several actual and idealized survey situations, and the results of those tests indicated that the …
-
Novel heuristic search methods for protein folding and identification of folding pathways
… of identifying folding pathways. The leading research objective for this work was to design efficient heuristic search algorithms for these problems, to empirically study these new methods and to compare them with existing algorithms. This thesis makes the following contributions: (1) we show …
-
Empirical Models of Heuristic Search in AI Planning and Neural Sequence Decoding
Heuristic search algorithms are widely used in both AI planning and the decoding of sequences from deep neural networks. In recent years, several lines of work have highlighted different factors that impact the empirical performance of heuristic search algorithms. However, a principled empirical …
-
Two graph problems: bidirectional heuristic search and the airplane seating assignment problem
… different types of graph problems, bidirectional heuristic search and airplane seating assignment. Bidirectional heuristic search is used to solve for the shortest path between two given vertices in a graph. The airplane seating assignment problem (ASAP) is to find an optimal airplane passenger …
-
Finding multi-step attacks in computer networks using heuristic search and mobile ambients
… Combinatorial Optimization, more specifically Heuristic Search, to the domain of multi-step network attacks. A variant of ambient calculus is used to model networks, and heuristic search is used to simulate attackers searching for possible attacks in the modelled network. Additionally, and in …
Page 1 of 12