• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.39-47
• /
• 2010

Constraint satisfaction optimization problem is a kind of optimization problem involving cost minimization as well as complex constraints. Local search and constraint programming respectively have been used for solving such problems. In this paper, I propose a method to integrate local search and constraint programming to improve search performance. Basically, local search is used to solve the given problem. However, it is very difficult to find a feasible neighbor satisfying all the constraints when we use only local search. Therefore, I introduced constraint programming as a tool for neighbor generation. Through the experimental results using weighted N-Queens problems, I confirmed that the proposed method can significantly improve search performance.

• Journal of Information Technology Applications and Management
• /
• v.23 no.2
• /
• pp.61-80
• /
• 2016

The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.4
• /
• pp.301-311
• /
• 2000

For effective part modifications which is necessary in the design process frequently, variational geometric modeling with constraint management being used in a wide. Most variational geometric modeling methods, however, manage just the constraints about sketch elements used for generation of primitives. Thus, not only constraint propagation but also re-build of various modeling operations stored in the modeling history is necessary iota part geometry modifications. Especially, re-build of high-cost Boolean operations is apt to deteriorate overall modeling efficiency abruptly. Therefore, in this paper we proposed an algorithm that can handle all geometric entities of the part directly. For this purpose, we introduced eight type geometric constraints to the various geometric calculations about all geometric entities in sweepings and Boolean operations as well as the existing constraints of the sketch elements. The algorithm has a merit of rapid part geometric modifications through only constraint propagation without rebuild of modeling operations which are necessary in the existing variational geometric modeling method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.410-417
• /
• 2002

We consider the constraint based explicit routing problem in MPLS based IP Network. In this problem, we are given a set of traffic demands and a network with different link capacities. The problem is to assign the demand commodities to the paths in the network while minimizing the maximum link load ratio. We formulate this problem as an integer programming problem and propose an efficient column generation technique. To strengthen the formulation, we consider some valid inequalities. We also incorporate the column generation technique with variable fixing scheme Computational results show that the algorithm gives high quality solutions in a short execution time.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.953-956
• /
• 2000

Application specific DSPs often employ irregular datapath structures with distributed registers. In the scheduling phase of retargetable compilation, resolution of register usage conflicts comes to be a new constraint for such datapaths. This paper presents a method of register constraint analysis which attempts to minimize the number of the spill codes required for resolving the register usage conflicts. It searches for a set of ordering restrictions among operations which sequentialize the lifetimes of the values residing in the same register as much as possible and thus minimize the number of the register conflict. Experimental results show that a combination of the proposed register constraint, analysis and list-based scheduling reduces the number of the register spills into 25%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.12
• /
• pp.2306-2310
• /
• 2007

In this paper, reuse module generation algorithm consider the power consumption for FPGA technology mapping is proposed. To proposed algorithm is RT library generating algorithm, consider power consumption for reuse module using FPGA technology mapping. In the first, selected FPGA for power consumption calculation. Technology mapping process have minimum total power consumption consider LUT's constraint in selected FPGA. A circuit into device by selected proper modules of allocation result for power consumption constraint using data.

• Bulletin of the Korean Space Science Society
• /
• 1998.10a
• /
• pp.53.2-53
• /
• 1998

No Abstract.See Full-text

• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.1304-1310
• /
• 2015

In remote islands, due to expense of existing generation systems, installation of photovoltaic cells (PVs) and wind turbines has a chance of reducing generation costs. However, in island power systems, even short-term power fluctuations change the frequency of grids because of their small inertia constant. In order to compensate power fluctuations, the authors proposed the power consumption control of pumps which send water to tanks. The power control doesn’t affect water users’ convenience as long as tanks hold water. Based on experimental characteristics of a pump system, this paper shows methods to determine reference power consumption of the system with compensation for short-term PV fluctuations while satisfying water demand. One method uses a PI controller and the other method calculates reference power consumption from water flow reference. Simulations with a PV and a pump system are carried out to find optimum parameters and to compare the methods. Results show that both PI control method and water flow calculation method are useful for satisfying the water demand constraint. The water demand constraint has a little impact to suppression of the short-term power fluctuation in this condition.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.10
• /
• pp.1029-1036
• /
• 2011

An energy-efficient reference walking trajectory generation algorithm is suggested utilizing allowable ZMP (Zero-Moment-Point) region, which maxmizes the energy efficiency for cyclic gaits, based on three-dimensional LIPM (Linear Inverted Pendulum Model) for biped robots. As observed in natural human walking, variable ZMP manipulation is suggested, in which ZMP moves within the allowable region to reduce the joint stress (i.e., rapid acceleration and deceleration of body), and hence to reduce the consumed energy. In addition, opimization of footstep planning is conducted to decide the optimal step-length and body height for a given forward mean velocity to minimize a suitable energy performance - amount of energy required to carry a unit weight a unit distance. In this planning, in order to ensure physically realizable walking trajectory, we also considered geometrical constraints, ZMP stability condition, friction constraint, and yawing moment constraint. Simulations are performed with a 12-DOF 3D biped robot model to verify the effectiveness of the proposed method.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.341-343
• /
• 2000

Traditionally electric power system are operated in such a way that the total fuel cost is minimized regardless of accounting for tie-lines transmission constraint and emissions produced. But tie-lines transmission and emissions constraint are very important issues in the operation and planning of electric power system. This paper presents the Two-Phase Neural Network(TPNN) to solve the Economic Load Dispatch (ELD) problem with tie-lines transmission and emissions constraint considering transmission losses. The transmission losses are obtained from the B-coefficient which approximate the system losses as s quadratic function of the real power generation. By applying the proposed algorithm to the test system, the usefulness of this algorithm is verified.