Yinyan Zhang – författare

This book discusses methods and algorithms for the near-optimal adaptive control of nonlinear systems, including the corresponding theoretical analysis and simulative examples, and presents two innovative methods for the redundancy resolution of redundant manipulators with consideration of parameter uncertainty and periodic disturbances.

It also reports on a series of systematic investigations on a near-optimal adaptive control method based on the Taylor expansion, neural networks, estimator design approaches, and the idea of sliding mode control, focusing on the tracking control problem of nonlinear systems under different scenarios. The book culminates with a presentation of two new redundancy resolution methods; one addresses adaptive kinematic control of redundant manipulators, and the other centers on the effect of periodic input disturbance on redundancy resolution.

Each self-contained chapter is clearly written, making the book accessible to graduate students as well as academic and industrial researchers in the fields of adaptive and optimal control, robotics, and dynamic neural networks.

This is the first book to focus on solving cooperative control problems of multiple robot arms using different centralized or distributed neural network models, presenting methods and algorithms together with the corresponding theoretical analysis and simulated examples. It is intended for graduate students and academic and industrial researchers in the field of control, robotics, neural networks, simulation and modelling.

In this book, we present our systematic investigations into consensus in multi-agent systems. We show the design and analysis of various types of consensus protocols from a multi-agent perspective with a focus on min-consensus and its variants. We also discuss second-order and high-order min-consensus. A very interesting topic regarding the link between consensus and path planning is also included. We show that a biased min-consensus protocol can lead to the path planning phenomenon, which means that the complexity of shortest path planning can emerge from a perturbed version of min-consensus protocol, which as a case study may encourage researchers in the field of distributed control to rethink the nature of complexity and the distance between control and intelligence. We also illustrate the design and analysis of consensus protocols for nonlinear multi-agent systems derived from an optimal control formulation, which do not require solving a Hamilton-Jacobi-Bellman (HJB) equation.

The book was written in a self-contained format. For each consensus protocol, the performance is verified through simulative examples and analyzed via mathematical derivations, using tools like graph theory and modern control theory. The book’s goal is to provide not only theoretical contributions but also explore underlying intuitions from a methodological perspective.