Editors:
- Comprehensively addresses the famous problem of shortest path solving in the context of computer science, network theory, operational systems, swarm robotics, and graph theory
- Presents novel and unique algorithms of solving shortest problems in massively parallel cellular automaton machines, graphs populated with mobile automata, and the imitated foraging behaviour of slime moulds
- Discusses unconventional prototypes of experimental laboratory shortest path solvers using chemical systems, electrical current, single living cells, and plants
- Includes unique contributions prepared by the world’s leading experts in computer science, engineering, applied mathematics, chemistry, physics, and biology
- Richly illustrated: its wealth of graphical examples will appeal not only to scientists but also to engineers, industry representatives, and the general public
Part of the book series: Emergence, Complexity and Computation (ECC, volume 32)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (17 chapters)
-
Front Matter
-
Back Matter
About this book
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.
Editors and Affiliations
-
Unconventional Computing Centre, University of the West of England, Bristol, United Kingdom
Andrew Adamatzky
Bibliographic Information
Book Title: Shortest Path Solvers. From Software to Wetware
Editors: Andrew Adamatzky
Series Title: Emergence, Complexity and Computation
DOI: https://doi.org/10.1007/978-3-319-77510-4
Publisher: Springer Cham
eBook Packages: Engineering, Engineering (R0)
Copyright Information: Springer International Publishing AG, part of Springer Nature 2018
Hardcover ISBN: 978-3-319-77509-8Published: 07 May 2018
Softcover ISBN: 978-3-030-08473-8Published: 05 January 2019
eBook ISBN: 978-3-319-77510-4Published: 26 April 2018
Series ISSN: 2194-7287
Series E-ISSN: 2194-7295
Edition Number: 1
Number of Pages: VIII, 441
Number of Illustrations: 97 b/w illustrations, 90 illustrations in colour
Topics: Complexity, Computational Intelligence