Research Article  Open Access
Satwinder Singh, Ekta Singla, "Service Arms with Unconventional Robotic Parameters for Intricate Workstations: Optimal Number and Dimensional Synthesis", Journal of Robotics, vol. 2016, Article ID 3537068, 11 pages, 2016. https://doi.org/10.1155/2016/3537068
Service Arms with Unconventional Robotic Parameters for Intricate Workstations: Optimal Number and Dimensional Synthesis
Abstract
A taskoriented design strategy is presented in this paper for service manipulators. The tasks are normally defined in the form of working locations where the endeffector can work while avoiding the obstacles. To acquire feasible solutions in cluttered environments, the robotic parameters (DH parameters) are allowed to take unconventional values. This enhances the solution space and it is observed that, by inducing this flexibility, the required number of degrees of freedom for fulfilling a given task can be reduced. A bilevel optimization problem is formulated with the outer layer utilizing the binary search method for minimizing the number of degrees of freedom. To enlarge the applicability domain of the proposed strategy, the upper limit of the number of joints is kept more than six. These allowable redundant joints would help in providing solution for intricate workcells. For each iteration of the upper level, a constrained nonlinear problem is solved for dimensional synthesis of the manipulator. The methodology is demonstrated through a case study of a realistic environment of a cluttered server room. A link service arm, synthesized using the proposed method, is able to fulfill two different tasks effectively.
1. Introduction
The tremendously increasing variety in the robotic services leads to less repetitive tasks. To provide solution to the resulting variations, adaptive design techniques and realization strategies have taken the attention of the researchers. Given a cluttered environment with fixed obstacles, as shown in Figure 1, tasks are generally defined as working locations for the robot endeffector. For such intricate workstations with narrow passages, manipulability needs to be induced in the required design to maneuver within the cluttered workcells. Focus of the work is to determine adaptive number of degrees of freedom (dof) for given work scenarios. There is no limitation of keeping degrees of freedom as six or less. To acquire even one connecting path in the given cluttered environments, a design with even larger dof may be used. Novelty of the work lies in enhancing the solution space through unconventional values of the robotic parameters.
In recent works, Yang and Chen [1] presented a study on optimizing the number of degrees of freedom for given tasks. The work is limited to specific conditions, without the description of any obstacles and/or workcells. In another work by Zhang and Wang [2], kinematic redundancy is utilized for avoidance of given obstacles. A fixed degreesoffreedom manipulator is utilized in the work and no general strategy is provided for any given task and/or workcell. The techniques used to avoid collisions are the utilization of kinematic redundancy and/or having movable platform in most of the works. Modularity in robotic arms is worked upon by few researchers [3, 4] for providing a solution for changes in the environments. Normally, in the modular development strategies, a configuration of modular components is changed and then a systematic method is developed to compute its robotic parameters, thus formulating the kinematic equations. However, to design a service arm for any given spatial workcell, a general platform is required, with least input required from the user. Importance of the customized design of robotic arms has been discussed in recent works and the algorithms have been presented either with fixed degrees of freedom or with fixed or no environment [5, 6]. The field of taskbased design needs to be further explored for algorithms adaptive to given workcells. This work provides one such solution to deal with given cluttered environment, through unconventional robotic parameters and by tradingoff the requirement of number of degrees of freedom.
2. Problem Formulation
A nested optimization approach is proposed in this work with all the robotic parameters as design variables in the inner loop for dimensional synthesis and a unidirectional problem solving in number of dof in the outer loop. Important aspects related to the problem are the utilization of unconventional robotic parameters and varying number of degrees of freedom:(1)Flexibility in the values of robotic parameters (DH parameters in this work) leads to a larger search domain, which is required for a feasible solution in intricate workstations. For highly cluttered environments, this aspect is expected to play an important role. Related to this work, for a link manipulator, Patel and Sobh [7] utilized a larger range of DH parameters. The adaptable modules are fabricated to adapt the unconventional values of DH parameters such as adaptable links [8] with adaptable connectors. The proposed methodology provides a general platform which can provide a robotic arm design corresponding to a given workstation, defined by a workspace model.(2)The number of dof is not confined to any predefined value. Kinematic redundancy is kept acceptable in the varying number of dof. This is to gain the inherent advantages of a large number of dof, if required, according to the work scenario.The proposed strategy is illustrated through realistic workcells, with the changes in number of task space locations (TSLs).
2.1. Varying Number of Degrees of Freedom and Unconventional Robotic Parameters
For an linked serial manipulator, DH convention is used to attach the reference frames to the serially joined links (refer to [9]). To define the relation between th and th links, , four parameters—twist angle (), link length (), joint offset (), and joint angle —are associated.
As shown in Figure 2, the link parameters ((), ()) and joint offset () are fixed to provide a manipulator configuration. With values of , this configuration will attain one particular posture. By varying the values of each (), the posture of this configuration can be changed; that is, position of the endeffector can be varied to reach the desired locations (TSLs)—say “” in number.
A transformation matrix, using DH parameters, defines transformation of frame relative to frame , represented as , and is computed as
For dof, comprising frames, number of transformation matrices are computed. The concatenated matrix provides the required transformation from frame corresponding to the endeffector to frame attached to the base:
The robotic parameters in manipulator kinematic equations are dependent on number of dof. For a single posture of an link manipulator, total parameters are required to compute kinematic equations. Since the value of “” is not defined a priori, the total number of design variables will vary with each change in dof . This is handled through a nested optimization problem formulation.
Apart from the possibility of using redundant joints in the design, if and when required, the robotic parameters are also kept flexible in the proposed methodology. Figures 3(a) and 3(b) present the significance of conventional twist angles with normal values as or and unconventional twist angles values. The latter provides a larger solution space and thus a possibility of getting solution even in highly constrained workcells.
(a) Two links connected at conventional values of twist angle
(b) Illustration of unconventional twist angles, which provide flexibility to the design process
2.2. Collision Avoidance
To work on a general problem with any given cluttered workspace, an obstacle avoidance strategy is required. It is important to check any collision among the robotic links and any of the environmental objects. In this work, emphasis is given on the thorough examination of any configuration in question; that is, the collision is not checked just for endeffector and/or for a few points on the robotic links. For this purpose, the solid model of the workspace is required in Stereolithographic (stl) format which is modelled in Solidworks Premium 2013 version. The stl file provides the connectivity information of modelled environment in triangulated mesh format. The forward kinematic procedure is used to model the robotic arm at every iteration. Each link is assumed to be a rectangular parallelepiped with square cross section of a prescribed width. For collision detection, the proximity query package is utilized. The obstacle avoidance approach computes the minimum distance between the two solid models, represented in their triangulated form. In case there is collision between the two objects, the package furnishes the data about the colliding pairs. The collided pair may belong to the robot links or robot obstacles. The strategy computes a positive minimum distance “” between the models which is utilized in formation of corresponding constraints.
3. TaskOriented Problem Formulation
A nested bilevel optimization problem is formulated for minimizing the number of dof at upper level (outer loop) and designing a robotic arm for the fixed number of dof in each inner loop.
3.1. Reachability at Working Locations: Objective Function
For each current value of “” in the outer loop, robotic parameters are synthesized for reachability at the required TSLs. Reachability is measured as a squared error function of Euclidean distances, that is, distance between the endeffector position of the manipulator and the specified TSL as
A schematic diagram of the endeffector position of a redundant manipulator while reaching at the desired task locations is shown in Figure 4. For an link manipulator, working for TSLs—with the actual position of the endeffector corresponding to the th TSL as vector and the desired TSL position as vector —the error square sum for number of TSLs is computed as
In Cartesian coordinates, (3) can be expressed as
Finally, the cumulative error for all the TSLs can be written as
To include the orientation of a frame attached to the endeffector of the manipulator relative to the base frame, Euler angle conventions have been used. With , , and representing the Euler angles corresponding to a particular configuration of the manipulator under consideration, the objective function can be revised as Corresponding actual orientation parameters (, , and ) can be derived from the concatenative rotation matrix of the endeffector with respect to the base frame.
The actual coordinates of the manipulator endeffector are given by the forward kinematics using DH parameters (). The transformation matrices are multiplied together to form an arm matrix. The first three elements of the global transformation matrix give the current location of the endeffector in Cartesian form, that is, . It is worth mentioning here that the base point coordinates can also be considered as design variables, in case the application allows a flexibility in the installation point of the robot:where is the coordinates of the base point.
3.2. Unconventional Robotic Parameters: Design Variables
The global transformation matrix is calculated to determine the actual position in Cartesian coordinates. The arm matrix is the function of the number of dof and DH parameters and all are considered as design variables for the formulated problem. Out of all the DH parameters, link parameters are fixed for each TSL, while the joint variables are varying to provide th configuration. The change in joint variables is required to reach at different TSLs for each particular robotic posture. With the number of TSLs as “”, total “” joint variables are required. The joint variables are expressed as
The total number of design variables for link manipulator reaching “” TSLs is, therefore, . Since the number of dof “” is also a design variable, it leads to an inherent challenge of handling varying number of design variables in each iteration. Therefore, a bilevel problem is formulated to fix the number of dof at the upper level. The dimensional synthesis variable vector is expressed as and it is further a function of “”.
3.3. Constraints Handling
The minimization of the objective function is subject to the constraints due to the limits on the design variables and due to the environmental obstacles.
3.3.1. Limiting Values of DH Parameters: Inequality Constraints
All the DH parameters and degrees of freedom are design variables in the above formulated problem. The limiting bound/range on all the design variables are imposed as constraints for the optimization method. The limits on DH parameters for the th link can be written aswhere , , and in suffix represents the lower bound, while represents the upper. Each inequality in (10) gives rise to a pair of constraints in the formThe bounds on the number of degrees of freedom are also discussed later.
3.3.2. Cluttered Workstations: Inequality Constraints
To compute the minimum distance between the robot and the workspace or among the robot links, the workspace and each link of the manipulator are presented in a triangulated mesh format, as discussed in Section 2.2. A function is defined as the minimum distance between two nearest triangle pairs. The minimum distance of separation (positive in nature), reported by the package, is returned as . The function gets a negative value representing the overall intersection, when there is a collision between objects (robotobstacle or linklink).
The inequality constraint including both cases is represented aswhere is the number of TSLs. Thus, the th constraint gets active only when there is an intersection of the manipulator with any obstacle and/or among the links, at the posture corresponding to the th TSL.
All these constraints, along with the objective function, constitute the problem in . As discussed earlier, this constrained optimization problem is solved by using augmented Lagrangian method.
4. Binary Search Method: Outer Loop
The binary search method is applied at the outer layer of the formulated bilevel optimization problem. The technique is used to locate the target value in a sorted array [10]. In this work, targeted value is the minimum number of dof at which the manipulator can be designed for reachability at desired TSLs. The range of dof is the array under consideration from which the middle element will be selected and every element of the array is an integer.
It is used to find out the optimal number of degrees of freedom . Total number of design variables are dependent on dof as discussed in Section 3.2, that is, [], where is the number of TSLs. “” is an integer value and possesses a finite range of 3–12 in this work.
To initialize the method, the array is split in half and the middle element is selected as an input to the inner loop; that is,where and are the upper and the lower limit of the number of dof and represents the iteration number. In the inner loop, a nonlinear optimization problem has been formulated and augmented Lagrangian method is used to solve the highly constrained problem. is the value at which design vector is to be determined in inner loop optimization.
In case the solution does not exist at , it becomes the new as
However, if there exists a design solution at , then it becomes new and The iterative process terminates with .
5. Augmented Lagrangian Method: Inner Loop
This constrained optimization method uses the combination of duality and penalty aspects. A penalty function is induced in the objective function to check the constraint violation. The Hessian of Lagrangian can be illconditioned in some cases due to which it affects the rate of convergence. The dual method can be applied only on convex functions. So, in augmented Lagrangian method, a moderate penalty is applied to augment the objective function into its convex function [11].
Suppose is the objective function to be minimized subject to the inequality constraintsand equality constraints where and are the number of inequality and equality constraints, respectively. The augmented Lagrangian function is then expressed as where and are the Lagrange multipliers corresponding to th inequality and th equality constraints, respectively, whereas is the penalty parameter.
6. Methodology
For a given workcell (in triangulated mesh format) with the tasks defined as the working locations (in Euclidean space), the problem formulated in the previous sections facilitates the solution of the problem with minimum number of dof. The complete methodology is summarized through the following steps.
Upper Level Start(1)Define and for binary search algorithm.(2)Compute the value and update it to lower level.
Lower Level Start(1)Formulate the objective function referring to (18).(2)Specify the constraints due to parameter bounds and obstacles as mentioned in Section 3.3.(3)Apply the augmented Lagrangian method to solve the formulated NLP problem. This involves updating the Lagrange multipliers as discussed in previous section.(4)Update the solution status to upper level.
Lower Level Ends(1)Based on the solution status at lower level, update according to (14) and (15).(2)Check termination criteria. If the condition mentioned after (15) is fulfilled, the corresponding inner loop solution is the required feasible solution with minimum number of dof.
Upper Level Ends. It is possible that, on termination, the objective function is not zero, which signifies that no solution is possible within the prescribed range of dof. The range of dof can also be expanded to increase the redundancy. The bounds on the link lengths can be relaxed, if allowed. The range of degrees of freedom is to in this work. Only revolute joint has been taken in the design process which means joint offset will be fixed parameter in all the cases.
7. Results and Discussion
The problem, discussed and formulated in the previous sections, is implemented in C++. For the execution of the code, the information of workspace environment in the triangulated mesh format, the task space locations in the environment, base position of the manipulator, and the limits on the DH parameters (design variables) are required as the input data.
Using the proposed strategy, manipulator design for several environments has been synthesized and some of the results are presented in this section.
7.1. Example 1: Strategy Validation
Case 1. An exemplary workspace is taken into consideration for the validation of the strategy. It has 10 blocks scattered in the space, as shown in Figure 5(a). The required manipulator needs to work at TSLs [, , , and ], while avoiding all the blocks. The base of the manipulator is fixed at (,,). The design of an link manipulator has been reported in the work of Singla et al. [5] for the same environment and TSLs. The number of dof was reported fixed in the work.
By using the proposed strategy given in this chapter, the link manipulator can reach all the given TSLs. In the first iteration, the degrees of freedom have been taken as at the outer loop and initialize the augmented Lagrangian method in the inner loop for reachability. The link design outcome is expected because, with same input, it has been reported earlier.
The update is done according to the algorithm discussed in Section 4. The number of dof is updated to at the outer loop and this updated value is checked for the success in the inner loop. Table 1 presents the robotic parameters and Figure 5(b) shows the corresponding skeletal view of the manipulator in the workspace.
Binary search will update the new value of dof that is in this case. At number of dof , the method fails to converge. A positive error value that is is left, which signifies that no solution exists at dof . The method will terminate here with a link design as an output. The case showcases the importance of varying number of links.

