• Journal of Power Electronics
• /
• 제15권3호
• /
• pp.775-785
• /
• 2015

Many equalization circuits have been proposed to improve pack performance and reduce imbalance. Although bidirectional equalization topologies are promising in these methods, pre-equalization global equalization strategy is lacking. This study proposes a novel state-of-charge (SoC) equalization algorithm for bidirectional equalizer based on particle swarm optimization (PSO), which is employed to find optimal equalization time and steps. The working principle of bidirectional equalization topologies is analyzed, and the reason behind the application of SoC as a balancing criterion is explained. To verify the performance of the proposed algorithm, a pack with 12 LiFePO4 batteries is applied in the experiment. Results show that the maximum SoC gap is within 2% after equalization, and the available pack capacity is enhanced by 13.2%. Furthermore, a comparison between previously used methods and the proposed PSO equalization algorithm is presented. Experimental tests are performed, and results show that the proposed PSO equalization algorithm requires fewer steps and is superior to traditional methods in terms of equalization time, energy loss, and balancing performance.

• Journal of Power Electronics
• /
• 제17권2호
• /
• pp.323-333
• /
• 2017

This paper proposes a model-based optimal control algorithm for the clamp switch of a zero-voltage switching (ZVS) bidirectional DC-DC converter. The bidirectional DC-DC converter (BDC) can accomplish the ZVS operation using the clamp switch. The minimum current for the ZVS operation is maintained, and the inductor current is separated from the input and output voltages by the clamp switch in this topology. The clamp switch can decrease the inductor current ripple, switching loss, and conduction loss of the system. Therefore, the optimal control of the clamp switch is significant to improve the efficiency of the system. This paper proposes a model-based optimal control algorithm using phase shift in a micro-controller unit. The proposed control algorithm is demonstrated by the results of PSIM simulations and an experiment conducted in a 1-kW ZVS BDC system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권1호
• /
• pp.319-333
• /
• 2022

In order to enhance system energy efficiency, bidirectional link resource allocation strategy in GFDM-based multiuser SWIPT systems is proposed. In the downlink channel, each SWIPT user applies power splitting (PS) receiver structure in information decoding (ID) and non-linear energy harvesting (EH). In the uplink channel, information transmission power is originated from the harvested energy. An optimization problem is constructed to maximize weighted sum ID achievable rates in the downlink and uplink channels via bidirectional link power allocation as well as subcarriers and subsymbols scheduling. To solve this non-convex optimization problem, Lagrange duality method, sub-gradient-based method and greedy algorithm are adopted respectively. Simulation results show that the proposed strategy is superior to the fixed subcarrier scheme regardless of the weighting coefficients. It is superior to the heuristic algorithm in larger weighting coefficients scenario.

• 한국멀티미디어학회논문지
• /
• 제5권6호
• /
• pp.745-752
• /
• 2002

도로에서의 최적 경로 탐색은 출발지와 목적지의 위치를 알고 있는 경우로서 탐색에 대한 일종의 사전 지식을 가진 탐색으로 A* 알고리즘이 널리 사용되고 있다. 단방향 A* 알고리즘은 최적의 경로를 보장해 주는 반면 탐색 시간이 많이 소요되고 양방향 A* 알고리즘은 최적 경로를 보장해 주지 못하거나 최적 경로 보장을 위해서는 오히려 단방향 A* 보다 탐색 시간이 더 많이 소요될 수도 있다. 본 논문에서는 탐색 시간이 우수하며 최적 경로를 보장하는 새로운 양방향 A* 알고리즘을 제안한다. 본 논문에서 제안하는 알고리즘의 효용성을 확인하기 위하여 실제 도로에 적용한 격과 정확한 최적 경로를 탐색하고 탐색 시간도 매우 우수한 것으로 확인되었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권8호
• /
• pp.2764-2782
• /
• 2021

