• Journal of Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.329-337
• /
• 2016

With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.36-45
• /
• 1992

A numerical trajectory planning method for path-constrained trajectory planning is proposed which ensures collision-free and time-optimal motions for two robotic manipulators with limited actuator torques and velocities. For each robot, physical constraints of the robots such as limited torques or limited rotational velocities of the actuators are converted to the constraints on velocity and acceleration along the path, which is described by a scalar variable denoting the traveled distance from starting point. Collision region is determined on the coordination space according to the kinematic structures and the geometry of the paths of the robots. An Extended Coordination Space is then constructed` an element of the space determines the postures and the velocities of the robots, and all the constraints described before are transformed to some constraints on the behaviour of the coordination-velocity curves in the space. A dynamic programming technique is them provided with on the discretized Extended Coordination Space to derive a collision-free and time-optimal trajectory pair. Numerical example is included.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.3
• /
• pp.389-394
• /
• 2014

Two evolutionary gait generation methods for Cartesian and Joint coordinates space are compared to develop a fast locomotion for quadruped robots. GA(Genetic Algorithm) based approaches seek to optimize a pre-selected set of parameters for the locus of paw and initial position in cartesian coordinates space. GP(Genetic Programming) based technique generate few joint trajectories using symbolic regression in joint coordinates space as a form of polynomials. Optimization for two proposed methods are executed using Webots simulation for the quadruped robot which is built by Bioloid. Furthermore, simulation results for two proposed methods are analysed in terms of different coordinate spaces.

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.7 no.2
• /
• pp.27-36
• /
• 2001

This study aims to provide space organization of the Postpartum Care Center and basic data for architectural planning in the reasonable size. Nurturing method of infants at independent Postpartum Care Center combines rooming-in and non rooming-in and space organization is planned accordingly. Types of the existing floor plans are classified as a type centered on maternity protection room, a type of the separate space for multipurpose, a near type to the infants' room. New types of plane are presented as follows a core type concentrate upon nurse room, the infants' room and the same environmental and balanced corridors between the both. When an average capacity of 20 at Postpartum Care Center is planned, proper suitable floor space of Postpartum Care Center is above $753.9m^2$ and $37.69m^2$ per postpartum woman is required. It is indicated that an average floor space per postpartum woman of the reviewed facilities is smaller than one of the Postpartum Care Center in a plan and plane distributed by function too lack in nursing space. Expansion of space for the Postpartum Care Center is generally required, also the enlargement of nursing space is necessary to be harmonized with the management of a medical facilities and those mutual cooperation.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.8
• /
• pp.44-53
• /
• 1992

In this paper, a matching method is proposed to improve the correct matching rate in stereo correspondence matching in which the fingerprint of zero-crossing points on the scale-space is used as the robust matching feature. The dynamic programming, which is appropriate for the fingerprint feature, is introduced for correspondence matching. We also improve the matching rate by using the post-processing for correcting mismatched points. In simulation, we apply the proposed algorithm to the synthetic and real images and obtain good matching results.

• Journal of the Korean Institute of Educational Facilities
• /
• v.15 no.5
• /
• pp.5-12
• /
• 2008

The purpose of this study is to suggest a design guideline for the domestic campus master plan. The main contents of this study are as follows ; 1) Study for the characteristics and components of the comprehensive campus master plan. 2) Case study on the domestic campus plan 3) Establishment of methods for campus master plan focused on the space programming, land use planning, circulation planning, and building layout planning.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.5
• /
• pp.459-464
• /
• 2010

Computer programs are required from all areas in society including machine, space, aviation, and medicine. However, the programming curriculum is getting hard despite a lot of teaching materials and video lessons. Programming languages are very diverse, but most of them use the same structure, and they only have different expression methods. Therefore, if one learns one programming language, then it doesn't need to spend a lot of time and efforts to learn another programming langue. Most programming languages use the structure of sequence, selection, and repletion in general. The important thing for programming learners is the structure or algorithm of programming not the grammar of program. This study designed and implemented the language learning system to learn structured programming by using a flowchart.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.617-620
• /
• 2000

In this paper, we show an application of constraint logic programming to the operation scheduling on machines in a job shop. Constraint logic programming is a new genre of programming technique combining the declarative aspect of logic programming with the efficiency of constraint manipulation and solving mechanisms. Due to the latter feature, combinatorial search problems like scheduling may be resolved efficiently. In this study, the jobs that consist of a set of related operations are supposed to be constrained by precedence and resource availability. We also explore how the constraint solving mechanisms can be defined over a scheduling domain. Thus the scheduling approach presented here has two benefits: the flexibility that can be expected from an artificial intelligence tool by simplifying greatly the problem; and the efficiency that stems from the capability of constraint logic programming to manipulate constraints to prune the search space in an a priori manner.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.8
• /
• pp.327-336
• /
• 2007

Lots of effort toward design optimizations have been paid for a cost-effective system design in various ways from a transistor level to RTL designs. In this paper, we propose a bit level optimization of an adder design for expanding its design space. For the bit-level optimization, a heterogeneous adder organization utilizing a mixture of carry propagation schemes is proposed to design a delay-area efficient adder which were not available in an ordinary design space. Then, we develop an optimization method based on Integer Linear Programming to search the expanded design space of the heterogeneous adder. The novelty of the Proposed architecture and optimization method is introducing a bit level reconstruction/recombination of IPs which have same functionality but different speed and area characteristics for producing more find-grained delay-area optimization.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.3
• /
• pp.318-324
• /
• 2006

The mobile manipulator is expected to work in partially defined or unstructured environments. In our global/local approach to path planning, joint trajectories are generated for a desired Cartesian space path, designed by the global path planner. For a local path planner, inverse kinematics for a redundant system is used. Joint displacement limit for the manipulator links is considered in the motion planner. In an event of failure to obtain feasible trajectories, the task cannot be accomplished. At the point of failure, a deviation in the Cartesian space path is obtained and a replanner gives a new path that would achieve the goal position. To calculate the deviation, a nonlinear optimization problem is formulated and solved by standard Sequential Quadratic Programming (SQP) method.