Implementation of backstepping becomes increasingly complex as the order of the system increases. This increasing complexity is mainly driven by the need to compute command derivatives at each step of the design, with the ultimate step requiring derivatives of the same order as the plant. This article addresses a modification that obviates the need to compute analytic derivatives by introducing command filters in the backstepping design. While the concept of the command filter has previously been introduced in the literature, the main contribution of this technical note is the rigorous analysis of the effect of the command filter on closed-loop stability and performance, and a proof of stability based on Tikhonov's theorem. The implementation approach includes a compensated tracking error that retains the standard stability properties of backstepping approaches.

Implementation of adaptive backstepping controllers requires analytic calculation of the partial derivatives of certain stabilizing functions. It is well documented that, as the order of a nonlinear system increases, analytic calculation of these derivatives becomes prohibitive. Therefore, in practice, either alternative control approaches are used or the derivatives are neglected in the implementation. Neglecting the derivatives results in the loss of all guarantees proven by Lyapunov methods for the adaptive backstepping approach and may result in instability. This paper presents a new implementation approach for adaptive backstepping control. The main objectives are to facilitate the derivation and implementation of the adaptive backstepping approach, with performance guarantees proven by Lyapunov methods, for applications that were prohibitively difficult using the standard analytic implementation approach. The new approach uses filtering methods to produce certain command signals and their derivatives which eliminates the requirement of analytic differentiation. The approach also introduces filters to generate certain compensating signals necessary to compute compensated tracking errors suitable for adaptive parameter estimation. We present a set of Lemmas and Theorems to analyze the performance both during the initialization and the operating phases. We show that the initialization phase is of finite duration that can be controlled by selection of a design parameter. We also show that all signals within the system are bounded during this short initialization phase. During the operating phase, we show that the command filtered implementation approach has theoretical properties identical to those of the conventional approach. The general approach is presented and analyzed for systems in generalized parameter strict feedback form. Extensions of the approach are presented to demonstrate the application of the method to a land vehicle trajectory following application. Application and effectiveness of the proposed method is shown by simulation results.

Click on the title to browse this book

In this paper, a distributed optimization problem with general differentiable convex objective functions is studied for continuous-time multi-agent systems with single-integrator dynamics. The objective is for multiple agents to cooperatively optimize a team objective function formed by a sum of local objective functions with only local interaction and information while explicitly taking into account nonuniform gradient gains, finite-time convergence, and a common convex constraint set. First, a distributed nonsmooth algorithm is introduced for a special class of convex objective functions that have a quadratic-like form. It is shown that all agents reach a consensus in finite time while minimizing the team objective function asymptotically. Second, a distributed algorithm is presented for general differentiable convex objective functions, in which the interaction gains of each agent can be self-adjusted based on local states. A corresponding condition is then given to guarantee that all agents reach a consensus in finite time while minimizing the team objective function asymptotically. Third, a distributed optimization algorithm with state-dependent gradient gains is given for general differentiable convex objective functions. It is shown that the distributed continuous-time optimization problem can be solved even though the gradient gains are not identical. Fourth, a distributed tracking algorithm combined with a distributed estimation algorithm is given for general differentiable convex objective functions. It is shown that all agents reach a consensus while minimizing the team objective function in finite time. Fifth, as an extension of the previous results, a distributed constrained optimization algorithm with nonuniform gradient gains and a distributed constrained finite-time optimization algorithm are given. It is shown that both algorithms can be used to solve a distributed continuous-time optimization problem with a common convex constraint set. Numerical examples are included to illustrate the obtained theoretical results.

Due to their high fault-tolerance and scalability to large networks, consensus-based distributed algorithms have recently gained immense popularity in the sensor networks community. Large-scale camera networks are a special case. In a consensus-based state estimation framework, multiple neighboring nodes iteratively communicate with each other, exchanging their own local information about each target's state with the goal of converging to a single state estimate over the entire network. However, the state estimation problem becomes challenging when some nodes have limited observability of the state. In addition, the consensus estimate is suboptimal when the cross-covariances between the individual state estimates across different nodes are not incorporated in the distributed estimation framework. The cross-covariance is usually neglected because the computational and bandwidth requirements for its computation become unscalable for a large network. These limitations can be overcome by noting that, as the state estimates at different nodes converge, the information at each node becomes correlated. This fact can be utilized to compute the optimal estimate by proper weighting of the prior state and measurement information. Motivated by this idea, we propose information-weighted consensus algorithms for distributed maximum a posteriori parameter estimation, and their extension to the information-weighted consensus filter (ICF) for state estimation. We compare the performance of the ICF with existing consensus algorithms analytically, as well as experimentally by considering the scenario of a distributed camera network under various operating conditions.

This paper considers two cooperative control problems for nonholonomic mobile agents. In the first problem, we discuss the design of cooperative control laws such that a group of nonholonomic mobile agents cooperatively converges to some stationary point under various communication scenarios. Dynamic control laws for each agent are proposed with the aid of sigma-processes and results from graph theory. In the second problem, we discuss the design of cooperative control laws such that a group of mobile agents converges to and tracks a target point which moves along a desired trajectory under various communication scenarios. By introducing suitable variable transformations, cooperative control laws are proposed. Since communication delay is inevitable in cooperative control, in each of the above cooperative control problems, we analyze the effect of delayed communication on the proposed controllers. As applications of the proposed results, formation control of wheeled mobile robots is discussed. It is shown that our results can be successfully used to solve formation control problem. To show effectiveness of the proposed approach, simulation results are included.