• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.12
• /
• pp.1601-1609
• /
• 1988

In the control of the robotic manipulators, the variable structure control method for the set point Regualation has an advantage of the insensitivity about parameter variations and disturbances. When the robotic manipulatores are controlled by a point-to-point scheme, no path constraint is considered. Thus, the variable structure control method will be effectively applied only if the trajectory of the robot hand is estimated precisely. In this paper, the joint trajectories in the joint space and the hand trajectory in the cartesian space are calculated by the variable structure control method, and an algorithm is suggested to elaborate the deviation error of the robot hand from a straight line path. The result of this study will become a base of the effective path planning about robotic manipulators with the variable structure control concept.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1483-1490
• /
• 2009

This parer is presented multiple path-planning of unmanned autonomous forklift using modified genetic algorithm and fuzzy inference system. There are a task-level feedback method and a method that path is dynamically replaned in realtime while the autonomous vehicles are moving by means of an optimal algorithm for existing multiple path-planning. However, such methods cause malfunctions and inefficiency in the sense of time and energy, and path-planning should be dynamically replanned in realtime. To solve these problems, we propose multiple path-planning using modified genetic algorithm and fuzzy inference system and show the performance with autonomous vehicles. For experiment, we designed and built two autonomous mobile vehicles that equipped with the same driving control part used in actual autonomous forklift, and test the proposed multiple path-planning algorithm. Experimental result that actual autonomous mobile vehicle, we verified that fast optimized path-planning and efficient collision avoidance are possible.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5723-5743
• /
• 2018

The evolving internet-based services demand high-speed data transmission in conjunction with scalability. The next generation optical network has to exploit artificial intelligence and cognitive techniques to cope with the emerging requirements. This work proposes a novel way to solve the dynamic provisioning problem in optical network. The provisioning in optical network involves the computation of routes and the reservation of wavelenghs (Routing and Wavelength assignment-RWA). This is an extensively studied multi-objective optimization problem and its complexity is known to be NP-Complete. As the exact algorithms incurs more running time, the heuristic based approaches have been widely preferred to solve this problem. Recently the software-defined networking has impacted the way the optical pipes are configured and monitored. This work proposes the dynamic selection of path computation algorithms in response to the changing service requirements and network scenarios. A software-defined controller mechanism with a novel packet matching feature was proposed to dynamically match the traffic demands with the appropriate algorithm. A software-defined controller with Path Computation Element-PCE was created in the ONOS tool. A simulation study was performed with the case study of dynamic path establishment in ONOS-Open Network Operating System based software defined controller environment. A java based NOX controller was configured with a parent path computation element. The child path computation elements were configured with different path computation algorithms under the control of the parent path computation element. The use case of dynamic bulk path creation was considered. The algorithm selection method is compared with the existing single algorithm based method and the results are analyzed.

• The Journal of the Acoustical Society of Korea
• /
• v.34 no.5
• /
• pp.377-384
• /
• 2015

An active noise control (ANC) algorithm for noise canceling headphone is proposed. In this study, the feedback ANC operated with the filtered-x least mean square algorithm (FxLMS) algorithm is used to attenuate the undesired noise. Also an adaptive residual music canceller (RMC) is proposed for enhancing the accuracy of the reference signal of the feedback ANC. Simulation results show that a high quality of music sound can be consistently achieved in a time-varying secondary path situation.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.75-78
• /
• 2002

SFFS(Solid Freeform Fabrication System) is commercializing to rapid prototyping concept in world-wide some corporations including the States, have much technological problems yet and need new mode for agile solid freeform fabrication as well as prototyping. In this paper, we design an automatic control algorithm that the cutting path of laser beam, on the SFFS, is controlled with constant speed. The designed algorithm for constant-speed path control is implemented and experimented in the $CAFL^{VM}$ (Computer Aided Fabrication of Lamination for Various Material) system, the new SFFS which is developed in this paper. Its process is an automated fabrication method in which a 3D object is constructed from STL(SToreoLithography) 2D data, derived from CAD 3D image, by sequentially laminating the part cross-sections. The constant-speed path control is started from the STL data. After STL file is modified in data format to be available for control. The fabrication of the 2D part is, with constant speed, conducted from the 23 position data by laser beam. we confirm its high-performance through experiment results from the application into $CAFL^{VM}$ system.

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

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.60.2-60
• /
• 2001

In this paper, manufacturing system and Internet are combined and NC milling machine engraves image and text on nameplate. Image and text are input through Internet. And NC tool path is obtained by thinning algorithm and NC part program is generated. Thinning algorithm detects center lines from image and text by using connectivity and tool path is obtained along the center line. Actually experiments are performed and thinning algorithm and G-code generation module are verified.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.2
• /
• pp.138-142
• /
• 2007

This paper presents an algorithm which extends the rapidly-exploring random tree (RRT) framework to deal with change of the task environments. This algorithm called the Retrieval RRT Strategy (RRS) combines a support vector machine (SVM) and RRT and plans the robot motion in the presence of the change of the surrounding environment. This algorithm consists of two levels. At the first level, the SVM is built and selects a proper path from the bank of RRTs for a given environment. At the second level, a real path is planned by the RRT planners for the: given environment. The suggested method is applied to the control of $KUKA^{TM}$, a commercial 6 DOF robot manipulator, and its feasibility and efficiency are demonstrated via the cosimulatation of $MatLab^{TM}\;and\;RecurDyn^{TM}$.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.6
• /
• pp.107-115
• /
• 1998

A path planning using potential field method is very useful for the real-time navigation of mobile robots. However, the method needs high modeling cost to calculate the potential field because of complex preprocessing, and mobile robots may get stuck into local minima. In this paper, An efficient path planning algorithm for multiple mobile robots, based on the potential field method, was proposed. In the algorithm. the concepts of subgoals and obstacle priority were introduced. The subgoals can be used to escape local minima, or to design and change the paths of mobile robots in the work space. In obstacle priority, all the objects (obstacles and mobile robots) in the work space have their own priorities, and the object having lower priority should avoid the objects having higher priority than it has. In this paper, first, potential based path planning method was introduced, next an efficient collision-avoidance algorithm for multiple mobile robots, moving in the obstacle environment, was proposed by using subgoals and obstacle priority. Finally, the developed algorithm was demonstrated graphically to show the usefulness of the algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.1 s.178
• /
• pp.113-120
• /
• 2006

This paper proposed the control algorithm fur aspheric surface grinding and was verified by the experiment. The functions of the algorithm were simultaneous control of the position and interpolation of the aspheric curve. The non-linear formula of the tool position was derived from the aspheric equations and the shape of the tool. The function was partitioned by an certain interval and the control parameters were calculated at each control section. The movement in a session was interpolated with acceleration and velocity. The position error was feed-backed by rotary encorder. The concept of feedback algorithm was correcting position error by increasing or decreasing the speed. In the experiment, two-axis machine was controlled to track the aspheric surface by the proposed algorithm. The effect of the control and process parameters was monitored. The result showed that the maximum tracking error was under sub-micro level for the concave and convex surfaces.