arrow
Return

An incremental nonparametric Bayesian clustering-based traversable region detection method

delete2016-07-02
delete7
PRE
AI
H
Honggu Lee
K
Kiho Kwak
S
Sungho Jo *
DOI:10.1007/s10514-016-9588-7delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Navigation capability in complex and unknown outdoor environments is one of the major requirements for an autonomous vehicle and a robot that perform tasks such as a military mission or planetary exploration. Robust traversability estimation in unknown environments would allow the vehicle or the robot to devise control and planning strategies to maximize their effectiveness. In this study, we present a self-supervised on-line learning architecture to estimate the traversability in complex and unknown outdoor environments. The proposed approach builds a model by clustering appearance data using the newly proposed incremental non-parametric Bayesian clustering algorithm. The clusters are then classified as being either traversable or non-traversable. Because our approach effectively groups unknown regions with similar properties, while the vehicle is in motion without human intervention, the vehicle can be deployed to new environments by automatically adapting to changing environmental conditions. We demonstrate the performance of the proposed clustering algorithm through intensive experiments using synthetic and real data and evaluate the viability of the traversability estimation using real data sets collected in outdoor environment.
Keywords:
Autonomous driving
Incremental clustering
Self-supervised learning
Dirichlet process mixture model
Traversability prediction
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Autonomous Robots cover
Autonomous Robots
IF:
4.3
Papers:
1.7K
Citations:
5.0K

Organization

A
agency of defense development (add), republic of korea
Scholars:
1.3K
Papers: 1.4K
Citations: 3