國立虎尾科技大學 |

Shortest Path Solvers. From Software to Wetware

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Shortest Path Solvers. From Software to Wetware/ edited by Andrew Adamatzky.
other author:	Adamatzky, Andrew.
Description:	VIII, 441 p. 187 illus., 90 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computational complexity. -
Online resource:	https://doi.org/10.1007/978-3-319-77510-4
ISBN:	9783319775104

Shortest Path Solvers. From Software to Wetware
Shortest Path Solvers. From Software to Wetware[electronic resource] /edited by Andrew Adamatzky. - 1st ed. 2018. - VIII, 441 p. 187 illus., 90 illus. in color.online resource. - Emergence, Complexity and Computation,322194-7287 ;. - Emergence, Complexity and Computation,12.

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 -- Inﬂuenza 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. .

ISBN: 9783319775104

Standard No.: 10.1007/978-3-319-77510-4doiSubjects--Topical Terms:

527777
Computational complexity.

LC Class. No.: QA267.7

Dewey Class. No.: 620

Shortest Path Solvers. From Software to Wetware
LDR:03692nam a22004095i 4500 001 992661
003 DE-He213
005 20200702122931.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319775104 $9 978-3-319-77510-4
024 7 $a 10.1007/978-3-319-77510-4 $2 doi
035 $a 978-3-319-77510-4
050 4 $a QA267.7
072 7 $a GPFC $2 bicssc
072 7 $a TEC009000 $2 bisacsh
072 7 $a GPFC $2 thema
082 0 4 $a 620 $2 23
245 1 0 $a Shortest Path Solvers. From Software to Wetware $h [electronic resource] / $c edited by Andrew Adamatzky.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a VIII, 441 p. 187 illus., 90 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Emergence, Complexity and Computation, $x 2194-7287 ; $v 32
505 0 $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 -- Inﬂuenza 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 $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 $a Computational complexity. $3 527777
650 0 $a Computational intelligence. $3 568984
650 1 4 $a Complexity. $3 669595
650 2 4 $a Computational Intelligence. $3 768837
700 1 $a Adamatzky, Andrew. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 670221
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319775098
776 0 8 $i Printed edition: $z 9783319775111
776 0 8 $i Printed edition: $z 9783030084738
830 0 $a Emergence, Complexity and Computation, $x 2194-7287 ; $v 12 $3 1254548
856 4 0 $u https://doi.org/10.1007/978-3-319-77510-4
912 $a ZDB-2-ENG
912 $a ZDB-2-SXE
950 $a Engineering (SpringerNature-11647)
950 $a Engineering (R0) (SpringerNature-43712)