
A simulation program was written to test the parallel manipulation algorithm. A typical run of the program is shown in the 3 screenshots below. They illustrate a manipulation task with 3 parts moving simultaneously along 3 independent trajectories. The minimum number of rotations/step is therefore 6 (it is twice the number of parts). To better condition the solving step, the program will assume a total of 25 centers of rotation, i.e., allow for 256=19 degrees of redundancy. SVD is used to invert a 6x25 matrix at every step. In the snapshots, the centers of rotation are rendered with green dots. Below, the user has placed the first part at the upper left corner of the workspace (purple disk) and created a rectangular path for it. Next, a second part is placed initially at the lower left corner of the workspace (yellow disk), and is also prescribed a rectangular path. The simulation is allowed to run for a few steps. Both parts advance along their intended paths (it works, it works!!!); midway along these paths, a third part is added to the experiment (the cyan disk), and a selfintersecting polygonal path is specified. The simulation go on, with the three parts moving simultaneously, as shown below (note that in these frames, the force field lines which result from the sum of all rotations are shown as a grid of red vectors):
An .avi animation of the whole process is available here.

© 2000 Dan S. Reznik, <dreznik@cs.berkeley.edu> 