13.07.2015 Views

Assembly Maintainability Study with Motion Planning

Assembly Maintainability Study with Motion Planning

Assembly Maintainability Study with Motion Planning

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

ÄÄÄÄIn Proceedings of 1995 IEEE Int’l Conf. on Robotics and Automationf maxfinitial configuration1xaggressivezoneconservative zonex s x m#collisionÄÄÄÄobstacleConstraint Volume created bylinking the spheres <strong>with</strong> cones.The union of the spheresand the cones is theconstraint volume.f min0ÄÄÄÄfinal configurationFigure 3. Search resolution refinement model: collisionratio dependent step size. Note x m = 728 for6 dof.which is shown in Figure 3. This model grows the step sizeinitially if, at a given configuration q, there were only a fewcollisions before a feasible q’ is found. We call this region off the aggressive zone. Once there are more than a fixed numberof collisions x s detected at q, f becomes smaller than 1,which effectively makes s i+1 smaller than s i. An important parameteris x s . It is essentially the number of collisions one assumesunder normal circumstances the planner expects beforemaking a successful move. If the number of collisions encounteredbefore making a successful move is near this value,the search resolution will stay very close to the previouslyused resolution. However, if significantly more collisions areencountered, the resolution value drops quickly, down to thefloor value set by the user, in the conservative zone. If relativelyfew collisions are encountered before making a successfulmove, the next search resolution may grow by a factordetermined by the curve between x=0 and x=x s . Since we donot know the distribution of the C–space shapes and clutteredness,x s can only be determined through empirical means. Bymoving this cutoff threshold between the two zones, one canchange the behavior of the refinement model so as to effect amore aggressive or more conservative policy. Notice that themaximum step size factor f max and the minimum step size factorf min are the other parameters in the model. With these parameters,we set also a ceiling and a floor for s i+1 so that theuser may enforce control over the search resolution. Forinstance, the maximum step size should not exceed the minimumobstacle dimension so that the moving object would notjump through an obstacle from one configuration to the next.These parameters are case dependent. In our experiments, wehave used f min = 1 / f max and f max = 2.3.2 Biased PathsThere are various ways to achieve bias in searching for a path.An obvious way is to block all undesirable passages by artifi-ÄÄFigure 4. Constraint Volume specified by placing a set ofcircles (spheres for 3d) of various sizes.cial obstacles. However, in 3D environments, it may not beintuitive for the user to specify such obstacles. The user needsto know the locations and dimensions of these passages in orderto place artificial obstacles <strong>with</strong> reasonable sizes. Thisprocess may be tedious when the number of these passages arelarge. In addition, it is difficult to verify that these artificialobstacles will not prevent the planner from finding an otherwisefeasible path, e.g., a path that requires the use of parts ofan undesirable passage to adjust the orientation of the object.In our system, we developed a different approach in which theuser specifies a constraint volume by placing a set of spheresof various diameters (user specified) at critical branchingpoints in the workspace where the user wants to prefer onedirection to the others. These spheres are then linked together<strong>with</strong> cones smoothly to form a volume. The exterior of thevolume is treated differently than obstacles. While the originalobstacles are still there, confining the motion of an LRU,this volume places an additional constraint on the motion ofthe LRU. More specifically, a certain set of points (calledconstraint points) is constrained to stay inside the volume,while the rest of the concerned LRU may leave the volume to,for instance, make orientational adjustments. Theseconstraint points may be critical surface landmarks of anLRU, its centroid, or some other references. Note that a givenconstraint through a set of user–specified spheres does notconstitute a single initial path. It merely signifies that the selectedconstraint points will trace out a path, during the search,that lies inside the corresponding constraint volume. In fact incases where fewer than three (non–colinear) constraint pointsare used, indeed at some configurations the LRU may be incollision <strong>with</strong> obstacles. Furthermore, such a constraint volumeis allowed to overlap <strong>with</strong> obstacles, thus making itsselection much less demanding of the user. Figure 4 illustratessuch a constraint volume for the case shown in Figure 2 to biasthe search to find path (b). The algorithm used in the RPP to

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!