arXiv subjects

Yongduan Song

Publications and source records attributed to Yongduan Song.

23 records · Page 2Linked to original sources

arXiv2022

Prescribed-time Control for Linear Systems in Canonical Form Via Nonlinear Feedback

For systems in canonical form with nonvanishing uncertainties/disturbances, this work presents an approach to full state regulation within prescribed time irrespective of initial conditions. By introducing the smooth hyperbolic-tangent-like function, a nonlinear and time-varying state feedback control scheme is constructed, which is further extended to address output feedback based prescribed-time regulation by invoking the prescribed-time observer, all are applicable over the entire operational time zone. As an alternative to full state regulation within user-assignable time interval, the proposed method analytically bridges the divide between linear and nonlinear feedback based prescribed-time control, and is able to achieve asymptotic stability, exponential stability and prescribed-time stability with a unified control structure.

eess.SY↗

arXiv2022

Backstepping Design Embedded With Time-Varying Command Filters

If embedded with command filter properly, the implementation of backstepping design could be dramatically simplified. In this paper, we introduce a command filter with time-varying gain and integrate it with backstepping design, resulting in a new set of backstepping control algorithms with low complexity even for high-order strict-feedback systems. Furthermore, with the aid of "softening" sign function based compensator, zero-error output tracking is ensured while at the same time maintaining prescribed transient performance. Numerical simulation is carried out to verify the effectiveness and benefits of the proposed method.

eess.SY↗

arXiv2021

Achieving safe minimum circle circumnavigation around multiple targets: a dynamic compensation approach

Minimum circle circumnavigation is proposed in this paper, which is of special value in target monitoring, capturing and/or attacking. In this paper, a safe minimum circle circumnavigation of multiple targets based on bearing measurements is studied. In contrast with the traditional circumnavigation problem, with the new pattern, one agent is able to enclose multiple targets along a minimum circle with the desired enclosing distance and tangential speed. To achieve the minimum circle circumnavigation, an algorithm including dynamic compensators and a control protocol is proposed, by which collision is avoided between the agent and the multiple targets during the whole moving process. Moreover, the control protocol developed for a single agent is further extended to the scenarios of multiple agents by adding a coordination mechanism into the tangential velocity term, which drives the agents to distribute evenly on each expected circular orbit with the same radius or different radius. Simulations results illustrate the effectiveness of the proposed methods.

cs.MA↗

arXiv2015

Fully Distributed Flocking with a Moving Leader for Lagrange Networks with Parametric Uncertainties

This paper addresses the leader-follower flocking problem with a moving leader for networked Lagrange systems with parametric uncertainties under a proximity graph. Here a group of followers move cohesively with the moving leader to maintain connectivity and avoid collisions for all time and also eventually achieve velocity matching. In the proximity graph, the neighbor relationship is defined according to the relative distance between each pair of agents. Each follower is able to obtain information from only the neighbors in its proximity, involving only local interaction. We consider two cases: i) the leader moves with a constant velocity, and ii) the leader moves with a varying velocity. In the first case, a distributed continuous adaptive control algorithm accounting for unknown parameters is proposed in combination with a distributed continuous estimator for each follower. In the second case, a distributed discontinuous adaptive control algorithm and estimator are proposed. Then the algorithm is extended to be fully distributed with the introduction of gain adaptation laws. In all proposed algorithms, only one-hop neighbors' information (e.g., the relative position and velocity measurements between the neighbors and the absolute position and velocity measurements) is required, and flocking is achieved as long as the connectivity and collision avoidance are ensured at the initial time and the control gains are designed properly. Numerical simulations are presented to illustrate the theoretical results.

math.OC↗

arXiv2015

Distributed Average Tracking for Double-integrator Multi-agent Systems with Reduced Requirement on Velocity Measurements

This paper addresses distributed average tracking for a group of physical double-integrator agents under an undirected graph with reduced requirement on velocity measurements. The idea is that multiple agents track the average of multiple time-varying input signals, each of which is available to only one agent, under local interaction with neighbors. We consider two cases. First, a distributed discontinuous algorithm and filter are proposed, where each agent needs the relative positions between itself and its neighbors and its neighbors' filter outputs obtained through communication but the requirement for either absolute or relative velocity measurements is removed. The agents' positions and velocities must be initialized correctly, but the algorithm can deal with a wide class of input signals with bounded acceleration deviations. Second, a distributed discontinuous algorithm and filter are proposed to remove the requirement for communication and accurate initialization. Here each agent needs to measure the relative position between itself and its neighbors and its own velocity but the requirement for relative velocity measurements between itself and its neighbors is removed. The algorithm can deal with the case where the input signals and their velocities and accelerations are all bounded. Numerical simulations are also presented to illustrate the theoretical results.

math.OC↗