English
Related papers

Related papers: Stein Variational Probabilistic Roadmaps

200 papers

Planning in environments with moving obstacles remains a significant challenge in robotics. While many works focus on navigation and path planning in obstacle-dense spaces, traversing such congested regions is often avoidable by selecting…

Robotics · Computer Science 2025-06-23 Yaroslav Marchukov , Luis Montano

In this work, we present a novel sampling-based path planning method, called SPRINT. The method finds solutions for high dimensional path planning problems quickly and robustly. Its efficiency comes from minimizing the number of collision…

Robotics · Computer Science 2021-06-02 Daniel Rakita , Bilge Mutlu , Michael Gleicher

Planning safe paths is a major building block in robot autonomy. It has been an active field of research for several decades, with a plethora of planning methods. Planners can be generally categorised as either trajectory optimisers or…

Robotics · Computer Science 2017-05-18 Gilad Francis , Lionel Ott , Fabio Ramos

Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidly-exploring Random Trees (RRTs) in particular have been shown to be efficient in solving high dimensional problems. Even though…

Artificial Intelligence · Computer Science 2009-12-02 Nicolas A. Barriga , Mauricio Araya-López

Autonomous uncrewed aerial vehicles (UAVs) can be utilized as aerial relays to serve users far from terrestrial infrastructure. Unfortunately, existing algorithms for aerial relay path planning cannot accommodate general flight constraints…

Optimization and Control · Mathematics 2026-02-05 Pham Q. Viet , Daniel Romero

This paper presents a novel image-based path planning algorithm that was developed using computer vision techniques, as well as its comparative analysis with well-known deterministic and probabilistic algorithms, namely A* and Probabilistic…

Computer Vision and Pattern Recognition · Computer Science 2025-11-12 Selim Ahmet Iz , Mustafa Unel

Sampling-based motion planners have proven to be efficient solutions to a variety of high-dimensional, geometrically complex motion planning problems with applications in several domains. The traditional view of these approaches is that…

Robotics · Computer Science 2014-04-09 Andrew Dobson , George V. Moustakides , Kostas E. Bekris

Sampling based probabilistic roadmap planners (PRM) have been successful in motion planning of robots with higher degrees of freedom, but may fail to capture the connectivity of the configuration space in scenarios with a critical narrow…

Robotics · Computer Science 2021-07-05 Shubham Shukla , Lokesh Kumar , Titas Bera , Ranjan Dasgupta

Balancing the trade-off between safety and efficiency is of significant importance for path planning under uncertainty. Many risk-aware path planners have been developed to explicitly limit the probability of collision to an acceptable…

Robotics · Computer Science 2022-10-26 Fei Meng , Liangliang Chen , Han Ma , Jiankun Wang , Max Q. -H. Meng

Inference and prediction of routes have become of interest over the past decade owing to a dramatic increase in package delivery and ride-sharing services. Given the underlying combinatorial structure and the incorporation of probabilities,…

Logic in Computer Science · Computer Science 2023-06-21 Suwei Yang , Victor C. Liang , Kuldeep S. Meel

Path planning in dynamic environments is essential to high-risk applications such as unmanned aerial vehicles, self-driving cars, and autonomous underwater vehicles. In this paper, we generate collision-free trajectories for a robot within…

Robotics · Computer Science 2020-07-30 Sourav Dutta , Tuan Tran , Banafsheh Rekabdar , Chinwe Ekenna

Safety is a critical concern for the success of urban air mobility, especially in dynamic and uncertain environments. This paper proposes a path planning algorithm based on RRT in conjunction with chance constraints in the presence of…

Robotics · Computer Science 2022-03-15 Pengcheng Wu , Lin Li , Junfei Xie , Jun Chen

Roadmaps constructed by many sampling-based motion planners coincide, in the absence of obstacles, with standard models of random geometric graphs (RGGs). Those models have been studied for several decades and by now a rich body of…

Robotics · Computer Science 2016-02-18 Kiril Solovey , Oren Salzman , Dan Halperin

Obstacle avoidance and path planning are essential for guiding unmanned ground vehicles (UGVs) through environments that are densely populated with dynamic obstacles. This paper develops a novel approach that combines tangentbased path…

Robotics · Computer Science 2025-11-12 Okan Arif Guvenkaya , Selim Ahmet Iz , Mustafa Unel

Sampling-based path planning is a widely used method in robotics, particularly in high-dimensional state space. Among the whole process of the path planning, collision detection is the most time-consuming operation. In this paper, we…

Robotics · Computer Science 2023-11-23 Xingrong Diao , Wenzheng Chi , Jiankun Wang

Autonomous exploration in dynamic environments necessitates a planner that can proactively respond to changes and make efficient and safe decisions for robots. Although plenty of sampling-based works have shown success in exploring static…

Robotics · Computer Science 2023-09-19 Zhefan Xu , Christopher Suzuki , Xiaoyang Zhan , Kenji Shimada

Robotic systems, particularly in demanding environments like narrow corridors or disaster zones, often grapple with imperfect state estimation. Addressing this challenge requires a trajectory plan that not only navigates these restrictive…

Robotics · Computer Science 2023-09-19 Zhenyang Chen , Hongzhe Yu , Yongxin Chen

Uncertainty-aware robot motion prediction is crucial for downstream traversability estimation and safe autonomous navigation in unstructured, off-road environments, where terrain is heterogeneous and perceptual uncertainty is high. Most…

Automated driving in urban scenarios requires efficient planning algorithms able to handle complex situations in real-time. A popular approach is to use graph-based planning methods in order to obtain a rough trajectory which is…

Robotics · Computer Science 2021-02-17 Oliver Speidel , Jona Ruof , Klaus Dietmayer

In this paper, we present an online method for converting an arbitrary geometric path represented by a sequence of states, generated by any planner (e.g., sampling-based planners like RRT or PRM, search-based planners like ARA*, etc.), into…

Robotics · Computer Science 2026-03-03 Nermin Covic , Bakir Lacevic