• Feb 07, 2023 News!JACN will adopt Article-by-Article Work Flow. The benefit of article-by-article workflow is that a delay with one article may not delay the entire issue. Once a paper steps into production, it will be published online soon.   [Click]
  • May 30, 2022 News!JACN Vol.10, No.1 has been published with online version.   [Click]
  • Dec 24, 2021 News!Volume 9 No 1 has been indexed by EI (inspec)!   [Click]
General Information
    • ISSN: 1793-8244 (Print)
    • Abbreviated Title:  J. Adv. Comput. Netw.
    • Frequency: Semiyearly
    • DOI: 10.18178/JACN
    • Editor-in-Chief: Professor Haklin Kimm
    • Executive Editor: Ms. Cherry Chan
    • Abstracting/ Indexing: EBSCO, ProQuest, and Google Scholar.
    • E-mail: jacn@ejournal.net
    • APC: 500USD
Professor Haklin Kimm
East Stroudsburg University, USA
I'm happy to take on the position of editor in chief of JACN. We encourage authors to submit papers on all aspects of computer networks.

JACN 2013 Vol.1(3): 189-193 ISSN: 1793-8244
DOI: 10.7763/JACN.2013.V1.38

An Improved Minimum-Cost Pathfinding Algorithm for Mobile Robot Navigation

Yung-Fu Hsu, Chun-Hao Huang, Way-Ren Huang, and Woei-Chyn Chu

Abstract—In this paper, we present an effective pathfinding algorithm for mobile robot navigation. The algorithm stem is from the A* algorithm that can perform minimum-cost path navigation with the added obstacles avoidance capability. A set of passive RFID tags placed on the Cartesian grids where used for location identification. During navigation, the RFID reader attached on the mobile robot receives its nearby RFID tags’ ID to determine the robot’s current position, and use it to formulate the minimum-cost path that goes from the present location to the target point. The devised path is a set of connected RFID tags computed by the A* algorithm. The proposed improved A* algorithm explored a heuristic search of the minimal cost navigation path that taking into consideration of the presence of obstacles so that the devised optimal path would not collide with the obstacles. Passive RFID tags have the advantages of low cost, providing unequivocal coordinate information, fast computation and easy deployment.

Index Terms—Pathfinding, A* algorithm, robot navigation, passive RFID.

The authors are with the National Yang Ming University, Beitou, Taipei 11221 Taiwan (e-mail: d49904010 @ym.edu.tw, jim90486@hotmail.com, g39604042@gmail.com, wchu@ym.edu.tw).


Cite:Yung-Fu Hsu, Chun-Hao Huang, Way-Ren Huang, and Woei-Chyn Chu, "An Improved Minimum-Cost Pathfinding Algorithm for Mobile Robot Navigation," Journal of Advances in Computer Networks vol. 1, no. 3, pp. 189-193, 2013.

Copyright © 2008-2024. Journal of Advances in Computer Networks.  All rights reserved.
E-mail: jacn@ejournal.net