Adaptive Algorithms in Finite Forms
英文摘要：
We propose a new method to design adaptation algorithms that guarantee a certain prescribed level of performance and are applicable to systems with nonconvex parameterization. The main idea behind the method is, given the desired performance characteristics and a class of nonlinearly parameterized systems, first to augment the tuning error function and design the adaptation scheme in the form of ordinary differential equations. The resulting augmentation is allowed to depend on state derivatives. To deal with these, we suggest the realization of the adaptation scheme in an algebraic-integral form. Because of the explicit dependance on the state of the original system such adaptation schemes are referred to as adaptive algorithms in it finite form instead of differential ones. Sufficient conditions for the existence of finite form realizations are proposed. These conditions lead to the necessity to find a solution of a system of partial differential equations, which in general is not an easy task. In order to resolve this problem we suggest to embed the original system dynamics into one of a higher order, thus replacing it by a simple integration of a function with respect to a single scalar argument. Several full-state feedback finite form realizations are presented and illustrated with examples.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
