Distributed control of robotic networks :: a mathematical approach to motion coordination algorithms /
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...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Princeton :
Princeton University Press,
©2009.
|
Schriftenreihe: | Princeton series in applied mathematics.
|
Schlagworte: | |
Online-Zugang: | Volltext |
Zusammenfassung: | 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. |
Beschreibung: | 1 online resource (xii, 320 pages) : illustrations |
Bibliographie: | Includes bibliographical references and indexes. |
ISBN: | 9781400831470 1400831474 9781680158977 168015897X 1282935755 9781282935754 9786612458200 6612458208 9786612935756 6612935758 |
Internformat
MARC
LEADER | 00000cam a2200000 a 4500 | ||
---|---|---|---|
001 | ZDB-4-EBA-ocn698110342 | ||
003 | OCoLC | ||
005 | 20241004212047.0 | ||
006 | m o d | ||
007 | cr cnu---unuuu | ||
008 | 110124s2009 njua ob 001 0 eng d | ||
040 | |a N$T |b eng |e pn |c N$T |d E7B |d YDXCP |d UBF |d OCLCQ |d CDX |d IDEBK |d OCLCQ |d DEBSZ |d UMI |d OCLCQ |d JSTOR |d OCLCF |d OCLCQ |d NLGGC |d EBLCP |d MERUC |d C6I |d KNOVL |d OCLCQ |d S3O |d COO |d OCLCQ |d AZK |d OCLCO |d LOA |d COCUF |d UIU |d TOA |d OCLCO |d CUS |d AGLDB |d JBG |d MOR |d PIFAG |d OTZ |d ZCU |d OCLCA |d OCLCQ |d AL5MG |d IOG |d OCLCO |d U3W |d EZ9 |d OCLCA |d STF |d WRM |d VTS |d CEF |d NRAMU |d CRU |d ICG |d OCLCQ |d INT |d VT2 |d AU@ |d OCLCO |d OCLCQ |d WYU |d LVT |d TKN |d OCLCQ |d DKC |d OCLCQ |d M8D |d UKAHL |d OCLCQ |d K6U |d OCLCQ |d VLY |d AJS |d UWK |d IEEEE |d OCLCO |d OCLCQ |d OCLCO |d OCL |d OCLCQ |d OCLCO |d OCLCL |d NUI | ||
015 | |a GBA970423 |2 bnb | ||
016 | 7 | |a 015327727 |2 Uk | |
019 | |a 536418909 |a 609855940 |a 613309781 |a 613708914 |a 647874743 |a 694142434 |a 816362440 |a 817741633 |a 961638855 |a 962624206 |a 1055377636 |a 1058170304 |a 1062857870 |a 1152981757 |a 1162530080 |a 1181899484 |a 1228526954 | ||
020 | |a 9781400831470 |q (electronic bk.) | ||
020 | |a 1400831474 |q (electronic bk.) | ||
020 | |a 9781680158977 |q (electronic bk.) | ||
020 | |a 168015897X |q (electronic bk.) | ||
020 | |a 1282935755 | ||
020 | |a 9781282935754 | ||
020 | |a 9786612458200 | ||
020 | |a 6612458208 | ||
020 | |a 9786612935756 | ||
020 | |a 6612935758 | ||
020 | |z 9780691141954 | ||
020 | |z 0691141959 | ||
020 | |z 1282458205 | ||
020 | |z 9781282458208 | ||
024 | 7 | |a 10.1515/9781400831470 |2 doi | |
024 | 8 | |a 9786612458200 | |
035 | |a (OCoLC)698110342 |z (OCoLC)536418909 |z (OCoLC)609855940 |z (OCoLC)613309781 |z (OCoLC)613708914 |z (OCoLC)647874743 |z (OCoLC)694142434 |z (OCoLC)816362440 |z (OCoLC)817741633 |z (OCoLC)961638855 |z (OCoLC)962624206 |z (OCoLC)1055377636 |z (OCoLC)1058170304 |z (OCoLC)1062857870 |z (OCoLC)1152981757 |z (OCoLC)1162530080 |z (OCoLC)1181899484 |z (OCoLC)1228526954 | ||
037 | |a 245820 |b MIL | ||
037 | |a 22573/ctt1156d |b JSTOR | ||
037 | |a 9452681 |b IEEE | ||
050 | 4 | |a TJ211 |b .B82 2009eb | |
072 | 7 | |a TEC |x 037000 |2 bisacsh | |
072 | 7 | |a MAT003000 |2 bisacsh | |
072 | 7 | |a TEC037000 |2 bisacsh | |
072 | 7 | |a COM014000 |2 bisacsh | |
072 | 7 | |a TJFM1 |2 bicssc | |
082 | 7 | |a 629.8/9246 |2 22 | |
084 | |a SK 880 |2 rvk | ||
049 | |a MAIN | ||
100 | 1 | |a Bullo, Francesco, |e author. |0 http://id.loc.gov/authorities/names/n2004009391 | |
245 | 1 | 0 | |a Distributed control of robotic networks : |b a mathematical approach to motion coordination algorithms / |c Francesco Bullo, Jorge Cortés, Sonia Martínez. |
260 | |a Princeton : |b Princeton University Press, |c ©2009. | ||
300 | |a 1 online resource (xii, 320 pages) : |b illustrations | ||
336 | |a text |b txt |2 rdacontent | ||
337 | |a computer |b c |2 rdamedia | ||
338 | |a online resource |b cr |2 rdacarrier | ||
347 | |a data file | ||
490 | 1 | |a Princeton series in applied mathematics | |
504 | |a Includes bibliographical references and indexes. | ||
588 | 0 | |a Print version record. | |
505 | 0 | |a Preface; An introduction to distributed algorithms; Geometric models and optimization; Robotic network models and complexity notions; Connectivity maintenance and rendezvous; Deployment; Boundary estimation and tracking; Bibliography; Algorithm Index; Subject Index; Symbol Index. | |
520 | |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. | ||
546 | |a In English. | ||
650 | 0 | |a Robotics. |0 http://id.loc.gov/authorities/subjects/sh85114628 | |
650 | 0 | |a Computer algorithms. |0 http://id.loc.gov/authorities/subjects/sh91000149 | |
650 | 0 | |a Robots |x Control systems. |0 http://id.loc.gov/authorities/subjects/sh89001406 | |
650 | 0 | |a Algorithms. |0 http://id.loc.gov/authorities/subjects/sh85003487 | |
650 | 6 | |a Robotique. | |
650 | 6 | |a Algorithmes. | |
650 | 6 | |a Robots |x Systèmes de commande. | |
650 | 7 | |a algorithms. |2 aat | |
650 | 7 | |a TECHNOLOGY & ENGINEERING |x Robotics. |2 bisacsh | |
650 | 7 | |a MATHEMATICS |x Applied. |2 bisacsh | |
650 | 7 | |a Algorithms |2 fast | |
650 | 7 | |a Computer algorithms |2 fast | |
650 | 7 | |a Robotics |2 fast | |
650 | 7 | |a Robots |x Control systems |2 fast | |
650 | 7 | |a Kontrolltheorie |2 gnd |0 http://d-nb.info/gnd/4032317-1 | |
650 | 7 | |a Robotik |2 gnd | |
650 | 7 | |a Robotique. |2 ram | |
650 | 7 | |a Algorithmes |x Informatique. |2 ram | |
650 | 7 | |a Robots |x Systèmes de commande. |2 ram | |
653 | |a 1-center problem. | ||
653 | |a Adjacency matrix. | ||
653 | |a Aggregate function. | ||
653 | |a Algebraic connectivity. | ||
653 | |a Algebraic topology (object). | ||
653 | |a Algorithm. | ||
653 | |a Analysis of algorithms. | ||
653 | |a Approximation algorithm. | ||
653 | |a Asynchronous system. | ||
653 | |a Bellman-Ford algorithm. | ||
653 | |a Bifurcation theory. | ||
653 | |a Bounded set (topological vector space). | ||
653 | |a Calculation. | ||
653 | |a Cartesian product. | ||
653 | |a Centroid. | ||
653 | |a Chebyshev center. | ||
653 | |a Circulant matrix. | ||
653 | |a Circumscribed circle. | ||
653 | |a Cluster analysis. | ||
653 | |a Combinatorial optimization. | ||
653 | |a Combinatorics. | ||
653 | |a Communication complexity. | ||
653 | |a Computation. | ||
653 | |a Computational complexity theory. | ||
653 | |a Computational geometry. | ||
653 | |a Computational model. | ||
653 | |a Computer simulation. | ||
653 | |a Computer vision. | ||
653 | |a Connected component (graph theory). | ||
653 | |a Connectivity (graph theory). | ||
653 | |a Consensus (computer science). | ||
653 | |a Control function (econometrics). | ||
653 | |a Differentiable function. | ||
653 | |a Dijkstra's algorithm. | ||
653 | |a Dimensional analysis. | ||
653 | |a Directed acyclic graph. | ||
653 | |a Directed graph. | ||
653 | |a Discrete time and continuous time. | ||
653 | |a Disk (mathematics). | ||
653 | |a Distributed algorithm. | ||
653 | |a Doubly stochastic matrix. | ||
653 | |a Dynamical system. | ||
653 | |a Eigenvalues and eigenvectors. | ||
653 | |a Estimation. | ||
653 | |a Euclidean space. | ||
653 | |a Function composition. | ||
653 | |a Hybrid system. | ||
653 | |a Information theory. | ||
653 | |a Initial condition. | ||
653 | |a Instance (computer science). | ||
653 | |a Invariance principle (linguistics). | ||
653 | |a Invertible matrix. | ||
653 | |a Iteration. | ||
653 | |a Iterative method. | ||
653 | |a Kinematics. | ||
653 | |a Laplacian matrix. | ||
653 | |a Leader election. | ||
653 | |a Linear dynamical system. | ||
653 | |a Linear interpolation. | ||
653 | |a Linear programming. | ||
653 | |a Lipschitz continuity. | ||
653 | |a Lyapunov function. | ||
653 | |a Markov chain. | ||
653 | |a Mathematical induction. | ||
653 | |a Mathematical optimization. | ||
653 | |a Mobile robot. | ||
653 | |a Motion planning. | ||
653 | |a Multi-agent system. | ||
653 | |a Network model. | ||
653 | |a Network topology. | ||
653 | |a Norm (mathematics). | ||
653 | |a Numerical integration. | ||
653 | |a Optimal control. | ||
653 | |a Optimization problem. | ||
653 | |a Parameter (computer programming). | ||
653 | |a Partition of a set. | ||
653 | |a Percolation theory. | ||
653 | |a Permutation matrix. | ||
653 | |a Polytope. | ||
653 | |a Proportionality (mathematics). | ||
653 | |a Quantifier (logic). | ||
653 | |a Quantization (signal processing). | ||
653 | |a Robustness (computer science). | ||
653 | |a Scientific notation. | ||
653 | |a Sensor. | ||
653 | |a Set (mathematics). | ||
653 | |a Simply connected space. | ||
653 | |a Simulation. | ||
653 | |a Simultaneous equations. | ||
653 | |a State space. | ||
653 | |a State variable. | ||
653 | |a Stochastic matrix. | ||
653 | |a Stochastic. | ||
653 | |a Strongly connected component. | ||
653 | |a Synchronous network. | ||
653 | |a Theorem. | ||
653 | |a Time complexity. | ||
653 | |a Topology. | ||
653 | |a Variable (mathematics). | ||
653 | |a Vector field. | ||
700 | 1 | |a Cortés, Jorge, |d 1974- |e author. |1 https://id.oclc.org/worldcat/entity/E39PCjyMqyvFdCPgmqPvcfG9Mq |0 http://id.loc.gov/authorities/names/n2009009497 | |
700 | 1 | |a Martínez, Sonia, |d 1974- |e author. |1 https://id.oclc.org/worldcat/entity/E39PCjBchjyXPMjmR3KfpfV7Xm |0 http://id.loc.gov/authorities/names/n2009009500 | |
758 | |i has work: |a Distributed control of robotic networks (Text) |1 https://id.oclc.org/worldcat/entity/E39PCH3gdHJQVQ6vctD9vqPb3P |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
776 | 0 | 8 | |i Print version: |a Bullo, Francesco. |t Distributed control of robotic networks. |d Princeton : Princeton University Press, ©2009 |z 9780691141954 |w (DLC) 2009006697 |w (OCoLC)310171843 |
830 | 0 | |a Princeton series in applied mathematics. |0 http://id.loc.gov/authorities/names/no2002046464 | |
856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=350079 |3 Volltext |
938 | |a Askews and Holts Library Services |b ASKH |n AH28073945 | ||
938 | |a Coutts Information Services |b COUT |n 12123227 | ||
938 | |a EBL - Ebook Library |b EBLB |n EBL483500 | ||
938 | |a ebrary |b EBRY |n ebr10364752 | ||
938 | |a EBSCOhost |b EBSC |n 350079 | ||
938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 245820 | ||
938 | |a YBP Library Services |b YANK |n 3340374 | ||
994 | |a 92 |b GEBAY | ||
912 | |a ZDB-4-EBA | ||
049 | |a DE-863 |
Datensatz im Suchindex
DE-BY-FWS_katkey | ZDB-4-EBA-ocn698110342 |
---|---|
_version_ | 1816881749615968256 |
adam_text | |
any_adam_object | |
author | Bullo, Francesco Cortés, Jorge, 1974- Martínez, Sonia, 1974- |
author_GND | http://id.loc.gov/authorities/names/n2004009391 http://id.loc.gov/authorities/names/n2009009497 http://id.loc.gov/authorities/names/n2009009500 |
author_facet | Bullo, Francesco Cortés, Jorge, 1974- Martínez, Sonia, 1974- |
author_role | aut aut aut |
author_sort | Bullo, Francesco |
author_variant | f b fb j c jc s m sm |
building | Verbundindex |
bvnumber | localFWS |
callnumber-first | T - Technology |
callnumber-label | TJ211 |
callnumber-raw | TJ211 .B82 2009eb |
callnumber-search | TJ211 .B82 2009eb |
callnumber-sort | TJ 3211 B82 42009EB |
callnumber-subject | TJ - Mechanical Engineering and Machinery |
classification_rvk | SK 880 |
collection | ZDB-4-EBA |
contents | Preface; An introduction to distributed algorithms; Geometric models and optimization; Robotic network models and complexity notions; Connectivity maintenance and rendezvous; Deployment; Boundary estimation and tracking; Bibliography; Algorithm Index; Subject Index; Symbol Index. |
ctrlnum | (OCoLC)698110342 |
dewey-full | 629.8/9246 |
dewey-hundreds | 600 - Technology (Applied sciences) |
dewey-ones | 629 - Other branches of engineering |
dewey-raw | 629.8/9246 |
dewey-search | 629.8/9246 |
dewey-sort | 3629.8 49246 |
dewey-tens | 620 - Engineering and allied operations |
discipline | Mathematik Mess-/Steuerungs-/Regelungs-/Automatisierungstechnik / Mechatronik |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>09900cam a2202257 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn698110342</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">110124s2009 njua ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">E7B</subfield><subfield code="d">YDXCP</subfield><subfield code="d">UBF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CDX</subfield><subfield code="d">IDEBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">UMI</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">JSTOR</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">NLGGC</subfield><subfield code="d">EBLCP</subfield><subfield code="d">MERUC</subfield><subfield code="d">C6I</subfield><subfield code="d">KNOVL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">S3O</subfield><subfield code="d">COO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AZK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">LOA</subfield><subfield code="d">COCUF</subfield><subfield code="d">UIU</subfield><subfield code="d">TOA</subfield><subfield code="d">OCLCO</subfield><subfield code="d">CUS</subfield><subfield code="d">AGLDB</subfield><subfield code="d">JBG</subfield><subfield code="d">MOR</subfield><subfield code="d">PIFAG</subfield><subfield code="d">OTZ</subfield><subfield code="d">ZCU</subfield><subfield code="d">OCLCA</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AL5MG</subfield><subfield code="d">IOG</subfield><subfield code="d">OCLCO</subfield><subfield code="d">U3W</subfield><subfield code="d">EZ9</subfield><subfield code="d">OCLCA</subfield><subfield code="d">STF</subfield><subfield code="d">WRM</subfield><subfield code="d">VTS</subfield><subfield code="d">CEF</subfield><subfield code="d">NRAMU</subfield><subfield code="d">CRU</subfield><subfield code="d">ICG</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INT</subfield><subfield code="d">VT2</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">WYU</subfield><subfield code="d">LVT</subfield><subfield code="d">TKN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DKC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">M8D</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VLY</subfield><subfield code="d">AJS</subfield><subfield code="d">UWK</subfield><subfield code="d">IEEEE</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">NUI</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBA970423</subfield><subfield code="2">bnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">015327727</subfield><subfield code="2">Uk</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">536418909</subfield><subfield code="a">609855940</subfield><subfield code="a">613309781</subfield><subfield code="a">613708914</subfield><subfield code="a">647874743</subfield><subfield code="a">694142434</subfield><subfield code="a">816362440</subfield><subfield code="a">817741633</subfield><subfield code="a">961638855</subfield><subfield code="a">962624206</subfield><subfield code="a">1055377636</subfield><subfield code="a">1058170304</subfield><subfield code="a">1062857870</subfield><subfield code="a">1152981757</subfield><subfield code="a">1162530080</subfield><subfield code="a">1181899484</subfield><subfield code="a">1228526954</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400831470</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1400831474</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781680158977</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">168015897X</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1282935755</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781282935754</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786612458200</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6612458208</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786612935756</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6612935758</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780691141954</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0691141959</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1282458205</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781282458208</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400831470</subfield><subfield code="2">doi</subfield></datafield><datafield tag="024" ind1="8" ind2=" "><subfield code="a">9786612458200</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)698110342</subfield><subfield code="z">(OCoLC)536418909</subfield><subfield code="z">(OCoLC)609855940</subfield><subfield code="z">(OCoLC)613309781</subfield><subfield code="z">(OCoLC)613708914</subfield><subfield code="z">(OCoLC)647874743</subfield><subfield code="z">(OCoLC)694142434</subfield><subfield code="z">(OCoLC)816362440</subfield><subfield code="z">(OCoLC)817741633</subfield><subfield code="z">(OCoLC)961638855</subfield><subfield code="z">(OCoLC)962624206</subfield><subfield code="z">(OCoLC)1055377636</subfield><subfield code="z">(OCoLC)1058170304</subfield><subfield code="z">(OCoLC)1062857870</subfield><subfield code="z">(OCoLC)1152981757</subfield><subfield code="z">(OCoLC)1162530080</subfield><subfield code="z">(OCoLC)1181899484</subfield><subfield code="z">(OCoLC)1228526954</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">245820</subfield><subfield code="b">MIL</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">22573/ctt1156d</subfield><subfield code="b">JSTOR</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">9452681</subfield><subfield code="b">IEEE</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">TJ211</subfield><subfield code="b">.B82 2009eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">TEC</subfield><subfield code="x">037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT003000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">TEC037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM014000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">TJFM1</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">629.8/9246</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 880</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bullo, Francesco,</subfield><subfield code="e">author.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2004009391</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, Jorge Cortés, Sonia Martínez.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Princeton :</subfield><subfield code="b">Princeton University Press,</subfield><subfield code="c">©2009.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xii, 320 pages) :</subfield><subfield code="b">illustrations</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">data file</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Princeton series in applied mathematics</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and indexes.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Preface; An introduction to distributed algorithms; Geometric models and optimization; Robotic network models and complexity notions; Connectivity maintenance and rendezvous; Deployment; Boundary estimation and tracking; Bibliography; Algorithm Index; Subject Index; Symbol Index.</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.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Robotics.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85114628</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh91000149</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Robots</subfield><subfield code="x">Control systems.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh89001406</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85003487</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Robotique.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Robots</subfield><subfield code="x">Systèmes de commande.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithms.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">TECHNOLOGY & ENGINEERING</subfield><subfield code="x">Robotics.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Applied.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Robotics</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Robots</subfield><subfield code="x">Control systems</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Kontrolltheorie</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4032317-1</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Robotik</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Robotique.</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes</subfield><subfield code="x">Informatique.</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Robots</subfield><subfield code="x">Systèmes de commande.</subfield><subfield code="2">ram</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="d">1974-</subfield><subfield code="e">author.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjyMqyvFdCPgmqPvcfG9Mq</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2009009497</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Martínez, Sonia,</subfield><subfield code="d">1974-</subfield><subfield code="e">author.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjBchjyXPMjmR3KfpfV7Xm</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2009009500</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Distributed control of robotic networks (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCH3gdHJQVQ6vctD9vqPb3P</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Bullo, Francesco.</subfield><subfield code="t">Distributed control of robotic networks.</subfield><subfield code="d">Princeton : Princeton University Press, ©2009</subfield><subfield code="z">9780691141954</subfield><subfield code="w">(DLC) 2009006697</subfield><subfield code="w">(OCoLC)310171843</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Princeton series in applied mathematics.</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2002046464</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=350079</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH28073945</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">12123227</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBL - Ebook Library</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL483500</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10364752</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">350079</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">245820</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">3340374</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
id | ZDB-4-EBA-ocn698110342 |
illustrated | Illustrated |
indexdate | 2024-11-27T13:17:40Z |
institution | BVB |
isbn | 9781400831470 1400831474 9781680158977 168015897X 1282935755 9781282935754 9786612458200 6612458208 9786612935756 6612935758 |
language | English |
oclc_num | 698110342 |
open_access_boolean | |
owner | MAIN DE-863 DE-BY-FWS |
owner_facet | MAIN DE-863 DE-BY-FWS |
physical | 1 online resource (xii, 320 pages) : illustrations |
psigel | ZDB-4-EBA |
publishDate | 2009 |
publishDateSearch | 2009 |
publishDateSort | 2009 |
publisher | Princeton University Press, |
record_format | marc |
series | Princeton series in applied mathematics. |
series2 | Princeton series in applied mathematics |
spelling | Bullo, Francesco, author. http://id.loc.gov/authorities/names/n2004009391 Distributed control of robotic networks : a mathematical approach to motion coordination algorithms / Francesco Bullo, Jorge Cortés, Sonia Martínez. Princeton : Princeton University Press, ©2009. 1 online resource (xii, 320 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier data file Princeton series in applied mathematics Includes bibliographical references and indexes. Print version record. Preface; An introduction to distributed algorithms; Geometric models and optimization; Robotic network models and complexity notions; Connectivity maintenance and rendezvous; Deployment; Boundary estimation and tracking; Bibliography; Algorithm Index; Subject Index; Symbol Index. 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. In English. Robotics. http://id.loc.gov/authorities/subjects/sh85114628 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Robots Control systems. http://id.loc.gov/authorities/subjects/sh89001406 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Robotique. Algorithmes. Robots Systèmes de commande. algorithms. aat TECHNOLOGY & ENGINEERING Robotics. bisacsh MATHEMATICS Applied. bisacsh Algorithms fast Computer algorithms fast Robotics fast Robots Control systems fast Kontrolltheorie gnd http://d-nb.info/gnd/4032317-1 Robotik gnd Robotique. ram Algorithmes Informatique. ram Robots Systèmes de commande. ram 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, 1974- author. https://id.oclc.org/worldcat/entity/E39PCjyMqyvFdCPgmqPvcfG9Mq http://id.loc.gov/authorities/names/n2009009497 Martínez, Sonia, 1974- author. https://id.oclc.org/worldcat/entity/E39PCjBchjyXPMjmR3KfpfV7Xm http://id.loc.gov/authorities/names/n2009009500 has work: Distributed control of robotic networks (Text) https://id.oclc.org/worldcat/entity/E39PCH3gdHJQVQ6vctD9vqPb3P https://id.oclc.org/worldcat/ontology/hasWork Print version: Bullo, Francesco. Distributed control of robotic networks. Princeton : Princeton University Press, ©2009 9780691141954 (DLC) 2009006697 (OCoLC)310171843 Princeton series in applied mathematics. http://id.loc.gov/authorities/names/no2002046464 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=350079 Volltext |
spellingShingle | Bullo, Francesco Cortés, Jorge, 1974- Martínez, Sonia, 1974- Distributed control of robotic networks : a mathematical approach to motion coordination algorithms / Princeton series in applied mathematics. Preface; An introduction to distributed algorithms; Geometric models and optimization; Robotic network models and complexity notions; Connectivity maintenance and rendezvous; Deployment; Boundary estimation and tracking; Bibliography; Algorithm Index; Subject Index; Symbol Index. Robotics. http://id.loc.gov/authorities/subjects/sh85114628 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Robots Control systems. http://id.loc.gov/authorities/subjects/sh89001406 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Robotique. Algorithmes. Robots Systèmes de commande. algorithms. aat TECHNOLOGY & ENGINEERING Robotics. bisacsh MATHEMATICS Applied. bisacsh Algorithms fast Computer algorithms fast Robotics fast Robots Control systems fast Kontrolltheorie gnd http://d-nb.info/gnd/4032317-1 Robotik gnd Robotique. ram Algorithmes Informatique. ram Robots Systèmes de commande. ram |
subject_GND | http://id.loc.gov/authorities/subjects/sh85114628 http://id.loc.gov/authorities/subjects/sh91000149 http://id.loc.gov/authorities/subjects/sh89001406 http://id.loc.gov/authorities/subjects/sh85003487 http://d-nb.info/gnd/4032317-1 |
title | Distributed control of robotic networks : a mathematical approach to motion coordination algorithms / |
title_auth | Distributed control of robotic networks : a mathematical approach to motion coordination algorithms / |
title_exact_search | Distributed control of robotic networks : a mathematical approach to motion coordination algorithms / |
title_full | Distributed control of robotic networks : a mathematical approach to motion coordination algorithms / Francesco Bullo, Jorge Cortés, Sonia Martínez. |
title_fullStr | Distributed control of robotic networks : a mathematical approach to motion coordination algorithms / Francesco Bullo, Jorge Cortés, Sonia Martínez. |
title_full_unstemmed | Distributed control of robotic networks : a mathematical approach to motion coordination algorithms / Francesco Bullo, Jorge Cortés, Sonia Martínez. |
title_short | Distributed control of robotic networks : |
title_sort | distributed control of robotic networks a mathematical approach to motion coordination algorithms |
title_sub | a mathematical approach to motion coordination algorithms / |
topic | Robotics. http://id.loc.gov/authorities/subjects/sh85114628 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Robots Control systems. http://id.loc.gov/authorities/subjects/sh89001406 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Robotique. Algorithmes. Robots Systèmes de commande. algorithms. aat TECHNOLOGY & ENGINEERING Robotics. bisacsh MATHEMATICS Applied. bisacsh Algorithms fast Computer algorithms fast Robotics fast Robots Control systems fast Kontrolltheorie gnd http://d-nb.info/gnd/4032317-1 Robotik gnd Robotique. ram Algorithmes Informatique. ram Robots Systèmes de commande. ram |
topic_facet | Robotics. Computer algorithms. Robots Control systems. Algorithms. Robotique. Algorithmes. Robots Systèmes de commande. algorithms. TECHNOLOGY & ENGINEERING Robotics. MATHEMATICS Applied. Algorithms Computer algorithms Robotics Robots Control systems Kontrolltheorie Robotik Algorithmes Informatique. |
url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=350079 |
work_keys_str_mv | AT bullofrancesco distributedcontrolofroboticnetworksamathematicalapproachtomotioncoordinationalgorithms AT cortesjorge distributedcontrolofroboticnetworksamathematicalapproachtomotioncoordinationalgorithms AT martinezsonia distributedcontrolofroboticnetworksamathematicalapproachtomotioncoordinationalgorithms |