• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.817-821
• /
• 1991

Coordinated motion control of two arms of a dual-arm robot has been studied by many researchers, because of it's potential application in assembly as well as the handling of large and heavy objects beyond the capacity of single arm. This paper derives dynamic equation of a dual-arm robot, and describes some constrains to pick up a simply shaped object at prespecified position on it. This paper concludes with describing both PD and self-tunning control algorithm for the above task.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.90-96
• /
• 2021

The logistics market is continuously growing due to the development of technology and the growth of the online market. In addition, the social atmosphere that emphasizes non-face-to-face due to the pandemic situation is accelerating the growth of logistics. Delivery of goods ordered online requires delivery process through courier worker. In order for the courier worker to ship the product, the work of loading the product on the truck must be preceded. The accident caused by such delivery and loading work is increasing and it is emerging as a social problem. This study proposes a robot-based automated loading system to efficiently handle the increasing volume of courier service and to construct a more efficient and safe working environment by replacing the physical labor that was overloaded to courier workers. The proposed system replaces the loading of the courier worker and proposes the optimal loading function through the automation system.

• Journal of the Korean Society of Industry Convergence
• /
• v.26 no.2_2
• /
• pp.249-254
• /
• 2023

The use of robots in automated factories requires accurate bin-picking to ensure that objects are correctly identified and selected. In the case of atypical objects with multiple reflections from their surfaces, this is a challenging task. In this paper, we developed a random 3D bin picking system by integrating the low-cost vision system with the robotics system. The vision system identifies the position and posture of candidate parts, then the robot system validates if one of the candidate parts is pickable; if a part is identified as pickable, then the robot will pick up this part and place it accurately in the right location.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.11 no.2
• /
• pp.52-57
• /
• 2012

In this paper describe configuration about QCM system for image processing device. It presents that QCM's image processing board video from the camera recognized by the PLC's battery removable exact location coordinates to the robot image processing technology to deliver. In addition, QCM video image processing technology for improved data reliability is described. In this paper define the landmarks of battery for obtaining the location coordinates and verify battery the location coordinates acquisition process from field tests of the QCM/QTPE-BUS Battery Exchange System.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.306-315
• /
• 1995

This paper presents a bin picking method using a slit beam laser in which a robot recognizes all of the unoccluded objects from the top of jumbled objects, and picks them up one by one. Once those unoccluded objects are removed, newly developed unoccluded objects underneath are recognized and the same process is continued until the bin gets empty. To recognize unoccluded objects, a new algorithm to link edges on slices which are generated by the orthogonally mounted laser on the xy table is proposed. The edges on slices are partitioned and classified using convex and concave function with a distance parameter. The edge types on the neighborhood slices are compared, then the hamming distances among identical kinds of edges are extracted as the features of fuzzy membership function. The sugeno fuzzy integration about features is used to determine linked edges. Finally, the pick-up sequence based on MaxMin theory is determined to cause minimal disturbance to the pile. This proposed method may provide a solution to the automation of part handling in manufacturing environments such as in punch press operation or part assembly.

• Industrial Engineering and Management Systems
• /
• v.8 no.3
• /
• pp.181-193
• /
• 2009

This paper presents a framework for controlling mobile multiple robots connected by communication networks. This framework provides novel methods to control coordinated systems using mobile agents. The combination of the mobile agent and mobile multiple robots opens a new horizon of efficient use of mobile robot resources. Instead of physical movement of multiple robots, mobile software agents can migrate from one robot to another so that they can minimize energy consumption in aggregation. The imaginary application is making "carts," such as found in large airports, intelligent. Travelers pick up carts at designated points but leave them arbitrary places. It is a considerable task to re-collect them. It is, therefore, desirable that intelligent carts (intelligent robots) draw themselves together automatically. Simple implementation may be making each cart has a designated assembly point, and when they are free, automatically return to those points. It is easy to implement, but some carts have to travel very long way back to their own assembly point, even though it is located close to some other assembly points. It consumes too much unnecessary energy so that the carts have to have expensive batteries. In order to ameliorate the situation, we employ mobile software agents to locate robots scattered in a field, e.g. an airport, and make them autonomously determine their moving behaviors by using a clustering algorithm based on the Ant Colony Optimization (ACO). ACO is the swarm intelligence-based methods, and a multi-agent system that exploit artificial stigmergy for the solution of combinatorial optimization problems. Preliminary experiments have provided a favorable result. In this paper, we focus on the implementation of the controlling mechanism of the multi-robots using the mobile agents.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1939-1943
• /
• 1991

