Abstract

The energy of a space station is a precious resource, and the minimization of energy consumption of a space manipulator is crucial to maintain its normal functionalities. This paper first presents novel gaits for space manipulators by equipping a new gripping mechanism. With the use of wheels locomotion, lower energy demand gaits can be achieved. With the use of the proposed gaits, we further develop a global path planning algorithm for space manipulators which can plan a moving path on a space station with a minimum total energy demand. Different from existing approaches, we emphasize both the use of the proposed low energy demand gaits and the gaits composition during the path planning process. To evaluate the performance of the proposed gaits and path planning algorithm, numerous simulations are performed. Results show that the energy demand of both the proposed gaits and the resultant moving path is also minimum.

1. Introduction

The application of robots in space exploration becomes more advanced. For extravehicular activities (EVA) in low Earth orbit, most of them are designed as a chain-like manipulator which is suitable in performing tasks such as mechanical assistance, capturing operations, monitoring, and satellite maintenance [1]. Shuttle Remote Manipulator System (SRMS) [2, 3], Engineering Test Satellite No. 7 (ETS-VII) [4], the main arm (MA) and the small fine arm (SFA) of Module Remote Manipulator System (JEMRMS) [5], European Robotic Arm [6] and Space Station Remote Manipulator System (SSRMS), or Canadarm 2 [7] are typical examples for space manipulators. In addition to manipulation tasks, they are capable of navigating on the exterior of a space station. For the locomotion on a space station, two major gaits are commonly used which are inchworm gait and turnaround gait. Canadarm 2 is a typical example which uses inchworm gait for locomotion. Different from the inchworm gait, the turn around gait is another commonly used gait in conventional truss climbing robots such as Shady, Shady 3D, and Handbot [810].

For the conventional long limbs design of space manipulators, a larger joint torque is required to drive the arm’s swing motion in conventional gaits. As a result, these conventional gaits are regarded as a high power demand motion. Since the energy source of a manipulator is from the attached space station, the minimization of energy consumption of a space manipulator is crucial to maintain normal functionalities of a space station. Without modifying the joint configuration of existing manipulators, we propose novel gaits for space manipulators by equipping a new gripping mechanism which combines the wheels locomotion in conventional grippers. For linear locomotion, it can eliminate the swing motions in conventional gaits. For turning motion, the range of swing motions is reduced by the wheels locomotion. Different from the Mobile Transporter of Mobile Servicing System (MSS), the proposed concept allows a manipulator to transit between trusses. In fact, several benefits can also be achieved. For example, the complexity of docking process during the exchange of gripping base can be simplified. As a result, the navigation efficiency can be enhanced. Also, the additional redundancy of the manipulator’s mobility allows a fine positioning capability when it moves on a truss.

Based on our previous research, we developed a gripping mechanism, Movable Gripper (MovGrip), which combines the concepts of active wheels in traditional parallel grippers [11]. With the use of MovGrip, a frame climbing robot, Frambot, is also developed which illustrates the methodology of using wheels in truss climbing [12]. With the advantages of MovGrip, one of the contributions in this paper is to propose novel gaits for space manipulators in minimizing the energy demand on a space station. To study the energy demand of different gaits, we extend the conventional modeling method to formulate the dynamic coupling effect during wheels locomotion. Based on the system’s dynamic model, the proposed gaits are simulated and the corresponding energy demand is analyzed.

With the use of the proposed gaits, we further develop a global path planning algorithm for space manipulators which can plan a moving path on a space station with a minimum total energy demand. For conventional path planning algorithms, they are highlighted by many researchers in the category of planar mobile robots. Fernandez et al. proposed a path planning algorithm for mobile robot navigation with the use of a multicriteria path planar in 1999 [13]. In 2001, Gemeinder and Gerke proposed a genetic-algorithm- (GA-) based robot path planning algorithm [14]. Wang et al. developed a path planning algorithm in 2008 which also considers the lifetime of a mobile robot [15]. In 2009, Ooi and Schindelhauer proposed a path planning algorithm to find a solution path for mobile robots with an optimal energy consumption for both robot’s mobility and communication [16]. Liu and Sun proposed a path planning algorithm using algorithm with a minimum energy consumption in 2011 [17].

