2-Axis Pan and Tilt Motion Platform, a complex multivariate non-linear system, may incur any disturbance, thus requiring system controller with robustness against various disturbances. In this study, we designed an adaptive backstepping compensated controller by estimating the disturbance and error using the Radial Basis Function Neural Network (RBF NN). In this process, Uniformly Ultimately Bounded (UUB) was demonstrated via Lyapunov and stability was confirmed. By generating progressive disturbance to the irregular frequency and amplitude changes, it was verified for various environmental disturbances. In addition, by setting the RBF NN input vector to the minimum, the estimated disturbance compensation process was analyzed. Only two input vectors facilitated compensatory function of RBF NN via estimating the modeling and control error values as well as irregular disturbance; the application of the process resulted in improved backstepping controller performance that was confirmed through simulation.

A parallel mechanism with redundancy can be regarded as a means for not only maximizing the benefits of parallel mechanisms but also overcoming their drawbacks. We proposed a novel parallel mechanism by eliminating an unnecessary degree of freedom of the configuration space. Because of redundancy, however, the solution for the inverse kinematics of the developed parallel mechanism is infinite. Therefore, we defined a cost function that can minimize the movement time to the target orientation and found the solution for the inverse kinematics by using a numerical method. In addition, we proposed a method for determining the boundary of the geometric singularity in order to avoid singularities.

This paper presents a scheduling problem for a high-density robotic workcell using multi-objective genetic algorithm. We propose a new algorithm based on NSGA-II(Non-dominated Sorting Algorithm-II) which is the most popular algorithm to solve multi-objective optimization problems. To solve the problem efficiently, the proposed algorithm divides the problem into two processes: clustering and scheduling. In clustering process, we focus on multi-robot positions because they are fixed in manufacturing system and have a great effect on task distribution. We test the algorithm by changing multi-robot positions and compare it to previous work. Test results shows that the proposed algorithm is effective under various conditions.