Path planning is an important task for optimal motion of a robot in structured or unstructured environment. The goal of this paper is to plan the shortest collision-free path in 3D, when a robot is navigated to pick up some tools or to repair some parts from various locations. To accomplish the goal of this paper, the Path Coordinator is proposed to have the capabilities of an obstacle avoidance strategy[3] and a traveling salesman problem strategy(TSP)[23]. The obstacle avoidance strategy is to plan the shortest collision-free path between each pair of n locations in 2D or in 3D. The TSP strategy is to compute a minimal system cost of a tour that is defined as a closed path navigating each location exactly once. The TSP strategy can be implemented by the Neural Network. The obstacle avoidance strategy in 2D can be implemented by the VGraph Algorithm. However, the VGraph Algorithm is not useful in 3D, because it can't compute the global optimality in 3D. Thus, the Path Coordinator is proposed to solve this problem, having the capabilities of selecting the optimal edges by the modified Genetic Algorithm[21] and computing the optimal nodes along the optimal edges by the Recursive Compensation Algorithm[5].

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.79-84
• /
• 1992

Path planning is an important task for optimal motion of a robot in structured or unstructured environment. The goal of this paper is to plan the optimal collision-free path in 3D, when a robot is navigated to pick up some tools or to repair some parts from various locations. To accomplish the goal, the Path Coordinator is proposed to have the capabilities of an obstacle avoidance strategy and a traveling salesman problem strategy (TSP). The obstacle avoidance strategy is to plan the shortest collision-free path between each pair of n locations in 2D or in 3D. The TSP strategy is to compute a minimal system cost of a tour that is defined as a closed path navigating each location exactly once. The TSP strategy can be implemented by the Hopfield Network. The obstacle avoidance strategy in 2D can be implemented by the VGraph Algorithm. However, the VGraph Algorithm is not useful in 3D, because it can't compute the global optimality in 3D. Thus, the Path Coordinator is used to solve this problem, having the capabilities of selecting the optimal edges by the modified Genetic Algorithm and computing the optimal nodes along the optimal edges by the Recursive Compensation Algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1920-1925
• /
• 2004

This paper describes a new method for 3D object recognition which used surface segment-based stereo vision. The position and orientation of an objects is identified accurately enabling a robot to pick up, even though the objects are multiple and partially occluded. The stereo vision is used to get the 3D information as 3D sensing, and CAD model with its post processing is used for building models. Matching is initially performed using the model and object features, and calculate roughly the object's position and orientation. Though the fine adjustment step, the accuracy of the position and orientation are improved.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1360-1365
• /
• 2019

In this paper, we describe a sound source localization(SSL) system which can be applied to mobile robot and automatic control systems. Usually the SSL method finds the Interaural Time Difference, the Interaural Level Difference, and uses the geometrical principle of microphone array. But here we proposed another approach based on the deep neural network to obtain the horizontal directional angle(azimuth) of the sound source. We pick up the sound source signals from the two microphones attached symmetrically on both sides of the robot to imitate the human ears. Here, we use difference of spectral distributions of sounds obtained from two microphones to train the network. We train the network with the data obtained at the multiples of 10 degrees and test with several data obtained at the random degrees. The result shows quite promising validity of our approach.