English
Related papers

Related papers: Transformer-Enhanced Motion Planner: Attention-Gui…

200 papers

Sampling-based Motion Planners (SMPs) have become increasingly popular as they provide collision-free path solutions regardless of obstacle geometry in a given environment. However, their computational complexity increases significantly…

Robotics · Computer Science 2018-09-28 Ahmed H. Qureshi , Michael C. Yip

We investigate the sampling-based optimal path planning problem for robotics in complex and dynamic environments. Most existing sampling-based algorithms neglect environmental information or the information from previous samples. Yet, these…

Robotics · Computer Science 2025-11-20 Mingyang Feng , Shaoyuan Li , Xiang Yin

Fast and efficient sampling-based motion planning (SMP) is an integral component of many robotic systems, such as autonomous cars. A popular technique to improve the efficiency of these planners is to restrict search space in the planning…

Robotics · Computer Science 2022-11-15 Jacob J. Johnson , Uday S. Kalra , Ankit Bhatia , Linjun Li , Ahmed H. Qureshi , Michael C. Yip

We present a learning-enabled Task and Motion Planning (TAMP) algorithm for solving mobile manipulation problems in environments with many articulated and movable obstacles. Our idea is to bias the search procedure of a traditional TAMP…

Robotics · Computer Science 2023-05-23 Zhutian Yang , Caelan Reed Garrett , Tomás Lozano-Pérez , Leslie Kaelbling , Dieter Fox

Sampling-based model predictive control (MPC) offers strong performance in nonlinear and contact-rich robotic tasks, yet often suffers from poor exploration due to locally greedy sampling schemes. We propose \emph{Model Tensor Planning}…

Robotics · Computer Science 2025-08-05 An T. Le , Khai Nguyen , Minh Nhat Vu , João Carvalho , Jan Peters

In this article, we propose a sampling-based motion planning algorithm equipped with an information-theoretic convergence criterion for incremental informative motion planning. The proposed approach allows dense map representations and…

Robotics · Computer Science 2019-05-24 Maani Ghaffari Jadidi , Jaime Valls Miro , Gamini Dissanayake

High-level autonomy requires discrete and continuous reasoning to decide both what actions to take and how to execute them. Integrated Task and Motion Planning (TMP) algorithms solve these hybrid problems jointly to consider constraints…

Robotics · Computer Science 2022-10-19 Wil Thomason , Marlin P. Strub , Jonathan D. Gammell

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 motion planners' testing environment (sbp-env) is a full feature framework to quickly test different sampling-based algorithms for motion planning. sbp-env focuses on the flexibility of tinkering with different aspects of the…

Robotics · Computer Science 2021-10-29 Tin Lai

Task And Motion Planning (TAMP) is the problem of finding a solution to an automated planning problem that includes discrete actions executable by low-level continuous motions. This field is gaining increasing interest within the robotics…

Robotics · Computer Science 2024-08-13 Elisa Tosello , Alessandro Valentini , Andrea Micheli

Autonomous robots operating in dynamic environments must balance global path optimality with real-time responsiveness to disturbances. This requires addressing a fundamental trade-off between computationally expensive global planning and…

Robotics · Computer Science 2026-05-05 Shreyas Raorane , Kabir Ram Puri , Anh-Quan Pham

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

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

Current robotic manipulators require fast and efficient motion-planning algorithms to operate in cluttered environments. State-of-the-art sampling-based motion planners struggle to scale to high-dimensional configuration spaces and are…

Robotics · Computer Science 2024-08-26 Davood Soleymanzadeh , Xiao Liang , Minghui Zheng

Motion planning is a crucial component of autonomous robot driving. While various trajectory datasets exist, effectively utilizing them for a target domain remains challenging due to differences in agent interactions and environmental…

Robotics · Computer Science 2025-07-28 Giwon Lee , Wooseong Jeong , Daehee Park , Jaewoo Jeong , Kuk-Jin Yoon

We propose a novel algorithm to solve multi-robot motion planning (MRMP) rapidly, called Simultaneous Sampling-and-Search Planning (SSSP). Conventional MRMP studies mostly take the form of two-phase planning that constructs roadmaps and…

Robotics · Computer Science 2023-05-08 Keisuke Okumura , Xavier Défago

Generative models such as diffusion models, excel at capturing high-dimensional distributions with diverse input modalities, e.g. robot trajectories, but are less effective at multi-step constraint reasoning. Task and Motion Planning (TAMP)…

We present an integrated Task-Motion Planning (TMP) framework for navigation in large-scale environments. Of late, TMP for manipulation has attracted significant interest resulting in a proliferation of different approaches. In contrast,…

Robotics · Computer Science 2021-11-05 Antony Thomas , Fulvio Mastrogiovanni , Marco Baglietto

Motion planning is integral to robotics applications such as autonomous driving, surgical robots, and industrial manipulators. Existing planning methods lack scalability to higher-dimensional spaces, while recent learning based planners…

Robotics · Computer Science 2023-09-28 Jacob J Johnson , Ahmed H Qureshi , Michael Yip

Anytime sampling-based methods are an attractive technique for solving kino-dynamic motion planning problems. These algorithms scale well to higher dimensions and can efficiently handle state and control constraints. However, an intelligent…

Robotics · Computer Science 2021-03-08 Sagar Suhas Joshi , Seth Hutchinson , Panagiotis Tsiotras
‹ Prev 1 2 3 10 Next ›