English
Related papers

Related papers: Probabilistic Completeness of Randomized Possibili…

200 papers

Motion planning seeks a collision-free path in a configuration space (C-space), representing all possible robot configurations in the environment. As it is challenging to construct a C-space explicitly for a high-dimensional robot, we…

Robotics · Computer Science 2023-05-19 Yoonchang Sung , Peter Stone

Recently, biped robot walking technology has been significantly developed, mainly in the context of a bland walking scheme. To emulate human walking, robots need to step on the positions they see in unknown spaces accurately. In this paper,…

Robotics · Computer Science 2025-10-15 Bingquan Li , Ning Wang , Tianwei Zhang , Zhicheng He , Yucong Wu

In this work, we present an approach to planning for humanoid mobility. Humanoid mobility is a challenging problem, as the configuration space for a humanoid robot is intractably large, especially if the robot is capable of performing many…

Robotics · Computer Science 2018-02-01 Andrew Dornbush , Karthik Vijayakumar , Sameer Bardapurkar , Fahad Islam , Maxim Likhachev

In this paper we introduce and study a new concept of parametrised topological complexity, a topological invariant motivated by the motion planning problem of robotics. In the parametrised setting, a motion planning algorithm has high…

Algebraic Topology · Mathematics 2021-09-10 Daniel C. Cohen , Michael Farber , Shmuel Weinberger

In this letter, we propose an efficient and highly versatile loco-manipulation planning for humanoid robots. Loco-manipulation planning is a key technological brick enabling humanoid robots to autonomously perform object transportation by…

Robotics · Computer Science 2025-05-30 Masaki Murooka , Iori Kumagai , Mitsuharu Morisawa , Fumio Kanehiro , Abderrahmane Kheddar

Planning whole-body motions while taking into account the terrain conditions is a challenging problem for legged robots since the terrain model might produce many local minima. Our coupled planning method uses stochastic and…

Robotics · Computer Science 2020-06-30 Carlos Mastalli , Ioannis Havoutis , Michele Focchi , Darwin G. Caldwell , Claudio Semini

Path planning for robotic coverage is the task of determining a collision-free robot trajectory that observes all points of interest in an environment. Robots employed for such tasks are often capable of exercising active control over…

Robotics · Computer Science 2020-11-17 Tushar Kusnur , Dhruv Mauria Saxena , Maxim Likhachev

We present a method that finds locomanipulation plans that perform simultaneous locomotion and manipulation of objects for a desired end-effector trajectory. Key to our approach is to consider a generic locomotion constraint manifold that…

Robotics · Computer Science 2019-09-24 Steven Jens Jorgensen , Mihir Vedantam , Ryan Gupta , Henry Cappel , Luis Sentis

For safe operation, a robot must be able to avoid collisions in uncertain environments. Existing approaches for motion planning under uncertainties often assume parametric obstacle representations and Gaussian uncertainty, which can be…

Robotics · Computer Science 2023-12-04 Ralf Römer , Armin Lederer , Samuel Tesfazgi , Sandra Hirche

We propose a method to generate actuation plans for a reduced order, dynamic model of bipedal running. This method explicitly enforces robustness to ground uncertainty. The plan generated is not a fixed body trajectory that is aggressively…

Robotics · Computer Science 2020-01-30 Kevin Green , Ross L. Hatton , Jonathan Hurst

Autonomous exploration of unknown environments using a team of mobile robots demands distributed perception and planning strategies to enable efficient and scalable performance. Ideally, each robot should update its map and plan its motion…

Robotics · Computer Science 2024-05-07 Arash Asgharivaskasi , Fritz Girke , Nikolay Atanasov

Robotic motion-planning problems, such as a UAV flying fast in a partially-known environment or a robot arm moving around cluttered objects, require finding collision-free paths quickly. Typically, this is solved by constructing a graph,…

Robotics · Computer Science 2017-06-29 Sanjiban Choudhury , Shervin Javdani , Siddhartha Srinivasa , Sebastian Scherer

Most, if not all, robot navigation systems employ a decomposed planning framework that includes global and local planning. To trade-off onboard computation and plan quality, current systems have to limit all robot dynamics considerations…

Robotics · Computer Science 2025-10-08 Yuanjie Lu , Tong Xu , Linji Wang , Nick Hawes , Xuesu Xiao

Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…

Probability · Mathematics 2026-05-19 Boris Bukh , Quentin Dubroff

Bipedal robots have received much attention because of the variety of motion maneuvers that they can produce, and the many applications they have in various areas including rehabilitation. One of these motion maneuvers is walking. In this…

Robotics · Computer Science 2023-01-03 Aref Amiri , Hassan Salarieh

Planning motions to grasp an object in cluttered and uncertain environments is a challenging task, particularly when a collision-free trajectory does not exist and objects obstructing the way are required to be carefully grasped and moved…

Robotics · Computer Science 2017-11-28 Muhayyuddin , Mark Moll , Lydia Kavraki , Jan Rosell

The paper surveys topological problems relevant to the motion planning problem of robotics and includes some new results and constructions. First we analyse the notion of topological complexity of configuration spaces which is responsible…

Algebraic Topology · Mathematics 2017-01-10 Michael Farber

Stable bipedal walking is a key prerequisite for humanoid robots to reach their potential of being versatile helpers in our everyday environments. Bipedal walking is, however, a complex motion that requires the coordination of many degrees…

Robotics · Computer Science 2020-11-06 Marcell Missura , Maren Bennewitz , Sven Behnke

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

This paper presents a novel planning method that achieves navigation of multi-robot formations in cluttered environments, while maintaining the formation throughout the robots motion. The method utilises a decentralised approach to find…

Robotics · Computer Science 2023-07-17 Jeppe Heini Mikkelsen , Matteo Fumagalli
‹ Prev 1 3 4 5 6 7 10 Next ›