We consider the tracking of geometric paths in output spaces of nonlinear systems subject to input and state constraints without pre-specified timing requirements, commonly referred to as constrained output path-following problems. Specifically, we propose a predictive control approach to constrained path-following problems with and without velocity assignments. We present sufficient convergence conditions based on terminal regions and end penalties. Furthermore, we analyze the geometric nature of constrained output path-following problems and thereby provide insight into the computation of suitable terminal control laws and terminal regions. We draw upon an example from robotics to illustrate our findings.

Many robotic applications, such as milling, gluing, or high precision measurements, require the precise following of a predefined geometric path. We investigate the real-time feasible implementation of model predictive path-following control for an industrial robot. We consider constrained output path following with and without reference speed assignment. Finally, we present the results of an implementation of the proposed model predictive path-following controller on a KUKA LWR IV robot.

The evolving concepts of pervasive computing, ubiquitous computing and ambient intelligence are increasingly influencing health care and medicine. Summarizing published research, this literature review provides an overview of recent developments and implementations of pervasive computing systems in health care. It also highlights some of the experiences reported in deployment processes.

The present paper discusses the application of the recently proposed Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) method to non-convex AC Optimal Power Flow Problems (OPF) in a distributed fashion. In contrast to the often used Alternating Direction of Multipliers Method (ADMM), ALADIN guarantees locally quadratic convergence for AC-OPF. Numerical results for 5--300 bus test cases indicate that ALADIN is able to outperform ADMM and to reduce the number of iterations by about one order of magnitude. We compare ALADIN to numerical results for ADMM documented in the literature. The improved convergence speed comes at the cost of increasing the communication effort per iteration. Therefore, we propose a variant of ALADIN that uses inexact Hessians to reduce communication. Additionally, we provide a detailed comparison of these ALADIN variants to ADMM from an algorithmic and communication perspective. Moreover, we prove that ALADIN converges locally at quadratic rate even for the relevant case of suboptimally solved local NLPs.

This paper presents an overview of the recent developments of modifier-adaptation schemes for real-time optimization of uncertain processes. These schemes have the ability to reach plant optimality upon convergence despite the presence of structural plant-model mismatch. Modifier Adaptation has its origins in the technique of Integrated System Optimization and Parameter Estimation, but differs in the definition of the modifiers and in the fact that no parameter estimation is required. This paper reviews the fundamentals of Modifier Adaptation and provides an overview of several variants and extensions. Furthermore, the paper discusses different methods for estimating the required gradients (or modifiers) from noisy measurements. We also give an overview of the application studies available in the literature. Finally, the paper briefly discusses open issues so as to promote future research in this area.