(a) A 10obstacle environment with 4 TSLs
(b) A skeletal view of the 6link manipulator in the environment.
Case 2. It is quite possible to achieve the required set of design variables with dof, if variable bounds are relaxed. For dof design, the link length limits in the failed case are which are changed to . With the changed limits, the reachability is achieved as shown in Figure 6(b). With the initial limits, robot arm was nearly outstretched to its full length and yet not able to reach one of the TSLs, as shown in Figure 6(a). Therefore, the variations in the link lengths are tried and successfully delivered the result.
(a) A 5link design failed to reach
(b) A 5link manipulator design
7.2. Example 2: Comparison with Conventional Values of DH Parameters
This example is included to compare the design results having conventional values of twist angles with the proposed flexibility in twist angles. The environment and the working locations are kept the same as used in the previous case study. In this example, the outer loop is not active and the number of dof is fixed manually at different levels. The problem starts with a link configuration in which the link lengths and the joint offsets can vary and all the twist angles are taken as either perpendicular or parallel. The values of all the twist angles are taken the same as for PUMA configuration. This example is an attempt to compare whether a manipulator with conventional twist angles that is or achieves the objective with same number of dof. If not, then how many dof are required to reach? Hence, the problem started with minimum number of dof which has been calculated in the previous example. It is observed that, with least variation in twist angles, no solution is obtained with number of dof , , and . Twist angle can vary along with other variables from dof onwards because there is no set conventional value of twist angle in redundant manipulators. In this example, with first dof puma configuration, a link manipulator is the design outcome. Corresponding DH parameters are shown in Table 2 and the configurations are presented in Figure 7. There is an important aspect that with increase in solution space degrees of freedom can be decreased for reaching desired locations.

