Architecturally-efficient computation of shortest paths for a mobile robot

The computation of shortest path for a mobile robot to get to a destination is considered in this paper. An architecturally-efficient solution is presented for this problem. Results of implementation in Xilinx Virtex FPGA are promising: the solution operates at approximately 72 MHz and the implementation for a graph with 40 nodes and 52 edges fits in one XCV3200E-FG1156 device.

[1]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[3]  Víctor Blanco,et al.  Design of Embedded DSP-Based Fuzzy Controllers for Autonomous Mobile Robots , 2008, IEEE Transactions on Industrial Electronics.

[4]  Kouhei Ohnishi,et al.  Improvement of Performances in Bilateral Teleoperation by Using FPGA , 2007, IEEE Transactions on Industrial Electronics.

[5]  María José Moure,et al.  Features, Design Tools, and Application Domains of FPGAs , 2007, IEEE Transactions on Industrial Electronics.

[6]  Eric Monmasson,et al.  FPGA Design Methodology for Industrial Control Systems—A Review , 2007, IEEE Transactions on Industrial Electronics.

[7]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .