• International Journal of Control, Automation, and Systems
• /
• v.2 no.3
• /
• pp.279-288
• /
• 2004

This paper presents a novel design for a tubular linear brushless permanent-magnet motor. In this design, the magnets in the moving part are oriented in an NS-NS―SN-SN fashion which leads to higher magnetic force near the like-pole region. An analytical methodology to calculate the motor force and to size the actuator was developed. The linear motor is operated in conjunction with a position sensor, three power amplifiers, and a controller to form a complete solution for controlled precision actuation. Real-time digital controllers enhanced the dynamic performance of the motor, and gain scheduling reduced the effects of a nonlinear dead band. In its current state, the motor has a rise time of 30 ms, a settling time of 60 ms, and 25% overshoot to a 5-mm step command. The motor has a maximum speed of 1.5 m/s and acceleration up to 10 g. It has a 10-cm travel range and 26-N maximum pull-out force. The compact size of the motor suggests it could be used in robotic applications requiring moderate force and precision, such as robotic-gripper positioning or actuation. The moving part of the motor can extend significantly beyond its fixed support base. This reaching ability makes it useful in applications requiring a small, direct-drive actuator, which is required to extend into a spatially constrained environment.

• Industrial Engineering and Management Systems
• /
• v.7 no.2
• /
• pp.171-181
• /
• 2008

Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.30 no.7
• /
• pp.113-122
• /
• 2002

Control system modeling and optimal bending filter design for KSR-III (Korea Sounding Rocket III) are performed. Rigid rocket dynamics, aerodynamics, sloshing, structural bending, actuator dynamics, sensor dynamics and on-board computer characteristics are considered for control system modeling. Compensation for time-varying control system parameters is conducted by gain-scheduling. A filter to stabilize bending mode is designed using parameter optimization technique. Resultant attitude control system can satisfy required frequency domain stability margin.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.4 no.4
• /
• pp.286-292
• /
• 2004

In this paper we present a static performance estimation technique of on-chip bus architectures. The proposed technique requires the static scheduling of function blocks of a task to analyze bus conflicts caused by simultaneous accesses from processing elements to which function blocks are mapped. To apply it to multitask applications, the concurrent execution of the function blocks of different tasks also should be considered. Since tasks are scheduled independently, considering all cases of concurrency in each processing element is impractical. Therefore we make an average estimate on the effects of other tasks with respect to bus request rate and bus access time. The proposed technique was incorporated with our exploration framework for on-chip bus architectures, Its viability and efficiency are validated by a preliminary example.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.100-115
• /
• 2004

The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.55-58
• /
• 2000

EC, which is done the virtual space through Web, has weakly like security problem because anybody can easily access to the system due to open network attribute of Web. Therefore, we need the solutions that protect the Web security for safe and useful EC. One of these solutions is the implementation of a strong cipher system. NC(Nonpolynomial Complete) cipher system proposed in this paper is advantage for the Web security and it overcomes the limit of the 64 bits cipher system using 128 bits key length for input, output, encryption key and 16 rounds. Moreover, it is designed for the increase of time complexity by adapted more complex design for key scheduling regarded as one of the important element effected to encryption.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.113-122
• /
• 2009

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.328-332
• /
• 2015

By logging position data from GPS-equipped construction machines, we re-create daily activities as 3D animations to analyze performance and facilitate look-ahead scheduling. The 3D animation enables going back to any point in time and space to observe the activities as they took place. By segmenting data into a set of activities, it is possible to obtain actual measures of performance such as cycle times, production, speed profiles and idle times. The measures of performance can then be compared to those expected (e.g., theoretical speed profiles vs. observed profiles), and instances of significant difference can be flagged for further investigation. Idle times and queues that exceed prescribed thresholds can also be identified. In general, many of the traditional real-time performance analyses can be performed after the fact. Situations of interest can be identified automatically and the events in this manner enhances effective performance improvement in construction. The proposed research is explained and demonstrated using a real push-loaded earthmoving operation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.11
• /
• pp.1477-1483
• /
• 2020

The stability guarantee of wireless network based control systems is still challenging due to the lossy links and node failures. This paper proposes a hierarchical cluster-based network protocol called robust wireless sensor and actuator network (R-WSAN) by combining time, channel, and space resource diversity. R-WSAN includes a scheduling algorithm to support the network resource allocation and a control task sharing scheme to maintain the control stability of multiple plants. R-WSAN was implemented on a real test-bed using Zolertia RE-Mote embedded hardware platform running the Contiki-NG operating system. Our experimental results demonstrate that R-WSAN provides highly reliable and robust performance against lossy links and node failures. Furthermore, the proposed scheduling algorithm and the task sharing scheme meet the stability requirement of control systems, even if the controller fails to support the control task.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3138-3147
• /
• 2000

EC(Electronic Commerce) which is cone the virtual space through Internet, has the advantage of time and space. On the contrary, it also has weak point like security probelm because anybody can easily access to the system due to open network attribute of Internet. Theretore, we need the solutions that protect the EC security problem for safe and useful EC activity. One of these solution is the implemonlation of a strong cipher algorithm. YK2(YoungKu Kang) cipher algorithm proposed in this paper is advantage for the EC security and it overcomes the limit of the current 6/1 bits block cipher algorithm using 128 bits key length for input, output, encryption key and 32 rounds. Moreover, it is degigned for the increase of time complexity and probability calculation by adapting more complex design for key scheduling regarded as one of the important element effected to enciyption.