For the above algorithms, they mainly focus on the path planning problems whose workspace is limited on a 2D plane. Although the properties of a mobile robot and its working environment are studied, the robot’s orientation after each move is not considered. For instance, space manipulators possess a 3D workspace. For a given current and target points pair, different manipulator’s orientations on a truss can result in a different energy demand to reach the target point. Also, most of their works focused on the minimization of the path length as the energy consumption optimization. However, two paths with the same path length may have different energy demands. In fact, it depends on the motions composition in reaching a target position. Since the energy demand of each individual locomotion of a mobile robot can be different, the search of a solution path should also consider the composition of motion primitives.

Besides the planar mobile robots, the optimization problem is also addressed by researchers in climbing robots. For example, Balaguer proposed a path planning algorithm for ROMA which is a frame climbing robot developed to travel into complex metallic-based environments for inspection, assembly, and maintenance [18, 19]. For different climbing aspects such as linear truss climbing, turning, and transition between surfaces, different climbing methodologies are considered and the one with a minimum energy demand is selected as the climbing motion for ROMA in that climbing aspect. Although the motion primitives are preselected with a minimum energy demand, the composition of motion primitives in a climbing path is still not considered.

In this paper, the proposed path planning algorithm considers the composition of the proposed gaits in planning a moving path and the optimization is achieved by GA. To enhance the performance of the conventional GA, a novel genetic operator, Planar-NN is proposed and the design of Planar-NN, is based on the feature of the energy demands of the proposed gaits. The working principle of Planar-NN is to search a solution path with more motion primitives which contribute a lower energy demand. With this, the total energy demand of a solution path not only can be reduced by the use of motion primitives with a minimum individual energy demand, but also can further be minimized by focusing on the composition of motion primitives in the path.

The remaining of this paper is organized as follows. Section 2 gives a brief design description on our robot prototype, Frambot, including the robot’s specifications, design of Movable Gripper (MovGrip), and locomotion. The conventional and proposed gaits for space robotic arms are illustrated in Section 3. Section 4 first describes methodology to model the dynamic coupling effect during wheels navigation. After that, the energy demand of the proposed gaits are simulated and analyzed. The global path planning algorithm is illustrated in Section 5. Finally, contributions of this paper are summarized in Section 6.

2. Design of Frambot

In this section, the design of a novel frame climbing robot (Frambot) is presented which aims to give a brief introduction on the design and use of a movable gripper in truss climbing. The working principle of the movable gripper on Frambot is first described. The major specifications of Frambot are also summarized. After that, the climbing motions of Frambot are illustrated. Details of the design and performance of Frambot are presented in [11, 12] and this is not repeated here.

2.1. Mechanical Design

Figure 1 shows the current prototype of Frambot which consists of (a) body linkage and (b) movable gripper (MovGrip). For the body linkage of Frambot, it is a four degree of freedom (DOF) serial robot linkage actuated by digital servo motors. Table 1 summaries the major specifications of Frambot.

The structure of MovGrip is composed of two major parts, (a) gripper jaw and (b) parallel gripping mechanism (Figure 2). Different from conventional design, each of the gripper jaws is equipped with two wheels actuated by mini geared motors through a spur gears transmission. For the parallel gripping mechanism, it is actuated by two linear servo motors and the gripping force is generated by the compression of springs. To simplify the design, the wheels’ traction of MovGrip is contributed by the gripping force.

2.2. Locomotion on a Truss

For the design of conventional space manipulators, their end effector is mainly designed for grasping and different locomotion can only be performed by the swing motion of their body linkage. With the use of MovGrip, wheels locomotion can be utilized to minimize the arm’s swing motion. For linear locomotion, it is performed by the rotation of wheels in MovGrip and the arm’s swing motion in conventional turnaround and inchworm gaits are therefore eliminated. Figures 3 and 4 illustrate the turning and exterior transition of Frambot on a hexagonal aluminum truss, respectively. Frambot first lifts up the front gripper by using the body linkage. After that, it uses wheels locomotion to move forward until the front gripper can form a grasp on the target truss. Once a grasp is formed, the rear gripper is opened and lifted up. Similarly, Frambot uses wheels locomotion to climb forward until there is enough space for it to lower the rear gripper.

3. Design of Locomotion

One of the major contributions in this paper is to propose new gaits for space manipulators with an open chain configuration. For its gripping mechanism, it is assumed to be the concept presented in previous section. By this, the gripper not only provides a grasp on a truss, but also allows a linear locomotion along the truss by the embedded active wheels. Under this configuration, both conventional and proposed gaits can be realized and compared unbiasedly. For simplicity, we focus on the motion of a cubic truss structure which is symmetric about its principal axes. With this, the moment of inertia about the three axes is identical which simplifies the energy demand analysis.

