Shortest path solvers: from software to wetware
A parallel algorithm for the constrained shortest path problem on lattice graphs -- Gathering a Swarm of Robots through Shortest Paths -- The MinSum-MinHop and the MaxMin-MinHop bicriteria path problems -- Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks -- I...
Gespeichert in:
| Weitere Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cham
Springer
[2018]
|
| Schriftenreihe: | Emergence, complexity and computation
volume 32 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Zusammenfassung: | A parallel algorithm for the constrained shortest path problem on lattice graphs -- Gathering a Swarm of Robots through Shortest Paths -- The MinSum-MinHop and the MaxMin-MinHop bicriteria path problems -- Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks -- Influenza Virus Algorithm for Multiobjective Energy Reduction Open Vehicle Routing Problem -- Computng shortest paths with cellular automata -- Cellular Automata Applications in Shortest Path Problem -- Checkerboard Pattern Formed by Cellular Automata Agents -- Do ants use Ant Colony Optimization -- Slime Mould Inspired Models for Path Planning: Collective and Structural Approaches This book offers advanced parallel and distributed algorithms and experimental laboratory prototypes of unconventional shortest path solvers. In addition, it presents novel and unique algorithms of solving shortest problems in massively parallel cellular automaton machines. The shortest path problem is a fundamental and classical problem in graph theory and computer science and is frequently applied in the contexts of transport and logistics, telecommunication networks, virtual reality and gaming, geometry, and social networks analysis. Software implementations include distance-vector algorithms for distributed path computation in dynamics networks, parallel solutions of the constrained shortest path problem, and application of the shortest path solutions in gathering robotic swarms. Massively parallel algorithms utilise cellular automata, where a shortest path is computed either via matrix multiplication in automaton arrays, or via the representation of data graphs in automaton lattices and using the propagation of wave-like patterns. Unconventional shortest path solvers are presented in computer models of foraging behaviour and protoplasmic network optimisation by the slime mould Physarum polycephalum and fluidic devices, while experimental laboratory prototypes of path solvers using chemical media, flows and droplets, and electrical current are also highlighted. The book will be a pleasure to explore for readers from all walks of life, from undergraduate students to university professors, from mathematicians, computers scientists and engineers to chemists and biologists |
| Beschreibung: | viii, 441 Seiten Illustrationen, Diagramme |
| ISBN: | 9783319775098 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV045426278 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 190125s2018 a||| |||| 00||| eng d | ||
| 020 | |a 9783319775098 |9 978-3-319-77509-8 | ||
| 035 | |a (OCoLC)1083891776 | ||
| 035 | |a (DE-599)GBV1023630273 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 084 | |a 05-04 |2 msc | ||
| 084 | |a 54.51 |2 bkl | ||
| 084 | |a 54.10 |2 bkl | ||
| 084 | |a 68-06 |2 msc | ||
| 245 | 1 | 0 | |a Shortest path solvers |b from software to wetware |c Andrew Adamatzky, editor |
| 264 | 1 | |a Cham |b Springer |c [2018] | |
| 264 | 4 | |c © 2018 | |
| 300 | |a viii, 441 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Emergence, complexity and computation |v volume 32 | |
| 520 | 3 | |a A parallel algorithm for the constrained shortest path problem on lattice graphs -- Gathering a Swarm of Robots through Shortest Paths -- The MinSum-MinHop and the MaxMin-MinHop bicriteria path problems -- Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks -- Influenza Virus Algorithm for Multiobjective Energy Reduction Open Vehicle Routing Problem -- Computng shortest paths with cellular automata -- Cellular Automata Applications in Shortest Path Problem -- Checkerboard Pattern Formed by Cellular Automata Agents -- Do ants use Ant Colony Optimization -- Slime Mould Inspired Models for Path Planning: Collective and Structural Approaches | |
| 520 | 3 | |a This book offers advanced parallel and distributed algorithms and experimental laboratory prototypes of unconventional shortest path solvers. In addition, it presents novel and unique algorithms of solving shortest problems in massively parallel cellular automaton machines. The shortest path problem is a fundamental and classical problem in graph theory and computer science and is frequently applied in the contexts of transport and logistics, telecommunication networks, virtual reality and gaming, geometry, and social networks analysis. Software implementations include distance-vector algorithms for distributed path computation in dynamics networks, parallel solutions of the constrained shortest path problem, and application of the shortest path solutions in gathering robotic swarms. Massively parallel algorithms utilise cellular automata, where a shortest path is computed either via matrix multiplication in automaton arrays, or via the representation of data graphs in automaton lattices and using the propagation of wave-like patterns. Unconventional shortest path solvers are presented in computer models of foraging behaviour and protoplasmic network optimisation by the slime mould Physarum polycephalum and fluidic devices, while experimental laboratory prototypes of path solvers using chemical media, flows and droplets, and electrical current are also highlighted. The book will be a pleasure to explore for readers from all walks of life, from undergraduate students to university professors, from mathematicians, computers scientists and engineers to chemists and biologists | |
| 650 | 0 | 7 | |a Wetware-Computer |0 (DE-588)1163345113 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |2 gnd |9 rswk-swf |
| 653 | |a Complexity, Computational | ||
| 653 | |a Computational intelligence | ||
| 653 | |a Engineering | ||
| 689 | 0 | 0 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 0 | 1 | |a Wetware-Computer |0 (DE-588)1163345113 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Adamatzky, Andrew |d 1965- |0 (DE-588)123369053 |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-319-77510-4 |
| 830 | 0 | |a Emergence, complexity and computation |v volume 32 |w (DE-604)BV041227294 |9 32 | |
| 856 | 4 | 2 | |m V:DE-601;B:DE-89 |q application/pdf |u http://www.gbv.de/dms/tib-ub-hannover/1023630273.pdf |y Inhaltsverzeichnis |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030812067 | ||
Datensatz im Suchindex
| _version_ | 1804179310038220800 |
|---|---|
| any_adam_object | |
| author2 | Adamatzky, Andrew 1965- |
| author2_role | edt |
| author2_variant | a a aa |
| author_GND | (DE-588)123369053 |
| author_facet | Adamatzky, Andrew 1965- |
| building | Verbundindex |
| bvnumber | BV045426278 |
| ctrlnum | (OCoLC)1083891776 (DE-599)GBV1023630273 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03972nam a2200481 cb4500</leader><controlfield tag="001">BV045426278</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">190125s2018 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319775098</subfield><subfield code="9">978-3-319-77509-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1083891776</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV1023630273</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05-04</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.51</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68-06</subfield><subfield code="2">msc</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Shortest path solvers</subfield><subfield code="b">from software to wetware</subfield><subfield code="c">Andrew Adamatzky, editor</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield><subfield code="c">[2018]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2018</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">viii, 441 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Emergence, complexity and computation</subfield><subfield code="v">volume 32</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">A parallel algorithm for the constrained shortest path problem on lattice graphs -- Gathering a Swarm of Robots through Shortest Paths -- The MinSum-MinHop and the MaxMin-MinHop bicriteria path problems -- Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks -- Influenza Virus Algorithm for Multiobjective Energy Reduction Open Vehicle Routing Problem -- Computng shortest paths with cellular automata -- Cellular Automata Applications in Shortest Path Problem -- Checkerboard Pattern Formed by Cellular Automata Agents -- Do ants use Ant Colony Optimization -- Slime Mould Inspired Models for Path Planning: Collective and Structural Approaches</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This book offers advanced parallel and distributed algorithms and experimental laboratory prototypes of unconventional shortest path solvers. In addition, it presents novel and unique algorithms of solving shortest problems in massively parallel cellular automaton machines. The shortest path problem is a fundamental and classical problem in graph theory and computer science and is frequently applied in the contexts of transport and logistics, telecommunication networks, virtual reality and gaming, geometry, and social networks analysis. Software implementations include distance-vector algorithms for distributed path computation in dynamics networks, parallel solutions of the constrained shortest path problem, and application of the shortest path solutions in gathering robotic swarms. Massively parallel algorithms utilise cellular automata, where a shortest path is computed either via matrix multiplication in automaton arrays, or via the representation of data graphs in automaton lattices and using the propagation of wave-like patterns. Unconventional shortest path solvers are presented in computer models of foraging behaviour and protoplasmic network optimisation by the slime mould Physarum polycephalum and fluidic devices, while experimental laboratory prototypes of path solvers using chemical media, flows and droplets, and electrical current are also highlighted. The book will be a pleasure to explore for readers from all walks of life, from undergraduate students to university professors, from mathematicians, computers scientists and engineers to chemists and biologists</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Wetware-Computer</subfield><subfield code="0">(DE-588)1163345113</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Complexity, Computational</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Computational intelligence</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Engineering</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Wetware-Computer</subfield><subfield code="0">(DE-588)1163345113</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Adamatzky, Andrew</subfield><subfield code="d">1965-</subfield><subfield code="0">(DE-588)123369053</subfield><subfield code="4">edt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-319-77510-4</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Emergence, complexity and computation</subfield><subfield code="v">volume 32</subfield><subfield code="w">(DE-604)BV041227294</subfield><subfield code="9">32</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">V:DE-601;B:DE-89</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://www.gbv.de/dms/tib-ub-hannover/1023630273.pdf</subfield><subfield code="y">Inhaltsverzeichnis</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030812067</subfield></datafield></record></collection> |
| id | DE-604.BV045426278 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T08:17:50Z |
| institution | BVB |
| isbn | 9783319775098 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030812067 |
| oclc_num | 1083891776 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | viii, 441 Seiten Illustrationen, Diagramme |
| publishDate | 2018 |
| publishDateSearch | 2018 |
| publishDateSort | 2018 |
| publisher | Springer |
| record_format | marc |
| series | Emergence, complexity and computation |
| series2 | Emergence, complexity and computation |
| spelling | Shortest path solvers from software to wetware Andrew Adamatzky, editor Cham Springer [2018] © 2018 viii, 441 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Emergence, complexity and computation volume 32 A parallel algorithm for the constrained shortest path problem on lattice graphs -- Gathering a Swarm of Robots through Shortest Paths -- The MinSum-MinHop and the MaxMin-MinHop bicriteria path problems -- Distance-Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks -- Influenza Virus Algorithm for Multiobjective Energy Reduction Open Vehicle Routing Problem -- Computng shortest paths with cellular automata -- Cellular Automata Applications in Shortest Path Problem -- Checkerboard Pattern Formed by Cellular Automata Agents -- Do ants use Ant Colony Optimization -- Slime Mould Inspired Models for Path Planning: Collective and Structural Approaches This book offers advanced parallel and distributed algorithms and experimental laboratory prototypes of unconventional shortest path solvers. In addition, it presents novel and unique algorithms of solving shortest problems in massively parallel cellular automaton machines. The shortest path problem is a fundamental and classical problem in graph theory and computer science and is frequently applied in the contexts of transport and logistics, telecommunication networks, virtual reality and gaming, geometry, and social networks analysis. Software implementations include distance-vector algorithms for distributed path computation in dynamics networks, parallel solutions of the constrained shortest path problem, and application of the shortest path solutions in gathering robotic swarms. Massively parallel algorithms utilise cellular automata, where a shortest path is computed either via matrix multiplication in automaton arrays, or via the representation of data graphs in automaton lattices and using the propagation of wave-like patterns. Unconventional shortest path solvers are presented in computer models of foraging behaviour and protoplasmic network optimisation by the slime mould Physarum polycephalum and fluidic devices, while experimental laboratory prototypes of path solvers using chemical media, flows and droplets, and electrical current are also highlighted. The book will be a pleasure to explore for readers from all walks of life, from undergraduate students to university professors, from mathematicians, computers scientists and engineers to chemists and biologists Wetware-Computer (DE-588)1163345113 gnd rswk-swf Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Complexity, Computational Computational intelligence Engineering Kürzester-Weg-Problem (DE-588)4138403-9 s Wetware-Computer (DE-588)1163345113 s DE-604 Adamatzky, Andrew 1965- (DE-588)123369053 edt Erscheint auch als Online-Ausgabe 978-3-319-77510-4 Emergence, complexity and computation volume 32 (DE-604)BV041227294 32 V:DE-601;B:DE-89 application/pdf http://www.gbv.de/dms/tib-ub-hannover/1023630273.pdf Inhaltsverzeichnis Inhaltsverzeichnis |
| spellingShingle | Shortest path solvers from software to wetware Emergence, complexity and computation Wetware-Computer (DE-588)1163345113 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd |
| subject_GND | (DE-588)1163345113 (DE-588)4138403-9 |
| title | Shortest path solvers from software to wetware |
| title_auth | Shortest path solvers from software to wetware |
| title_exact_search | Shortest path solvers from software to wetware |
| title_full | Shortest path solvers from software to wetware Andrew Adamatzky, editor |
| title_fullStr | Shortest path solvers from software to wetware Andrew Adamatzky, editor |
| title_full_unstemmed | Shortest path solvers from software to wetware Andrew Adamatzky, editor |
| title_short | Shortest path solvers |
| title_sort | shortest path solvers from software to wetware |
| title_sub | from software to wetware |
| topic | Wetware-Computer (DE-588)1163345113 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd |
| topic_facet | Wetware-Computer Kürzester-Weg-Problem |
| url | http://www.gbv.de/dms/tib-ub-hannover/1023630273.pdf |
| volume_link | (DE-604)BV041227294 |
| work_keys_str_mv | AT adamatzkyandrew shortestpathsolversfromsoftwaretowetware |