Search

This note studies the tracking control problem of nonlinear networked and quantized control systems (NQCSs) with communication delays. The communication network is to guarantee the information transmission among the plant, the reference system, and the controller. The communication network also brings about some undesired issues, which lead to nonvanishing network-induced errors and affect the tracking performance. As a result, we first develop a hybrid system model for NQCSs under the network-induced issues. Based on the Lyapunov approach, sufficient conditions are established to guarantee the tracking performance with respect to the nonvanishing network-induced errors. The obtained conditions lead to a tradeoff between the maximally allowable transmission interval and the maximally allowable delay. Furthermore, the existence of Lyapunov functions satisfying the obtained conditions is studied. For specific time-scheduling protocols and quantizers, Lyapunov functions are constructed explicitly. Finally, a numerical example is presented to demonstrate the developed theory., QC 20200828

This paper studies input-to-state stability of networked and quantized control systems with external disturbances. Since the external disturbance is considered, the state may escape from the quantization regions, which thus leads to the introduction of the quantization mechanism with zooming-out and zooming-in stages. We first propose a novel hybrid system to incorporate both the open-loop and closed-loop systems. Based on the developed hybrid model, we establish the boundedness of the state in the zooming-out stage, and the convergence of the state in the zooming-in stage. Furthermore, sufficient conditions are established for input-to-state stability in the case of switching between the zooming-in and zooming-out stages. Finally, a numerical example is presented to illustrate the obtained results., QC 20210802

A power packet dispatching system is proposed to realize the function of power on demand. This system distributes electrical power in quantized form, which is called power processing. This system has extensibility and flexibility. Here, we propose to use the power packet dispatching system as the next generation power distribution system in self-established and closed system such as robots, cars, and aircrafts. This paper introduces the concept and the required researches to take the power packet dispatching system in practical phase from the total viewpoints of devices, circuits, power electronics, system control, computer network, and bio-inspired power consumption.

Distributed real-time systems often rely on clock synchronization. However, the achievement of precise synchronization in Wireless Sensor Networks (WSNs) is hampered by competing design challenges, which finally causes many WSN hardware platforms to rely on low frequency clock crystal for local timebase provision. Although this solution is inexpensive and with a remarkably low energy consumption, it limits the resolution at which time can be measured. The FLOPSYNC synchronization scheme was then introduced to compensate for possible quartz crystal imperfections. The main limitation of FLOPSYNC is that it does not account for the effects of quantization. In this paper we propose a switched control variant of the base FLOPSYNC scheme to address quantization explicitly in the compensator design, providing clock synchronization in cost-sensitive WSN node platforms with a minimal additional overhead. Experimental evidence is given that the approach reaches a synchronization error of at most 1 clock tick in a real WSN.

For a networked control system, we consider the problem of encoder and controller design. We study a discrete-time linear plant with a finite horizon performance cost, comprising a quadratic function of the states and controls, and an additive communication cost. We study separation in design of the encoder and controller, along with related closed-loop properties such as the dual effect and certainty equivalence. The encoder outputs are quantized samples, but our results also apply to two other formats for encoder outputs: real-valued samples at event-triggered times, and real-valued samples over additive noise channels. If the controller and encoder are dynamic, then we show that the performance cost is minimized by a separated design: the controls are updated at each time instant as per a certainty equivalence law, and the encoder is chosen to minimize an aggregate quadratic distortion of the estimation error. This separation is shown to hold even though a dual effect is present in the closed-loop system. We also show that this separated design need not be optimal when the controller or encoder are to be chosen from within restricted classes., QC 20160613

This paper addresses a problem of finding an optimal dynamic quantizer for nonlinear control subject to discrete-valued signal constraints, i.e., to the condition that some signals must take a value on a discrete and countable set at each time instant. The quantizers to be studied are in the form of a nonlinear difference equation which maps continuous-valued signals into discrete-valued ones. They are evaluated by a performance index expressing the difference between the resulting quantized system and the unquantized system, in terms of the input-output relation. In this paper, we present a closed-form solution, which globally minimizes the performance index. This result shows the performance limitation of a general class of dynamic quantizers. In addition to this, some results on the structure and the stability are given in order to clarify the mechanism of the best dynamic quantization in nonlinear control systems.

The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems., QC 20110113

The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems., QC 20110113

The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems., QC 20110113

The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems., QC 20110113

The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems., QC 20110113

