Robot Path Planning in Three-Dimensions Using the Direct Subspace

1987 ◽  
Vol 109 (3) ◽  
pp. 238-244 ◽  
Author(s):  
W. E. Red ◽  
H. V. Troung-Cao ◽  
K. H. Kim

An efficient subspace approach is used to find collision-free paths in congested workspaces for a general class of robots having revolute and/or prismatic joints. A three-dimensional joint space is formed by mapping the workspace obstacles represented by polyhedral elements into the robot’s primary degrees-of-freedom comprising the first three robot links, also modeled by polyhedral elements. In this approach the secondary degrees-of-freedom (>3), including objects grasped by the robot end-effector, are bounded by a box attached to the distal primary link. The joint space obstacles represent forbidden space that limits the allowable robot configurations. Paths are then planned on a two-dimensional direct subspace of the joint space using graphics cursor input. Methods of iteration elimination are used to reduce the computational time required to transform obstacles into the joint space.

Robotica ◽  
1987 ◽  
Vol 5 (1) ◽  
pp. 29-36 ◽  
Author(s):  
W. E. Red ◽  
K. H. Kim

SUMMARYA direct subspace of a dynamic three-dimensional joint space is found to be useful for robot path planning in workspaces comprised of both static and dynamic objects. Dynamic descriptions permit positioning tables, automated guided vehicles, conveyors and cycling machine tools to be modeled by elements which translate or cycle along rectilinear paths. Graphical path planning procedures use cursor indicators to move the robot configuration point between the desired starting and final configurations while avoiding both the static and dynamic joint space obstacles.


Author(s):  
Stéphane Caro ◽  
Philippe Wenger ◽  
Damien Chablat

This paper deals with the non-singular assembly mode changing of a six degrees of freedom parallel manipulator. The manipulator is composed of three identical limbs and one moving platform. Each limb is composed of three prismatic joints of directions orthogonal to each other and one spherical joint. The first two prismatic joints of each limb are actuated. The planes normal to the directions of the first two prismatic joints of each limb are orthogonal to each other. It appears that the parallel singularities of the manipulator depend only on the orientation of its moving platform. Moreover, the manipulator turns to have two aspects, namely, two maximal singularity free domains without any singular configuration, in its orientation workspace. As the manipulator can get up to eight solutions to its direct kinematic model, several assembly modes can be connected by non-singular trajectories. It is noteworthy that the images of those trajectories in the joint space of the manipulator encircle one or several cusp point(s). This property can be depicted in a three dimensional space because the singularities depend only on the orientation of the moving-platform and the mapping between the orientation parameters of the manipulator and three joint variables can be obtained with a simple change of variables. Finally to the best of the authors’ knowledge, this is the first spatial parallel manipulator for which non-singular assembly mode changing trajectories have been found and shown.


Author(s):  
E. Sandgren ◽  
S. Venkataraman

Abstract A design optimization approach to robot path planning in a two dimensional workplace is presented. Obstacles are represented as a series of rectangular regions and collision detection is performed by an operation similar to clipping in computer graphics. The feasible design space is approximated by a discrete set of robot arm and gripper positions. Control is applied directly through the angular motion of each link. Feasible positions which are located between the initial and final robot link positions are grouped into stages. A dynamic programming algorithm is applied to locate the best state within each stage which minimizes the overall path length. An example is presented involving a three link planar manipulator. Extensions to three dimensional robot path planning and real time control in a dynamically changing workplace are discussed.


1993 ◽  
Vol 69 (3) ◽  
pp. 965-979 ◽  
Author(s):  
K. Hepp ◽  
A. J. Van Opstal ◽  
D. Straumann ◽  
B. J. Hess ◽  
V. Henn

1. Although the eye has three rotational degrees of freedom, eye positions, during fixations, saccades, and smooth pursuit, with the head stationary and upright, are constrained to a plane by ListingR's law. We investigated whether Listing's law for rapid eye movements is implemented at the level of the deeper layers of the superior colliculus (SC). 2. In three alert rhesus monkeys we tested whether the saccadic motor map of the SC is two dimensional, representing oculocentric target vectors (the vector or V-model), or three dimensional, representing the coordinates of the rotation of the eye from initial to final position (the quaternion or Q-model). 3. Monkeys made spontaneous saccadic eye movements both in the light and in the dark. They were also rotated about various axes to evoke quick phases of vestibular nystagmus, which have three degrees of freedom. Eye positions were measured in three dimensions with the magnetic search coil technique. 4. While the monkey made spontaneous eye movements, we electrically stimulated the deeper layers of the SC and elicited saccades from a wide range of initial positions. According to the Q-model, the torsional component of eye position after stimulation should be uniquely related to saccade onset position. However, stimulation at 110 sites induced no eye torsion, in line with the prediction of the V-model. 5. Activity of saccade-related burst neurons in the deeper layers of the SC was analyzed during rapid eye movements in three dimensions. No systematic eye-position dependence of the movement fields, as predicted by the Q-model, could be detected for these cells. Instead, the data fitted closely the predictions made by the V-model. 6. In two monkeys, both SC were reversibly inactivated by symmetrical bilateral injections of muscimol. The frequency of spontaneous saccades in the light decreased dramatically. Although the remaining spontaneous saccades were slow, Listing's law was still obeyed, both during fixations and saccadic gaze shifts. In the dark, vestibularly elicited fast phases of nystagmus could still be generated in three dimensions. Although the fastest quick phases of horizontal and vertical nystagmus were slower by about a factor of 1.5, those of torsional quick phases were unaffected. 7. On the basis of the electrical stimulation data and the properties revealed by the movement field analysis, we conclude that the collicular motor map is two dimensional. The reversible inactivation results suggest that the SC is not the site where three-dimensional fast phases of vestibular nystagmus are generated.(ABSTRACT TRUNCATED AT 400 WORDS)


