Related Experiment Video
Updated: Jan 25, 2026

10:10
Analyzing the Size, Shape, and Directionality of Networks of Coupled Astrocytes
Published on: October 4, 2018
9.3K
Preview-Based Discrete-Time Dynamic Formation Control Over Directed Networks via Matrix-Valued Laplacian
IEEE Transactions on Cybernetics
|April 30, 2019
Summary
This study addresses dynamic formation control for discrete-time agents using preview-based controllers. The proposed P-like and PD-like methods effectively manage time-varying formations in directed graph networks.
Area of Science:
- Robotics
- Control Theory
- Distributed Systems
Background:
- Cooperative agents require formation control for coordinated tasks.
- Existing methods often rely on fixed formations or continuous-time dynamics.
- Discrete-time formation control with time-varying shapes presents unique challenges.
Purpose of the Study:
- To develop a novel approach for dynamic formation control in discrete-time multi-agent systems.
- To enable agents to adapt to time-varying formation shapes while maintaining coordination.
- To overcome limitations of traditional formation control methods in discrete-time settings.
Main Methods:
- Utilizing preview-based Proportional (P)-like and Proportional-Derivative (PD)-like controllers.
- Adapting matrix-valued Laplacian concepts for discrete-time dynamics.
- Designing controllers that consider future formation configurations.
Main Results:
- The proposed preview-based controllers effectively solve the dynamic formation control problem.
- Controllers demonstrate successful coordination of agents with time-varying geometric formations.
- Numerical simulations validate the efficacy and robustness of the developed control strategies.
Conclusions:
- Preview-based control offers a viable solution for dynamic formation control in discrete-time systems.
- The proposed controllers provide a robust framework for achieving adaptable formations.
- This research advances the capabilities of cooperative multi-agent systems in complex, dynamic environments.
Related Concept Videos
Discrete-time Fourier transform
1.1K
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
1.1K
Basic Discrete Time Signals
683
The unit step sequence is defined as 1 for zero and positive values of the integer n. This sequence can be graphically displayed using a set of eight sample points, showing a step function starting from n=0 and remaining constant thereafter.
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
683
Discrete-Time Fourier Series
671
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
671
BIBO stability of continuous and discrete -time systems
898
System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
898
Review and Preview
8.3K
In statistics, several tools are used to interpret the data. Measures of central tendency represent the characteristics of the data, such as mean, median, and mode. Additionally, measures of variance like standard deviation and range are used to find the spread of data from the mean. Relative standing measures the distance between data locations. Commonly used measures of relative standings are percentile, z score, and quartiles.
Percentiles are a type of fractile that partition data into...
Percentiles are a type of fractile that partition data into...
8.3K
Review and Preview
10.9K
Data are individual items of information obtained from a population or sample. Data may be classified as qualitative (categorical), quantitative continuous, or quantitative discrete. Because it is not practical to measure the entire population in a study, researchers use samples to represent the population. A random sample is a representative group from the population chosen by using a method that gives each individual in the population an equal chance of being included in the sample. Random...
10.9K

