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 61 for “"Heuristic Search"”.

  1. Heuristic search for manipulation planning

    … high dimensionality and multi-modality of the search space. Symbolic task planners can efficiently construct plans involving many entities but cannot incorporate the constraints from geometry and kinematics. Existing approaches to integrated task and motion planning as well as manipulation …

    mit Repository record for Heuristic search for manipulation planning (opens in a new tab)

  2. 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 …

    unh-thes Repository record for Heuristic search under time and cost bounds (opens in a new tab)

  3. 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 …

    penn Repository record for Motion Planning for Manipulation With Heuristic Search (opens in a new tab)

  4. 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 …

    uiuc Repository record for Two graph problems: bidirectional heuristic search and the airplane seating assignment problem (opens in a new tab)

  5. 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 …

    cent-lancashire Repository record for Finding multi-step attacks in computer networks using heuristic search and mobile ambients (opens in a new tab)

  6. Simultaneous Lot sizing and Lead-time Setting (SLLS)Via Queuing Theory and Heuristic search

    … nature of lead-time and lot size. In this research, a lot-sizing model is modified in such a way that it minimizes the combination of setup cost, holding cost and work-in-process cost. This proposed approach embeds an optimization routine, which is based on dynamic programming on a …

    vt Repository record for Simultaneous Lot sizing and Lead-time Setting (SLLS)Via Queuing Theory and Heuristic search (opens in a new tab)

  7. Planning under time pressure

    <p>Heuristic search is a technique used pervasively in artificial intelligence and automated planning. Often an agent is given a task that it would like to solve as quickly as possible. It must allocate its time between planning the actions to achieve the task and actually executing them. We call …

    unh-thes Repository record for Planning under time pressure (opens in a new tab)

  8. Symcretic testing of programs

    … execution uses concrete forward execution and heuristic search to find inputs that satisfy the constraints that were skipped in the first phase. A comparison with related approaches and an empirical evaluation suggest that symcretic execution finds more inputs that result in relevant executions …

    uiuc Repository record for Symcretic testing of programs (opens in a new tab)

  9. Solving general game playing puzzles using heuristics search

    … is more similar to planning algorithms than the search methods used for two- or multi-player games. General problem solving has been a topic addressed by the planning community for years. In this thesis we adapt heuristic search methods for automated planning to use in solving single-agent GGP …

    reykjavik Repository record for Solving general game playing puzzles using heuristics search (opens in a new tab)

  10. Explaining the Performance of Bidirectional Dijkstra and A* on Road Networks

    <p>The heuristic search community traditionally uses A* as the baseline algorithm for their research methods. Research papers in the road networks community, however, often build upon Dijkstra's algorithm and use Bidirectional Dijkstra's algorithm as their baseline. This thesis investigates the …

    denver Repository record for Explaining the Performance of Bidirectional Dijkstra and A* on Road Networks (opens in a new tab)

  11. Vision based robot navigation

    … planning is performed by doing bidirectional heuristic search with a discrete set of actions that account for the robot's nonholonomic constraints. The intent of this project is to create a system that allows a robot to be able to explore and to navigate in a wide variety of environments in a …

    mit Repository record for Vision based robot navigation (opens in a new tab)

  12. Automatic fault localization in concurrent programs using noising and search strategies

    … Faults Localized Automatically using Search Heuristics), an automatic fault localization tool for multithreaded Java programs. CFLASH utilizes a combination of noise-based code injection and a heuristic search algorithm to identify potentially faulty code sections containing …

    uoit Repository record for Automatic fault localization in concurrent programs using noising and search strategies (opens in a new tab)

  13. An investigation into Off-Link IPv6 host enumeration search methods

    This research investigated search methods for enumerating networked devices on off-link 64 bit Internet Protocol version 6 (IPv6) subnetworks. IPv6 host enumeration is an emerging research area involving strategies to enable detection of networked devices on IPv6 networks. Host enumeration is an …

    edithcowan Repository record for An investigation into Off-Link IPv6 host enumeration search methods (opens in a new tab)

  14. Improvement of constrained searches

    Search is ubiquitous in computer science, but most searches are performed under constraints: time, memory, dependences. We study several cases of constrained search and present methods for improving their performance. Execution of Prolog programs amounts to a search with several types of …

    uiuc Repository record for Improvement of constrained searches (opens in a new tab)

  15. Otimização de redes de distribuição de água: estudo de dois modelos

    … other model seeks optimization of the network by heuristic search of optimal diameters, based on energy costs necessary to elevation of piezometric height of the network source nodes. In case of network supplied by reservoir with prefixed height, a dummy value is adopted for the energy cost, and …

    brazil-uerj Repository record for Otimização de redes de distribuição de água: estudo de dois modelos (opens in a new tab)

  16. Mathematical models and simulations of complex social systems

    … analysis we use an adapted version of the Random Heuristic Search framework, which was originally used for the understanding of Genetic Algorithms. In this thesis we investigate the predictability power of the mathematical approach.

    birmingham Repository record for Mathematical models and simulations of complex social systems (opens in a new tab)

Page 1 of 4