In the study of multi-agent systems (MASs), cooperative control is one of the most fundamental issues. As it covers a broad spectrum of applications in many industrial areas, there is a desire to design cooperative control protocols for different system and network setups. Motivated by this fact, in this thesis we focus on elaborating consensus protocol design, via model predictive control (MPC), under two different scenarios: (1) general constrained linear MASs with bounded additive disturbance; (2) linear MASs with input constraints underlying distributed communication networks. In Chapter 2, a tube-based robust MPC consensus protocol for constrained linear MASs is proposed. For undisturbed linear MASs without constraints, the results on designing a centralized linear consensus protocol are first developed by a suboptimal linear quadratic approach. In order to evaluate the control performance of the suboptimal consensus protocol, we use an infinite horizon linear quadratic objective function to penalize the disagreement among agents and the size of control inputs. Due to the non-convexity of the performance function, an optimal controller gain is difficult or even impossible to find, thus a suboptimal consensus protocol is derived. In the presence of disturbance, the original MASs may not maintain certain properties such as stability and cooperative performance. To this end, a tube-based robust MPC framework is introduced. When disturbance is involved, the original constraints in nominal prediction should be tightened so as to achieve robust constraint satisfaction, as the predicted states and the actual states are not necessarily the same. Moreover, the corresponding robust constraint sets can be determined offline, requiring no extra iterative online computation in implementation. In Chapter 3, a novel distributed MPC-based consensus protocol is proposed for general linear MASs with input constraints. For the linear MAS without constraints, a pre-stabilizing distributed linear consensus protocol is developed by an inverse optimal approach, such that the corresponding closed-loop system is asymptotically stable with respect to a consensus set. Implementing this pre-stabilizing controller in a distributed digital setting is however not possible, as it requires every local decision maker to continuously access the state of their neighbors simultaneously when updating the control input. To relax these requirements, the assumed neighboring state, instead of the actual state of neighbors, is used. In our distributed MPC scheme, each local controller minimizes a group of control variables to generate control input. Moreover, an additional state constraint is proposed to bound deviation between the actual and the assumed state. In this way, consistency is enforced between intended behaviors of an agent and what its neighbors believe it will behave. We later show that the closed-loop system converges to a neighboring set of the consensus set thanks to the bounded state deviation in prediction. In Chapter 4, conclusions are made and some research topics for future exploring are presented. / Graduate / 2021-03-31

This thesis focuses on the development and extension of nonlinear evolutionary model predictive control (NEMPC), a control algorithm previously developed by Phil Hyatt of the BYU RaD Lab. While this controller and its variants are applicable to any high degree-of-freedom (DoF) robotic system, particular emphasis is given in this thesis to control of a soft robot continuum joint. First, speed improvements are presented for NEMPC. Second, a Python package is presented as a companion to NEMPC, as a method of establishing a common interface for dynamic simulators and approximating each system by a deep neural network (DNN). Third, a method of training a DNN approximation of a hardware system that is generalize-able to more complex hardware systems is presented. This method is shown to reduce median tracking error on a soft robot hardware platform by 88%. Finally, particle swarm model predictive control (PSOMPC), a variant of NEMPC, is presented and modified to model and account for uncertainty in a dynamic system. Control performance of NEMPC and PSOMPC are presented for a set of control trials on simulated systems with uncertainty in parameters, states, and inputs, as well as on a soft robot hardware platform. PSOMPC is shown to have an increased robustness to system uncertainty, reducing expected collisions by 71% for a three-link robot arm with parameter uncertainty, input disturbances, and state measurement error.

Traditional robots, while capable of being efficient and effective for the task they were designed, are dangerous when operating in unmodeled environments or around humans. The field of soft robotics attempts to increase the safety of robots thus enabling them to operate in environments where traditional robots should not operate. Because of this, soft robots were developed with different goals in mind than traditional robots and as such the traditional metrics used to evaluate standard robots are not effective for evaluating soft robots. New metrics need to be developed for soft robots so that effective comparison and evaluations can be made. This dissertation attempts to lay the groundwork for that process through a survey on soft robot metrics. Additionally we propose six soft robot actuator metrics that can be used to evaluate and compare characteristics and performance of soft robot actuators. Data from eight different soft robot rotational actuators (five distinct designs) were used to evaluate these soft robot actuator metrics and show their utility. New models, control methods and estimation methods also need to be developed for soft robots. Many of the traditional methods and assumptions for modeling and controlling robotic systems are not able to provide the fidelity that is needed for soft robots to effectively complete useful tasks. This dissertation presents specific developments in each of these areas of soft robot metrics, modeling, control and estimation. We show several incremental improvements to soft robot dynamic models as well as how they were used in control methods for more precise control. We also demonstrate a method for linearizing high degree of freedom models so it can be simplified for use in faster control methods for better performance. Lastly, we present an improved continuum joint configuration estimation method that uses a linear combination of length measurements. All these developments combine to help build the "fundamental engineering framework" that is needed for soft robotics as well as helping to move robots out of their confined spaces and bring them into new unmodeled/unstructured environments.

