Technical Report: Fast Robot Arm Inverse Kinematics and Path Planning Under Complex Obstacle Constraint

06/25/2019
by   David W. Arathorn, et al.
0

Described here is a simple, reliable method for rapid computation of robot arm inverse kinematic solutions and motion path plans in the presence of complex obstructions. The method is based on a restricted form of the MSC (map-seeking circuit) algorithm, optimized to exploit the characteristics of practical arm configurations. MSC representation naturally incorporates both arm and obstacle geometries. The consequent performance on modern hardware is suitable for applications requiring real-time response. On high-end GPGPU hardware computation of both final pose for an 8 DOF arm and a smooth obstacle-avoiding motion path to that pose takes approximately 200msec.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2018

Near-optimal Smooth Path Planning for Multisection Continuum Arms

We study the path planning problem for continuum-arm robots, in which we...
research
12/07/2021

PRM path smoothening by circular arc fillet method for mobile robot navigation

Motion planning and navigation, especially for mobile robots operating i...
research
10/21/2022

Reaching Through Latent Space: From Joint Statistics to Path Planning in Manipulation

We present a novel approach to path planning for robotic manipulators, i...
research
08/02/2021

Redundancy Resolution in Kinematic Control of Serial Manipulators in Multi-Obstacle Environment

The paper focuses on the redundancy resolution in kinematic control of a...
research
08/05/2023

Achieving Unit-Consistent Pseudo-Inverse-based Path-Planning for Redundant Incommensurate Robotic Manipulators

In this paper, we review and compare several velocity-level and accelera...
research
10/10/2019

Variational Path Optimization of Linear Pentapods with a Simple Singularity Variety

The class of linear pentapods with a simple singularity variety is obtai...
research
04/04/2022

Coarse-to-Fine Q-attention with Learned Path Ranking

We propose Learned Path Ranking (LPR), a method that accepts an end-effe...

Please sign up or login with your details

Forgot password? Click here to reset