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 2 of 2 for “"bidirectional heuristic search"”.

  1. Two graph problems: bidirectional heuristic search and the airplane seating assignment problem

    … covers two 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 …

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

  2. Vision based robot navigation

    … Motion 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 …

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