English
Related papers

Related papers: Robotic Motion Planning using Learned Critical Sou…

200 papers

Sampling-based methods are widely adopted solutions for robot motion planning. The methods are straightforward to implement, effective in practice for many robotic systems. It is often possible to prove that they have desirable properties,…

Robotics · Computer Science 2022-11-16 Troy McMahon , Aravind Sivaramakrishnan , Edgar Granados , Kostas E. Bekris

Sampling-based planning is the predominant paradigm for motion planning in robotics. Most sampling-based planners use a global random sampling scheme to guarantee probabilistic completeness. However, most schemes are often inefficient as…

Robotics · Computer Science 2020-01-22 Tin Lai , Philippe Morere , Fabio Ramos , Gilad Francis

Recent advancements in robotics have transformed industries such as manufacturing, logistics, surgery, and planetary exploration. A key challenge is developing efficient motion planning algorithms that allow robots to navigate complex…

Robotics · Computer Science 2025-08-27 Liding Zhang , Kuanqi Cai , Zewei Sun , Zhenshan Bing , Chaoqun Wang , Luis Figueredo , Sami Haddadin , Alois Knoll

A defining feature of sampling-based motion planning is the reliance on an implicit representation of the state space, which is enabled by a set of probing samples. Traditionally, these samples are drawn either probabilistically or…

Robotics · Computer Science 2019-03-13 Brian Ichter , James Harrison , Marco Pavone

Robot motion planning involves computing a sequence of valid robot configurations that take the robot from its initial state to a goal state. Solving a motion planning problem optimally using analytical methods is proven to be PSPACE-Hard.…

Robotics · Computer Science 2021-07-26 Naman Shah , Abhyudaya Srinet , Siddharth Srivastava

Sampling-based motion planning techniques have emerged as an efficient algorithmic paradigm for solving complex motion planning problems. These approaches use a set of probing samples to construct an implicit graph representation of the…

Robotics · Computer Science 2019-10-10 Brian Ichter , Edward Schmerling , Tsang-Wei Edward Lee , Aleksandra Faust

This paper presents a sampling-based motion planning framework that leverages the geometry of obstacles in a workspace as well as prior experiences from motion planning problems. Previous studies have demonstrated the benefits of utilizing…

Robotics · Computer Science 2023-06-19 Keita Kobashi , Changhao Wang , Yu Zhao , Hsien-Chung Lin , Masayoshi Tomizuka

Latest research in industrial robotics is aimed at making human robot collaboration possible seamlessly. For this purpose, industrial robots are expected to work on the fly in unstructured and cluttered environments and hence the subject of…

Robotics · Computer Science 2019-11-13 Indraneel Patil , B. K. Rout , V. Kalaichelvi

Sampling-based methods for motion planning, which capture the structure of the robot's free space via (typically random) sampling, have gained popularity due to their scalability, simplicity, and for offering global guarantees, such as…

Robotics · Computer Science 2025-05-22 Itai Panasoff , Kiril Solovey

This paper presents a new approach to learning for motion planning (MP) where critical regions of an environment are learned from a given set of motion plans and used to improve performance on new environments and problem instances. We…

Robotics · Computer Science 2020-03-10 Daniel Molina , Kislay Kumar , Siddharth Srivastava

This paper presents Latent Sampling-based Motion Planning (L-SBMP), a methodology towards computing motion plans for complex robotic systems by learning a plannable latent representation. Recent works in control of robotic systems have…

Robotics · Computer Science 2018-11-07 Brian Ichter , Marco Pavone

Motion planning is a fundamental problem in autonomous robotics that requires finding a path to a specified goal that avoids obstacles and takes into account a robot's limitations and constraints. It is often desirable for this path to also…

Robotics · Computer Science 2021-01-14 Jonathan D. Gammell , Marlin P. Strub

Randomized sampling based algorithms are widely used in robot motion planning due to the problem's intractability, and are experimentally effective on a wide range of problem instances. Most variants do not sample uniformly at random, and…

Sampling-based motion planning is the predominant paradigm in many real-world robotic applications, but its performance is immensely dependent on the quality of the samples. The majority of traditional planners are inefficient as they use…

Robotics · Computer Science 2020-10-23 Tin Lai , Fabio Ramos

Sampling-based planners are effective in many real-world applications such as robotics manipulation, navigation, and even protein modeling. However, it is often challenging to generate a collision-free path in environments where key areas…

Robotics · Computer Science 2021-11-24 Constantinos Chamzas , Anshumali Shrivastava , Lydia E. Kavraki

Sampling-based motion planners (SBMPs) are widely used to compute dynamically feasible robot paths. However, their reliance on uniform sampling often leads to poor efficiency and slow planning in complex environments. We introduce a novel…

Robotics · Computer Science 2025-11-10 Shubham Natraj , Bruno Sinopoli , Yiannis Kantaros

The objective of this study is to enable fast and safe manipulation tasks in home environments. Specifically, we aim to develop a system that can recognize its surroundings and identify target objects while in motion, enabling it to plan…

Robotics · Computer Science 2026-02-25 Keisuke Takeshita , Takahiro Yamazaki , Tomohiro Ono , Takashi Yamamoto

Robot motion planning has made vast advances over the past decades, but the challenge remains: robot mobile manipulators struggle to plan long-range whole-body motion in common household environments in real time, because of…

Robotics · Computer Science 2024-08-13 Yunfan Lu , Yuchen Ma , David Hsu , Panpan Cai

Exploration is a fundamental problem in robotics. While sampling-based planners have shown high performance, they are oftentimes compute intensive and can exhibit high variance. To this end, we propose to directly learn the underlying…

Robotics · Computer Science 2022-07-15 Lukas Schmid , Chao Ni , Yuliang Zhong , Roland Siegwart , Olov Andersson

Sampling-based motion planners have experienced much success due to their ability to efficiently and evenly explore the state space. However, for many tasks, it may be more efficient to not uniformly explore the state space, especially when…

Robotics · Computer Science 2018-06-07 Clark Zhang , Jinwook Huh , Daniel D. Lee
‹ Prev 1 2 3 10 Next ›