A Maze Routing Algorithm Based on Two Dimensional Cellular Automata

DOI10.1007/11861201_65zbMATH Open1155.68460OpenAlexW1488115238MaRDI QIDQ3540022

Author name not available (Why is that?)

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11861201_65

zbMATH Keywords

cellular automataparallel algorithmroutingphysical designmaze routing algorithm

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Explicit routing schemes for implementation of cellular automata on processor arrays 👍 👎
• A cellular automaton that computes shortest paths in grid graph 👍 👎
• An algorithm for finding shortest paths in a maze 👍 👎
• CELLULAR AUTOMATA AND OPTIMAL PATH PLANNING 👍 👎
• Un algoritmo estocástico para resolver laberintos 👍 👎
• Online Multi-path Routing in a Maze 👍 👎
• A 2-DIMENSIONAL CELLULAR AUTOMATON FOR AGENTS MOVING FROM ORIGINS TO DESTINATIONS 👍 👎

This page was built for publication: A Maze Routing Algorithm Based on Two Dimensional Cellular Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540022)