Extremum Seeking for Stefan PDE with Moving Boundary

This paper presents the design and analysis of the extremum seeking for static maps with input passed through a partial differential equation (PDE) of the diffusion type defined on a time-varying spatial domain whose boundary position is governed by an ordinary differential equation (ODE). This is the first effort to pursue an extension of extremum seeking from the heat PDE to the Stefan PDE. We compensate the average-based actuation dynamics by a controller via backstepping transformation for the moving boundary, which is utilized to transform the original coupled PDE-ODE into a target system whose exponential stability of the average equilibrium of the average system is proved. The discussion for the delay-compensated extremum seeking control of the Stefan problem is also presented and illustrated with numerical simulations.Comment: 10 pages and 10 figure

Newton Nonholonomic Source Seeking for Distance-Dependent Maps

The topics of source seeking and Newton-based extremum seeking have flourished, independently, but never combined. We present the first Newton-based source seeking algorithm. The algorithm employs forward velocity tuning, as in the very first source seeker for the unicycle, and incorporates an additional Riccati filter for inverting the Hessian inverse and feeding it into the demodulation signal. Using second-order Lie bracket averaging, we prove convergence to the source at a rate that is independent of the unknown Hessian of the map. The result is semiglobal and practical, for a map that is quadratic in the distance from the source. The paper presents a theory and simulations, which show advantage of the Newton-based over the gradient-based source seeking

Dither-less extremum seeking for hydrogen minimization in PEM fuel cells

This paper presents a nonsmooth adaptive extremum seeker that minimizes the hydrogen consumption in a fuel-cell system. The extremum seeker operates by estimating the gradient of the objective function but, unlike other seekers, it does not require a dither signal to produce such estimate. The absence of a dither signal simplifies the choice of parameter values for the seeker, and more importantly, it allows it to converge to the optimal value exactly, not only to a small neighborhood. The proper functioning of the proposed scheme is proved using nonsmooth Lyapunov analysis. The strategy is tested on the input-output map of a real polymer electrolyte fuel cell.The research of C. Kunusch has been supported by the Seventh Framework Programme of the European Community through the Marie Curie actions (GA: PCIG09-GA-2011-293876), the Puma-Mind project (GA: FCH-JU-2011-1-303419), the CICYT project DPI2011-25649 (MINECO-Spain), the CSIC MACPERCON project (201250E027) and the CSIC JAE-DOC Research Programme.Peer Reviewe

CONTROL AND ESTIMATION ALGORITHMS FOR MULTIPLE-AGENT SYSTEMS

Tese arquivada ao abrigo da Portaria nº 227/2017 de 25 de julhoIn this thesis we study crucial problems within complex, large scale, networked control systems and mobile sensor networks. The ¯rst one is the problem of decomposition of a large-scale system into several interconnected subsystems, based on the imposed information structure constraints. After associating an intelligent agent with each subsystem, we face with a problem of formulating their local estimation and control laws and designing inter-agent communication strategies which ensure stability, desired performance, scalability and robustness of the overall system. Another problem addressed in this thesis, which is critical in mobile sensor networks paradigm, is the problem of searching positions for mobile nodes in order to achieve optimal overall sensing capabilities. Novel, overlapping decentralized state and parameter estimation schemes based on the consensus strategy have been proposed, in both continuous-time and discrete-time. The algorithms are proposed in the form of a multi-agent network based on a combination of local estimators and a dynamic consensus strategy, assuming possible intermittent observations and communication faults. Under general conditions concerning the agent resources and the network topology, conditions are derived for the stability and convergence of the algorithms. For the state estimation schemes, a strategy based on minimization of the steady-state mean-square estimation error is proposed for selection of the consensus gains; these gains can also be adjusted by local adaptation schemes. It is also demonstrated that there exists a connection between the network complexity and e±ciency of denoising, i.e., of suppression of the measurement noise in°uence. Several numerical examples serve to illustrate characteristic properties of the proposed algorithm and to demonstrate its applicability to real problems. Furthermore, several structures and algorithms for multi-agent control based on a dynamic consensus strategy have been proposed. Two novel classes of structured, overlapping decentralized control algorithms are presented. For the ¯rst class, an agreement between the agents is implemented at the level of control inputs, while the second class is based on the agreement at the state estimation level. The proposed control algorithms have been illustrated by several examples. Also, the second class of the proposed consensus based control scheme has been applied to decentralized overlapping tracking control of planar formations of UAVs. A comparison is given with the proposed novel design methodology based on the expansion/contraction paradigm and the inclusion principle. Motivated by the applications to the optimal mobile sensor positioning within mobile sensor networks, the perturbation-based extremum seeking algorithm has been modifed and extended. It has been assumed that the integrator gain and the perturbation amplitude are time varying (decreasing in time with a proper rate) and that the output is corrupted with measurement noise. The proposed basic, one dimensional, algorithm has been extended to two dimensional, hybrid schemes and directly applied to the planar optimal mobile sensor positioning, where the vehicles can be modeled as velocity actuated point masses, force actuated point masses, or nonholonomic unicycles. The convergence of all the proposed algorithms, with probability one and in the mean square sense, has been proved. Also, the problem of target assignment in multi-agent systems using multi-variable extremum seeking algorithm has been addressed. An algorithm which e®ectively solves the problem has been proposed, based on the local extremum seeking of the specially designed global utility functions which capture the dependance among di®erent, possibly con°icting objectives of the agents. It has been demonstrated how the utility function parameters and agents' initial conditions impact the trajectories and destinations of the agents. All the proposed extremum seeking based algorithms have been illustrated with several simulations

