Efficient Dense Frontier Detection for 2D Graph SLAM Based on Occupancy Grid Submaps

February 28, 2019 Β· Declared Dead Β· πŸ› IEEE Robotics and Automation Letters

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Juraj OrΕ‘uliΔ‡, Damjan MikliΔ‡, Zdenko KovačiΔ‡ arXiv ID 1902.11061 Category cs.RO: Robotics Cross-listed eess.IV Citations 33 Venue IEEE Robotics and Automation Letters Last Checked 6 months ago
Abstract
In autonomous robot exploration, the frontier is the border in the world map between the explored space and unexplored space. The frontier plays an important role when deciding where in the environment the robots should go explore next. We examine a modular control system pipeline for autonomous exploration where a 2D graph SLAM algorithm based on occupancy grid submaps performs map building and localization. We provide an overview of the state of the art in frontier detection and the relevant SLAM concepts and propose a specialized frontier detection method which is efficiently constrained to active submaps, yet robust to SLAM loop closures.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Robotics

Died the same way β€” πŸ‘» Ghosted