English
Related papers

Related papers: Ultrafast Sampling-based Kinodynamic Planning via …

200 papers

We integrate sampling-based planning techniques with funnel-based feedback control to develop KDF, a new framework for solving the kinodynamic motion-planning problem via funnel control. The considered systems evolve subject to complex,…

Robotics · Computer Science 2021-04-27 Christos K. Verginis , Dimos V. Dimarogonas , Lydia E. Kavraki

We present a sampling-based kinodynamic planning framework for a bipedal robot in complex environments. Unlike other footstep planner which typically plan footstep locations and the biped dynamics in separate steps, we handle both…

Robotics · Computer Science 2018-07-11 Junhyeok Ahn , Orion Campbell , Donghyun Kim , Luis Sentis

Motion planning is a mature area of research in robotics with many well-established methods based on optimization or sampling the state space, suitable for solving kinematic motion planning. However, when dynamic motions under constraints…

Sampling-based motion planners (SBMPs) are widely used for robot motion planning with complex kinodynamic constraints in high-dimensional spaces, yet they struggle to achieve \emph{real-time} performance due to their serial computation…

Robotics · Computer Science 2026-02-04 Nicolas Perrault , Qi Heng Ho , Morteza Lahijanian

This paper presents a kinodynamic motion planner that is able to produce energy efficient motions by taking the full robot dynamics into account, and making use of gravity, inertia, and momentum to reduce the effort. Given a specific goal…

Robotics · Computer Science 2020-06-16 Mandy Xie , Frank Dellaert

Task and Motion Planning (TAMP) integrates high-level task planning with low-level motion feasibility, but existing methods are costly in long-horizon problems due to excessive motion sampling. While LLMs provide commonsense priors, they…

Robotics · Computer Science 2026-03-06 Minseo Kwon , Young J. Kim

Sampling-based algorithms are viewed as practical solutions for high-dimensional motion planning. Recent progress has taken advantage of random geometric graph theory to show how asymptotic optimality can also be achieved with these…

Robotics · Computer Science 2016-02-09 Yanbo Li , Zakary Littlefield , Kostas E. Bekris

This paper tackles the problem of integrated task and kinodynamic motion planning in uncertain environments. We consider a robot with nonlinear dynamics tasked with a Linear Temporal Logic over finite traces ($\ltlf$) specification…

Robotics · Computer Science 2026-04-02 Qi Heng Ho , Zachary N. Sunberg , Morteza Lahijanian

This paper aims to increase the safety and reliability of executing trajectories planned for robots with non-trivial dynamics given a light-weight, approximate dynamics model. Scenarios include mobile robots navigating through workspaces…

This paper aims to improve the path quality and computational efficiency of kinodynamic planners used for vehicular systems. It proposes a learning framework for identifying promising controls during the expansion process of sampling-based…

Robotics · Computer Science 2022-01-10 Seth Karten , Aravind Sivaramakrishnan , Edgar Granados , Troy McMahon , Kostas E. Bekris

Search-based techniques have shown great success in motion planning problems such as robotic navigation by discretizing the state space and precomputing motion primitives. However in domains with complex dynamic constraints, constructing…

Robotics · Computer Science 2021-09-28 Nader Maray , Anirudh Vemula , Maxim Likhachev

This paper presents a motion planner for systems subject to kinematic and dynamic constraints. The former appear when kinematic loops are present in the system, such as in parallel manipulators, in robots that cooperate to achieve a given…

Robotics · Computer Science 2017-05-23 Ricard Bordalba , Lluís Ros , Josep M. Porta

We propose a motion planner for cable-driven payload transportation using multiple unmanned aerial vehicles (UAVs) in an environment cluttered with obstacles. Our planner is kinodynamic, i.e., it considers the full dynamics model of the…

Robotics · Computer Science 2024-10-02 Khaled Wahba , Joaquim Ortiz-Haro , Marc Toussaint , Wolfgang Hönig

Sampling-based motion planning algorithms such as RRT* are well-known for their ability to quickly find an initial solution and then converge to the optimal solution asymptotically. However, the convergence rate can be slow for…

Robotics · Computer Science 2021-07-06 Dongliang Zheng , Panagiotis Tsiotras

Planning for systems with dynamics is challenging as often there is no local planner available and the only primitive to explore the state space is forward propagation of controls. In this context, tree sampling-based planners have been…

Robotics · Computer Science 2019-07-19 Aravind Sivaramakrishnan , Zakary Littlefield , Kostas E. Bekris

Kinodynamic Motion Planning (KMP) is to find a robot motion subject to concurrent kinematics and dynamics constraints. To date, quite a few methods solve KMP problems and those that exist struggle to find near-optimal solutions and exhibit…

Robotics · Computer Science 2021-01-19 Linjun Li , Yinglong Miao , Ahmed H. Qureshi , Michael C. Yip

We present Kinodynamic RRT*, an incremental sampling-based approach for asymptotically optimal motion planning for robots with linear differential constraints. Our approach extends RRT*, which was introduced for holonomic robots (Karaman et…

Robotics · Computer Science 2012-05-24 Dustin J. Webb , Jur van den Berg

Multi-Agent Motion Planning (MAMP) finds various applications in fields such as traffic management, airport operations, and warehouse automation. In many of these environments, differential drive robots are commonly used. These robots have…

Robotics · Computer Science 2024-12-19 Jingtian Yan , Jiaoyang Li

Kinodynamic motion planners allow robots to perform complex manipulation tasks under dynamics constraints or with black-box models. However, they struggle to find high-quality solutions, especially when a steering function is unavailable.…

Robotics · Computer Science 2023-08-29 Marco Faroni , Dmitry Berenson

We consider the problem of coordinating a collection of robots at an intersection area taking into account dynamical constraints due to actuator limitations. We adopt the coordination space approach, which is standard in multiple robot…

Robotics · Computer Science 2014-05-06 Jean Gregoire , Silvère Bonnabel , Arnaud de La Fortelle
‹ Prev 1 2 3 10 Next ›