Neural Networks for Modeling and Control of Particle Accelerators

We describe some of the challenges of particle accelerator control, highlight recent advances in neural network techniques, discuss some promising avenues for incorporating neural networks into particle accelerator control systems, and describe a neural network-based control system that is being developed for resonance control of an RF electron gun at the Fermilab Accelerator Science and Technology (FAST) facility, including initial experimental results from a benchmark controller.Comment: 21 p

Distributed Algorithms for Stochastic Source Seeking With Mobile Robot Networks

Autonomous robot networks are an effective tool for monitoring large-scale environmental fields. This paper proposes distributed control strategies for localizing the source of a noisy signal, which could represent a physical quantity of interest such as magnetic force, heat, radio signal, or chemical concentration. We develop algorithms specific to two scenarios: one in which the sensors have a precise model of the signal formation process and one in which a signal model is not available. In the model-free scenario, a team of sensors is used to follow a stochastic gradient of the signal field. Our approach is distributed, robust to deformations in the group geometry, does not necessitate global localization, and is guaranteed to lead the sensors to a neighborhood of a local maximum of the field. In the model-based scenario, the sensors follow a stochastic gradient of the mutual information (MI) between their expected measurements and the expected source location in a distributed manner. The performance is demonstrated in simulation using a robot sensor network to localize the source of a wireless radio signal

Robust Hybrid Systems for Control, Learning, and Optimization in Networked Dynamical Systems

The deployment of advanced real-time control and optimization strategies in socially-integratedengineering systems could significantly improve our quality of life whilecreating jobs and economic opportunity. However, in cyber-physical systems such assmart grids, transportation networks, healthcare, and robotic systems, there still existseveral challenges that prevent the implementation of intelligent control strategies.These challenges include the existence of limited communication networks, dynamicand stochastic environments, multiple decision makers interacting with the system,and complex hybrid dynamics emerging from the feedback interconnection of physicalprocesses and computational devices.In this dissertation, we study the problem of designing robust control and optimizationalgorithms for cyber-physical systems using the framework of hybrid dynamicalsystems. We propose different theoretical frameworks for the design and analysis offeedback mechanisms that optimize the performance of dynamical systems without requiringan explicit characterization of their mathematical model, i.e., in a model-freeway. The closed-loop system that emerges of the interconnection of the plant with thefeedback mechanism describes, in general, a set-valued hybrid dynamical system. Thesetypes of systems combine continuous-time and discrete-time dynamics, and they usuallylack the uniqueness of solutions property. The framework of set-valued hybriddynamical systems allows us to study many complex dynamical systems that emerge indifferent engineering applications, such as networked multi-agent systems with switching graphs, non-smooth mechanical systems, dynamic pricing mechanisms in transportationsystems, autonomous robots with logic-based controllers, etc. We proposea step-by-step approach to the design of different types of discrete-time, continuous-time,hybrid, and stochastic controllers for different types of applications, extendingand generalizing different results in the literature in the area of extremum seeking control,sampled-data extremization, robust synchronization, and stochastic learning innetworked systems. Our theoretical results are illustrated via different simulations andnumerical examples

Model-Guided Data-Driven Optimization and Control for Internal Combustion Engine Systems

The incorporation of electronic components into modern Internal Combustion, IC, engine systems have facilitated the reduction of fuel consumption and emission from IC engine operations. As more mechanical functions are being replaced by electric or electronic devices, the IC engine systems are becoming more complex in structure. Sophisticated control strategies are called in to help the engine systems meet the drivability demands and to comply with the emission regulations. Different model-based or data-driven algorithms have been applied to the optimization and control of IC engine systems. For the conventional model-based algorithms, the accuracy of the applied system models has a crucial impact on the quality of the feedback system performance. With computable analytic solutions and a good estimation of the real physical processes, the model-based control embedded systems are able to achieve good transient performances. However, the analytic solutions of some nonlinear models are difficult to obtain. Even if the solutions are available, because of the presence of unavoidable modeling uncertainties, the model-based controllers are designed conservatively