Existing city-level boundary nodes identification methods need to locate all IP addresses on the path to differentiate which IP is the boundary node. However, these methods are susceptible to time-delay, the accuracy of location information and other factors, and the resource consumption of locating all IPes is tremendous. To improve the recognition rate and reduce the locating cost, this paper proposes an algorithm for city-level boundary node identification based on bidirectional approaching. Different from the existing methods based on time-delay information and location results, the proposed algorithm uses topological analysis to construct a set of candidate boundary nodes and then identifies the boundary nodes. The proposed algorithm can identify the boundary of the target city network without high-precision location information and dramatically reduces resource consumption compared with the traditional algorithm. Meanwhile, it can label some errors in the existing IP address database. Based on 45,182,326 measurement results from Zhengzhou, Chengdu and Hangzhou in China and New York, Los Angeles and Dallas in the United States, the experimental results show that: The algorithm can accurately identify the city boundary nodes using only 20.33% location resources, and more than 80.29% of the boundary nodes can be mined with a precision of more than 70.73%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.956-967
• /
• 2010

Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. In this paper, a new algorithm for multiple string matching is proposed. This proposed algorithm is based on the canonical Aho-Corasick algorithm and it utilizes a bidirectional and parallel processing structure to accelerate the matching speed. The proposed string matching algorithm was implemented and patched into Snort for experimental evaluation. Comparing with the canonical Aho-Corasick algorithm, the proposed algorithm has gained much improvement on the matching speed, especially in detecting multiple keywords within a long input text string.

• Management Science and Financial Engineering
• /
• 제15권1호
• /
• pp.71-79
• /
• 2009

This paper considers the two kinds of integer multicommodity flow problems, a feasibility problem and a maximization problem, on two types of directed cycles, a unidirectional and a bidirectional cycle. Both multicommodity flow problems on an undirected cycle have been dealt with by many researchers and it is known that each problems can be solved by a polynomial time algorithm. However, we don't find any result on the directed cycles. Here we show that we can also solve both problems for a unidirectional and a bidirectional cycle in polynomial time.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.258-260
• /
• 2007

Nowadays the automotive circuit design becomes more complicated a practical modern car circuit usually contains thousands of wires. So the error connection between connector and pins becomes more difficult to be located. This paper proposes a general way to locate all error wires in an automotive circuit design. Firstly, we give an exact definition of error wire to guide our job. This definition also composes the core part of our algorithm. Then we limit the area of the error wires by several steps. During these steps, we apply breadth-first search method to step over all wires under consideration of reducing time cost. In addition, we apply bidirectional stack technique to organize the data structure for algorithm optimization. This algorithm can get a result with all error wires and doubtful wires in a very efficient way. The analysis of this algorithm shows that the complexity is linear. We also discuss some possible improvement of this algorithm.

• Journal of Electrical Engineering and Technology
• /
• 제10권1호
• /
• pp.165-175
• /
• 2015

Energy storage system has been widely applied in power distribution sectors as well as in renewable energy sources to ensure uninterruptible power supply. This paper presents a model predictive algorithm to control a bidirectional AC-DC converter, which is used in an energy storage system for power transferring between the three-phase AC voltage supply and energy storage devices. This model predictive control (MPC) algorithm utilizes the discrete behavior of the converter and predicts the future variables of the system by defining cost functions for all possible switching states. Subsequently, the switching state that corresponds to the minimum cost function is selected for the next sampling period for firing the switches of the AC-DC converter. The proposed model predictive control scheme of the AC-DC converter allows bidirectional power flow with instantaneous mode change capability and fast dynamic response. The performance of the MPC controlled bidirectional AC-DC converter is simulated with MATLAB/Simulink(R) and further verified with 3.0kW experimental prototypes. Both the simulation and experimental results show that, the AC-DC converter is operated with unity power factor, acceptable THD (3.3% during rectifier mode and 3.5% during inverter mode) level of AC current and very low DC voltage ripple. Moreover, an efficiency comparison is performed between the proposed MPC and conventional VOC-based PWM controller of the bidirectional AC-DC converter which ensures the effectiveness of MPC controller.

• 제어로봇시스템학회논문지
• /
• 제19권5호
• /
• pp.410-415
• /
• 2013

This paper proposes a bidirectional platoon control law using a coupled distance error based on the backstepping-like feedback linearization control method for an interconnected mobile agent system with a string structure. Unlike the previous results where the single agent was controlled using the only own information without other agents, the proposed control law cannot show the only distance error convergence of each agent, but also the string stability of the whole system. Also, the control performances are improved by the proposed control law in spite of low performance of bidirectional control strategy in the previous results. The proposed bidirectional platoon control algorithm is based on the backstepping-like feedback linearization control method. The position errors between each agent and the preceding and the behind agents are coupled by weighted summation. By the proposed control law, the distance error of each agent can converge to zero while the string stability is guaranteed when the coupled errors can converge to zero. To this end, the back-stepping control method is employed. The pseudo velocity input is determined considering the kinematic relationship between agents and the string stability. Then, the actual dynamic control input is determined to make the actual velocity converge to the pseudo velocity input. The stability analysis and the simulation results of the proposed method are included in order to demonstrate the practical application of the proposed algorithm.