Advertisement

Shortest Path Solvers. From Software to Wetware

  • Andrew Adamatzky

Part of the Emergence, Complexity and Computation book series (ECC, volume 32)

Table of contents

  1. Front Matter
    Pages i-viii
  2. Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra
    Pages 27-72
  3. Gianlorenzo D’Angelo, Mattia D’Emidio, Daniele Frigioni
    Pages 99-143
  4. Iraklis-Dimitrios Psychas, Eleni Delimpasi, Magdalene Marinaki, Yannis Marinakis
    Pages 145-161
  5. Andrej Brodnik, Marko Grgurovič
    Pages 163-180
  6. Michail-Antisthenis I. Tsompanas, Nikolaos I. Dourvas, Konstantinos Ioannidis, Georgios Ch. Sirakoulis, Rolf Hoffmann, Andrew Adamatzky
    Pages 199-237
  7. Wolfhard von Thienen, Tomer J. Czaczkes
    Pages 265-291
  8. Daniel Irimia
    Pages 365-378
  9. Jitka Čejková, Rita Tóth, Artur Braun, Michal Branicki, Daishin Ueyama, István Lagzi
    Pages 401-408
  10. Simon Ayrinhac
    Pages 409-420
  11. Andrew Adamatzky
    Pages 421-438
  12. Back Matter
    Pages 439-441

About this book

Introduction

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.

 


Keywords

Unconventional Computing Natural Computation Evolutionary Algorithms Genetic Programming Bio-inspired Computing Applied Mathematics Computer Engineering Molecular Computing Artificial Chemistries

Editors and affiliations

  • Andrew Adamatzky
    • 1
  1. 1.Unconventional Computing CentreUniversity of the West of EnglandBristolUnited Kingdom

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-77510-4
  • Copyright Information Springer International Publishing AG, part of Springer Nature 2018
  • Publisher Name Springer, Cham
  • eBook Packages Engineering
  • Print ISBN 978-3-319-77509-8
  • Online ISBN 978-3-319-77510-4
  • Series Print ISSN 2194-7287
  • Series Online ISSN 2194-7295
  • Buy this book on publisher's site
Industry Sectors
Pharma
Biotechnology
Energy, Utilities & Environment
Aerospace
Oil, Gas & Geosciences