Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

GERARD: GEneral RApid Resolution of Digital Mazes Using a Memristor Emulator

Version 1 : Received: 2 December 2021 / Approved: 3 December 2021 / Online: 3 December 2021 (10:08:55 CET)

A peer-reviewed article of this Preprint also exists.

Dopazo, P.; de Benito, C.; Camps, O.; Stavrinides, S.G.; Picos, R. GERARD: GEneral RApid Resolution of Digital Mazes Using a Memristor Emulator. Physics 2021, 4, 1–11, doi:10.3390/physics4010001. Dopazo, P.; de Benito, C.; Camps, O.; Stavrinides, S.G.; Picos, R. GERARD: GEneral RApid Resolution of Digital Mazes Using a Memristor Emulator. Physics 2021, 4, 1–11, doi:10.3390/physics4010001.

Abstract

In this paper, a system of searching for optimal paths is developed and concreted on a FPGA. It is based on a memristive emulator, used as a delay element, by configuring the test graph as a memristor network. A parallel algorithm is applied to reduce computing time and increase efficiency. The operation of the algorithm in Matlab is checked beforehand and then exported to two different Intel FPGAs: a DE0-Nano board and an Arria 10 GX 220 FPGA. In both cases reliable results are obtained quickly and conveniently, even for the case of a 300x300 nodes maze.

Keywords

Memristor; memristive grid; maze solving; shortest path; programmable devices.

Subject

Engineering, Electrical and Electronic Engineering

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.