共查询到20条相似文献,搜索用时 15 毫秒
1.
We present a simple model matching controller for the stabilization of the inverted pendulum cart system, assuming that the pendulum is initialized above the horizontal plane. The control strategy consists of forcing the closed‐loop system to behave as another nonlinear target system with some stability properties. To this end, we solve two matching conditions that allow us to shape a suitable target system. Having satisfied both matching conditions, the stabilizing controller is directly obtained from the proposed target system. The obtained close‐loop system is locally asymptotically exponentially stable, with a very large domain of attraction. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
2.
The leader‐following consensus problem for multiple Euler–Lagrange systems has been extensively studied for various scenarios. Under the assumption that the communication graph is jointly connected, one of our recent papers gave the solution for the case where the leader system can generate a combination of arbitrary step signal, arbitrary ramp signal, and arbitrary sinusoidal signals. In practice, it is desirable to enable the control law the capability of maintaining the connectivity of the communication graph, thus achieving the leader‐following consensus without assuming the connectivity of the communication graph. We call such a problem as leader‐following consensus with connectivity preservation. By combining the adaptive control technique and potential function technique, we will show that such a problem is solvable. By employing different potential functions, our approach may also lead to the solution of such problems as rendezvous, flocking and swarming. Copyright © 2017 John Wiley & Sons, Ltd. 相似文献
3.
Carlos F. Aguilar‐Ibañez F. Guzmán‐Aguilar Rogelio Lozano Juan C. Chimal E 《国际强度与非线性控制杂志
》2009,19(11):1278-1289
》2009,19(11):1278-1289
In this paper we present a control strategy for the stabilization of a rigid beam balanced by a cart. The control problem consists of horizontally balancing the beam by moving the cart backwards and forwards along the beam. The cart movement is restricted to always remain over the beam. The control strategy is based on the interconnection and damping assignment passivity based controller. The stability analysis is carried out using LaSalles's theorem. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
4.
This paper proposes a novel pose (position and orientation) consensus controller for networks of heterogeneous robots modeled in the operational space. The proposed controller is a distributed proportional plus damping scheme that, with a slight modification, solves both the leader–follower and leaderless consensus problems. A singularity‐free representation, unit quaternion, is used to describe the robots orientation, and the network is represented by an undirected and connected interconnection graph. Furthermore, it is shown that the controller is robust to interconnection variable time delays. Experiments with a network of two 6‐degrees‐of‐freedom robots are presented to illustrate the performance of the proposed scheme. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
5.
The problem of robust control for the angular velocity of a rigid body subject to external disturbances is addressed. It is shown that if the disturbances are matched there exists a control law attenuating the effect of the disturbances, whereas in the case of non-matched disturbances no such a feedback law generically exists. Hence, a new concept of disturbance attenuation is introduced and it is proved that the aforementioned problem is solvable in this weaker sense. Explicit expressions of the control laws solving the proposed robust stabilization problems are given. 相似文献
6.
Numerical simulation of pyroclastic density currents using locally refined Cartesian grids 总被引:1,自引:0,他引:1
Pyroclastic density currents are ground hugging, hot, gas–particle flows representing the most hazardous events of explosive volcanism. Their impact on structures is a function of dynamic pressure, which expresses the lateral load that such currents exert over buildings. Several critical issues arise in the numerical simulation of such flows, which involve a rheologically complex fluid that evolves over a wide range of turbulence scales, and moves over a complex topography. In this paper we consider a numerical technique that aims to cope with the difficulties encountered in the domain discretization when an adequate resolution in the regions of interest is required. Without resorting to time-consuming body-fitted grid generation approaches, we use Cartesian grids locally refined near the ground surface and the volcanic vent in order to reconstruct the steep velocity and particle concentration gradients. The grid generation process is carried out by an efficient and automatic tool, regardless of the geometric complexity. We show how analog experiments can be matched with numerical simulations for capturing the essential physics of the multiphase flow, obtaining calculated values of dynamic pressure in reasonable agreement with the experimental measurements. These outcomes encourage future application of the method for the assessment of the impact of pyroclastic density currents at the natural scale. 相似文献
7.
《国际计算机数学杂志》2012,89(2-4):235-245
8.
A. V. Plotnikov 《Cybernetics and Systems Analysis》2002,38(5):772-782
This paper deals with rapidity and rendezvous problems and with problems with multi-valued and vector quality criteria for objects whose behavior is described by linear differential inclusions that contain controls. 相似文献
9.
The paper suggests an explicit form of a general integral of motion for some classes of dynamical systems including n-degrees of freedom Euler–Lagrange systems subject to (n-1) virtual holonomic constraints. The knowledge of this integral allows to extend the classical results due to Lyapunov for detecting a presence of periodic solutions for a family of second order systems, and allows to solve the periodic motion planning task for underactuated Euler–Lagrange systems, when there is only one not directly actuated generalized coordinate. As an illustrative example, we have shown how to create a periodic oscillation of the pendulum for a cart–pendulum system and how then to make them orbitally exponentially stable following the machinery developed in [A. Shiriaev, J. Perram, C. Canudas-de-Wit, Constructive tool for an orbital stabilization of underactuated nonlinear systems: virtual constraint approach, IEEE Trans. Automat. Control 50 (8) (2005) 1164–1176]. The extension here also considers time-varying virtual constraints. 相似文献
10.
This paper proposes a distributed model‐independent algorithm to achieve leaderless consensus on a directed network where each fully‐actuated agent has self‐dynamics described by Euler–Lagrange equations of motion. Specifically, we aim to achieve consensus of the generalised coordinates with zero generalised velocity. We show that on a strongly connected graph, a model‐independent algorithm can achieve the consensus objective at an exponential rate if an upper bound on the initial conditions is known a priori. By model‐independent, we mean that each agent can execute the algorithm with no knowledge of the equations describing the self‐dynamics of any agent. For design of the control laws which achieve consensus, a control gain scalar and a control gain matrix are required to satisfy several inequalities involving bounds on the matrices of the agent dynamic model, bounds on the Laplacian matrix describing the network topology and the set of initial conditions; design of the algorithm therefore requires some knowledge on the bounds of the agent dynamical parameters. Because only bounds are required, the proposed algorithm offers robustness to uncertainty in the parameters of the multiagent system. We systematically show that additional relative velocity information improves the performance of the controller. Numerical simulations are provided to show the effectiveness of the algorithm. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
11.
A unified solution is presented to the tracking control problem of Euler–Lagrange systems with finite‐time convergence. A reconstruction module is designed to estimate the overall of unmodeled dynamics, disturbance, actuator misalignment, and multiple actuator faults. That reconstruction is accomplished in finite time with zero error. A nonsingular terminal sliding mode controller is then synthesized, and the resultant closed‐loop system is also shown to be finite‐time stable with the reference trajectory followed in finite time. Unlike most sliding mode control methods to handle system uncertainties, the designed control has less conservativeness and stronger fault tolerant capability. A rigid spacecraft system is used to demonstrate the effectiveness and potential of the proposed scheme. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
12.
In this paper, the robust coordination of multi-agent systems via energy-shaping is studied. The agents are nonidentical, Euler–Lagrange systems with uncertain parameters which are regulated (with and without exchange of information between the agents) by the classical energy-based controller where the potential energy function is shaped such that, if the parameters are known, all agents converge globally to the same desired constant equilibrium. Under parameter uncertainty, the globally asymptotically stable (GAS) equilibrium point is shifted away from its desired value and this paper shows that adding information exchange between the agents to the decentralized control policy improves the steady-state performance. More precisely, it proves that if the undirected communication graph is connected, the equilibrium of the networked controller is always closer (in a suitable metric) to the desired one than that of the decentralized controller. The result holds for all interconnection gains if the potential energy functions are quadratic, else, it is true for sufficiently large gains. An additional advantage of networking is that the asymptotic stabilization objective can be achieved by using lower gains into the loop. Some experimental results (using two nonlinear manipulators) given support to the main results of the paper. 相似文献
13.
This paper investigates the distributed finite‐time tracking problem of networked agents with multiple Euler–Lagrange dynamics. To achieve finite‐time tracking, a distributed finite‐time protocol is first proposed on the basis of both relative position and relative velocity measurements. By using tools from homogeneous theory, it is theoretically shown that the proposed protocol can guarantee finite‐time tracking in the presence of control input constraints. On the basis of the state feedback analysis and with the aid of second‐order sliding‐mode observer approach, a new class of finite‐time tracking protocols based only on the relative position measurements is developed and employed. It is proved that the multiple agents equipped with the designed protocols can track the target location in finite time. Furthermore, a decentralized finite‐time protocol based on a distributed estimator is proposed to solve the finite‐time tracking problems with a dynamic leader. The effectiveness of the theoretical results is finally illustrated by numerical simulations. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
14.
The consensus problem for multi‐agent systems with input saturation is addressed in this paper. For agents with double‐integrator dynamics, we first propose two consensus algorithms, respectively, for the cases with and without velocity measurements. Based on graph theory, homogeneous method and the Lyapunov stability theory, it is proved that the proposed algorithms can guarantee not only the state agreement in finite time for all the agents but also the input saturation requirement. Then, the obtained results and techniques are extended to the finite‐time consensus problem for multiple mechanical systems. Numerical simulations are finally provided to verify the effectiveness of the theoretical results. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
15.
Often, in solving an elliptic equation with Neumann boundary conditions, a compatibility condition has to be imposed for well-posedness. This condition involves integrals of the forcing function. When pseudospectral Chebyshev methods are used to discretize the partial differential equation, these integrals have to be approximated by an appropriate quadrature formula. The Gauss-Chebyshev (or any variant of it, like the Gauss-Lobatto) formula cannot be used here since the integrals under consideration do not include the weight function. A natural candidate to be used in approximating the integrals is the Clenshaw-Curtis formula; however, we show in this article that this is the wrong choice and it may lead to divergence if time-dependent methods are used to march the solution to steady state. We develop, in this paper, the correct quadrature formula for these problems. This formula takes into account the degree of the polynomials involved. We show that this formula leads to a well-conditioned Chebyshev approximation to the differential equations and that the compatibility condition is automatically satisfied. 相似文献
16.
This paper investigates the flocking problem of networked nonlinear Euler–Lagrange systems with parametric uncertainties, and they are assumed to interact on directed graphs with a directed spanning tree. We propose an adaptive controller to achieve the flocking objective, and the resultant closed-loop networked system bears the cascade structure. Using a new similarity decomposition approach, a critical-characteristic-root based approach, and the input–output stability analysis, we demonstrate the convergence of the position/velocity synchronization errors among the uncertain nonlinear Euler–Lagrange agents. We also show that the velocities of the Euler–Lagrange systems converge to the weighted average velocity value. Simulation results are provided to demonstrate the performance of the proposed controller. 相似文献
17.
This article deals with problems of continuous dependence of solutions of impulsive differential inclusions on their initial conditions and right sides and of the use of these inclusions in control problems arising in systems with impulses. 相似文献
18.
This article aims at proposing a successive Chebyshev pseudospectral convex optimization method for solving general nonlinear optimal control problems (OCPs). First, Chebyshev pseudospectral discrete scheme is used to discretize a general nonlinear OCP. At the same time, a convex subproblem is formulated by using the first-order Taylor expansion to convexify the discretized nonlinear dynamic constraints. Second, a trust-region penalty term is added to the performance index of the subproblem, and a successive convex optimization algorithm is proposed to solve the subproblem iteratively. Noted that the trust-region penalty parameters can be adjusted according to the linearization error in iterative process, which improves convergence rate. Third, the Karush–Kuhn–Tucker conditions of the subproblem are derived, and furthermore, a proof is given to show that the algorithm will iteratively converge to the subproblem. Additionally, the global convergence of the algorithm is analyzed and proved, which is based on three key lemmas. Finally, the orbit transfer problem of spacecraft is used to test the performance of the proposed method. The simulation results demonstrate the optimal control is bang-bang form, which is consistent with the result of theoretical proof. Also, the algorithm is of efficiency, fast convergence rate, and high accuracy. Therefore, the proposed method provides a new approach for solving nonlinear OCPs online and has great potential in engineering practice. 相似文献
19.
We consider linear control systems under uncertainties. For such systems we solve the problem of constructing worst‐case feedback control policies that are allowed to be corrected at m fixed intermediate time moments. We propose two types of the approximative control policies. All of them guarantee that for all admissible uncertainties the terminal system state lies in a prescribed neighborhood of a given state x* at a given final moment, and the value of the cost function does not exceed a given estimate. It is shown that computation of the estimate for each policy is equivalent to solving a corresponding convex mathematical programming (MP) problem with m decision variables. Based on the solution of the MP problem, we derive simple explicit rules (which can be easily implemented on‐line) for constructing the corresponding control policy in the original control problem. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献