000 04279nam a22005655i 4500
001 978-3-319-77510-4
003 DE-He213
005 20220801220456.0
007 cr nn 008mamaa
008 180426s2018 sz | s |||| 0|eng d
020 _a9783319775104
_9978-3-319-77510-4
024 7 _a10.1007/978-3-319-77510-4
_2doi
050 4 _aTA352-356
050 4 _aQC20.7.N6
072 7 _aTBJ
_2bicssc
072 7 _aGPFC
_2bicssc
072 7 _aTEC009000
_2bisacsh
072 7 _aTBJ
_2thema
072 7 _aGPFC
_2thema
082 0 4 _a515.39
_223
245 1 0 _aShortest Path Solvers. From Software to Wetware
_h[electronic resource] /
_cedited by Andrew Adamatzky.
250 _a1st ed. 2018.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2018.
300 _aVIII, 441 p. 187 illus., 90 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aEmergence, Complexity and Computation,
_x2194-7295 ;
_v32
505 0 _aA 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 _aThis 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 _aDynamics.
_950521
650 0 _aNonlinear theories.
_93339
650 0 _aComputational intelligence.
_97716
650 1 4 _aApplied Dynamical Systems.
_932005
650 2 4 _aComputational Intelligence.
_97716
700 1 _aAdamatzky, Andrew.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_950522
710 2 _aSpringerLink (Online service)
_950523
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319775098
776 0 8 _iPrinted edition:
_z9783319775111
776 0 8 _iPrinted edition:
_z9783030084738
830 0 _aEmergence, Complexity and Computation,
_x2194-7295 ;
_v32
_950524
856 4 0 _uhttps://doi.org/10.1007/978-3-319-77510-4
912 _aZDB-2-ENG
912 _aZDB-2-SXE
942 _cEBK
999 _c78608
_d78608