English
Related papers

Related papers: Constrained Bimanual Planning with Analytic Invers…

200 papers

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

During the conceptual and prototype design stage of an industrial product, it is crucial to take assembly/disassembly and maintenance operations in advance. A well-designed system should enable relatively easy access of operating…

Robotics · Computer Science 2012-06-08 Liang Ma , Ruina Ma , Damien Chablat , Fouad Bennis

An effective method for optimizing path planning for a specific model of a 6-degree-of-freedom (6-DOF) robot manipulator is presented as part of the motion planning of the manipulator using computer algebra. We assume that we are given a…

Robotics · Computer Science 2025-09-09 Takumu Okazaki , Akira Terui , Masahiko Mikawa

Conventional robots possess a limited understanding of their kinematics and are confined to preprogrammed tasks, hindering their ability to leverage tools efficiently. Driven by the essential components of tool usage - grasping the desired…

Robotics · Computer Science 2025-10-31 Prathamesh Kothavale , Sravani Boddepalli

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…

We study the problem of bipedal robot navigation in complex environments with uncertain and rough terrain. In particular, we consider a scenario in which the robot is expected to reach a desired goal location by traversing an environment…

Robotics · Computer Science 2024-04-16 Kasidit Muenprasitivej , Jesse Jiang , Abdulaziz Shamsah , Samuel Coogan , Ye Zhao

Motion planning in high-dimensional space is a challenging task. In order to perform dexterous manipulation in an unstructured environment, a robot with many degrees of freedom is usually necessary, which also complicates its motion…

Robotics · Computer Science 2021-08-03 Chao Liu , Mark Yim

The problem of self-tuning control of cooperative manipulators forming a closed kinematic chain in the presence of an inaccurate kinematics model is addressed using adaptive machine learning. The kinematic parameters pertaining to the…

Robotics · Computer Science 2022-09-07 Farhad Aghili

Robotic manipulation research has investigated contact-rich problems and strategies that require robots to intentionally collide with their environment, to accomplish tasks that cannot be handled by traditional collision-free solutions. By…

Robotics · Computer Science 2025-09-15 Kejia Ren , Gaotian Wang , Andrew S. Morgan , Kaiyu Hang

Visual uncertainties such as occlusions, lack of texture, and noise present significant challenges in obtaining accurate kinematic models for safe robotic manipulation. We introduce a probabilistic real-time approach that leverages the…

Robotics · Computer Science 2025-11-04 Adrian Pfisterer , Xing Li , Vito Mengers , Oliver Brock

Traversing environments with arbitrary obstacles poses significant challenges for bipedal robots. In some cases, whole body motions may be necessary to maneuver around an obstacle, but most existing footstep planners can only select from a…

Robotics · Computer Science 2017-03-22 Michael X. Grey , Aaron D. Ames , C. Karen Liu

This work presents a motion planning framework for robotic manipulators that computes collision-free paths directly in image space. The generated paths can then be tracked using vision-based control, eliminating the need for an explicit…

Robotics · Computer Science 2025-07-04 Sreejani Chatterjee , Abhinav Gandhi , Berk Calli , Constantinos Chamzas

Traditional approaches to quadruped control frequently employ simplified, hand-derived models. This significantly reduces the capability of the robot since its effective kinematic range is curtailed. In addition, kinodynamic constraints are…

When planning motions in a configuration space that has underlying symmetries (e.g. when manipulating one or multiple symmetric objects), the ideal planning algorithm should take advantage of those symmetries to produce shorter…

Robotics · Computer Science 2025-07-18 Thomas Cohn , Russ Tedrake

The motion of a mechanical system can be defined as a path through its configuration space. Computing such a path has a computational complexity scaling exponentially with the dimensionality of the configuration space. We propose to reduce…

Robotics · Computer Science 2018-09-17 Andreas Orthey , Olivier Roussel , Olivier Stasse , Michel Taïx

Path Planning and target searching in a three-dimensional environment is a challenging task in the field of robotics. It is an optimization problem as the path from source to destination has to be optimal. This paper aims to generate a…

Artificial Intelligence · Computer Science 2019-11-07 Devansh Verma , Priyansh Saxena , Ritu Tiwari

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

This paper presents a manipulation planning algorithm for robots to reorient objects. It automatically finds a sequence of robot motion that manipulates and prepares an object for specific tasks. Examples of the preparatory manipulation…

Robotics · Computer Science 2018-12-11 Weiwei Wan , Kensuke Harada , Fumio Kanehiro

Industrial robotic object handling often involves boxes and packages whose mass and center of mass are not known in advance. These uncertainties affect the force--moment balance required for stable lifting, and improper regulation of…

Robotics · Computer Science 2026-05-22 Kenzhi Iskandar Wong , Lin Yang , Qian Ying Lee , Domenico Campolo

A well-known weakness of the probabilistic path planners is the so-called narrow passage problem, where a region with a relatively low probability of being sampled must be explored to find a solution path. Many strategies have been proposed…

Robotics · Computer Science 2014-07-10 Josep M. Porta , Léonard Jaillet