The problem of linear parameter varying (LPV) system identification is considered based on the locally weighted technique which provides estimation of the LPV model parameters at each distinct data time point by giving large weights to measurements that are "close" to the current time point and small weights to measurements "far" from the current time point. Issues such as choice of distance function, weighting function and bandwidth selection are discussed.The developed method is easy to implement and simulation results illustrate its efficiency. §1 IntroductionRecently, the identification problem of linear parameter varying (LPV) system [13] has received considerable attention, motivated by problems confronted in robust control [1,11] and gain scheduling control [7,10]. Work on the identification of LPV system can be roughly divided into 2 classes: global approaches which obtain a single parameter dependent model [3,5,14,15,17,21] and local approaches which identify many linear time invariant (LTI) models [10,16,20]. The global approaches rely on the assumption that both the control input and the scheduling variables are persistently excited simultaneously in one global identification experiment, which may not be reasonable in many applications. The local approaches supply attractive alternatives. However, both the global and local approaches need some kind of a priori information of the system, which may not be available in practice [9].In this paper, an attempt is made to identify the LPV system based on locally weighted technique [12], which provides estimation of the LPV model parameters at each distinct data time point by giving large weights to measurements that are "close" to the current time point and small weights to measurements "far" from the current time point. This technique uses available data and does not require much a priori information of the system, which makes it suitable for many practical applications.