1991 ◽  
Vol 35 (01) ◽  
pp. 40-57
Author(s):  
Nickolas Vlahopoulos ◽  
Michael M. Bernitsas

The dynamic behavior of a nonintegral riser bundle is studied parametrically. The dynamics of each component-riser is analyzed by a three-dimensional, nonlinear, large deflection, small strain model with coupled bending and torsion. Component-risers are slender, thin-walled, extensible or inextensible tubular beam-columns, subject to response and deformation dependent hydrodynamic loads. The con-nector equations of equilibrium are used to derive the connector forces and moments. Substructuring can thus be achieved even though in three dimensions connectors do not impose linearly dependent deflections at substructure interfaces. The developed time incremental and iterative finite-element computer code is used to analyze the effects of water depth, distribution of connectors, distance between component risers and number of finite elements in the numerical model. The problem of total CPU (central processor unit) time and the advantages of substructuring are discussed by running cases of up to 1094 degrees of freedom.


Author(s):  
C. Y. Liu ◽  
R. W. Mayne

Abstract This paper considers the problem of robot path planning by optimization methods. It focuses on the use of recursive quadratic programming (RQP) for the optimization process and presents a formulation of the three dimensional path planning problem developed for compatibility with the RQP selling. An approach 10 distance-to-contact and interference calculations appropriate for RQP is described as well as a strategy for gradient computations which are critical to applying any efficient nonlinear programming method. Symbolic computation has been used for general six degree-of-freedom transformations of the robot links and to provide analytical derivative expressions. Example problems in path planning are presented for a simple 3-D robot. One example includes adjustments in geometry and introduces the concept of integrating 3-D path planning with geometric design.


2020 ◽  
Vol 17 (3) ◽  
pp. 165-173
Author(s):  
C.O. Yinka-Banjo ◽  
U. Agwogie

This article presents the implementation and comparison of fruit fly optimization (FOA), ant colony optimization (ACO) and particle swarm optimization (PSO) algorithms in solving the mobile robot path planning problem. FOA is one of the newest nature-inspired algorithms while PSO and ACO has been in existence for a long time. PSO has been shown by other studies to have long search time while ACO have fast convergence speed. Therefore there is need to benchmark FOA performance with these older nature-inspired algorithms. The objective is to find an optimal path in an obstacle free static environment from a start point to the goal point using the aforementioned techniques. The performance of these algorithms was measured using three criteria: average path length, average computational time and average convergence speed. The results show that the fruit fly algorithm produced shorter path length (19.5128 m) with faster convergence speed (3149.217 m/secs) than the older swarm intelligence algorithms. The computational time of the algorithms were in close range, with ant colony optimization having the minimum (0.000576 secs). Keywords:  Swarm intelligence, Fruit Fly algorithm, Ant Colony Optimization, Particle Swarm Optimization, optimal path, mobile robot.


1995 ◽  
Vol 117 (1) ◽  
pp. 20-25 ◽  
Author(s):  
Pardeep K. Bhatti ◽  
Klaus Gschwend ◽  
Abel Y. Kwang ◽  
Ahmer R. Syed

Three-dimensional finite element analysis has been applied for determining time-dependent solder joint response of leaded surface mount components under thermal cycling. Two main challenges are the geometric complexity in mesh development and computationally intensive analysis because of the highly nonlinear material properties. Advanced techniques have been applied, including multi-point constraints for mesh transition, which reduces the number of degrees of freedom in the model, and substructuring, which effectively reduces computational time in the iterative analysis. The result is a generic approach for nonlinear creep analysis using commercial FEA software on a high performance workstation. Illustrations are provided for J and gullwing leaded packages.


Robotica ◽  
2010 ◽  
Vol 29 (2) ◽  
pp. 295-315 ◽  
Author(s):  
Debanik Roy

SUMMARYCollision-free path planning for static robots is a demanding manifold of contemporary robotics research, vastly due to the growing industrial applications. In this paper, a novel ‘visibility map’-based heuristic algorithm is used to generate near-optimal safe path for a three-dimensional congested robot workspace. The final path is obtainable in terms of joint configurations, by considering the Configuration Space of the task space. The developed algorithm has been verified initially by considering representative 2D workspaces, cluttered with different obstacles with regular geometries and then after with the spatial endeavour. A case study reveals the effectiveness of the developed modules of the configuration space mapping, pertaining to a five degrees-of-freedom low payload articulated robot.


Sign in / Sign up

Export Citation Format

Share Document