In an increasingly connected world, the term cyber-physical networks has been coined to refer to the communication among devices that is turning smart devices into smart (cooperating) systems. The distinctive feature of such systems is that significant advantage can be obtained if its interconnected, complex nature is exploited. Several challenges arising in cyber-physical networks can be stated as optimization problems. Examples are estimation, decision, learning and control applications. In cyber-physical networks, the goal is to design algorithms, based on the exchange of information among the processors, that take advantage of the aggregated computational power. Distributed Optimization for Smart Cyber-Physical Networks provides a comprehensive overview of the most common approaches used to design distributed optimization algorithms, together with the theoretical analysis of the main schemes in their basic version. It identifies and formalizes classes of problem set-ups that arise in motivating application scenarios. For each set-up, in order to give the main tools for analysis, tailored distributed algorithms in simplified cases are reviewed. Extensions and generalizations of the basic schemes are also discussed at the end of each chapter. Distributed Optimization for Smart Cyber-Physical Networks provides the reader with an accessible overview of the current research and gives important pointers towards new developments. It is an excellent starting point for research and students unfamiliar with the topic.
The presence of uncertainty in a system description has always been a critical issue in control. The main objective of Randomized Algorithms for Analysis and Control of Uncertain Systems, with Applications (Second Edition) is to introduce the reader to the fundamentals of probabilistic methods in the analysis and design of systems subject to deterministic and stochastic uncertainty. The approach propounded by this text guarantees a reduction in the computational complexity of classical control algorithms and in the conservativeness of standard robust control techniques. The second edition has been thoroughly updated to reflect recent research and new applications with chapters on statistical learning theory, sequential methods for control and the scenario approach being completely rewritten. Features: · self-contained treatment explaining Monte Carlo and Las Vegas randomized algorithms from their genesis in the principles of probability theory to their use for system analysis; · development of a novel paradigm for (convex and nonconvex) controller synthesis in the presence of uncertainty and in the context of randomized algorithms; · comprehensive treatment of multivariate sample generation techniques, including consideration of the difficulties involved in obtaining identically and independently distributed samples; · applications of randomized algorithms in various endeavours, such as PageRank computation for the Google Web search engine, unmanned aerial vehicle design (both new in the second edition), congestion control of high-speed communications networks and stability of quantized sampled-data systems. Randomized Algorithms for Analysis and Control of Uncertain Systems (second edition) is certain to interest academic researchers and graduate control students working in probabilistic, robust or optimal control methods and control engineers dealing with system uncertainties. The present book is a very timely contribution to the literature. I have no hesitation in asserting that it will remain a widely cited reference work for many years. M. Vidyasagar
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.