Shortest Path Solvers. From Software to Wetware

Häftad, Engelska, 2019

Del 32 i serien Emergence, Complexity and Computation

1 066 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2019-01-05
Mått:155 x 235 x 25 mm
Vikt:680 g
Format:Häftad
Språk:Engelska
Serie:Emergence, Complexity and Computation
Antal sidor:441
Förlag:Springer Nature Switzerland AG
ISBN:9783030084738

Utforska kategorier

Innehållsförteckning

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.