To achieve satisfactory overall performance, optimal rate allocation in a networked control system with highly limited communication resources is instrumental. In this paper, a rate allocation technique for state feedback control in linear dynamic systems over a noisy channel is proposed. The method consists of two steps: (i) the overall cost is expressed as a function of rates at all time instants by means of high-rate quantization theory, and (ii) a constrained optimization problem to minimize the overall distortion is solved. It is shown that a non-uniform quantization is in general the best strategy for state feedback control over noisy channels. Monte Carlo simulations illustrate the proposed scheme, which is shown to have good performance when compared to arbitrarily selected rate allocations., QC 20110124

To achieve satisfactory overall performance, optimal rate allocation in a networked control system with highly limited communication resources is instrumental. In this paper, a rate allocation technique for state feedback control in linear dynamic systems over a noisy channel is proposed. The method consists of two steps: (i) the overall cost is expressed as a function of rates at all time instants by means of high-rate quantization theory, and (ii) a constrained optimization problem to minimize the overall distortion is solved. It is shown that a non-uniform quantization is in general the best strategy for state feedback control over noisy channels. Monte Carlo simulations illustrate the proposed scheme, which is shown to have good performance when compared to arbitrarily selected rate allocations., QC 20110124

To achieve satisfactory overall performance, optimal rate allocation in a networked control system with highly limited communication resources is instrumental. In this paper, a rate allocation technique for state feedback control in linear dynamic systems over a noisy channel is proposed. The method consists of two steps: (i) the overall cost is expressed as a function of rates at all time instants by means of high-rate quantization theory, and (ii) a constrained optimization problem to minimize the overall distortion is solved. It is shown that a non-uniform quantization is in general the best strategy for state feedback control over noisy channels. Monte Carlo simulations illustrate the proposed scheme, which is shown to have good performance when compared to arbitrarily selected rate allocations., QC 20110124

To achieve satisfactory overall performance, optimal rate allocation in a networked control system with highly limited communication resources is instrumental. In this paper, a rate allocation technique for state feedback control in linear dynamic systems over a noisy channel is proposed. The method consists of two steps: (i) the overall cost is expressed as a function of rates at all time instants by means of high-rate quantization theory, and (ii) a constrained optimization problem to minimize the overall distortion is solved. It is shown that a non-uniform quantization is in general the best strategy for state feedback control over noisy channels. Monte Carlo simulations illustrate the proposed scheme, which is shown to have good performance when compared to arbitrarily selected rate allocations., QC 20110124

To achieve satisfactory overall performance, optimal rate allocation in a networked control system with highly limited communication resources is instrumental. In this paper, a rate allocation technique for state feedback control in linear dynamic systems over a noisy channel is proposed. The method consists of two steps: (i) the overall cost is expressed as a function of rates at all time instants by means of high-rate quantization theory, and (ii) a constrained optimization problem to minimize the overall distortion is solved. It is shown that a non-uniform quantization is in general the best strategy for state feedback control over noisy channels. Monte Carlo simulations illustrate the proposed scheme, which is shown to have good performance when compared to arbitrarily selected rate allocations., QC 20110124

A rendezvous problem for a team of autonomous vehicles that is communicating through quantized channels is considered. Communication topologies and feedback control law are presented that solves the rendezvous problem in the sense that a meeting point for the vehicles is practically stabilized. In particular, it is shown that uniform quantizers can sometimes be replaced by logarithmic quantizers and thus reduce the need for communication bandwidth., QC 20120220

A rendezvous problem for a team of autonomous vehicles that is communicating through quantized channels is considered. Communication topologies and feedback control law are presented that solves the rendezvous problem in the sense that a meeting point for the vehicles is practically stabilized. In particular, it is shown that uniform quantizers can sometimes be replaced by logarithmic quantizers and thus reduce the need for communication bandwidth., QC 20120220

A rendezvous problem for a team of autonomous vehicles that is communicating through quantized channels is considered. Communication topologies and feedback control law are presented that solves the rendezvous problem in the sense that a meeting point for the vehicles is practically stabilized. In particular, it is shown that uniform quantizers can sometimes be replaced by logarithmic quantizers and thus reduce the need for communication bandwidth., QC 20120220

A rendezvous problem for a team of autonomous vehicles that is communicating through quantized channels is considered. Communication topologies and feedback control law are presented that solves the rendezvous problem in the sense that a meeting point for the vehicles is practically stabilized. In particular, it is shown that uniform quantizers can sometimes be replaced by logarithmic quantizers and thus reduce the need for communication bandwidth., QC 20120220

A rendezvous problem for a team of autonomous vehicles that is communicating through quantized channels is considered. Communication topologies and feedback control law are presented that solves the rendezvous problem in the sense that a meeting point for the vehicles is practically stabilized. In particular, it is shown that uniform quantizers can sometimes be replaced by logarithmic quantizers and thus reduce the need for communication bandwidth., QC 20120220