• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.329-334
• /
• 1998

This work is concerned with the problem of tracking a maneuvering target. In this paper, an error monitoring and recovery method of perception net is utilized to improve tracking performance for a highly maneuvering tar-get. Many researches have been performed in tracking a maneuvering target. The conventional Interacting Multiple Model (IMM) filter is well known as a suboptimal hybrid filter that has been shown to be one of the most cost-effective hybrid state estimation scheme. The subfilters of IMM can be considered as fusing its initial value with new measurements. This approach is also shown in this paper. Perception net based error monitoring and recovery technique, which is a kind of geometric data fusion, makes it possible to monitor errors and to calibrate possible biases involved in sensed data and extracted features. Both detecting a maneuvering target and compensating the estimated state can be achieved by employing the properly implemented error monitoring and recovery technique. The IMM filter which employing the error monitoring and recovery technique shows good tracking performance for a highly maneuvering target as well as it reduces maximum values of estimation errors when maneuvering starts and finishes. The effectiveness of the pro-posed method is validated through simulation by comparing it with the conventional IMM algorithm.

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

Ultrasonic sensors are widely used in mobile robot applications to recognize external environments, because they are cheap, easy to use, and robust under varying lighting conditions. However, the recognition of objects using a ultrasonic sensor is not so easy due to its characteristics such as narrow beam width and no reflected signal from a inclined object. As one of the alternatives to resolve these problems, use of multiple sensors has been studied. A sequential driving system needs a long measurement time and does not take advantage of multiple sensors. Simultaneous and pulse coding driving system of ultrasonic sensor array cannot measure short distance as the length of the code becomes long. This problem can be resolved by multi-frequency driving of ultrasonic sensors, which allows multi-sensors to be fired simultaneously and adjacent objects to be distinguished. Accordingly, this paper presents a simultaneous and multi-frequency driving system for an ultrasonic sensor array for object recognition. The proposed system is designed and implemented using a DSP and FPGA. A micro-controller board is made using a DSP, Polaroid 6500 ranging modules are modified for firing the multi-frequency signals, and a 5-channel frequency modulated signal generating board is made using a FPGA. To verify the proposed method, experiments were conducted in an environment with overlapping signals, and the flight distances for each sensor were obtained from filtering of the received overlapping signals and calculation of the time-of-flights.

• Advances in robotics research
• /
• v.2 no.1
• /
• pp.45-57
• /
• 2018

Even though the popularity of projection mapping continues to increase and it is being implemented in more and more settings, most current projection mapping systems are limited to special purposes, such as outdoor events, live theater and musical performances. This lack of versatility arises from the large number of projectors needed and their proper calibration. Furthermore, we cannot change the positions and poses of projectors, or their projection targets, after the projectors have been calibrated. To overcome these problems, we propose a projection mapping method using a projector robot that can perform projection mapping in more general or ubiquitous situations, such as shopping malls. We can estimate a projector's position and pose with the robot's self-localization sensors, but the accuracy of this approach remains inadequate for projection mapping. Consequently, the proposed method solves this problem by combining self-localization by robot sensors with position and pose estimation of projection targets based on a 3D model. We first obtain the projection target's 3D model and then use it to accurately estimate the target's position and pose and thus achieve accurate projection mapping with a projector robot. In addition, our proposed method performs accurate projection mapping even after a projection target has been moved, which often occur in shopping malls. In this paper, we employ Ubiquitous Display (UD), which we are researching as a projector robot, to experimentally evaluate the effectiveness of the proposed method.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.339-350
• /
• 2003

In this paper, we propose a simultaneous multithreading (SMT) architecture that improves instruction throughput by exploiting instruction level parallelism (ILP) and thread level parallelism (TLP). The proposed architecture issues and completes instructions belonging to the same thread in exact program order. The issue and completion policy greatly reduces the design complexity and hardware cost of our architecture, compared with others that employ out-of-order issue and completion. On the other hand, when the instructions belong to different threads, the issue and completion orders for those instructions may not necessarily be identical to the fetch order. The processor issues instructions simultaneously from multiple threads to functional units by exploiting ILP and TLP, and by dynamic resource sharing. That parallel execution notably improves performance and resource utilization with minimal additional hardware cost over the conventional superscalar processors. This paper proposes an SMT architecture with grouping as well as one without grouping. Without grouping, all threads dynamically and flexibly share most resources. On the other hand, in the SMT architecture with grouping, in which resources and threads are divided into several groups for design simplification, resources are shared only among threads belonging to the same group as those resources. Simulation results show that our processors with four and eight threads improve performance by three or more times over the conventional superscalar processor with comparable execution resources and policies, and that reasonable grouping reduces the design complexity of SMT processors with little negative effect on performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.6
• /
• pp.842-849
• /
• 2022

