Autonomous Navigation in Unknown Environments With Sparse Bayesian Kernel-Based Occupancy Mapping

Thai Duong

doi:10.1109/TRO.2022.3177950

Return

Autonomous Navigation in Unknown Environments With Sparse Bayesian Kernel-Based Occupancy Mapping

2022-12-01

Thai Duong *

Michael C. Yip

Nikolay Atanasov

DOI：10.1109/TRO.2022.3177950

Original

Original request for help

Save

Abstract

En 中文

This article focuses on online occupancy mapping and real-time collision checking onboard an autonomous robot navigating in a large unknown environment. Commonly used voxel and octree map representations can be easily maintained in a small environment but have increasing memory requirements as the environment grows. We propose a fundamentally different approach for occupancy mapping, in which the boundary between occupied and free space is viewed as the decision boundary of a machine learning classifier. This work generalizes a kernel perceptron model which maintains a very sparse set of support vectors to represent the environment boundaries efficiently. We develop a probabilistic formulation based on relevance vector machines, handling measurement noise, and probabilistic occupancy classification, supporting autonomous navigation. We provide an online training algorithm, updating the sparse Bayesian map incrementally from streaming range data, and an efficient collision-checking method for general curves, representing potential robot trajectories. The effectiveness of our mapping and collision checking algorithms is evaluated in tasks requiring autonomous robot navigation and active mapping in unknown environments.

Keywords:

Support vector machines

Autonomous systems

Trajectory

Navigation

Collision avoidance

Bayes methods

Autonomous navigation

collision avoidance

kernel-based occupancy mapping

relevance vector machine (RVM)

sparse Bayesian classification