Advances in Youla-Kucera parametrization: A Review

International audienceYoula-Kucera (YK) parametrization was formulated decades ago for obtaining the set of controllers stabilizing a linear plant. This fundamental result of control theory has been used to develop theoretical tools solving many control problems ranging from stable controller switching, closed-loop identification, robust control, disturbance rejection, adaptive control to fault tolerant control.This paper collects the recent work and classifies the maccording to the use of YK parametrization, Dual YK parametrization or both, providing the latest advances with main applications indifferent control fields. A final discussion gives some insights on the future trends in the field

Improving playability of Blu-ray disc drives by using adaptive suppression of repetitive disturbances

International audienceThis paper deals with the problem of adaptive suppression of disturbances on Blu-ray disc drives servo-mechanisms. The proposed methodology is intended for enhancing playability of low quality media at higher rotational speeds. One of the main problems in controlling an optical disc drive concerns the control of the radial lens position which assures the disc playback. However, due to the rotary nature of the Blu-ray disc the most important sources of disturbances concern those that present periodic behaviour. The frequency of such disturbances is proportional to the disc speed and inversely depends on the radial lens position, making more difficult the task of the tracking-controller when a high speed playback is required. Here, a new parametric adaptation algorithm is proposed to reject the main narrow-band disturbances without increasing the controller bandwidth. The proposed scheme makes use of the internal model principle and the Youla–Kucera parameterization. The parametric adaptation algorithm together with the robust stability and performance analysis are part of the main contribution of this paper. An experimental-data study illustrates the behaviour of the high speed tracking control

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words