With the development of deep learning technology, there are many cases of using DNNs in embedded systems such as unmanned vehicles, drones, and robotics. Typically, in the case of an autonomous driving system, it is crucial to run several DNNs which have high accuracy results and large computation amount at the same time. However, running multiple DNNs simultaneously in an embedded system with relatively low performance increases the time required for the inference. This phenomenon may cause a problem of performing an abnormal function because the operation according to the inference result is not performed in time. To solve this problem, the solution proposed in this paper first reduces the computation by applying the Tucker decomposition to DNN models with big computation amount, and then, make DNN models run in parallel as much as possible in the unit of hidden layer inside the GPU. The experimental result shows that the DNN inference time decreases by up to 75.6% compared to the case before applying the proposed technique.

• Journal of the Korean Society for Precision Engineering
• /
• v.30 no.1
• /
• pp.11-17
• /
• 2013

'Multi-scale mass-deployable cooperative robots' is a next generation robotics paradigm where a large number of robots that vary in size cooperate in a hierarchical fashion to collect information in various environments. While this paradigm can exhibit the effective solution for exploration of the wide area consisting of various types of terrain, its technical maturity is still in its infant state and many technical hurdles should be resolved to realize this paradigm. In this paper, we propose to develop new design and manufacturing methodologies for the multi-scale mass-deployable cooperative robots. In doing so, we present various fundamental technologies in four different research fields. (1) Adaptable design methods consist of compliant mechanisms and hierarchical structures which provide robots with a unified way to overcome various and irregular terrains. (2) Soft composite materials realize the compliancy in these structures. (3) Multi-scale integrative manufacturing techniques are convergence of traditional methods for producing various sized robots assembled by such materials. Finally, (4) the control and communication techniques for the massive swarm robot systems enable multiple functionally simple robots to accomplish the complex job by effective job distribution.

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

An effective methodology is reported for the optimal design of multisite batch production/transportation and storage networks under uncertain demand forecasting. We assume that any given storage unit can store one material type which can be purchased from suppliers, internally produced, internally consumed, transported to or from other plant sites and/or sold to customers. We further assume that a storage unit is connected to all processing and transportation stages that consume/produce or move the material to which that storage unit is dedicated. Each processing stage transforms a set of feedstock materials or intermediates into a set of products with constant conversion factors. A batch transportation process can transfer one material or multiple materials at once between plant sites. The objective for optimization is to minimize the probability averaged total cost composed of raw material procurement, processing setup, transportation setup and inventory holding costs as well as the capital costs of processing stages and storage units. A novel production and inventory analysis formulation, the PSW(Periodic Square Wave) model, provides useful expressions for the upper/lower bounds and average level of the storage inventory. The expressions for the Kuhn-Tucker conditions of the optimization problem can be reduced to two sub-problems. The first yields analytical solutions for determining lot sizes while the second is a separable concave minimization network flow subproblem whose solution yields the average material flow rates through the networks for the given demand forecast scenario. The result of this study will contribute to the optimal design and operation of large-scale supply chain system.

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

In this paper, we present a new method for monitoring of ECU's sensor signals of vehicle. In order to measure the ECU's sensor signals, the interfaced circuit is designed to communicate ECU and the Embedded Linux is used to monitor communication result through Web the Embedded Linux system and this system is said "ECU Interface Part". In ECU Interface Part the interface circuit is designed to match voltage level between ECU and SA-1110 micro controller and interface circuit to communicate ECU according to the ISO, SAE communication protocol standard. Because Embedded Linux does not allow to access hardware directly in application level, anyone who wants to modify any low level hardware must develop device driver. To monitor ECU's sensor signals the most important thing is to match serial level between ECU and ECU Interface Part. It means to communicate correctly between two hardware we need to match voltage and signal level, and need to match baudrate. The voltage of SA-1110 is 0 ${\sim}$ +3.3V and ECU is 0 ${\sim}$ +12V and, ECU's communication Line K does multiple operation so, the interface circuit is used to match voltage and signal level. In Addition to ECU's baudrate is 10400bps, it's not standard baudrate in computer environment. So, we need to develop a device driver to control the interface circuit, and change baudrate. To monitor ECU's sensor signals through web there's a network socket program is working in Embedded Linux. It works as server program and manages user's connections and commands. Anyone who wants to monitor ECU's sensor signals he just only connect to Embedded Linux system with web browser then, Embedded Linux webserver will return the ActiveX webbased measurement software. It works in web browser and inits ECU, as a result it returns sensor signals through web. All the programs are developed with GCC(GNU C Compiler) and, webbased measurement software is developed with Borland C++ Builder.

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