7.3. Example 3: Realistic Environment of a Server Room
In this case study, a server room environment has been taken into consideration, as shown in Figure 8(a). The manipulator has to reach TSLs, , , and , as shown in Figure 8(b) and the base point of the manipulator is taken at . Minimum link manipulator is required to reach all these TSLs. The corresponding design is presented in Table 3 and Figure 8(c) presents the visualization for desired working postures.

(a) Server room model
(b) Work environment and the TSLs
(c) Skeletal view of the 6link manipulator in the server room
In the first case study, it has been shown that, with less number of dof and varying the limits of variable, it is possible to compute the solution set of parameters. Now, in the present scenario, number of TSLs increased from to and placed in such a way that link design failed to reach which means strategy will automatically select the higher number of dof. A link manipulator design is selected to reach TSLs , , , , and with the same base point as shown in Figure 9(a) showing the violation of constraints in an intermediate iteration. The method will give the solution when there is no collision and all the parameters are converged according to the termination criteria. Figure 9(b) shows the model which is an outcome of a fully converged problem. The corresponding DH parameters are shown in Table 4.

(a) Sevenlink manipulator in the server room, intermediate iteration number 5
(b) Sevenlink design in the server room: final solution
(c) Number of violated constraints and the objective function evaluation
7.4. Example 4: Synthesis for Both Position and Orientation
This example presents a manipulator synthesis problem for both position and orientation of the endeffector, that is, for the entire armwrist combination. The workspace consists of an enclosed environment including a table and a big box, representing a cupboard, as shown in Figure 10(a). The figure includes two TSLs along with the desired approaching directions of the endeffector. The prescribed positions for these locations are and with () as the three orientation angles, the same for both locations. A 7link manipulator is synthesized for the situation, with fixed base point locations as . Table 5 contains the synthesis solution and pictorial view of the corresponding configurations is presented in Figure 10(b).