3.1. Joint Configurations

Aforementioned, a space station is first regarded as a cubic truss. For the locomotion on a truss, not all the joints of a seven-DOF space manipulator are involved. Therefore, the body of a space manipulator is defined as a five-DOF chain-like manipulator with its two ends equipped with MovGrip (Figure 5). It is a Roll-Pitch-Pitch-Pitch-Roll configuration which can be considered as a simplified version of Canadarm 2 and ERA.

3.2. Linear Locomotion

For linear locomotion, the most commonly used gaits are turnaround and inchworm gaits [20]. Figure 6 illustrates the turnaround gait and the cross marked at the upper gripper indicates a closed grip. Firstly, the robot forms a grasp on a truss by the upper gripper and the other one is lifted up through the rotation of the three pitch joints (P2–P4). After that, the robot arm swings from back to front by using the roll joint (R5). Finally, the free gripper is lowered down and forms a grasp on the truss. The motion continues by repeating the above motion steps.

For inchworm gait, it is realized by using the three pitch joints (Figure 7). Firstly, the upper gripper forms a grasp on the truss and the lower one opens. After that, the three pitch joints (P2–P4) rotate so that the robot arm folds. Then, the lower gripper closes and the other one opens. Finally, the three pitch joints rotate so that the robot arm unfolds and the front gripper forms a grasp on the truss.

For the proposed locomotion, we propose the use of wheels locomotion to reduce the swing motions of a space manipulator. Since the manipulator does not move with respect to the gripper, the arm’s swing motion is eliminated. Hence, the energy demand is converted to the rotation of wheels in the grippers.

3.3. Turning

Figure 8 illustrates the gait for turning. Firstly, the robot forms a grip by the front gripper and the other one is lifted up by the three pitch joints (P2–P4) (a). After that, the robot arm swings clockwise from the back to the left side by the roll joint (R5). The three pitch joints then rotate which lowers the free gripper (b). It grips the left truss and the other gripper opens. After that, the free gripper is lifted by the pitch joints and the robot arm swings until the free gripper is in a position above the left truss (c). Finally, the free gripper is lowered and a closed grasp is formed on the truss (d).

Figure 9 illustrates the proposed turning motion. Firstly, the robot forms a grasp by the rear gripper and the other one is lifted up by the three pitch joints (P2–P4) (a). After that, the robot moves forward by using wheels locomotion (b). The robot arm then swings to the left side by the roll joint (R1). The three pitch joints rotate which lowers the free gripper (c). It grips the left truss and the other gripper then opens. After that, the free gripper is then lifted by the pitch joints and the robot arm swings until the free gripper is above the left truss (d). Finally, the robot moves forward by using wheels locomotion until there is enough space for it to lower the free gripper (e) and (f).

As an alternative of the turning gait, space manipulators can perform inchworm gait to replace the wheels locomotion in the proposed turning gait. Since the notion of inchworm gait is illustrated before, the use of inchworm gait in truss turning is not repeated here. When compared with the conventional turning gaits, there are two common motion steps which are the target posture of the motion steps (c) and (f). For the proposed turning gait, it uses wheels locomotion to reduce the rotation of roll joints in conventional gaits.

3.4. Exterior Transition

Figure 10 shows the conventional gait for exterior transition by using the turnaround gait. Firstly, the robot forms a grasp by the upper gripper and the other one is lifted up by the three pitch joints (P2–P4) (a). After that, the robot arm swings from back to the front by the roll joint (R5) (b). Then, the pitch joints rotate so that the free gripper can form a grasp on the exterior of the truss (c). The free gripper closes and the other gripper then opens. Similarly, the robot arm swings up by the pitch joints (d) which aims to make the whole robot above the exterior truss. After that, the roll joint (R1) rotates which swings the robot arm forward (e). Finally, the free gripper is lowered and a closed grasp is formed on the truss (f).

Figure 11 shows the proposed gait for exterior transition. Firstly, the robot forms a grasp by using the lower gripper and the other one is lifted up by the three pitch joints (P2–P4) (a). After that, the robot moves forward by using wheels locomotion (b). Then, the pitch joints rotate so that the free gripper can grasp the exterior of the truss (c). The free gripper closes and the other gripper then opens. Similarly, the robot arm swings up by the pitch joints (d) which aims to make the whole robot above the exterior truss. Finally, the robot moves forward by using wheels locomotion until there is enough space for it to lower the free gripper (e) and (f).

