ENG-654 · Lecture 07
Workspace Path Planning
Lifting a desired Cartesian curve onto inverse-kinematic solution sheets
Running models: PUMA 560 and the cuspidal custom_3R_new.urdf.
The planning question
A workspace curve is not yet a robot trajectory
PUMA 560 example
Follow one closed wrist-center path in the workspace
The tool orientation and wrist posture are held fixed conceptually; the first three joints lift the displayed Cartesian loop.
Numerical lift
The Jacobian converts Cartesian error into a local joint correction
Start from a seed \(\mathbf q_0\).
Linearize forward kinematics at the current configuration.
Correct the joints, recompute \(J\), and iterate.
Use the last solution as the seed for the next path sample.
Local continuation
Different seeds can lift the same PUMA path differently
Each correction only sees the current Jacobian. A seed chooses the local solution sheet before tracking begins.
Numerical safeguards
Small steps and damping help—but do not create global knowledge
Step size
Large Cartesian steps invalidate the local linear model and can jump to another basin.
Near singularity
Small singular values amplify joint velocity. Damping limits the amplification but introduces tracking error.
Continuation
Warm-starting preserves a nearby solution while that local branch remains regular.
Analytical lift
Enumerate the PUMA IKs, classify them, then request a branch
For the wrist-partitioned PUMA, shoulder, elbow, and wrist signs give every regular solution a global SEW label.
What “analytical” changes
The branch label is an input—not an accident of convergence
Local versus global
The two methods answer different planning questions
| Jacobian / numerical | Analytical branch evaluation | |
|---|---|---|
| Information used | Local derivative at the current \(\mathbf q\) | Complete inverse structure for the robot geometry |
| Initialization | A seed configuration | A branch label |
| Output | One nearby solution, if convergence succeeds | The requested real solution, if that branch exists |
| Singularity signal | Conditioning degrades during iteration | Branch discriminant or separator vanishes |
| Scope | local | global |
Determinism
A numerical answer is seed-dependent; an analytical branch is fully specified
Now change the topology
For a cuspidal robot, one aspect can contain multiple IK solutions
Model
custom_3R_new.urdf
Workspace event
A square loop is placed around a cusp and may cross nearby critical-value curves.
Planning consequence
Different lifts of the exact same loop can close, terminate, or change IK solution without becoming singular.
Master path editor
Place one square loop—every following slide reuses it exactly
Translate, stretch, and rotate the loop in the \((\rho,z)\) workspace slice. The red curves are singular critical values; × marks the selected cusp.
One workspace loop, several lifts
Path feasibility is a property of the selected solution sheet
Regular
The selected joint path remains nonsingular and closes.
joint space ↻
Infeasible
The selected lift reaches a fold where its IK pair coalesces.
joint path ✕
Nonsingular change
The lift stays regular but returns to a different IK of the starting point.
joint path →
Path type 1 · regular
A closed workspace loop lifts to a closed joint-space loop
The continuation returns to the starting IK and maintains nonzero determinant throughout the traversal.
Path type 2A · infeasible
The first lift reaches a fold and loses its real continuation
The workspace command continues, but this IK branch merges with another solution at \(\det J_p=0\).
Path type 2B · infeasible
The companion IK reaches the same fold from the other sheet
Same square, different lift: the two inverse solutions coalesce as a pair when the critical-value curve is reached.
Path type 3 · nonsingular
One traversal changes IK solution without crossing a singularity
The workspace loop closes while its regular joint-space lift remains open.
Non-repeatability
The second lap starts from the new configuration—not the original one
Play lap 1, then request the same square again. The second attempt starts from the newly reached IK and can terminate at a fold instead of reproducing the first trajectory.
Planning checklist
A path planner must reason about the lift—not only the curve
Define the workspace path and sampling law.
Enumerate or initialize candidate IK lifts.
Track branch identity, singularity distance, joint limits, and collisions.
For closed task loops, test joint-space closure and repeatability explicitly.