Switched Reluctance Motors (SRMs) enable power-efficient actuation with mechanically simple designs. This paper aims to identify the nonlinear relationship between torque, rotor angle, and currents, to design commutation functions that minimize torque ripple in SRMs. This is achieved by conducting specific closed-loop experiments using purposely imperfect commutation functions and identifying the nonlinear dynamics via Bayesian estimation. A simulation example shows that the presented method is robust to position-dependent disturbances, and experiments suggest that the identification method enables the design of commutation functions that significantly increase performance. The developed approach enables accurate identification of the torque-current-angle relationship in SRMs, without the need for torque sensors, an accurate linear model, or an accurate model of position-dependent disturbances, making it easy to implement in production.@en

Control applications are increasingly sampled non-equidistantly in time, including in motion control, networked control, resource-aware control, and event-triggered control. Some of these applications use measurement devices that sample equidistantly in the amplitude domain. The aim of this paper is to develop a non-parametric estimator of the impulse response of continuous-time systems based on such sampling strategy, known as Lebesgue-sampling. To this end, kernel methods are developed to formulate an algorithm that adequately takes into account the output intersample behavior, which ultimately leads to more accurate models and more efficient output sampling compared to the standard approach. The efficacy of this method is demonstrated through a mass-spring damper case study.@en

Blind system identification is aimed at finding parameters of a system model when the input is inaccessible. In this paper, we propose a blind system identification method that delivers a single-input single-output, continuous-time model in a nonparametric kernel form. We take advantage of the representer theorem to form a joint maximum a posteriori estimator of the input and system impulse response. The identified system model and input are optimised in sequence to overcome the blind problem with generalised cross validation used to select appropriate hyperparameters given some fixed input sequence. We demonstrate via Monte Carlo simulations the accuracy of the method in terms of estimating the input.@en

Blind system identification is aimed at finding parameters of a system model when the input is inaccessible. In this paper, we propose a blind system identification method that delivers a single-input single-output, continuous-time model in a nonparametric kernel form. We take advantage of the representer theorem to form a joint maximum a posteriori estimator of the input and system impulse response. The identified system model and input are optimised in sequence to overcome the blind problem with generalised cross validation used to select appropriate hyperparameters given some fixed input sequence. We demonstrate via Monte Carlo simulations the accuracy of the method in terms of estimating the input.@en

Sampling in control applications is increasingly done non-equidistantly in time. This includes applications in motion control, networked control, resource-aware control, and event-based control. Some of these applications, like the ones where displacement is tracked using incremental encoders, are driven by signals that are only measured when their values cross fixed thresholds in the amplitude domain. This paper introduces a non-parametric estimator of the impulse response and transfer function of continuous-time systems based on such amplitude-equidistant sampling strategy, known as Lebesgue sampling. To this end, kernel methods are developed to formulate an algorithm that adequately takes into account the bounded output uncertainty between the event timestamps, which ultimately leads to more accurate models and more efficient output sampling compared to the equidistantly-sampled kernel-based approach. The efficacy of our proposed method is demonstrated through a mass–spring damper example with encoder measurements and extensive Monte Carlo simulation studies on system benchmarks.@en

Block coordinate descent is an optimization technique that is used for estimating multi-input single-output (MISO) continuous-time models, as well as single-input single output (SISO) models in additive form. Despite its widespread use in various optimization contexts, the statistical properties of block coordinate descent in continuous-time system identification have not been covered in the literature. The aim of this letter is to formally analyze the bias properties of the block coordinate descent approach for the identification of MISO and additive SISO systems. We characterize the asymptotic bias at each iteration, and provide sufficient conditions for the consistency of the estimator for each identification setting. The theoretical results are supported by simulation examples.@en

Block coordinate descent is an optimization technique that is used for estimating multi-input single-output (MISO) continuous-time models, as well as single-input single output (SISO) models in additive form. Despite its widespread use in various optimization contexts, the statistical properties of block coordinate descent in continuous-time system identification have not been covered in the literature. The aim of this letter is to formally analyze the bias properties of the block coordinate descent approach for the identification of MISO and additive SISO systems. We characterize the asymptotic bias at each iteration, and provide sufficient conditions for the consistency of the estimator for each identification setting. The theoretical results are supported by simulation examples.@en