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 6 of 6 for “"bug algorithms"”.

  1. Navigation in an unfamiliar environment using signal intensity

    … information than any others within the family of bug algorithms. The robot is unable to access precise information regarding position coordinates, angular coordinates, time, or odometry, but is nevertheless able to navigate itself to a goal among unknown piecewise-analytic obstacles in the plane. …

    uiuc Repository record for Navigation in an unfamiliar environment using signal intensity (opens in a new tab)

  2. RAPID VECTOR-BASED ANY-ANGLE PATH PLANNING WITH NON-CONVEX OBSTACLES

    Vector-based algorithms are novel algorithms in optimal any-angle path planning that are motivated by bug algorithms, bypassing free space by directly conducting line-of-sight checks between two queried points, and searching along obstacle contours if a check collides with an obstacle. The …

    nus Repository record for RAPID VECTOR-BASED ANY-ANGLE PATH PLANNING WITH NON-CONVEX OBSTACLES (opens in a new tab) Download file for RAPID VECTOR-BASED ANY-ANGLE PATH PLANNING WITH NON-CONVEX OBSTACLES (opens in a new tab)

  3. Leveraging Models to Improve Data Efficiency: Navigation, Reinforcement Learning, and Lie Group Convolutions

    … strike a balance between the local, sub-optimal bug algorithms and the global information, minimum path algorithms. By combining repulsive obstacle potentials with the objective, they can be implemented locally by traversing the negative gradient. Navigation functions are a particular type of …

    penn Repository record for Leveraging Models to Improve Data Efficiency: Navigation, Reinforcement Learning, and Lie Group Convolutions (opens in a new tab)

  4. Vizualizace algoritmů pro plánování cesty

    Bakalářská práce se zabývá plánováním cesty robota a návrhem programu pro vizualizaci vybraných algoritmů používaných v této oblasti. Cílem práce je vytvořit vizualizační nástroj, který umožní názorně sledovat chování různých algoritmů plánování cesty v prostředí s překážkami.

    brno-tech Repository record for Vizualizace algoritmů pro plánování cesty (opens in a new tab)

  5. Vizualizace hledání cesty pro robota

    … práce se zabývá hledáním cesty robota za pomocí Bug algoritmů a Potenciálových polí. Jsou zde popsány jednotlivé Bug algoritmy, je zde vysvětlen princip Potenciálových polí a způsob hledání cesty v těchto polích. Součástí této práce jsou také java applety sloužící pro demonstraci funkčnosti a …

    brno-tech Repository record for Vizualizace hledání cesty pro robota (opens in a new tab)

  6. Investigation on the mobile robot navigation in an unknown environment

    … with minimal sensing requirements. The Bug algorithm strategies were adapted for modelling the environment and implementing the exploration path. The second was a visual-search process, which consisted of employing appropriate image-processing techniques, and choosing a suitable …

    edithcowan Repository record for Investigation on the mobile robot navigation in an unknown environment (opens in a new tab)