Distributed Control of Robotic Networks : : A Mathematical Approach to Motion Coordination Algorithms / / Francesco Bullo, Sonia Martínez, Jorge Cortés.

This self-contained introduction to the distributed control of robotic networks offers a distinctive blend of computer science and control theory. The book presents a broad set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity; and it a...

Full description

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package
VerfasserIn:
Place / Publishing House:Princeton, NJ : : Princeton University Press, , [2009]
©2009
Year of Publication:2009
Edition:Course Book
Language:English
Series:Princeton Series in Applied Mathematics ; 27
Online Access:
Physical Description:1 online resource (320 p.) :; 76 line illus.
Tags: Add Tag
No Tags, Be the first to tag this record!
id 9781400831470
ctrlnum (DE-B1597)446779
(OCoLC)979835075
collection bib_alma
record_format marc
spelling Bullo, Francesco, author. aut http://id.loc.gov/vocabulary/relators/aut
Distributed Control of Robotic Networks : A Mathematical Approach to Motion Coordination Algorithms / Francesco Bullo, Sonia Martínez, Jorge Cortés.
Course Book
Princeton, NJ : Princeton University Press, [2009]
©2009
1 online resource (320 p.) : 76 line illus.
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
Princeton Series in Applied Mathematics ; 27
Frontmatter -- Contents -- Preface -- Chapter One. An introduction to distributed algorithms -- Chapter Two. Geometric models and optimization -- Chapter Three. Robotic network models and complexity notions -- Chapter Four. Connectivity maintenance and rendezvous -- Chapter Five. Deployment -- Chapter Six. Boundary estimation and tracking -- Bibliography -- Algorithm Index -- Subject Index -- Symbol Index
restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star
This self-contained introduction to the distributed control of robotic networks offers a distinctive blend of computer science and control theory. The book presents a broad set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity; and it analyzes various cooperative strategies for tasks such as consensus, rendezvous, connectivity maintenance, deployment, and boundary estimation. The unifying theme is a formal model for robotic networks that explicitly incorporates their communication, sensing, control, and processing capabilities--a model that in turn leads to a common formal language to describe and analyze coordination algorithms. Written for first- and second-year graduate students in control and robotics, the book will also be useful to researchers in control theory, robotics, distributed algorithms, and automata theory. The book provides explanations of the basic concepts and main results, as well as numerous examples and exercises. Self-contained exposition of graph-theoretic concepts, distributed algorithms, and complexity measures for processor networks with fixed interconnection topology and for robotic networks with position-dependent interconnection topology Detailed treatment of averaging and consensus algorithms interpreted as linear iterations on synchronous networks Introduction of geometric notions such as partitions, proximity graphs, and multicenter functions Detailed treatment of motion coordination algorithms for deployment, rendezvous, connectivity maintenance, and boundary estimation
Issued also in print.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022)
Technology & Engineering / Robotics. bisacsh
1-center problem.
Adjacency matrix.
Aggregate function.
Algebraic connectivity.
Algebraic topology (object).
Algorithm.
Analysis of algorithms.
Approximation algorithm.
Asynchronous system.
Bellman-Ford algorithm.
Bifurcation theory.
Bounded set (topological vector space).
Calculation.
Cartesian product.
Centroid.
Chebyshev center.
Circulant matrix.
Circumscribed circle.
Cluster analysis.
Combinatorial optimization.
Combinatorics.
Communication complexity.
Computation.
Computational complexity theory.
Computational geometry.
Computational model.
Computer simulation.
Computer vision.
Connected component (graph theory).
Connectivity (graph theory).
Consensus (computer science).
Control function (econometrics).
Differentiable function.
Dijkstra's algorithm.
Dimensional analysis.
Directed acyclic graph.
Directed graph.
Discrete time and continuous time.
Disk (mathematics).
Distributed algorithm.
Doubly stochastic matrix.
Dynamical system.
Eigenvalues and eigenvectors.
Estimation.
Euclidean space.
Function composition.
Hybrid system.
Information theory.
Initial condition.
Instance (computer science).
Invariance principle (linguistics).
Invertible matrix.
Iteration.
Iterative method.
Kinematics.
Laplacian matrix.
Leader election.
Linear dynamical system.
Linear interpolation.
Linear programming.
Lipschitz continuity.
Lyapunov function.
Markov chain.
Mathematical induction.
Mathematical optimization.
Mobile robot.
Motion planning.
Multi-agent system.
Network model.
Network topology.
Norm (mathematics).
Numerical integration.
Optimal control.
Optimization problem.
Parameter (computer programming).
Partition of a set.
Percolation theory.
Permutation matrix.
Polytope.
Proportionality (mathematics).
Quantifier (logic).
Quantization (signal processing).
Robustness (computer science).
Scientific notation.
Sensor.
Set (mathematics).
Simply connected space.
Simulation.
Simultaneous equations.
State space.
State variable.
Stochastic matrix.
Stochastic.
Strongly connected component.
Synchronous network.
Theorem.
Time complexity.
Topology.
Variable (mathematics).
Vector field.
Cortés, Jorge, author. aut http://id.loc.gov/vocabulary/relators/aut
Martínez, Sonia, author. aut http://id.loc.gov/vocabulary/relators/aut
Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package 9783110515831 ZDB-23-PAM
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 9783110442502
print 9780691141954
https://doi.org/10.1515/9781400831470
https://www.degruyter.com/isbn/9781400831470
Cover https://www.degruyter.com/document/cover/isbn/9781400831470/original
language English
format eBook
author Bullo, Francesco,
Bullo, Francesco,
Cortés, Jorge,
Martínez, Sonia,
spellingShingle Bullo, Francesco,
Bullo, Francesco,
Cortés, Jorge,
Martínez, Sonia,
Distributed Control of Robotic Networks : A Mathematical Approach to Motion Coordination Algorithms /
Princeton Series in Applied Mathematics ;
Frontmatter --
Contents --
Preface --
Chapter One. An introduction to distributed algorithms --
Chapter Two. Geometric models and optimization --
Chapter Three. Robotic network models and complexity notions --
Chapter Four. Connectivity maintenance and rendezvous --
Chapter Five. Deployment --
Chapter Six. Boundary estimation and tracking --
Bibliography --
Algorithm Index --
Subject Index --
Symbol Index
author_facet Bullo, Francesco,
Bullo, Francesco,
Cortés, Jorge,
Martínez, Sonia,
Cortés, Jorge,
Cortés, Jorge,
Martínez, Sonia,
Martínez, Sonia,
author_variant f b fb
f b fb
j c jc
s m sm
author_role VerfasserIn
VerfasserIn
VerfasserIn
VerfasserIn
author2 Cortés, Jorge,
Cortés, Jorge,
Martínez, Sonia,
Martínez, Sonia,
author2_variant j c jc
s m sm
author2_role VerfasserIn
VerfasserIn
VerfasserIn
VerfasserIn
author_sort Bullo, Francesco,
title Distributed Control of Robotic Networks : A Mathematical Approach to Motion Coordination Algorithms /
title_sub A Mathematical Approach to Motion Coordination Algorithms /
title_full Distributed Control of Robotic Networks : A Mathematical Approach to Motion Coordination Algorithms / Francesco Bullo, Sonia Martínez, Jorge Cortés.
title_fullStr Distributed Control of Robotic Networks : A Mathematical Approach to Motion Coordination Algorithms / Francesco Bullo, Sonia Martínez, Jorge Cortés.
title_full_unstemmed Distributed Control of Robotic Networks : A Mathematical Approach to Motion Coordination Algorithms / Francesco Bullo, Sonia Martínez, Jorge Cortés.
title_auth Distributed Control of Robotic Networks : A Mathematical Approach to Motion Coordination Algorithms /
title_alt Frontmatter --
Contents --
Preface --
Chapter One. An introduction to distributed algorithms --
Chapter Two. Geometric models and optimization --
Chapter Three. Robotic network models and complexity notions --
Chapter Four. Connectivity maintenance and rendezvous --
Chapter Five. Deployment --
Chapter Six. Boundary estimation and tracking --
Bibliography --
Algorithm Index --
Subject Index --
Symbol Index
title_new Distributed Control of Robotic Networks :
title_sort distributed control of robotic networks : a mathematical approach to motion coordination algorithms /
series Princeton Series in Applied Mathematics ;
series2 Princeton Series in Applied Mathematics ;
publisher Princeton University Press,
publishDate 2009
physical 1 online resource (320 p.) : 76 line illus.
Issued also in print.
edition Course Book
contents Frontmatter --
Contents --
Preface --
Chapter One. An introduction to distributed algorithms --
Chapter Two. Geometric models and optimization --
Chapter Three. Robotic network models and complexity notions --
Chapter Four. Connectivity maintenance and rendezvous --
Chapter Five. Deployment --
Chapter Six. Boundary estimation and tracking --
Bibliography --
Algorithm Index --
Subject Index --
Symbol Index
isbn 9781400831470
9783110515831
9783110442502
9780691141954
url https://doi.org/10.1515/9781400831470
https://www.degruyter.com/isbn/9781400831470
https://www.degruyter.com/document/cover/isbn/9781400831470/original
illustrated Illustrated
dewey-hundreds 600 - Technology
dewey-tens 620 - Engineering
dewey-ones 629 - Other branches of engineering
dewey-full 629.8/9246
dewey-sort 3629.8 49246
dewey-raw 629.8/9246
dewey-search 629.8/9246
doi_str_mv 10.1515/9781400831470
oclc_num 979835075
work_keys_str_mv AT bullofrancesco distributedcontrolofroboticnetworksamathematicalapproachtomotioncoordinationalgorithms
AT cortesjorge distributedcontrolofroboticnetworksamathematicalapproachtomotioncoordinationalgorithms
AT martinezsonia distributedcontrolofroboticnetworksamathematicalapproachtomotioncoordinationalgorithms
status_str n
ids_txt_mv (DE-B1597)446779
(OCoLC)979835075
carrierType_str_mv cr
hierarchy_parent_title Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013
is_hierarchy_title Distributed Control of Robotic Networks : A Mathematical Approach to Motion Coordination Algorithms /
container_title Title is part of eBook package: De Gruyter Princeton Series in Applied Mathematics eBook-Package
author2_original_writing_str_mv noLinkedField
noLinkedField
noLinkedField
noLinkedField
_version_ 1770176644471848960
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>08643nam a22019335i 4500</leader><controlfield tag="001">9781400831470</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20220131112047.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">220131t20092009nju fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400831470</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400831470</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)446779</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)979835075</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">TEC037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">629.8/9246</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 880</subfield><subfield code="2">rvk</subfield><subfield code="0">(DE-625)rvk/143266:</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bullo, Francesco, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed Control of Robotic Networks :</subfield><subfield code="b">A Mathematical Approach to Motion Coordination Algorithms /</subfield><subfield code="c">Francesco Bullo, Sonia Martínez, Jorge Cortés.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Course Book</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2009]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (320 p.) :</subfield><subfield code="b">76 line illus.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Princeton Series in Applied Mathematics ;</subfield><subfield code="v">27</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Chapter One. An introduction to distributed algorithms -- </subfield><subfield code="t">Chapter Two. Geometric models and optimization -- </subfield><subfield code="t">Chapter Three. Robotic network models and complexity notions -- </subfield><subfield code="t">Chapter Four. Connectivity maintenance and rendezvous -- </subfield><subfield code="t">Chapter Five. Deployment -- </subfield><subfield code="t">Chapter Six. Boundary estimation and tracking -- </subfield><subfield code="t">Bibliography -- </subfield><subfield code="t">Algorithm Index -- </subfield><subfield code="t">Subject Index -- </subfield><subfield code="t">Symbol Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This self-contained introduction to the distributed control of robotic networks offers a distinctive blend of computer science and control theory. The book presents a broad set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity; and it analyzes various cooperative strategies for tasks such as consensus, rendezvous, connectivity maintenance, deployment, and boundary estimation. The unifying theme is a formal model for robotic networks that explicitly incorporates their communication, sensing, control, and processing capabilities--a model that in turn leads to a common formal language to describe and analyze coordination algorithms. Written for first- and second-year graduate students in control and robotics, the book will also be useful to researchers in control theory, robotics, distributed algorithms, and automata theory. The book provides explanations of the basic concepts and main results, as well as numerous examples and exercises. Self-contained exposition of graph-theoretic concepts, distributed algorithms, and complexity measures for processor networks with fixed interconnection topology and for robotic networks with position-dependent interconnection topology Detailed treatment of averaging and consensus algorithms interpreted as linear iterations on synchronous networks Introduction of geometric notions such as partitions, proximity graphs, and multicenter functions Detailed treatment of motion coordination algorithms for deployment, rendezvous, connectivity maintenance, and boundary estimation</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 31. Jan 2022)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Technology &amp; Engineering / Robotics.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">1-center problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Adjacency matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Aggregate function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algebraic connectivity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algebraic topology (object).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Analysis of algorithms.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Approximation algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Asynchronous system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Bellman-Ford algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Bifurcation theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Bounded set (topological vector space).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Calculation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cartesian product.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Centroid.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Chebyshev center.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Circulant matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Circumscribed circle.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Cluster analysis.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Combinatorial optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Combinatorics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Communication complexity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computational complexity theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computational geometry.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computational model.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computer simulation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computer vision.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Connected component (graph theory).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Connectivity (graph theory).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Consensus (computer science).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Control function (econometrics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Differentiable function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Dijkstra's algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Dimensional analysis.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Directed acyclic graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Directed graph.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Discrete time and continuous time.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Disk (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Distributed algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Doubly stochastic matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Dynamical system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Eigenvalues and eigenvectors.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Estimation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Euclidean space.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Function composition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hybrid system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Information theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Initial condition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Instance (computer science).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Invariance principle (linguistics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Invertible matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Iteration.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Iterative method.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Kinematics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Laplacian matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Leader election.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear dynamical system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear interpolation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Linear programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lipschitz continuity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Lyapunov function.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Markov chain.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical induction.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mathematical optimization.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Mobile robot.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Motion planning.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Multi-agent system.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Network model.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Network topology.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Norm (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Numerical integration.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Optimal control.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Optimization problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Parameter (computer programming).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Partition of a set.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Percolation theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Permutation matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Polytope.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Proportionality (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Quantifier (logic).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Quantization (signal processing).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Robustness (computer science).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Scientific notation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sensor.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Set (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Simply connected space.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Simulation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Simultaneous equations.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">State space.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">State variable.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Stochastic matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Stochastic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Strongly connected component.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Synchronous network.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Time complexity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Topology.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Variable (mathematics).</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Vector field.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cortés, Jorge, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Martínez, Sonia, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton Series in Applied Mathematics eBook-Package</subfield><subfield code="z">9783110515831</subfield><subfield code="o">ZDB-23-PAM</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="z">9783110442502</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691141954</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400831470</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400831470</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9781400831470/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-044250-2 Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="c">2000</subfield><subfield code="d">2013</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-PAM</subfield></datafield></record></collection>