Time-efficient maze routing algorithms on reconfigurable mesh architectures

DOI10.1006/JPDC.1997.1353MaRDI QIDQ1373865zbMATH OpenOpenAlexFDO

Authors J. Ning

Publication date 11 June 1998

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1997.1353

zbMATH Keywords

absolute shortest pathrobot path planningVLSI design

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Parallel maze routing on hypercube computers
• Paths through a maze of rectangles
• An algorithm for finding shortest paths in a maze
• A Maze Routing Algorithm Based on Two Dimensional Cellular Automata

Cited in

(4)

• Orientation in a maze
• Parallel maze routing on hypercube computers
• Paths through a maze of rectangles
• EFFICIENT SIMULATION OF AN ACYCLIC DIRECTED RECONFIGURABLE MODEL ON AN UNDIRECTED RECONFIGURABLE MODEL

This page was built for publication: Time-efficient maze routing algorithms on reconfigurable mesh architectures

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