Similar to the turning gait, space manipulators can also perform inchworm gait to replace the wheels locomotion in the proposed transition gait and it is not illustrated here. Also, there are two common motion steps for the conventional and proposed transition gaits which are the target posture of the motion steps (Figures 11(c) and 11(f)). For the proposed gait, it minimizes the rotation of roll joints by driving the robot forward using wheels locomotion.

4. Analysis of Energy Demand

For the energy demand of a gait, it is defined as the energy required to perform that gait. For the joint’s motion, the energy demand, “” of the th joint can be formulated as the time integration of the joint torque, “,” and angular velocity, “,” multiplication as

Similarly, the energy demand, “,” for the wheels locomotion is the time integration of the wheels traction force, “,” and linear velocity, “,” multiplication as

The total energy demand of a gait can be computed as the sum of all individual energy demands. To compare the energy demand of different gaits of a space manipulator, the kinematics, momentums, and dynamics of a space robotic system provide the fundamental approach. Because of this, this section first presents the modeling of a space robotic system. After that, the energy demand of different gaits is analyzed.

4.1. Modeling of a Space Robotic System

Since the formulation of the dynamic coupling effect of a space manipulator with one end fixed on a space station is commonly established [2123], this paper only focuses on the approach to model the dynamic coupling effects under wheels locomotion. A general model for a space robotic system is first described. After that, the system’s kinematics and momentum relationships are presented. To determine the system’s dynamic equations, Lagrangian formulation is utilized.

Figure 12 shows a general model of a space robotic system. The space manipulator consists of joints which are numbered from 1 to . Since the manipulator is mounted on a free floating space station, the whole system is regarded as a free flying chain-like system with links. As the space station can translate and rotate freely about the inertial frame axes, the total DOF of the system is .

For the system modeling, three coordinate frames are first introduced which include (a) inertial frame, (b) manipulator frame, and (c) base frame. For the inertial frame, its origin is fixed in the space. For the manipulator frame and base frame, their origins are located at the mass center of the manipulator and base, respectively. During the modeling, a number of notations are defined as follows:: joint variable vector (), : joint angular velocity vector, : joint torque vector (), : position vector of the base, : position vector of the mass center of link , : position vector of the manipulator’s mass center center, : position vector of the link w.r.t. to the base frame, : position vector of the manipulator’s mass center with respect to the base frame, : linear velocity of the base, : angular velocity of the base, : mass of the base, : total mass of the system, : total mass of the manipulator, : inertial tensor matrix of the manipulator with respect to its mass center, : inertial tensor matrix of the base with respect to its mass center, : identity matrix.

All vectors are described with respect to the inertial coordinate system unless another coordinate system is mentioned and . Here, two matrix functions are defined for a vector as follows:

In addition, several assumptions are made. First of all, all links are rigid bodies and there are no external forces and torques acting on the system. As a result, the total potential energy of the system is equal to zero. During wheels locomotion, it is assumed that the configuration of the manipulator is maintained (i.e., ). Also, the modeling is with respect to the inertial frame unless other coordinate frame is specified.

4.2. Kinematics

To model the kinematics of the system, the manipulator is first visualized as a prismatic joint and the closed MovGrip is the gripping point on the base. During wheels locomotion, the resultant wheels traction becomes the pushing force of the prismatic joint acting on the base and the gripping point is moving together with wheels locomotion. Since the manipulator does not move with respect to the gripper, the position vector of the manipulator’s mass center can be formulated as follows:

By taking time derivative on both sides, we can derive the system’s kinematics relationship as follows:

where is the linear velocity of the manipulator under wheels locomotion. is the linear velocity of the manipulator’s mass center with respect to the inertial frame. Since the whole system rotates together under wheels locomotion, both the manipulator and base have the same angular velocity (i.e., ).

4.3. Linear and Angular Momentums

Aforementioned, it is assumed that there are no external forces and torques acting on the system, and the linear and angular momentums of the system are conserved as

From the kinematics relationship, we express the variables and in terms of , and . By rearranging the variables of the momentum equations, they can derive the following momentum relationship: where (i)(ii)(iii)(iv)(v).

