اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFixed-Time Cooperative Behavioral Control for Networked Autonomous Agents with Second-Order Nonlinear Dynamics
89
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we investigate the fixed-time behavioral control problem for a team of second-order nonlinear agents, aiming to achieve a desired formation with collision/obstacle~avoidance. In the proposed approach, the two behaviors(tasks) for each agent are prioritized and integrated via the framework of the null-space-based behavioral projection, leading to a desired merged velocity that guarantees the fixed-time convergence of task errors. To track this desired velocity, we design a fixed-time sliding mode controller for each agent with state-independent adaptive gains, which provides a fixed-time convergence of the tracking error. The control scheme is implemented in a distributed manner, where each agent only acquires information from its neighbors in the network. Moreover, we adopt an online learning algorithm to improve the robustness of the closed system with respect to uncertainties/disturbances. Finally, simulation results are provided to show the effectiveness of the proposed approach.
قيم البحث
اقرأ أيضاً
We study sequences, parametrized by the number of agents, of many agent exit time stochastic control problems with risk-sensitive cost structure. We identify a fully characterizing assumption, under which each of such control problem corresponds to a
risk-neutral stochastic control problem with additive cost, and sequentially to a risk-neutral stochastic control problem on the simplex, where the specific information about the state of each agent can be discarded. We also prove that, under some additional assumptions, the sequence of value functions converges to the value function of a deterministic control problem, which can be used for the design of nearly optimal controls for the original problem, when the number of agents is sufficiently large.
This paper investigates a distributed formation control problem for networked robots, with the global objective of achieving predefined time-varying formations in an environment with obstacles. A novel fixed-time behavioral approach is proposed to ta
ckle the problem, where a global formation task is divided into two local prioritized subtasks, and each of them leads to a desired velocity that can achieve the individual task in a fixed time. Then, two desired velocities are combined via the framework of the null-space-based behavioral projection, leading to a desired merged velocity that guarantees the fixed-time convergence of task errors. Finally, the effectiveness of the proposed control method is demonstrated by simulation results.
Differentiation is an important task in control, observation and fault detection. Levants differentiator is unique, since it is able to estimate exactly and robustly the derivatives of a signal with a bounded high-order derivative. However, the conve
rgence time, although finite, grows unboundedly with the norm of the initial differentiation error, making it uncertain when the estimated derivative is exact. In this paper we propose an extension of Levants differentiator so that the worst case convergence time can be arbitrarily assigned independently of the initial condition, i.e. the estimation converges in emph{Fixed-Time}. We propose also a family of continuous differentiators and provide a unified Lyapunov framework for analysis and design.
We introduce a novel class of Nash equilibrium seeking dynamics for non-cooperative games with a finite number of players, where the convergence to the Nash equilibrium is bounded by a KL function with a settling time that can be upper bounded by a p
ositive constant that is independent of the initial conditions of the players, and which can be prescribed a priori by the system designer. The dynamics are model-free, in the sense that the mathematical forms of the cost functions of the players are unknown. Instead, in order to update its own action, each player needs to have access only to real-time evaluations of its own cost, as well as to auxiliary states of neighboring players characterized by a communication graph. Stability and convergence properties are established for both potential games and strongly monotone games. Numerical examples are presented to illustrate our theoretical results.
We study the formation control problem for a group of mobile agents in a plane, in which each agent is modeled as a kinematic point and can only use the local measurements in its local frame. The agents are required to maintain a geometric pattern wh
ile keeping a desired distance to a static/moving target. The prescribed formation is a general one which can be any geometric pattern, and the neighboring relationship of the N-agent system only has the requirement of containing a directed spanning tree. To solve the formation control problem, a distributed controller is proposed based on the idea of decoupled design. One merit of the controller is that it only uses each agents local measurements in its local frame, so that a practical issue that the lack of a global coordinate frame or a common reference direction for real multi-robot systems is successfully solved. Considering another practical issue of real robotic applications that sampled data is desirable instead of continuous-time signals, the sampled-data based controller is developed. Theoretical analysis of the convergence to the desired formation is provided for the multi-agent system under both the continuous-time controller with a static/moving target and the sampled-data based one with a static target. Numerical simulations are given to show the effectiveness and performance of the controllers.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
