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 “"Weighted Region Problem"”.

  1. Field D* pathfinding in weighted simplicial complexes

    … many environments are constructed from a set of regions that do not conform to a discrete graph. The Weighted Region Problem was proposed to address the problem of finding the shortest path through a set of such regions, weighted with values representing the cost of traversing the region. Robust …

    cape-town Repository record for Field D* pathfinding in weighted simplicial complexes (opens in a new tab)

  2. Fast numerical algorithms for optimal robot motion planning

    … requires solving the optimal motion planning problem for a mobile robot. For example, to reach the desired destination on time, a self-driving car must quickly navigate streets and avoid hazardous obstacles such as buildings or other cars, as well as provide safety for pedestrians. Our …

    uiuc Repository record for Fast numerical algorithms for optimal robot motion planning (opens in a new tab)