is the linear Jacobian matrix of the manipulator under wheels locomotion and is defined as follows:

is the rotation matrix from the manipulator frame to the inertial frame and is the -axis of the manipulator frame which indicates the direction of gripper’s movement. If the system is initially at rest, the following constraints can be obtained:

4.4. Dynamics

For the system’s dynamic modeling, the conventional Lagrangian approach is utilized. Since the total potential energy of the system is zero, the total energy of the system during wheels locomotion is the sum of translational and rotational kinetic energy () of all bodies in the system as

Similar to the momentum equations, the energy equations can be expressed in terms of , and as

The matrix is the system inertial matrix which is positive definite and symmetric. By using the Lagrangian formulation the dynamic model of the system can be derived as

where is the generalized force vector and is the non-linear centrifugal and Coriolis forces as

4.5. Simulation Study

For the analysis of energy demand of the proposed gaits, it is assumed that there are no external forces and torques acting on the system. For the space station, it is assumed to be a cubic truss structure which gives a symmetric property for simulations. Length of a side of the truss is 10 meters and the presented system dynamic model is utilized to compute the energy demand.

Both the proposed and conventional gaits are simulated and three different aspects are studied including (a) linear locomotion, (b) turning, and (c) exterior transition. For each of the three aspects, three gaits are considered including (a) turnaround gait, (b) inchworm gait, and (c) wheels locomotion. For fair comparison, the moving distance of different gaits in each of the three aspects is equal. Also, the time to perform different gaits in each of the three cases is fixed. Table 2 lists the system parameters for simulations.

Figure 13 shows the definition of the base, base frame, and robot initial and final configurations. For linear locomotion, the robot (marked with dotted line) is initially set at the corner of the edge A. It moves forward by using different gaits and stops at a distance of 2 meters away from the other end (corner G).

For the turning gaits at a truss corner, only the turn left gait is discussed and it is performed from edge A to edge B of the space station in Figure 13. The robot is initially set at a position where its front gripper is at a distance of 2.828 meters on edge A away from corner G. It performs the turning motion by using different gaits and stops at a position on edge B where its rear gripper is at a distance of 6.828 meters away from that corner. For the exterior transition at a truss corner, the motions are performed from edge A to edge C of the space station in Figure 13. The robot is initial set at a position where its front gripper is at a distance of 2 meters on edge A away from corner G. It performs exterior transition and stops at a position on edge C where its rear gripper is at a distance of 6 meters away from that corner.

Figures 14 and 15 show the angular displacement and torque profile of the inchworm gait, respectively. Since the distance travel of an inchworm gait is two meters, the two repeated patterns in Figure 14 indicate the two repetitions of the arm folding and unfolding motions. Also, only the three pitch joints (joints 2–4) are involved to perform the inchworm gait. Therefore, the torque profile of three pitch joints is nonzero.

By using (1), the total energy demand of the inchworm gait is 2.0458 joules per meter (). By using the similar approach, the total energy demand for the other turning and transition motions can be computed which are summarized in Table 3.

From the nature of the gaits, the arm folding and unfolding motions of the inchworm gait on the one hand require the largest joints movement when compared with the others. On the other hand, the distance travel in one motion step is the smallest. Given a certain operation time to complete the gait, the joints’ torque and angular velocity are much larger than the others. Under a constraint on the operation time, the inchworm gait is regarded as a high power demand motion.

For the wheels locomotion, the wheels’ traction force is in the same direction as the movement. Also, all the mass is moving along a straight line during wheels locomotion. With a long limb design of conventional space manipulator, the use of wheels locomotion can avoid the arm’s swing motion whose joints torque is high. Therefore, the use of wheels locomotion to reduce the joints movement allows an energy efficiency locomotion on a space station.

5. Global Path Planning Algorithm

For the proposed minimum energy demand-based path planning algorithm, the optimization goal is first defined. Given the robot’s initial position and orientation, a list of check points (including the target point) and their position with respect to an inertial frame, the objective is to search a path which passes all the check points once and reaches the target point with a minimum energy demand. This can be visualized as a space manipulator is commanded to follow the solution path and visit a list of points for monitoring or maintenance tasks on a space station. Finally, it is commanded to reach a target point for charging or standby.

Figure 16 shows the geometry of a space station. The edges in the structure are the frame for grasping and the corners are the possible check points. To travel all the check points along the solution path, a space manipulator is assumed to perform the basic motion primitives.

