Related Experiment Video
Updated: Jun 28, 2025

Measuring Delay Discounting in Humans Using an Adjusting Amount Task
Published on: January 9, 2016
Distributed dynamic event-triggered algorithm for optimization problem with time delay
Lu Jiang1, Lunchao Xia1, Zhongyuan Zhao1
1College of Automation, Nanjing University of Information Science and Technology, Nanjing, China.
Abstract:
This paper focuses on studying the optimization problem of multi-agent systems (MAS) under undirected graph. To reduce the communication frequency among agents, a zero-gradient-sum (ZGS) algorithm based on dynamic event-triggered (DET) mechanism is investigated. The event-triggered condition of each agent only uses its own state information and the neighbor's state information at the previous triggering instants, without requiring continuous state information from the neighbor. In addition, the designed algorithm allows for the sampling period to be arbitrarily large. The Lyapunov method is utilized to derive the sufficient conditions that incorporate time delay and parameters. As the event is only checked at the periodic moment, zeno behavior can be directly excluded. Finally, numerical simulations demonstrate the effectiveness of the theoretical results.
More Related Videos
05:19Using Neuron Spiking Activity to Trigger Closed-Loop Stimuli in Neurophysiological Experiments
Published on: November 12, 2019
06:45Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator
Published on: October 28, 2022
Related Concept Videos
Time-Domain Interpretation of PD Control
Consider the example of control of motor torque. Initially, a positive...
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Trial and Error and Algorithm
Properties of DTFT I
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
Social Traps