This paper proposes an optimal obstacle avoidance and trajectory tracking method based on data-driven control ...
XING Shaomin 1,GUAN Xinping 1,2,LUO Xiaoyuan 1 1.Department of Electrical Engineering,Yanshan University,Qinhuangdao,066004,P.R.China2.School of Electronic and Electric Engineering,Shanghai Jiao Tong University,Shanghai,200240,P.R.China
This paper presents an up-to-date study on the observer-based control problem for nonlinear systems in the presence of unmodeled dynamics and actuator dead-zone.By introducing a dynamic signal to dominate the unmodeled dynamics and using an adaptive nonlinear damping to counter the effects of the nonlinearities and dead-zone input,the proposed observer and controller can ensure that the closed-loop system is asymptotically stable in the sense of uniform ultimate boundedness.Only one adaptive parameter is needed no matter how many unknown parameters there are.The system investigated is more general and there is no need to solve Linear matrix inequality (LMI).Moreover,with our method,some assumptions imposed on nonlinear terms and dead-zone input are relaxed.Finally,simulations illustrate the effectiveness of the proposed adaptive control scheme.
To investigate the leader-following formation control, in this paper we present the design problem of control protocols and distributed observers under which the agents can achieve and maintain the desired formation from any initial states, while the velocity converges to that of the virtual leader whose velocity cannot be measured by agents in real time. The two cases of switching topologies without communication delay and fixed topology with time-varying communication delay are both considered for multi-agent networks. By using the Lyapunov stability theory, the issue of stability is analysed for multi-agent systems with switching topologies. Then, by considering the time-varying communication delay, the sufficient condition is proposed for the multi-agent systems with fixed topology. Finally, two numerical examples are given to illustrate the effectiveness of the proposed leader-following formation control protocols.
This paper considers the problem of delay-dependent exponential stability in mean square for stochastic systems with polytopic-type uncertainties and time-varying delay. Applying the descriptor model transformation and introducing free weighting matrices, a new type of Lyapunov-Krasovskii functional is constructed based on linear matrix inequalities (LMIs), and some new delay-dependent criteria are obtained. These criteria include the delay-independent/rate-dependent and delay-dependent/rate-independent exponential stability criteria. These new criteria are less conservative than existing ones. Numerical examples demonstrate that these new criteria are effective and are an improvement over existing ones.
Yumei LIXinping GUANDan PENGChangchun HUAXiaoyuan LUO
In this paper, we apply adaptive coded modulation (ACM) schemes to a wireless networked control system (WNCS)to improve the energy efficiency and increase the data rate over a fading channel. To capture the characteristics of varying rate,interference, and routing in wireless transmission channels, the concepts of equivalent delay (ED) and networked condition index (NCI)are introduced. Also, the analytic lower and upper bounds of EDs are obtained. Furthermore, we model the WNCS as a multicontroller switched system (MSS) under consideration of EDs and loss index in the wireless transmission. Sufficient stability condition of the closed-loop WNCS and corresponding dynamic state feedback controllers are derived in terms of linear matrix inequality (LMI).Numerical results show the validity and advantage of our proposed control strategies.
This paper researched into some methods for generating min-weighted rigid graphs and min-weighted persistent graphs.Rigidity and persistence are currently used in various studies on coordination and control of autonomous multi-agent formations.To minimize the communication complexity of formations and reduce energy consumption,this paper introduces the rigidity matrix and presents three algorithms for generating min-weighted rigid and minweighted persistent graphs.First,the existence of a min-weighted rigid graph is proved by using the rigidity matrix,and algorithm 1 is presented to generate the min-weighted rigid graphs.Second,the algorithm 2 based on the rigidity matrix is presented to direct the edges of min-weighted rigid graphs to generate min-weighted persistent graphs.Third,the formations with range constraints are considered,and algorithm 3 is presented to find whether a framework can form a min-weighted persistent formation.Finally,some simulations are given to show the efficiency of our research.