5.1. Representation of a Chromosome

In conventional GA, a chromosome is the basic element for genetic evolution. For the proposed algorithm, a chromosome represents the path for navigation. It is composed of genes and is equal to the total number of check points. Each of the genes is labeled with a unique integer which indicates the visiting order. Therefore, the integers in a chromosome describe the order of check points being visited.

5.2. Evaluation Function

In GA, chromosomes with a higher fitness (lower energy demand) with respect to the optimization goal are selected for genetic evolution. To measure the fitness of a chromosome, an evaluation function should be defined. In this algorithm, the optimization goal is to search an optimal path with a minimum energy demand. The fitness function is therefore defined as the total energy demand of the path. Since a chromosome is composed of genes representing the order of check points being visited, the total energy demand of a path is the summation of the individual energy demand of all consecutive gene pairs along the chromosome. Figure 17 shows a manipulator climbing on a truss structure as an example. It is currently at the check point and gripping on the edge A. To compute the energy demand for reaching the next check point, the current manipulator’s orientation is considered. To represent the manipulator’s orientation, two vectors are defined. They are the head and normal vectors which are labeled with orange and red colors, respectively. For the head vector, it indicates the current gripper direction after traveling from the point to . If is the first point, it represents the initial orientation of the robot gripper. For the normal vector, it is perpendicular to the truss surface and pointing away from the robot gripper.

For the energy demand of a pair of check points, there are three major possible cases. The first one is the case when the line connecting them is parallel to one of the inertial frame axes. The points pair and in Figure 17 shows an example with the line jointing them is parallel to the -axis. For the second case, two check points lie on a plane which is parallel to the plane formed by any two of the inertial frame axes. The points pair and shows an example with the plane parallel to the - plane of the inertial frame. For the last case, the coordinate values of the two check points are different. The points pair and shows an example that does not satisfy the first two cases. For simplicity, this paper only illustrates the computation of individual energy demand of a points pair in the second case. Because a similar technique can be used for the other cases, it is not repeated here.

Assumed that the manipulator is currently at the check point and gripping on the edge E, in this case, if its head and normal vectors are initially pointing to the negative -axis and positive -axis, respectively, there are two possible paths to travel from point to . The first motion sequence contains interior transition, linear frame climbing, turn left, and linear frame climbing. The other motion sequence contains turn left, linear frame climbing, interior transition, and linear frame climbing. Since the energy demand of both paths is the same, the motion sequencing to travel from point to is chosen randomly in order to maintain the global search of a solution path in GA. The corresponding energy demand is computed as follows:

and are the edge length between the two points along the and axes of the inertial frame, respectively. , , and , are the energy demand for the manipulator to move one meter forward, turn left, and perform interior transition, respectively. After computing the move to the next check point, the updated head and normal vectors of the manipulator become the current head and normal vectors. Although there are other possible cases for the initial condition of the manipulator in all the above three cases, similar techniques can be utilized and they are not repeated here for simplicity. Finally, the total energy demand to travel along a solution path is the sum of all individual energy demands and it is formulated as follows:

is the energy demand for a manipulator to navigate from the th check point back to the th point.

5.3. Genetic Operators

From the energy demands of the motion primitives in Table 3, the total energy demand of a path is lower if it is composed of more planar (or linear) path segments. Because of this, the proposed path planning algorithm focuses on the searching of an optimal path which consists of more planar path segments. With the use of GA for optimization, we enhance the evolution process by developing a novel exchange mechanism for the genetic information of a chromosome. It is a genetic operator which promotes the path with planar (or linear) genes segments. It is called Planar-NN and NN means nearest neighbor.

Figure 18 illustrates the working principle of Planar-NN. A sample frame structure is shown and the orange dot indicates the initial position of the manipulator. The grey and blue dots are the intermediate and final check points, respectively. An elitist chromosome for genetic evolution using Planar-NN is first selected as below. Starting from the head gene (gene with an index ), the operator searches the following genes if the genes pair satisfies one of the following cases.(i)The genes pair forms a line which is parallel to one of the inertial frame axes. (ii)The genes pair forms a plane which is parallel to the plane formed by any two of the inertial frame axes.

From Figure 18, the gene with an index is the first observed gene which satisfies the first condition. Therefore, it is extracted and adjoined to the current gene. After that, the extracted gene becomes the current gene and the selection process is repeated until there is no genes left for extraction. If there is no genes matching the above conditions, the first unselected gene which follows the current gene is extracted. From the remaining genes, the second extracted gene is the one with an index since the points pair with gene indexes and satisfies the second condition. By repeating the the extraction and adjoining processes, the final offspring is obtained.