For general nonlinear processes, it is difficult to control with a linear model-based control method and nonlinear controls are considered. Among the numerous approaches suggested, the most rigorous approach is to use dynamic optimization. Many general engineering problems like control, scheduling, planning etc. are expressed by functional optimization problem and most of them can be changed into dynamic programming (DP) problems. However the DP problems are used in just few cases because as the size of the problem grows, the dynamic programming approach is suffered from the burden of calculation which is called as 'curse of dimensionality'. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach is proposed by Bertsekas and Tsitsiklis (1996). To get the solution of seriously nonlinear process control, the interest in NDP approach is enlarged and NDP algorithm is applied to diverse areas such as retailing, finance, inventory management, communication networks, etc. and it has been extended to chemical engineering parts. In the NDP approach, we select the optimal control input policy to minimize the value of cost which is calculated by the sum of current stage cost and future stages cost starting from the next state. The cost value is related with a weight square sum of error and input movement. During the calculation of optimal input policy, if the approximate cost function by using simulation data is utilized with Bellman iteration, the burden of calculation can be relieved and the curse of dimensionality problem of DP can be overcome. It is very important issue how to construct the cost-to-go function which has a good approximate performance. The neural network is one of the eager learning methods and it works as a global approximator to cost-to-go function. In this algorithm, the training of neural network is important and difficult part, and it gives significant effect on the performance of control. To avoid the difficulty in neural network training, the lazy learning method like k-nearest neighbor method can be exploited. The training is unnecessary for this method but requires more computation time and greater data storage. The pH neutralization process has long been taken as a representative benchmark problem of nonlin ar chemical process control due to its nonlinearity and time-varying nature. In this study, the NDP algorithm was applied to pH neutralization process. At first, the pH neutralization process control to use NDP algorithm was performed through simulations with various approximators. The global and local approximators are used for NDP calculation. After that, the verification of NDP in real system was made by pH neutralization experiment. The control results by NDP algorithm was compared with those by the PI controller which is traditionally used, in both simulations and experiments. From the comparison of results, the control by NDP algorithm showed faster and better control performance than PI controller. In addition to that, the control by NDP algorithm showed the good results when it applied to the cases with disturbances and multiple set point changes.

• Journal of Internet Computing and Services
• /
• v.15 no.3
• /
• pp.101-107
• /
• 2014

With the development of online service, recent forms of databases have been changed from static database structures to dynamic stream database structures. Previous data mining techniques have been used as tools of decision making such as establishment of marketing strategies and DNA analyses. However, the capability to analyze real-time data more quickly is necessary in the recent interesting areas such as sensor network, robotics, and artificial intelligence. Landmark window-based frequent pattern mining, one of the stream mining approaches, performs mining operations with respect to parts of databases or each transaction of them, instead of all the data. In this paper, we analyze and evaluate the techniques of the well-known landmark window-based frequent pattern mining algorithms, called Lossy counting and hMiner. When Lossy counting mines frequent patterns from a set of new transactions, it performs union operations between the previous and current mining results. hMiner, which is a state-of-the-art algorithm based on the landmark window model, conducts mining operations whenever a new transaction occurs. Since hMiner extracts frequent patterns as soon as a new transaction is entered, we can obtain the latest mining results reflecting real-time information. For this reason, such algorithms are also called online mining approaches. We evaluate and compare the performance of the primitive algorithm, Lossy counting and the latest one, hMiner. As the criteria of our performance analysis, we first consider algorithms' total runtime and average processing time per transaction. In addition, to compare the efficiency of storage structures between them, their maximum memory usage is also evaluated. Lastly, we show how stably the two algorithms conduct their mining works with respect to the databases that feature gradually increasing items. With respect to the evaluation results of mining time and transaction processing, hMiner has higher speed than that of Lossy counting. Since hMiner stores candidate frequent patterns in a hash method, it can directly access candidate frequent patterns. Meanwhile, Lossy counting stores them in a lattice manner; thus, it has to search for multiple nodes in order to access the candidate frequent patterns. On the other hand, hMiner shows worse performance than that of Lossy counting in terms of maximum memory usage. hMiner should have all of the information for candidate frequent patterns to store them to hash's buckets, while Lossy counting stores them, reducing their information by using the lattice method. Since the storage of Lossy counting can share items concurrently included in multiple patterns, its memory usage is more efficient than that of hMiner. However, hMiner presents better efficiency than that of Lossy counting with respect to scalability evaluation due to the following reasons. If the number of items is increased, shared items are decreased in contrast; thereby, Lossy counting's memory efficiency is weakened. Furthermore, if the number of transactions becomes higher, its pruning effect becomes worse. From the experimental results, we can determine that the landmark window-based frequent pattern mining algorithms are suitable for real-time systems although they require a significant amount of memory. Hence, we need to improve their data structures more efficiently in order to utilize them additionally in resource-constrained environments such as WSN(Wireless sensor network).