(a) The workspace
(b) The resulting configurations
8. Conclusion
In this work, the variation in the working environments for a service robotic arm is dealt with through a general methodology for a constrained workcell. For this purpose, least constraints are applied at the number of dof and over the values of the robotic parameters. A bilevel optimization problem is formulated, involving the minimization of the number of degrees of freedom required to work in the given environment and for the given tasks (positions and orientations). Binary search algorithm is implemented for the outer layer of the optimization problem, which solves the unidirection problem in number of dof. In each of the outer iterations, a nonlinear optimization problem is solved for dimensional synthesis. The proposed methodology is validated through the reduction of the number of dof required for an environment, reported in earlier works. The importance of flexibility in robotic parameters is illustrated through two different cases in a realistic workcell of a computer server room where a robotic assistance is required for maintenance.
Competing Interests
The authors declare that they have no competing interests.
Acknowledgments
Authors gratefully acknowledge the financial support of Department of Science and Technology (DST), Government of India, for this work.
References
 G. Yang and I.M. Chen, “Taskbased optimization of modular robot configurations: minimized degreeoffreedom approach,” Mechanism and Machine Theory, vol. 35, no. 4, pp. 517–540, 2000. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 Y. Zhang and J. Wang, “Obstacle avoidance for kinematically redundant manipulators using a dual neural network,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 34, no. 1, pp. 752–759, 2004. View at: Publisher Site  Google Scholar
 I.M. Chen, “Modular robots,” in Handbook of Manufacturing Engineering and Technology, pp. 2129–2168, Springer, 2015. View at: Google Scholar
 Z. M. Bi, W. J. Zhang, I.M. Chen, and S. Y. T. Lang, “Automated geneartion of the D–H parameters for configuration design of modular manipulators,” Robotics and ComputerIntegrated Manufacturing, vol. 23, no. 5, pp. 553–562, 2007. View at: Publisher Site  Google Scholar
 E. Singla, S. Tripathi, V. Rakesh, and B. Dasgupta, “Dimensional synthesis of kinematically redundant serial manipulators for cluttered environments,” Robotics and Autonomous Systems, vol. 58, no. 5, pp. 585–595, 2010. View at: Publisher Site  Google Scholar
 S. Rubrecht, E. Singla, V. Padois, P. Bidaud, and M. de Broissia, “Evolutionary design of a robotic manipulator for a highly constrained environment,” in New Horizons in Evolutionary Robotics, S. Doncieux, N. Bredèche, and J.B. Mouret, Eds., vol. 341 of Studies in Computational Intelligence, pp. 109–121, Springer, 2011. View at: Publisher Site  Google Scholar
 S. Patel and T. Sobh, “Task based synthesis of serial manipulators,” Journal of Advanced Research, vol. 6, no. 3, pp. 479–492, 2015. View at: Publisher Site  Google Scholar
 M. Brandstötter, A. Angerer, and M. Hofbaur, “The curved manipulator (cumatype arm): realization of a serial manipulator with general structure in modular design,” in Proceedings of the 14th IFToMM World Congress, pp. 403–409, October 2015. View at: Publisher Site  Google Scholar
 J. Craig, Introduction to Robotics: Mechanics and Control, AddisonWesley Longman Publishing, Boston, Mass, USA, 1989.
 D. E. Knuth, “Optimum binary search trees,” Acta Informatica, vol. 1, no. 1, pp. 14–25, 1971. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 K. Deb, Optimization for Engineering Design: Algorithms and Examples, PHI Learning, 2012.
Copyright
Copyright © 2016 Satwinder Singh and Ekta Singla. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.