Legged locomotion has several interesting challenges that need to be addressed, such as the ability of dynamically walk over rough terrain like stairs or stepping stones, as well as the ability to adapt to unexpected changes in the environment and the dynamic model of the robot. This thesis is driven towards solving these challenges and makes contributions on theoretical and experimental aspects to address: dynamic walking, model uncertainty, and rough terrain. On the theoretical front, we introduce and develop a unified robust and adaptive control framework that enables the ability to enforce stability and safety-critical constraints arising from robotic motion tasks under a high level of model uncertainty. We also present a novel method of walking gait optimization and gait library to address the challenge of dynamic robotic walking over stochastically generated stepping stones with significant variations in step length and step height, and where the robot has knowledge about the location of the next discrete foothold only one step ahead. On the experimental front, our proposed methods are successfully validated on ATRIAS, an underactuated, human-scale bipedal robot. In particular, experimental demonstrations illustrate our controller being able to dynamically walk at 0.6 m/s over terrain with step length variation of 23 to 78 cm, as well as simultaneous variation in step length and step height of 35 to 60cm and -22 to 22cm respectively. In addition to that, we also successfully implemented our proposed adaptive controller on the robot, which enables the ability to carry an unknown load up to 68 lb (31 kg) while maintaining very small tracking errors of about 0.01 deg (0.0017 rad) at all joints. To be more specific, we firstly develop robust control Lyapunov function based quadratic program (CLFQP) controller and L1 adaptive control to handle model uncertainty for bipedal robots. An application is dynamic walking while carrying an unknown load. The robust CLF-QP controller can guarantee robustness via a quadratic program that can be extended further to achieve robust safety-critical control. The L1 adaptive control can estimate and adapt to the presence of model uncertainty in the system dynamics. We then present a novel methodology to achieve dynamic walking for underactuated and hybrid dynamcal bipedal robots subject to safety-critical constraints. The proposed controller is based on the combination of control Barrier functions (CBFs) and control Lyapunov functions (CLFs) implemented as a state-based online quadratic program to achieve stability under input and state constraints. The main contribution of this work is the control design to enable stable dynamical bipedal walking subject to strict safety constraints that arise due to walking over a terrain with randomly generated discrete footholds. We next introduce Exponential Control Barrier Functions (ECBFs) as means to enforce high relativedegree safety constraints for nonlinear systems. We also develop a systematic design method that enables creating the Exponential CBFs for nonlinear systems making use of tools from linear control theory. Our method creates a smooth boundary for the safety set via an exponential function, therefore is called Exponential CBFs. Similar to exponential stability and linear control, the exponential boundary of our proposed method helps to have smoother control inputs and guarantee the robustness under model uncertainty. The proposed control design is numerically validated on a relative degree 4 nonlinear system (the two-link pendulum with elastic actuators and experimentally validated on a relative degree 6 linear system (the serial cart-spring system). Thanks to these advantages of Exponential CBFs, we then can apply the method to the problem of 3D dynamic walking with varied step length and step width as well as dynamic walking on time-varying stepping stones. For the work of using CBF for stepping stones, we use only one nominal walking gait. Therefore the range of step length variation is limited ([25 : 60](cm)). In order to improve the performance, we incorporate CBF with gait library and increase the step length range significantly ([10 : 100](cm)). While handling physical constraints and step transition via CBFs appears to work well, these constraints often become active at step switching. In order to resolve this issue, we introduce the approach of 2-step periodic walking. This method not only gives better step transitions but also offers a solution for the problem of changing both step length and step height. Experimental validation on the real robot was also successful for the problem of dynamic walking on stepping stones with step lengths varied within [23 : 78](cm) and average walking speed of 0:6(m=s). In order to address the problems of robust control and safety-critical control in a unified control framework, we present a novel method of optimal robust control through a quadratic program that offers tracking stability while subject to input and state-based constraints as well as safety-critical constraints for nonlinear dynamical robotic systems under significant model uncertainty. The proposed method formulates robust control Lyapunov and barrier functions to provide guarantees of stability and safety in the presence of model uncertainty. We evaluate our proposed control design on different applications ranging from a single-link pendulum to dynamic walking of bipedal robot subject to contact force constraints as well as safety-critical precise foot placements on stepping stones, all while subject to significant model uncertainty. We conduct preliminary experimental validation of the proposed controller on a rectilinear spring-cart system under different types of model uncertainty and perturbations. To solve this problem, we also present another solution of adaptive CBF-CLF controller, that enables the ability to adapt to the effect of model uncertainty to maintain both stability and safety. In comparison with the robust CBF-CLF controller, this method not only can handle a higher level of model uncertainty but is also less aggressive if there is no model uncertainty presented in the system.

Monitoring the dynamics of the productivity of ocean water and how it affects fisheries is essential for management. It requires data on proper spatial/temporal scales, which can be provided by operational ocean colour satellites. However, accurate productivity data from ocean colour imagery is only possible with proper validation of, for instance, the atmospheric correction applied to the images. In situ water reflectance data is of great value due to the requirements for validation and it is traditionally measured with the Surface Acquisition System (SAS) solar tracker system. Recently, an application, 'HydroColor', was developed for mobile devices to acquire water reflectance data. We examine the accuracy of the water reflectance acquired by HydroColor with the help of trained and untrained citizens under different environmental conditions. We used water reflectance data acquired by SAS solar tracker and HydroColor onboard the BC ferry Queen of Oak Bay from July to September 2016. Monte Carlo permutation F-tests were used to assess whether the differences between measurements collected by SAS solar tracker and HydroColor with citizens were significant. Results showed that the HydroColor measurements collected by 447 citizens were accurate in red, green, and blue bands, as well as red/green and red/blue ratios under different environmental conditions. Piecewise models were developed for correcting HydroColor blue/green water reflectance ratios based on the SAS solar tracker measurements. In addition, we found that training and environmental conditions had impacts on the data quality. A trained citizen obtained higher quality HydroColor data especially under clear skies at noon run (12:50-2:30 pm). / Graduate

Variable Horizon Model Predictive Control (VH-MPC) is a form of predictive control that includes the horizon length as a decision variable in the constrained optimisation problem solved at each iteration. It has been recently applied to completion problems, where the system state is to be steered to a closed set in finite time. The behaviour of the system once completion has occurred is not considered part of the control problem. This thesis is concerned with three aspects of robustness and optimality in VH-MPC completion problems. In particular, the thesis investigates robustness to well defined but unpredictable changes in system and controller parameters, robustness to bounded disturbances in the presence of certain input parameterisations to reduce computational complexity, and optimal robustness to bounded disturbances using tightened constraints. In the context of linear time invariant systems, new theoretical contributions and algorithms are developed. Firstly, changing dynamics, constraints and control objectives are addressed by introducing the notion of feasible contingencies. A novel algorithm is proposed that introduces extra prediction variables to ensure that anticipated new control objectives are always feasible, under changed system parameters. In addition, a modified constraint tightening formulation is introduced to provide robust completion in the presence of bounded disturbances. Different contingency scenarios are presented and numerical simulations demonstrate the formulation’s efficacy. Next, complexity reduction is considered, using a form of input parameterisation known as move blocking. After introducing a new notation for move blocking, algorithms are presented for designing a move-blocked VH-MPC controller. Constraints are tightened in a novel way for robustness, whilst ensuring that guarantees of recursive feasibility and finite-time completion are preserved. Simulations are used to illustrate the effect of an example blocking scheme on computation time, closed-loop cost, control inputs and state trajectories. Attention is now turned towards mitigating the effect of constraint tightening policies on a VH-MPC controller’s region of attraction. An optimisation problem is formulated to maximise the volume of an inner approximation to the region of attraction, parameterised in terms of the tightening policy. Alternative heuristic approaches are also proposed to deal with high state dimensions. Numerical examples show that the new technique produces substantially improved regions of attraction in comparison to other proposed approaches, and greatly reduces the maximum required prediction horizon length for a given application. Finally, a case study is presented to illustrate the application of the new theory developed in this thesis to a non-trivial example system. A simplified nonlinear surface excavation machine and material model is developed for this purpose. The model is stabilised with an inner-loop controller, following which a VH-MPC controller for autonomous trajectory generation is designed using a discretised, linearised model of the stabilised system. Realistic simulated trajectories are obtained from applying the controller to the stabilised system and incorporating the ideas developed in this thesis. These ideas improve the applicability and computational tractability of VH-MPC, for both traditional applications as well as those that go beyond the realm of vehicle manœuvring.

The central theme of the thesis is to study linear and non linear SVM formulations in the presence of uncertain observations. The main contribution of this thesis is to derive robust classfiers from partial knowledge of the underlying uncertainty. In the case of linear classification, a new bounding scheme based on Bernstein inequality has been proposed, which models interval-valued uncertainty in a less conservative fashion and hence is expected to generalize better than the existing methods. Next, potential of partial information such as bounds on second order moments along with support information has been explored. Bounds on second order moments make the resulting classifiers robust to moment estimation errors. Uncertainty in the dataset will lead to uncertainty in the kernel matrices. A novel distribution free large deviation inequality has been proposed which handles uncertainty in kernels through co-positive programming in a chance constraint setting. Although such formulations are NP hard, under several cases of interest the problem reduces to a convex program. However, the independence assumption mentioned above, is restrictive and may not always define a valid uncertain kernel. To alleviate this problem an affine set based alternative is proposed and using a robust optimization framework the resultant problem is posed as a minimax problem. In both the cases of Chance Constraint Program or Robust Optimization (for non-linear SVM), mirror descent algorithm (MDA) like procedures have been applied.

This thesis proposes and verifies a number of optimization models for re-designing a master surgery schedule with minimized peak inpatient load at the ward. All models include limitations on Operating Rooms and surgeons availability. Surgeons` preference is included with regards to a consistent weekly schedule over a cycle. The uncertain in patients` length of stay was incorporated using discrete probability distributions unique to each surgeon. Furthermore, robust optimization was utilized to protect against the uncertainty in the number of inpatients a surgeon may send to the ward per block. Different scenarios were developed that explore the impact of varying the availability of operating rooms on each day of the week. The models were solved using Cplex and were verified by an Arena simulation model.

Orientador: Ricardo Coração de Leão Fontoura de Oliveira / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-26T15:54:55Z (GMT). No. of bitstreams: 1 Vieira_HenriquedeSouza_M.pdf: 1027517 bytes, checksum: 9dcae7f42b15c7b6a4659c57bea547f7 (MD5) Previous issue date: 2015 / Resumo: Os problemas de estabilização e controle H? robustos por realimentação de estados para sistemas lineares incertos em domínios politópicos são investigados nesta dissertação. São propostas novas técnicas de síntese baseadas em condições LMIs com busca em escalares, abordando de maneira unificada sistemas contínuos e discretos no tempo. A principal novidade da técnica proposta é o uso efetivo de matrizes de Lyapunov polinomiais de grau arbitrário para certificar a estabilidade robusta do sistema em malha fechada. A segunda vantagem da abordagem proposta é que as melhores condições de síntese por realimentação de estados atualmente disponíveis na literatura podem ser reproduzidas por meio de escolhas particulares dos parâmetros escalares. Para o problema de controle H? também é proposto um procedimento iterativo como alternativa à busca dos escalares. Experimentos numéricos ilustram o potencial e a eficácia da técnica proposta / Abstract: The problems of robust stabilization and H? control by state-feedback for uncertain linear systems in polytopic domains are investigated in this dissertation. New synthesis techniques based on LMI conditions with scalar searches, addressing in a unified way continuous and discrete-time systems, are proposed. The main novelty of the proposed method is the effective use of polynomial Lyapunov matrices of arbitrary degree to certify the robust stability of the closed-loop system. The second advantage of the proposed approach is that the best currently available state-feedback synthesis conditions in the literature can be reproduced by particular choices of the scalars. Regarding the H? control problem, an iterative procedure is also proposed as an alternative to the scalar searches. Numerical experiments illustrate the potential and efficacy of the proposed methods / Mestrado / Automação / Mestre em Engenharia Elétrica

As machine learning becomes an increasingly relevant field being incorporated into everyday life, so does the need for consistently high performing models. With these high expectations, along with potentially restrictive data sets, it is crucial to be able to use techniques for machine learning that increase the likelihood of success. Robust Principal Component Analysis (RPCA) not only extracts anomalous data, but also finds correlations among the given features in a data set, in which these correlations can themselves be used as features. By taking a novel approach to utilizing the output from RPCA, we address how our method effects the performance of such models. We take into account the efficiency of our approach, and use projectors to enable our method to have a 99.79% faster run time. We apply our method primarily to cyber security data sets, though we also investigate the effects on data sets from other fields (e.g. medical).

This diploma thesis is concerned in static pictures Security problems. That means, additional informations (watermark) are embedded to the original picture in a specific way. This complex picture structure (watermark) should be unremoval by different attacks runing processes. The main goal of this diploma thesis is realize two separated methods digital data watermarking in MATLAB program. For reason of a quite large scale of different watermarking methods are chosen at this time only two of take were choosen. First of the methods is Watermark injection in the spatial domain and the second in the freuquency domain. Both methods are set up in a special way and finish goals of the process. Expected result are, that digital picture user doesn't know about the watermarking technique was aplied on this picture and the watermarking data are the most resistant as possible as can be. These attacks were simulated in Checkmark program.

This work is focused on robust control theory especially on methods H and analysis (structured singular value). The first part of the thesis contains theoreticle background to uncertainty modeling, to robust controller designs and to permanent magnet synchronous machine modeling. The second part presents concrette robust controller design which is tested in simulations and validated on a real motor. The influence of parameter changes on stability of closed loop system is discussed and description of obtained results is given in conclusions.

<div>This thesis is concerned with massive data analysis via robust A-optimally efficient non-uniform subsampling. Motivated by the fact that massive data often contain outliers and that uniform sampling is not efficient, we give numerous sampling distributions by minimizing the sum of the component variances of the subsampling estimate. And these sampling distributions are robust against outliers. Massive data pose two computational bottlenecks. Namely, data exceed a computer’s storage space, and computation requires too long waiting time. The two bottle necks can be simultaneously addressed by selecting a subsample as a surrogate for the full sample and completing the data analysis. We develop our theory in a typical setting for robust linear regression in which the estimating functions are not differentiable. For an arbitrary sampling distribution, we establish consistency for the subsampling estimate for both fixed and growing dimension( as high dimensionality is common in massive data). We prove asymptotic normality for fixed dimension. We discuss the A-optimal scoring method for fast computing. We conduct large simulations to evaluate the numerical performance of our proposed A-optimal sampling distribution. Real data applications are also performed.</div>