Librería: Majestic Books, Hounslow, Reino Unido
EUR 121,09
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 136,77
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 135,58
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New. 1st edition NO-PA16APR2015-KAP.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 137,79
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Elsevier Science Publishing Co Inc, 2020
ISBN 10: 0128236981 ISBN 13: 9780128236987
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 130,50
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback / softback. Condición: New. New copy - Usually dispatched within 4 working days.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 145,61
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 160,52
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 145,60
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 161,33
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
EUR 151,05
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. This book addresses advanced analytical tools for characterization control, estimation and design of networked dynamic systems over fixed, probabilistic and time-varying graphs Provides coherent results on adopting a set-theoretic framewor.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 103,55
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Elsevier Science & Technology, Academic Press, 2020
ISBN 10: 0128236981 ISBN 13: 9780128236987
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 114,00
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Discrete Networked Dynamic Systems: Analysis and Performance provides a high-level treatment of a general class of linear discrete-time dynamic systems interconnected over an information network, exchanging relative state measurements or output measurements. It presents a systematic analysis of the material and provides an account to the math development in a unified way. The topics in this book are structured along four dimensions: Agent, Environment, Interaction, and Organization, while keeping global (system-centered) and local (agent-centered) viewpoints. The focus is on the wide-sense consensus problem in discrete networked dynamic systems. The authors rely heavily on algebraic graph theory and topology to derive their results. It is known that graphs play an important role in the analysis of interactions between multiagent/distributed systems. Graph-theoretic analysis provides insight into how topological interactions play a role in achieving coordination among agents. Numerous types of graphs exist in the literature, depending on the edge set of G. A simple graph has no self-loop or edges. Complete graphs are simple graphs with an edge connecting any pair of vertices. The vertex set in a bipartite graph can be partitioned into disjoint non-empty vertex sets, whereby there is an edge connecting every vertex in one set to every vertex in the other set. Random graphs have fixed vertex sets, but the edge set exhibits stochastic behavior modeled by probability functions. Much of the studies in coordination control are based on deterministic/fixed graphs, switching graphs, and random graphs. Englisch.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 118,05
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 484 pages. 9.00x6.00x1.38 inches. In Stock. This item is printed on demand.
Idioma: Inglés
Publicado por Elsevier Science Publishing Co Inc, 2020
ISBN 10: 0128236981 ISBN 13: 9780128236987
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 173,43
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Idioma: Inglés
Publicado por Elsevier Science & Technology, Academic Press, 2020
ISBN 10: 0128236981 ISBN 13: 9780128236987
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 127,50
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Discrete Networked Dynamic Systems: Analysis and Performance provides a high-level treatment of a general class of linear discrete-time dynamic systems interconnected over an information network, exchanging relative state measurements or output measurements. It presents a systematic analysis of the material and provides an account to the math development in a unified way. The topics in this book are structured along four dimensions: Agent, Environment, Interaction, and Organization, while keeping global (system-centered) and local (agent-centered) viewpoints. The focus is on the wide-sense consensus problem in discrete networked dynamic systems. The authors rely heavily on algebraic graph theory and topology to derive their results. It is known that graphs play an important role in the analysis of interactions between multiagent/distributed systems. Graph-theoretic analysis provides insight into how topological interactions play a role in achieving coordination among agents. Numerous types of graphs exist in the literature, depending on the edge set of G. A simple graph has no self-loop or edges. Complete graphs are simple graphs with an edge connecting any pair of vertices. The vertex set in a bipartite graph can be partitioned into disjoint non-empty vertex sets, whereby there is an edge connecting every vertex in one set to every vertex in the other set. Random graphs have fixed vertex sets, but the edge set exhibits stochastic behavior modeled by probability functions. Much of the studies in coordination control are based on deterministic/fixed graphs, switching graphs, and random graphs.