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 “"Next Best Viewpoint."”.

  1. Scouting algorithms for field robots using triangular mesh maps

    … two-stage exploring policy was used to plan the next best viewpoint by considering both the distance and elevation change in the cost function. A greedy exploration algorithm based on the energy cost function was developed; the energy cost function not only considers the traveling distance, but …

    sask Repository record for Scouting algorithms for field robots using triangular mesh maps (opens in a new tab)

  2. Efficient algorithms and a two-stage framework for autonomous exploration of complex 3D environments using a climbing robot

    … a position on a surface. In this approach, the Next Best Viewpoint is selected first by evaluating and choosing between candidate viewpoints that are within a bounded range of the robot’s current position. NNEA is demonstrated in experiments in a real bridge environment for the case of a high …

    uts Repository record for Efficient algorithms and a two-stage framework for autonomous exploration of complex 3D environments using a climbing robot (opens in a new tab)