Robotic Mapping with Polygonal Random Fields

07/04/2012
by   Mark Paskin, et al.
0

Two types of probabilistic maps are popular in the mobile robotics literature: occupancy grids and geometric maps. Occupancy grids have the advantages of simplicity and speed, but they represent only a restricted class of maps and they make incorrect independence assumptions. On the other hand, current geometric approaches, which characterize the environment by features such as line segments, can represent complex environments compactly. However, they do not reason explicitly about occupancy, a necessity for motion planning; and, they lack a complete probability model over environmental structures. In this paper we present a probabilistic mapping technique based on polygonal random fields (PRF), which combines the advantages of both approaches. Our approach explicitly represents occupancy using a geometric representation, and it is based upon a consistent probability distribution over environments which avoids the incorrect independence assumptions made by occupancy grids. We show how sampling techniques for PRFs can be applied to localized laser and sonar data, and we demonstrate significant improvements in mapping performance over occupancy grids.

READ FULL TEXT

Authors

page 3

page 7

page 8

04/30/2020

Analysis of Spherical Monofractal and Multifractal Random Fields with Cosmological Applications

The Rényi function plays an important role in the analysis of multifract...
12/17/2020

On the chromatic numbers of signed triangular and hexagonal grids

A signed graph is a simple graph with two types of edges. Switching a ve...
07/07/2021

Distance covariance for random fields

We study an independence test based on distance correlation for random f...
07/01/2020

On Elastic Geodesic Grids and Their Planar to Spatial Deployment

We propose a novel type of planar-to-spatial deployable structures that ...
06/29/2020

Confidence-rich grid mapping

Representing the environment is a fundamental task in enabling robots to...
09/19/2018

Probabilistic completeness of RRT for geometric and kinodynamic planning with forward propagation

The Rapidly-exploring Random Tree (RRT) algorithm has been one of the mo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.