BBBart Besselink

Bart Besselink

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Bart Besselink has a total of 55 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Convergence of energy-based learning in linear resistive networks

    by Anne-Men Huijzer, Thomas Chaffey, Bart Besselink, Henk J. van Waarde

    Energy-based learning algorithms are alternatives to backpropagation and are well-suited to distributed implementations in analog electronic devices. However, a rigorous theory of convergence is lacking. We make a first step in this direction by analysing a particular energy based learning algorithm, Contrastive Learning, applied to a network of linear adjustable resistors. It is shown that, in this setup, Contrastive Learning is equivalent to projected gradient descent on a convex function with Lipschitz continuous gradient, giving a guarantee of convergence of the algorithm for a range of stepsizes. This convergence result is then extended to a stochastic variant of Contrastive Learning.


  • Hierarchical Control of Non-deterministic Linear Systems Using ($\gamma,\delta,\rho$)-Abstraction

    by Armin Pirastehzad, Arjan van der Schaft, Bart Besselink

    We compensate for scalability issues in control synthesis by developing a hierarchical scheme that splits the control of a high-dimensional non-deterministic linear ‘concrete’ system into three consecutive steps. First, a low-dimensional ‘abstract’ model of the concrete system is obtained. A controller is then designed for this abstract system, which is computationally efficient due to the low-dimensionality of the abstract system. Finally, through the use of an ‘interface,’ the designed abstract controller is refined into the concrete one. We enable this by introducing and characterizing the notion of ($\gamma,\delta,\rho$)-abstraction, which measures to what extent the controlled input-output behavior of a concrete system is similar to that of its abstraction in an $\mathcal {L}_{2}$ approximation metric. We then exploit this to characterize the existence of an abstract system and utilize this characterization to propose a step-by-step procedure to construct the abstract system and the corresponding interface.

  • Open Access

    On differential controllability and observability functions

    by Yu Kawano, Bart Besselink, Jacquelien M.A. Scherpen


  • Open Access

    Learning in Memristive Neural Networks

    by H. M. Heidema, H. J. van Waarde, B. Besselink

    Memristors are nonlinear two-terminal circuit elements whose resistance at a given time depends on past electrical stimuli. Recently, networks of memristors have received attention in neuromorphic computing since they can be used to implement Artificial Neural Networks (ANNs) in hardware. For this, one can use a class of memristive circuits called crossbar arrays. In this paper, we describe a circuit implementation of an ANN and resolve three questions concerning such an implementation. In particular, we show (1) how to evaluate the implementation at an input, (2) how the resistance values of the memristors at a given time can be determined from external (current) measurements, and (3) how the resistances can be steered to desired values by applying suitable external voltages to the network. The results will be applied to two examples: an academic example to show proof of concept and an ANN that was trained using the MNIST dataset.

  • Design and Control for Implementation of Simulation-Based Assume-Guarantee Contracts

    by Brayan M. Shali, Arjan J. van der Schaft, Bart Besselink

    We present assume-guarantee contracts as specifications for the dynamic behaviour of linear dynamical systems with inputs and outputs. We define and characterize contract implementation using the notion of simulation as a means of comparing system behaviour. We show that contract implementation can be verified by using the computationally tractable numerical procedures for verifying simulation. We then consider two problems related to contract-based design. First, we consider the problem of constructing an implementation for a given contract. We find necessary and sufficient conditions under which an implementation exists, and we provide a systematic procedure for the construction of an implementation if it exists. Second, we consider the problem of constructing a linear dynamic output feedback controller that turns a given plant system into an implementation of a given contract. We find necessary and sufficient conditions for the existence of such a controller, and we provide a systematic procedure for its construction if it exists. The latter is then demonstrated with a simple example of a vehicle following system.

  • String Stability and Guaranteed Safety via Funnel Cruise Control for Vehicle Platoons

    by Thomas Berger, Bart Besselink

    We study decentralized control strategies for platoons of autonomous vehicles with heterogeneous and nonlinear dynamics. Based on ideas from funnel control, we present a novel decentralized control algorithm which is able to guarantee a safety distance between any two vehicles, a good traffic flow and it achieves string stability of the controlled platoon. We illustrate the performance of the controller by simulations of two extreme scenarios.


  • Open Access

    Efficient reduction of interconnected subsystem models using abstracted environments

    by Luuk Poort, Bart Besselink, Rob H.B. Fey, Nathan van de Wouw


  • Abstracted Model Reduction: A General Framework for Efficient Interconnected System Reduction

    by Luuk Poort, Lars A. L. Janssen, Bart Besselink, Rob H. B. Fey, Nathan van de Wouw

    This article introduces the concept of abstracted model reduction: a framework to improve the tractability of structure-preserving methods for the complexity reduction of interconnected system models. To effectively reduce high-order, interconnected models, it is usually not sufficient to consider the subsystems separately. Instead, structure-preserving reduction methods should be employed, which consider the interconnected dynamics to select which subsystem dynamics to retain in reduction. However, structure-preserving methods are often not computationally tractable. To overcome this issue, we propose to connect each subsystem model to a low-order abstraction of its environment to reduce it both effectively and efficiently. By means of a high-fidelity structural dynamics model from the lithography industry, we show, on the one hand, significantly increased accuracy with respect to standard subsystem reduction and, on the other hand, similar accuracy to direct application of expensive structure-preserving methods, while significantly reducing computational cost. Furthermore, we formulate a systematic approach to automatically determine sufficient abstraction and reduction orders to preserve stability and guarantee a given frequency-dependent error specification. We apply this approach to the lithography equipment use case and show that the environment model can indeed be reduced by over 80% without significant loss in the accuracy of the reduced interconnected model.


  • Open Access

    Abstracted Model Reduction: A General Framework for Efficient Interconnected System Reduction

    by Luuk Poort, Lars A. L. Janssen, Bart Besselink, Rob H. B. Fey, Nathan van de Wouw

    This paper introduces the concept of abstracted model reduction: a framework to improve the tractability of structure-preserving methods for the complexity reduction of interconnected system models. To effectively reduce high-order, interconnected models, it is usually not sufficient to consider the subsystems separately. Instead, structure-preserving reduction methods should be employed, which consider the interconnected dynamics to select which subsystem dynamics to retain in reduction. However, structure-preserving methods are often not computationally tractable. To overcome this issue, we propose to connect each subsystem model to a low-order abstraction of its environment to reduce it both effectively and efficiently. By means of a high-fidelity structural-dynamics model from the lithography industry, we show, on the one hand, significantly increased accuracy with respect to standard subsystem reduction and, on the other hand, similar accuracy to direct application of expensive structure-preserving methods, while significantly reducing computational cost. Furthermore, we formulate a systematic approach to automatically determine sufficient abstraction and reduction orders to preserve stability and guarantee a given frequency-dependent error specification. We apply this approach to the lithography equipment use case and show that the environment model can indeed be reduced by over 80\% without significant loss in the accuracy of the reduced interconnected model.

  • Open Access

    Learning in memristive electrical circuits

    by Marieke Heidema, Henk van Waarde, Bart Besselink

    Memristors are nonlinear two-terminal circuit elements whose resistance at a given time depends on past electrical stimuli. Recently, networks of memristors have received attention in neuromorphic computing since they can be used as a tool to perform linear algebraic operations, like matrix-vector multiplication, directly in hardware. In this paper, the aim is to resolve two fundamental questions pertaining to a specific, but relevant, class of memristive circuits called crossbar arrays. In particular, we show (1) how the resistance values of the memristors at a given time can be determined from external (voltage and current) measurements, and (2) how the resistances can be steered to desired values by applying suitable external voltages to the network. The results will be applied to solve a prototypical learning problem, namely linear least squares, by applying and measuring voltages and currents in a suitable memristive circuit.