English
Related papers

Related papers: An Enhanced Sampling-Based Method With Modified Ne…

200 papers

Sampling-based planning algorithm is a powerful tool for solving planning problems in high-dimensional state spaces. In this article, we present a novel approach to sampling in the most promising regions, which significantly reduces…

Robotics · Computer Science 2023-05-26 Chenming Li , Fei Meng , Han Ma , Jiankun Wang , Max Q. -H. Meng

Sampling-based methods such as Rapidly-exploring Random Trees (RRTs) have been widely used for generating motion paths for autonomous mobile systems. In this work, we extend time-based RRTs with Control Barrier Functions (CBFs) to generate,…

Accurate traversability estimation is essential for safe and effective navigation of outdoor robots operating in complex environments. This paper introduces a novel experience-based method that allows robots to autonomously learn which…

This paper proposes a sampling based planning algorithm to control autonomous vehicles. We propose an improved Rapidly-exploring Random Tree which includes the definition of K- nearest points and propose a two-stage sampling strategy to…

Robotics · Computer Science 2017-02-14 Fatemeh Mohseni , Mahdi Morsali

Neighborhood finders and nearest neighbor queries are fundamental parts of sampling based motion planning algorithms. Using different distance metrics or otherwise changing the definition of a neighborhood produces different algorithms with…

Robotics · Computer Science 2025-06-17 Stav Ashur , Nancy M. Amato , Sariel Har-Peled

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

Autonomous exploration is a widely studied problem where a robot incrementally builds a map of a previously unknown environment. The robot selects the next locations to reach using an exploration strategy. To do so, the robot has to balance…

Robotics · Computer Science 2025-08-15 Matteo Luperto , Valerii Stakanov , Giacomo Boracchi , Nicola Basilico , Francesco Amigoni

Actively planning sensor views during object reconstruction is crucial for autonomous mobile robots. An effective method should be able to strike a balance between accuracy and efficiency. In this paper, we propose a seamless integration of…

Robotics · Computer Science 2024-05-29 Dongyu Yan , Jianheng Liu , Fengyu Quan , Haoyao Chen , Mengmeng Fu

Neural Radiance Fields (NeRF) have emerged as a powerful paradigm for 3D scene representation, offering high-fidelity renderings and reconstructions from a set of sparse and unstructured sensor data. In the context of autonomous robotics,…

Robotics · Computer Science 2024-12-09 Yuhang Ming , Xingrui Yang , Weihan Wang , Zheng Chen , Jinglun Feng , Yifan Xing , Guofeng Zhang

Given a two-dimensional polygonal space, the multi-robot visibility-based pursuit-evasion problem tasks several pursuer robots with the goal of establishing visibility with an arbitrarily fast evader. The best known complete algorithm for…

Robotics · Computer Science 2021-04-12 Trevor Olsen , Anne M. Tumlin , Nicholas M. Stiffler , Jason M. O'Kane

This paper proposes a novel mission planning algorithm for autonomous robots that selects an optimal waypoint sequence from a predefined set to maximize total reward while satisfying obstacle avoidance, state, input, derivative, mission…

Robotics · Computer Science 2025-05-07 Jose D. Hoyos , Tianyu Zhou , Zehui Lu , Shaoshuai Mou

Autonomous exploration of unknown space is an essential component for the deployment of mobile robots in the real world. Safe navigation is crucial for all robotics applications and requires accurate and consistent maps of the robot's…

Robotics · Computer Science 2026-01-13 Sotiris Papatheodorou , Simon Boche , Sebastián Barbas Laina , Stefan Leutenegger

The sampling based motion planning algorithm known as Rapidly-exploring Random Trees (RRT) has gained the attention of many researchers due to their computational efficiency and effectiveness. Recently, a variant of RRT called RRT* has been…

Robotics · Computer Science 2017-03-28 Ahmed Hussain Qureshi , Yasar Ayaz

Embodied navigation requires robots to understand and interact with the environment based on given tasks. Vision-Language Navigation (VLN) is an embodied navigation task, where a robot navigates within a previously seen and unseen…

Robotics · Computer Science 2024-09-10 Muraleekrishna Gopinathan , Jumana Abu-Khalaf , David Suter , Martin Masek

While recent advances in neural radiance field enable realistic digitization for large-scale scenes, the image-capturing process is still time-consuming and labor-intensive. Previous works attempt to automate this process using the…

Computer Vision and Pattern Recognition · Computer Science 2024-07-31 Xiao Chen , Quanyi Li , Tai Wang , Tianfan Xue , Jiangmiao Pang

We propose a novel receding horizon planner for an autonomous surface vehicle (ASV) performing path planning in urban waterways. Feasible paths are found by repeatedly generating and searching a graph reflecting the obstacles observed in…

Robotics · Computer Science 2020-09-02 Tixiao Shan , Wei Wang , Brendan Englot , Carlo Ratti , Daniela Rus

Autonomous exploration in unknown environments typically relies on onboard state estimation for localisation and mapping. Existing exploration methods primarily maximise coverage efficiency, but often overlook that visual-inertial odometry…

Robotics · Computer Science 2026-03-17 Moji Shi , Rajitha de Silva , Hang Yu , Riccardo Polvara , Marija Popović

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

In this work, we address the problem of multi-robot adaptive coverage, where teams of robots perform dynamic sampling by continuously adjusting their positions to collect data in an environment. This task can be challenging, particularly…

Robotics · Computer Science 2026-05-22 Thales Costa Silva , Nora Ayanian

Finding asymptotically-optimal paths in multi-robot motion planning problems could be achieved, in principle, using sampling-based planners in the composite configuration space of all of the robots in the space. The dimensionality of this…

Multiagent Systems · Computer Science 2017-07-05 Andrew Dobson , Kiril Solovey , Rahul Shome , Dan Halperin , Kostas E. Bekris
‹ Prev 1 4 5 6 7 8 10 Next ›