Choosing where to go: mobile robot exploration
<p>For a mobile robot to engage in exploration of a-priori unknown environments it must be able to identify locations which will yield new information when visited. This thesis presents two novel algorithms which attempt to answer the question of choosing where a robot should go next in a part...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2011
|
| Subjects: |
| _version_ | 1817933046706339840 |
|---|---|
| author | Shade, RJ |
| author2 | Newman, P |
| author_facet | Newman, P Shade, RJ |
| author_sort | Shade, RJ |
| collection | OXFORD |
| description | <p>For a mobile robot to engage in exploration of a-priori unknown environments it must be able to identify locations which will yield new information when visited. This thesis presents two novel algorithms which attempt to answer the question of choosing where a robot should go next in a partially explored workspace.</p><p>To begin we describe the process of acquiring highly accurate dense 3D data from a stereo camera. This approach combines techniques from a number of existing implementations and is demonstrated to be more accurate than a range of commercial offerings. Combined with state of the art visual odometry based pose estimation we can use these point clouds to drive exploration.</p><p>The first exploration algorithm we present is an attempt to represent the three dimensional world as a continuous two dimensional surface. The surface is maintained as a planar graph structure in which vertices correspond to points in space as seen by the stereo camera. Edges connect vertices which have been seen as adjacent pixels in a stereo image pair, and have a weight equal to the Euclidean distance between the end points. Discontinuities in the input stereo data manifest as areas of the graph with high average edge weight, and by moving the camera to view such areas and merging the new scan with the existing graph, we push back the boundary of the explored workspace.</p><p>Motivated by scaling and precision problems with the graph-based method, we present a second exploration algorithm based on continuum methods. We show that by solving Laplace’s equation over the freespace of the partially explored environment, we can guide exploration by following streamlines in the resulting vector field. Choosing appropriate boundary conditions ensures that these streamlines run parallel to obstacles and are guaranteed to lead to a frontier – a boundary between explored and unexplored space. Results are shown which demonstrate this method fully exploring three dimensional environments and outperforming oft-used information gain based approaches. We show how analysis of the potential field solution can be used to identify volumes of the workspace which have been fully explored, thus reducing future computation.</p> |
| first_indexed | 2024-03-06T21:48:39Z |
| format | Thesis |
| id | oxford-uuid:4a7d5578-f354-48e9-80b4-f3c83234be5f |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-12-09T03:47:35Z |
| publishDate | 2011 |
| record_format | dspace |
| spelling | oxford-uuid:4a7d5578-f354-48e9-80b4-f3c83234be5f2024-12-08T10:18:21ZChoosing where to go: mobile robot explorationThesishttp://purl.org/coar/resource_type/c_db06uuid:4a7d5578-f354-48e9-80b4-f3c83234be5fInformation engineeringRoboticsEnglishOxford University Research Archive - Valet2011Shade, RJNewman, P<p>For a mobile robot to engage in exploration of a-priori unknown environments it must be able to identify locations which will yield new information when visited. This thesis presents two novel algorithms which attempt to answer the question of choosing where a robot should go next in a partially explored workspace.</p><p>To begin we describe the process of acquiring highly accurate dense 3D data from a stereo camera. This approach combines techniques from a number of existing implementations and is demonstrated to be more accurate than a range of commercial offerings. Combined with state of the art visual odometry based pose estimation we can use these point clouds to drive exploration.</p><p>The first exploration algorithm we present is an attempt to represent the three dimensional world as a continuous two dimensional surface. The surface is maintained as a planar graph structure in which vertices correspond to points in space as seen by the stereo camera. Edges connect vertices which have been seen as adjacent pixels in a stereo image pair, and have a weight equal to the Euclidean distance between the end points. Discontinuities in the input stereo data manifest as areas of the graph with high average edge weight, and by moving the camera to view such areas and merging the new scan with the existing graph, we push back the boundary of the explored workspace.</p><p>Motivated by scaling and precision problems with the graph-based method, we present a second exploration algorithm based on continuum methods. We show that by solving Laplace’s equation over the freespace of the partially explored environment, we can guide exploration by following streamlines in the resulting vector field. Choosing appropriate boundary conditions ensures that these streamlines run parallel to obstacles and are guaranteed to lead to a frontier – a boundary between explored and unexplored space. Results are shown which demonstrate this method fully exploring three dimensional environments and outperforming oft-used information gain based approaches. We show how analysis of the potential field solution can be used to identify volumes of the workspace which have been fully explored, thus reducing future computation.</p> |
| spellingShingle | Information engineering Robotics Shade, RJ Choosing where to go: mobile robot exploration |
| title | Choosing where to go: mobile robot exploration |
| title_full | Choosing where to go: mobile robot exploration |
| title_fullStr | Choosing where to go: mobile robot exploration |
| title_full_unstemmed | Choosing where to go: mobile robot exploration |
| title_short | Choosing where to go: mobile robot exploration |
| title_sort | choosing where to go mobile robot exploration |
| topic | Information engineering Robotics |
| work_keys_str_mv | AT shaderj choosingwheretogomobilerobotexploration |