Optimal control theory has a long history and broad applications. Motivated by the goal of obtaining insights through unification and taking advantage of the abundant capability to generate data, this thesis introduces some suboptimal schemes via abstract dynamic programming models. As our first contribution, we consider deterministic infinite horizon optimal control problems with nonnegative stage costs. We draw inspiration from the learning model predictive control scheme designed for continuous dynamics and iterative tasks, and propose a rollout algorithm that relies on sampled data generated by some base policy. The proposed algorithm is based on value and policy iteration ideas. It applies to deterministic problems with arbitrary state and control spaces, and arbitrary dynamics. It admits extensions to problems with trajectory constraints, and a multiagent structure. In addition, abstract dynamic programming models are used to analyze $\lambda$-policy iteration with randomization algorithms. In particular, we consider contractive models with infinite policies. We show that well-posedness of the $\lambda$-operator plays a central role in the algorithm. The operator is known to be well-posed for problems with finite states, but our analysis shows that it is also well-defined for the contractive models with infinite states. Similarly, the algorithm we analyze is known to converge for problems with finite policies, but we identify the conditions required to guarantee convergence with probability one when the policy space is infinite regardless of the number of states. Guided by the analysis, we exemplify a data-driven approximated implementation of the algorithm for estimation of optimal costs of constrained linear and nonlinear control problems. Numerical results indicate the potentials of this method in practice. / Teorin om optimal reglering har en lång historia och breda tillämpningsområden.I denna avhandling, som motiveras av att få insikter genom att förena och dra nyttaav den goda möjligheten att generera data, introduceras några suboptimala systemvia abstrakta modeller för dynamisk programmering.I vårt första bidrag betraktar vi ett deterministiskt optimalt regleringsproblemmed oändlig horisont och icke-negativa stegkostnader. Vi hämtar inspiration frånmodellprediktiv reglering med inlärning, som är utformad för system med kontinuerligdynamik och iterativa uppgifter, och föreslår en utrullningsalgoritm som bygger påsamplade data som genereras av en viss baspolicy. Den föreslagna algoritmen byggerpå idéer om värde- och policyiteration. Den är tillämpningsbar för deterministiskaproblem med godtyckliga tillstånds- och kontrollrum samt för system med godtyckligdynamik. Slutligen kan den utvidgas till problem med trajektoriebegränsningar ochen struktur med flera agenter.Dessutom används abstrakta modeller för dynamisk programmering för attanalysera lambdapolicyiteration med randomiseringsalgoritmer. Vi betraktar merspecifikt kontraktiva modeller med oändliga strategier. Vi visar att lambdaoperatorns välbestämdhet spelar en central roll i algoritmen. Det är känt att operatorn ärväldefinierad för problem med ändliga tillstånd, men vår analys visar att den ocksåär väldefinierad för de studerade kontraktiva modellerna med oändliga tillstånd.På samma sätt är det känt att den algoritm vi analyserar konvergerar för problemmed ändliga strategier, men vi identifierar de villkor som krävs för att garanterakonvergens med sannolikhet ett när policyrummet är oändligt, oberoende av antalettillstånd. Med hjälp av analysen exemplifierar vi en datadriven approximativ implementering av algoritmen för uppskattning av optimala kostnader för begränsadelinjära och icke-linjära regleringsproblem. Numeriska resultat visar på potentialen iatt använda denna metod i praktiken. / <p>QC 20211129</p>

