• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.1 s.94
• /
• pp.49-60
• /
• 1999

This paper addresses a welding task sequencing for robot arc welding process planning. Although welding task sequencing is an essential step in the welding process planning, it has not been considered through a systematic approach, but it depends rather on empirical knowledge. Thus, an effective task sequencing for robot arc welding is required. Welding perations can be classified by the number of welding robots. Genetic algorithms are applied to tackle those welding task sequencing problems. A genetic algorithm for traveling salesman problem (TSP) is utilized to determine welding task sequencing for a MultiWeldline-SingleLayer problem. Further, welding task sequencing for multiWeldline-MultiLayer welding is investigated and appropriate genetic algorithms are introduced. A random key genetic algorithm is also proposed to solve multi-robot welding sequencing : MultiWeldline with multi robots. Finally, the genetic algorithm are implemented for the welding task sequencing of three dimensional weld plate assemblies. Robot welding operations conforming to the algorithms are simulated in graphic detail using a robot simulation software IGRIP.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.8
• /
• pp.135-143
• /
• 2003

This paper presents the impact minimization of a biped robot by using genetic algorithm. In case we want to accomplish the designed plan under the special environments, a robot will be required to have walking capability and patterns with legs, which are in a similar manner as the gaits of insects, dogs and human beings. In order to walk more effectively, studies of mobile robot movement are needed. To generate optimal motion for a biped robot, we employ genetic algorithm. Genetic algorithm is searching for technology that can look for solution from the whole district, and it is possible to search optimal solution from a fitness function that needs not to solve differential equation. In this paper, we generate trajectories of gait and trunk motion by using genetic algorithm. Using genetic algorithm not only on gait trajectory but also on trunk motion trajectory, we can obtain the smoothly stable motion of robot that has the least impact during the walk. All of the suggested motions of biped robot are investigated by simulations and verified through the real implementation.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.7
• /
• pp.115-123
• /
• 2004

This paper deals with the gait optimization of via points on biped robot. ZMP(Zero Moment point) is the most important index in a biped robot's dynamic walking stability. To stable walking of a biped robot, leg's trajectory and a desired ZMP trajectory is required, balancing motion is solved by FDM(Finite Difference Method). In this paper, optimal index is defined to dynamically stable walking of a biped robot, and genetic algorithm is applied to optimize gait trajectory and balancing motion of a biped robot. By genetic algorithm, the index of walking parameter is efficiently optimized, and dynamic walking stability is verified by ZMP verification equation. Genetic algorithm is only applied to balancing motion, and is totally applied to whole trajectory. All of the suggested motions of biped robot are investigated by simulations and verified through the real implementation.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2953-2955
• /
• 1999

In this paper, the concept of evolvable hardware and evolutionary robotics are introduced and constructing the mobile robot controller without human operator is suggested. The robot controller is evolved to avoid obstacles by genetic learning which determines the weights between sensor inputs and motor outputs. Genetic algorithms which is executed in a computer(PC) searches the best weights by interacting with robot performance under it's environment. The experiment is done by real mobile robot Khepera and a simple GA.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2003.10a
• /
• pp.207-212
• /
• 2003

This paper proposed trajectory tracking control of Mobile Robot. Trajectory tracking control scheme are Real coding Genetic-Algorithm and Back-propergation Algorithm. Control scheme ability experience proposed simulation.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.10a
• /
• pp.181-186
• /
• 2004

This paper proposed trajectory tracking control of Mobile Robot. Trajectory tracking control scheme are Real coding Genetic-Algorithm and Back-propergation Algorithm. Control scheme ability experience proposed simulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2492-2497
• /
• 2003

This paper presents optimal walking trajectory generation for a quadruped robot with genetic-fuzzy algorithm. In order to move a quadruped robot smoothly, both generations of optimal leg trajectory and free walking are required. Generally, making free walking is difficult to realize for a quadruped robot, because the patterned trajectory may interfere in the free walking. In this paper, we suggest the generation method for the leg trajectory satisfied with free walking pattern so as to avoid obstacle and walk smoothly. We generate via points of leg with respect to body motion, and then we use the genetic-fuzzy algorithm to search for the optimal via velocity and acceleration information of legs. All these methods are verified with PC simulation program, and implemented to SERO-V robot.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.7 s.184
• /
• pp.84-92
• /
• 2006

This paper deals with determination of motions of a humanoid robot using genetic algorithm. A humanoid robot has some problems of the structural instability basically. So, we have to consider the stable walking gait in gait planning. Besides, it is important to make the smoothly optimal gait for saving the electric power. A mobile robot has battery to move autonomously. But a humanoid robot needs more electric power in order to drive many joints. So, if movements of walking joint don't maintain optimally, it is hard to sustain the battery power during the working period. Also, if a gait trajectory doesn't have optimal state, the expected lift span of joints tends to be decreased. Also, if a gait trajectory doesn't have optimal state, the expected lift span of joints tends to be decreased. To solve these problems, the genetic algorithm is employed to guarantee the optimal gait trajectory. The fitness functions in a genetic algorithm are introduced to find out optimal trajectory, which enables the robot to have the less reduced jerk of joints and get smooth movement. With these all process accomplished by PC-based program, the optimal solution could be obtained from the simulation. In addition, we discuss the design consideration fur the joint motion and distributed computation of tile humanoid, ISHURO, and suggest its result such as structure of the network and a disturbance observer.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1189-1192
• /
• 1996

Navigation is a science of directing a mobile robot as traversing the environment. The purpose of navigation is to reach a destination without getting lost or crashing into any obstacles. In this paper, we use a genetic algorithm for navigation. Genetic algorithm searches for path in the entire, continuous free space and unifies global path planning and local path planning. It is the efficient and effective method when compared with navigators using traditional approaches.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1177-1180
• /
• 1996

In this paper, we propose an algorithm that realizes cooperative behavior by construction of autonomous mobile robot system. Each robot is able to sense other robots and obstacles, and it has the rule of behavior to achieve the goal of the system. In this paper, to improve performance of the whole system, we use Genetic Programming based on Natural Selection. Genetic Programming's chromosome is a program of tree structure and it's major operators are crossover and mutation. We verify the effectiveness of the proposed scheme from the several examples.