In various control application areas, at least some approximate dynamic model of the physical systems under control are available. Though these models are not precise enough for serving as the exclusive basis for realizing satisfactory control, the information they convey is valuable for developing a model-based control that can be improved by either adaptive or robust modifications. The traditional model-based adaptive approaches for strongly nonlinear systems’ control use Lyapunov’s second method that normally requires full state estimation. To evade this problem an alternative solution was elaborated for digital controllers based on Stefan Banach’s Fixed Point Iteration-based approach. In contrast to the “Resolved Acceleration Rate Controllers” of mechanical systems that feedback only integrated, proportional and first time-derivatives of the observed motion, like the “Acceleration Feedback Controllers”, this method utilizes the observed second time-derivatives that makes its original version noise-sensitive, especially if the observed noisy signals are numerically differentiated. To reduce this effect at first the “continuous version” of the originally discrete method is introduced then it is numerically investigated by the use of subsequent drastic signal smoother in the control of a drastically nonlinear system. As a result, the relevant application area of this improved method can be outlined.
Model-based controllers suffer from the effects of modeling imprecisions. The analytical form of the available model often contains only approximate parameters and can be physically incomplete. The consequences of these effects can be compensated by adaptive techniques and by the improvement of the available model. Lyapunov function-based classic methods, which assume exact analytical model forms, guarantee asymptotic stability by cautious and slow parameter tuning. Fixed point iteration-based adaptive controllers can work without the exact model form but immediately yield precise trajectory tracking. They neither identify nor improve the parameters of the available model. However, any amendment of the model can improve the controller’s operation by affecting its range and speed of convergence. It is shown that even very primitive, fast, and simple versions of evolutionary computation-based methods can produce considerable improvement in their operation. Particle swarm optimization (PSO) is an attractive, efficient, and simple tool for model improvement. In this paper, a PSO-based model approximation technique was investigated for use in the control of a three degrees of freedom PUMA-type robot arm via numerical simulations. A fixed point iteration (FPI)-based adaptive controller was used for tracking a nominal trajectory while the PSO attempted to refine the model. It was found that the refined model still had few errors, the effects of which could not be completely neglected in the model-based control. The best practical solution seems to be the application of the same adaptive control with the use of the more precise, PSO-improved model. Apart from a preliminary study, the first attempt to combine PSO with FPI is presented here.
Precise control of the flow rate of fluids stored in multiple tank systems is an important task in process industries. On this reason coupled tanks are considered popular paradigms in studies because they form strongly nonlinear systems that challenges the controller designers to develop various approaches. In this paper the application of a novel, Fixed Point Iteration (FPI)-based technique is reported to control the fluid level in a “lower tank” that is fed by the egress of an “upper” one. The control signal is the ingress rate at the upper tank. Numerical simulation results obtained by the use of simple sequential Julia code with Euler integration are presented to illustrate the efficiency of this approach.
With the exception of specially designed kinematic structures, the inverse kinematic task of redundant robots cannot be solved in “closed form”. Redundancy is often needed to make the arm “dexterous”. In general numerical techniques have to be applied. A typical approach is finding the “differential solution” by formulating the Jacobian of the problem in the first step, and using some generalized inverse that selects a definite solution of the ambiguous set of the possible ones. Each of these solutions suffers from huge joint coordinate time-derivatives in the vicinity of the kinematic singularities that are evaded by “deforming” the original task. A quasi-differential approach was recently elaborated that, though calculates the Jacobian, instead “inverting” it, applies a fixed point iteration that automatically evades the singularities. However, its solution depends on the eigenvalues of the Jacobian, and it was found not “flexible enough” for all practical purposes. The Moore-Penrose solution can be generalized as an optimization task under constraints for quite complex cost functions. The hard constraint in this approach forces the exact solution of the inverse kinematic task when it is possible. Due to it the intent of “minimizing the costs” is “overridden” in the vicinity of the singularities. In the present paper, based on the formal structure of the Receding Horizon Controllers, an alternative solution is suggested that allows flexibility for relaxing the costs and the “hard constraints”, too. Its computational complexity to some extent is reduced via evading the technique of gradient reduction. Simulation results are presented for a 7 DoF robot arm.
Receding horizon controllers are special approximations of optimal controllers in which the continuous time variable is discretized over a horizon of optimization. The cost function is defined as the sum of contributions calculated in the grid points and it is minimized under the constraint that expresses the dynamic model of the controlled system. The control force calculated only for one step of the horizon is exerted, and the next horizon is redesigned from the measured initial state to avoid the accumulation of the effects of modeling errors. In the suggested solution, the dynamic model is directly used without any gradient reduction by using a transition between the gradient descent and the Newton–Raphson methods to achieve possibly fast operation. The optimization is carried out for an "overestimated" dynamic model, and instead of using the optimized force components the optimized trajectory is adaptively tracked by an available approximate dynamic model of the controlled system. For speeding up the operation of the system, various cost functions have been considered in the past. The operation of the method is exemplified by simulations made for new cost functions and the dynamic control of a 4-degrees-of-freedom SCARA robot using the simple sequential Julia language code realizing Euler integration.
In various technical applications the local minimum of a differentiable cost function must be found under constraints that are interpreted as embedded hypersurfaces in the whole space of search. Generally Lagrange's “Reduced Gradient Method” can be applied for solving such problems in which the Lagrange multipliers associated with the individual constraint equations have important physical interpretation, therefore it is desirable to compute them. Though in special cases this algorithm can be replaced by closed form calculations via considering the “Auxiliary Function”, in other cases the algorithmic realization cannot be avoided. In this paper it is shown that via avoiding the calculation of the individual Lagrange multipliers the algorithm can be made considerably faster especially if the constraint equations are appropriately handled. Simulation investigations are presented to substantiate the suggested method.