Synchronizing hand and foot movements under reactive versus predictive control results in differential timing structures between the responses. Under reactive control, where the movement is externally triggered, the electromyographic (EMG) responses are synchronized, resulting in the hand displacement preceding the foot. Under predictive control, where the movement is self-paced, the motor commands are organized such that the displacement onset occurs relatively synchronously, requiring the EMG onset of the foot to precede that of the hand. The current study used a startling acoustic stimulus (SAS), which is known to involuntarily trigger a prepared response, to investigate whether these results are due to differences in the pre-programmed timing initiation structure of the responses. Participants (n=17) performed isolated and synchronous movements of the right heel and right hand under both reactive and predictive modes of control. The reactive condition involved a simple reaction time (RT) task where participants performed the required movement in response to a visual go-signal. The predictive condition involved an anticipation-timing task where participants initiated the required movement coincidently with a sweeping clock hand reaching a target. On a subset of trials, a SAS (114 dB) was presented 150 ms prior to the imperative stimulus. Results from the SAS trials revealed that while the differential timing structures between the responses was maintained under both reactive and predictive control, the EMG onset asynchrony under predictive control was significantly smaller following the SAS. Additionally, there was no difference in the effect of the SAS when the movements were performed in isolation versus synchronously. Together, these results suggest that the timing between the responses, which differs between the two control modes, is pre-programmed; however, under predictive control, an increase in cortical activation from the SAS may have shortened the between-limb delay.

No description available.

Collision avoidance is an essential capability for autonomous and assisted-driving ground vehicles. In this work, we developed a novel model predictive control based intelligent collision avoidance (CA) algorithm for a multi-trailer industrial ground vehicle implemented on a General Purpose Graphical Processing Unit (GPGPU). The CA problem is formulated as a multi-objective optimal control problem and solved using a limited look-ahead control scheme in real-time. Through hardware-in-the-loop-simulations and experimental results obtained in this work, we have demonstrated that the proposed algorithm, using NVIDA’s CUDA framework and the NVIDIA Jetson TX2 development platform, is capable of dynamically assisting drivers and maintaining the vehicle a safe distance from the detected obstacles on-thely. We have demonstrated that a GPGPU, paired with an appropriate algorithm, can be the key enabler in relieving the computational burden that is commonly associated with model-based control problems and thus make them suitable for real-time applications.

Telerobotics are becoming increasingly more prevalent in the medical field due to the many advantages they have over standard methods. In particular, their use in surgical procedures provides benefits such as safer operations and greater health care access, among others. However, there are drawbacks that dissuade telerobotic usage and aspects that can still be improved upon. Examples of these include the inevitable impact of time delay and the existence of disturbances, such as patient-manipulator contact. These factors can result in system destabilization and ultimately task failure, discouraging the usage of telerobotics in these settings. This thesis investigates the effects of time delay and contact disturbances on telerobotic performance in a surgical setting. In this work, different methods of improving telerobotic performance such as using hybrid controllers and predictive technology are explored. The goal is to investigate options for mitigating the negative effects of these elements while improving overall telerobotic performance.

A research report submitted in partial fulfillment of the requirements for the degree of Master of Science in School of Computer Science and Applied Mathematics to the Faculty of Science University of Witwatersrand, 2019 / Learning-based methods have recently become popular in control engineering, achieving good performance on a number of challenging tasks. However, in complex environments where data efficiency and safety are critical, current methods remain unsatisfactory. As a step toward addressing these shortcomings, we propose a learning-based approach that combines Gaussian process regression with model predictive control. Using sparse spectrum Gaussian processes, we extend previous work by learning a model of the dynamics incrementally from a stream ofsensory data. Utilizinglearned dynamics and model uncertainty, we develop a controller that can learn and plan in real-time under non-linear constraints. We test our approach on pendulum and cartpole swing up problems and demonstrate the benefits of learning on a challenging autonomous racing task. Additionally, we show that learned dynamics models can be transferred to new tasks without any additional training. / TL (2020)

This thesis investigates one option for improving the control of a reheating furnace used in heating steel slabs before hot rolling; an essential part of the steel manufacturing process. The furnace consumes a significant amount of energy, leading to high cost and high carbon dioxide emissions. The proposed solution is the implementation of a model predictive control (MPC) system to improve control and reduce fuel usage. The MPC system will be based on the use of system identification techniques to find a prediction model of the furnace, specifically using ARMAX models. An additional simulation model will be used to simulate the system, and to compare the performance of MPC and PID. The prediction model is found to have a normalized root mean squared error of over 91% for the first five minutes, suggesting that it has potential to be used for MPC. The simulation model has significant inaccuracies, due to the presence of unmeasured disturbances. The simulation results, although limited due to the inaccuracies of the simulation model, suggest that MPC is a viable option for improved control of the furnace. The use of MPC can potentially improve the repeatability of the heating process, resulting in improved steel quality and reduced defects. This thesis suggests that further investigation into the use of MPC for controlling reheating furnaces in the steel industry is worth pursuing, and could potentially bring significant benefits to both producers and the environment.