We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This tutorial guide introduces online nonstochastic control, an emerging paradigm in control of dynamical systems and differentiable reinforcement learning that applies techniques from online convex optimization and convex relaxations to obtain new methods with provable guarantees for classical settings in optimal and robust control. In optimal control, robust control, and other control methodologies that assume stochastic noise, the goal is to perform comparably to an offline optimal strategy. In online control, both cost functions and perturbations from the assumed dynamical model are chosen by an adversary. Thus, the optimal policy is not defined a priori and the goal is to attain low regret against the best policy in hindsight from a benchmark class of policies. The resulting methods are based on iterative mathematical optimization algorithms and are accompanied by finite-time regret and computational complexity guarantees. This book is ideal for graduate students and researchers interested in bridging classical control theory and modern machine learning.
With an emphasis on timeless essential mathematical background for optimization, this textbook provides a comprehensive and accessible introduction to convex optimization for students in applied mathematics, computer science, and engineering. Authored by two influential researchers, the book covers both convex analysis basics and modern topics such as conic programming, conic representations of convex sets, and cone-constrained convex problems, providing readers with a solid, up-to-date understanding of the field. By excluding modeling and algorithms, the authors are able to discuss the theoretical aspects in greater depth. Over 170 in-depth exercises provide hands-on experience with the theory, while more than 30 'Facts' and their accompanying proofs enhance approachability. Instructors will appreciate the appendices that cover all necessary background and the instructors-only solutions manual provided online. By the end of the book, readers will be well equipped to engage with state-of-the-art developments in optimization and its applications in decision-making and engineering.
Providing a succinct overview of Lindenmayer system (L-system) topology optimization, this book focuses on the methods and theory underlying this novel bioinspired approach. Starting from basic principles, the book outlines how topology optimization can be utilized at the conceptual design stage and shows how it offers straightforward applicability to multi-objective and/or multi-physical industrial problems. Design strategies are clearly demonstrated using a host of case studies and real-world examples, and their potential challenges and solutions are discussed. Written from an optimization and design perspective, the authors both summarize the latest advances in this field and suggest potential avenues of research and development for future work. This will be the ideal resource for engineering practitioners, researchers, and students wanting to gain a new perspective on using topology optimization to improve product design.
This practical guide to optimization combines mathematical theory with hands-on coding examples to explore how Python can be used to model problems and obtain the best possible solutions. Presenting a balance of theory and practical applications, it is the ideal resource for upper-undergraduate and graduate students in applied mathematics, data science, business, industrial engineering and operations research, as well as practitioners in related fields. Beginning with an introduction to the concept of optimization, this text presents the key ingredients of an optimization problem and the choices one needs to make when modeling a real-life problem mathematically. Topics covered range from linear and network optimization to convex optimization and optimizations under uncertainty. The book's Python code snippets, alongside more than 50 Jupyter notebooks on the author's GitHub, allow students to put the theory into practice and solve problems inspired by real-life challenges, while numerous exercises sharpen students' understanding of the methods discussed.
In contrast to the previous two chapters, which detailed L-system topology optimization approaches that interpret gene-informed rules into a complex set of layout-building instructions, this chapter introduces a grammar-to-layout approach known as the Arrangement L-system (ALS). Here, developmental operations that mimic the processes of cellular division, growth, and movement are directly informed by the genes and then iteratively applied to an iteratively changing topological layout that, once complete, represents an individual. The differences between formulations of the L-system, parameterized L-system, and ALS are discussed; examples of how the cellular division processes are used to develop a topological layout are provided; and extensions to the ALS such as directed search cellular dynamics and cellular division via the two-point topological derivative are detailed. The applicability of the ALS to a variety of structural design problems will be demonstrated, and it will be shown that this approach compares favorably with both conventional topology optimization methods discussed throughout this work as well as the graph-based SPIDRS approach introduced in the previous chapter.
Topology optimization is a powerful tool that, when employed at the preliminary stage of the design process, can determine potential structural configurations that best satisfy specified performance objectives. This chapter explores both the different classifications of topology optimization methodologies and their implementation within the design process, specifically highlighting potential areas where such techniques may fall short. This motivates a discussion on the relevance of a bioinspired approach to topology optimization known as EvoDevo, where topologies developed by interpreting instructions from a Lindenmayer system (L-system) encoding are evolved using a genetic algorithm. Such an approach can lend itself well to multiobjective design problems with a vast design space and for which users have little/no experience or intuition.
To this point, the proposed L-system topology optimization methods have been considered in the context of benchmark structural topology optimization problems, as such problems afford an opportunity for comparison to both other topology optimization methodologies and mathematically proven optimal or ideal solutions. However, the motivation behind the development of these approaches stems from the need for preliminary design method capable of considering complex multiobjective problems involving multiple physics for which the user may not have an intuition. This chapter briefly summarizes several multiphysical problems that have been approached using L-system topology optimization, including fluid transport, heat transfer, electrical, and aeroelastic applications. By no means an exhaustive survey, these examples are intended to provide an overview of potential applications and hopefully provoke opportunities for future efforts.
To address the need for an inherently multiobjective preliminary design tool, this chapter introduces a heuristic alternative to the conventional topology optimization approaches discussed in the previous chapter. Specifically, a parallel rewriting system known as a Lindenmayer system (L-system) is used to encode a limited number of design variables into a string of characters which, when interpreted using a deterministic algorithm, governs the development of a topology. The general formulation of L-systems is provided before discussing how L-system encodings can be interpreted using a graphical method known as turtle graphics. Turtle graphics constructs continuous, straight line segments by tracking the spatial position and orientation of a line-constructing agent, leading to the creation of branched structures that mimic those found in numerous natural systems. The performance of the proposed method is then assessed using simple, well-known topology optimization problems and comparisons to mathematically known optimal or ideal solutions as well as those generated using conventional topology optimization methodologies.
While the L-system approach introduced in the previous chapter exhibits potential for topology optimization applications, the modeling power of the turtle graphics interpretation is severely limited due to its reliance on limited parameters and its inability to guarantee the deliberate formation of load paths. Based on these characteristics, this chapter introduces a graph-based interpretation approach known as Spatial Interpretation for the Development of Reconfigurable Structures (SPIDRS) that uses principles of graph theory to allow an edge-constructing agent to introduce deliberate topological modifications. Furthermore, SPIDRS operates using instructions generated by a parametric L-system, which enhances modeling power and affords greater design freedom. This approach can also be extended to consider a three-dimensional structural design domain. It will be demonstrated that this interpretation approach results in configurations comparable to known optimal/ideal solutions as well as those found using conventional topology optimization methods, especially when coupled with a sizing optimization scheme to determine optimal structural member thicknesses.
To place the proposed bioinspired approach in the proper context, this chapter provides a review of the topology optimization problem and a general overview and demonstration of existing topology optimization techniques. Four different classes of methodologies are discussed: (1) pixel/voxel representations, (2) ground structure-based representations, (3) boundary representations, and (4) emerging methods. For each class, we consider both the established approach and, if applicable, any extension(s) to the established approach or new methodology that utilizes the same underlying principles; each method is demonstrated using a common structural optimization problem, allowing for direct comparison. Where possible, we offer observations regarding the strengths and weaknesses of each approach and recommendations as to how and where each approach should be employed.