English
Related papers

Related papers: Ada-Detector: Adaptive Frontier Detector for Rapid…

200 papers

In this paper we propose a planner for 3D exploration that is suitable for applications using state-of-the-art 3D sensors such as lidars, which produce large point clouds with each scan. The planner is based on the detection of a frontier -…

Robotics · Computer Science 2021-09-15 Ana Batinović , Tamara Petrović , Antun Ivanovic , Frano Petric , Stjepan Bogdan

Regression trees are a popular machine learning algorithm that fit piecewise constant models by recursively partitioning the predictor space. This paper focuses on statistical inference for a data-dependent model obtained from a fitted…

Methodology · Statistics 2025-12-17 Soham Bakshi , Yiling Huang , Snigdha Panigrahi , Walter Dempsey

We present a method for solving the coverage problem with the objective of autonomously exploring an unknown environment under mission time constraints. Here, the robot is tasked with planning a path over a horizon such that the accumulated…

Exploration is process of selecting target points that yield the biggest contribution to a specific gain function at an initially unknown environment. Frontier-based exploration is the most common approach to exploration, wherein frontiers…

Robotics · Computer Science 2018-06-12 Anirudh Topiwala , Pranav Inani , Abhishek Kathpal

This paper improves the performance of RRT$^*$-like sampling-based path planners by combining admissible informed sampling and local sampling (i.e., sampling the neighborhood of the current solution). An adaptive strategy regulates the…

Robotics · Computer Science 2024-04-16 Marco Faroni , Nicola Pedrocchi , Manuel Beschi

Navigation in natural outdoor environments requires a robust and reliable traversability classification method to handle the plethora of situations a robot can encounter. Binary classification algorithms perform well in their native domain…

Robotics · Computer Science 2020-01-23 Lorenz Wellhausen , René Ranftl , Marco Hutter

Rapidly-exploring Random Trees (RRT) and its variations have emerged as a robust and efficient tool for finding collision-free paths in robotic systems. However, adding dynamic constraints makes the motion planning problem significantly…

Motion planning problems have been studied by both the robotics and the controls research communities for a long time, and many algorithms have been developed for their solution. Among them, incremental sampling-based motion planning…

Robotics · Computer Science 2012-05-01 Oktay Arslan , Panagiotis Tsiotras

Exploration of unknown environments is crucial for autonomous robots; it allows them to actively reason and decide on what new data to acquire for different tasks, such as mapping, object discovery, and environmental assessment. Existing…

Robotics · Computer Science 2025-05-09 Boyang Sun , Hanzhi Chen , Stefan Leutenegger , Cesar Cadena , Marc Pollefeys , Hermann Blum

We present Lower Bound Tree-RRT (LBT-RRT), a single-query sampling-based algorithm that is asymptotically near-optimal. Namely, the solution extracted from LBT-RRT converges to a solution that is within an approximation factor of 1+epsilon…

Robotics · Computer Science 2015-03-05 Oren Salzman , Dan Halperin

This paper proposes a rapidly-exploring random trees (RRT) algorithm to solve the motion planning problem for hybrid systems. At each iteration, the proposed algorithm, called HyRRT, randomly picks a state sample and extends the search tree…

Robotics · Computer Science 2022-10-28 Nan Wang , Ricardo G. Sanfelice

Autonomous exploration using unmanned aerial vehicles (UAVs) is essential for various tasks such as building inspections, rescue operations, deliveries, and warehousing. However, there are two main limitations to previous approaches: they…

We describe the use of an unsupervised Random Forest for similarity learning and improved unsupervised anomaly detection. By training a Random Forest to discriminate between real data and synthetic data sampled from a uniform distribution…

Machine Learning · Statistics 2025-04-23 Joshua S. Harvey , Joshua Rosaler , Mingshu Li , Dhruv Desai , Dhagash Mehta

Rapid sampling from the environment to acquire available frontier points and timely incorporating them into subsequent planning to reduce fragmented regions are critical to improve the efficiency of autonomous exploration. We propose HPHS,…

Robotics · Computer Science 2024-07-22 Shijun Long , Ying Li , Chenming Wu , Bin Xu , Wei Fan

Sampling-based planning algorithms like Rapidly-exploring Random Tree (RRT) are versatile in solving path planning problems. RRT* offers asymptotic optimality but requires growing the tree uniformly over the free space, which leaves room…

Robotics · Computer Science 2024-03-08 Zhe Huang , Hongyu Chen , John Pohovey , Katherine Driggs-Campbell

We present a sampling-based framework for multi-robot motion planning which combines an implicit representation of a roadmap with a novel approach for pathfinding in geometrically embedded graphs tailored for our setting. Our pathfinding…

Robotics · Computer Science 2014-04-01 Kiril Solovey , Oren Salzman , Dan Halperin

Sparse residual tree (SRT) is an adaptive exploration method for multivariate scattered data approximation. It leads to sparse and stable approximations in areas where the data is sufficient or redundant, and points out the possible local…

Numerical Analysis · Mathematics 2019-05-15 Xin Xu , Xiaopeng Luo

Advanced persistent threats (APTs) pose significant challenges for organizations, leading to data breaches, financial losses, and reputational damage. Existing provenance-based approaches for APT detection often struggle with high false…

Cryptography and Security · Computer Science 2024-06-11 Yonatan Amaru , Prasanna Wudali , Yuval Elovici , Asaf Shabtai

Safe autonomous exploration of unknown environments is an essential skill for mobile robots to effectively and adaptively perform environmental mapping for diverse critical tasks. Due to its simplicity, most existing exploration methods…

Robotics · Computer Science 2025-03-13 Aykut İşleyen , René van de Molengraft , Ömür Arslan

Many robotic exploration algorithms rely on graph structures for frontier-based exploration and dynamic path planning. However, these graphs grow rapidly, accumulating redundant information and impacting performance. We present a…

Robotics · Computer Science 2026-04-21 Adithya V. Sastry , Bibek Poudel , Weizi Li