The design of Planar-NN is a greedy search for an optimal solution. To avoid a local optimal solution, three conventional genetic operators are involved in the evolution process. They are (a) genes flip, (b) genes swap, and (c) genes slide. For the working principle of these conventional operators, it is illustrated in [24] and it is not repeated here.

5.4. Simulation Study and Discussion

In this section, the performance of the proposed algorithm is evaluated by simulating a path planning problem on a structural frame. To evaluate the algorithm under different aspects, different simulations are performed. Forty points are first randomly generated on a cubic frame structure and the edge length is 40 meters. It is divided into many smaller cells each with 1 meter long (). The genetic operators involved in the evolution process are (a) genes flip, (b) genes swap, (c) genes slide, and (d) Planar-NN. The probabilities of selecting them are equal during the evolution process and the maximum number of generation is 1000. Table 4 lists some of the key parameters for the simulations.

The first simulation aims to show the effect of different population sizes on the final solution path. The conventional genetic operators are utilized during the genetic evolution. At the same time, the maximum population size is varied. The simulation is repeated five times and the mean total energy demand of the best solution path is shown in Figure 19.

In general, the total energy demand of the best solution path searched by the algorithm decreases when the population size increases. It is reasonable because more chromosomes are involved in searching the global optimal path. From the simulation results, the best population size is selected as 80.

In the second simulation, the proposed genetic operator, Planar-NN, is utilized to search a solution path and the result is compared with the results of using conventional genetic operators. The simulation is repeated 10 times and the mean of the ten simulation results is shown in Figure 20.

From Figure 20, the overall convergent rate is significantly enhanced when the proposed genetic operator is involved in the evolution process. Also, the proposed algorithm can search a solution path with a lower total energy demand. Table 5 gives a comparison of the convergent rate between the use of conventional operators alone and the hybrid use of conventional operators and Planar-NN.

When Plannar-NN is involved for genetic evolution, the total energy demand of a path represented by the current best chromosome is decreased below 255 joule in the first 100 generation. Also, the evolution process keeps improving the fitness of the current fittest chromosome and the result is closed to the optimal solution after 400 generations with a variation within 11 joule. To save the computation time, the evolution process can be terminated if the total energy demand of the current best path is satisfied.

To explain these, the nature of the Planar-NN and the hybrid use of genetic operators are considered. The design of Planar-NN is a greedy local search. It groups the genes with a planar or linear relationships. Therefore, the use of Planar-NN can result in a solution path with segments of planar or linear check points. Also, the hybrid use of conventional genetic operators can maintain the concepts of natural evolution in GA and so local optimums can be avoided. Hence, the proposed algorithm can facilitate the search of a minimum energy demand path. Also, it verifies that the composition of motion primitives in a motion path is also important in energy demand minimization. Based on the simulation results, the total energy demand of the best solution path given by the proposed algorithm is 218.79 joule and the corresponding solution path is displayed in Figure 21. The green lines represent the edge of the frame structure and the blue points indicate the randomly generated check points. The initial and final robot positions are marked with black and pink dots, respectively.

6. Conclusion and Future Work

In this paper, we propose the design of new gaits for space manipulators with a lower energy demand which is the major contribution of this research. Based on the system dynamic model, different gaits are simulated and the corresponding energy demand is analyzed. Results show that the proposed gaits require a lower energy demand when compared with conventional gaits. With the use of the proposed gaits, a minimum energy demand-based path planning algorithm is also developed. Different from traditional approaches, the proposed algorithm considers the composition of motion primitives in a path for the energy demand minimization. Based on the framework of conventional GA, we adopted the concept of genetic modification to design a new genetic operator, Planar-NN. Based on the simulation results, it benefits the final solution in terms of fast convergent rate and lower energy demand. Also, it verifies that the composition of motion primitives in a path is also important in energy demand minimization. Although this paper assumes a space station as a cubic truss structure which is different from the existing space station such as International Space Station (ISS), the geometry of the cubic truss can be modified and the concept of nonfeasible edges can be introduced by highly increasing the energy demand of those edges. For the future development, the proposed algorithm will be able to handle uncertainties such as infeasible path and obstacle avoidance.