{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T22:31:36Z","timestamp":1717194696010},"reference-count":22,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2013,8,9]],"date-time":"2013-08-09T00:00:00Z","timestamp":1376006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"Low-cost robots are characterized by low computational resources and limited energy supply. Path planning algorithms aim to find the optimal path between two points so the robot consumes as little energy as possible. However, these algorithms were not developed considering computational limitations (i.e., processing and memory capacity). This paper presents the HCTNav path-planning algorithm (HCTLab research group\u2019s navigation algorithm). This algorithm was designed to be run in low-cost robots for indoor navigation. The results of the comparison between HCTNav and the Dijkstra\u2019s algorithms show that HCTNav\u2019s memory peak is nine times lower than Dijkstra\u2019s in maps with more than 150,000 cells.<\/jats:p>","DOI":"10.3390\/ijgi2030729","type":"journal-article","created":{"date-parts":[[2013,8,9]],"date-time":"2013-08-09T15:21:13Z","timestamp":1376061673000},"page":"729-748","source":"Crossref","is-referenced-by-count":19,"title":["HCTNav: A Path Planning Algorithm for Low-Cost Autonomous Robot Navigation in Indoor Environments"],"prefix":"10.3390","volume":"2","author":[{"given":"Marco","family":"Pala","sequence":"first","affiliation":[{"name":"Human Computer Technology Laboratory, EPS, Universidad Aut\u00f3noma de Madrid. Francisco Tom\u00e1s y Valiente 11, E-28049 Madrid, Spain"}]},{"given":"Nafiseh","family":"Eraghi","sequence":"additional","affiliation":[{"name":"Human Computer Technology Laboratory, EPS, Universidad Aut\u00f3noma de Madrid. Francisco Tom\u00e1s y Valiente 11, E-28049 Madrid, Spain"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8400-4487","authenticated-orcid":false,"given":"Fernando","family":"L\u00f3pez-Colino","sequence":"additional","affiliation":[{"name":"Human Computer Technology Laboratory, EPS, Universidad Aut\u00f3noma de Madrid. Francisco Tom\u00e1s y Valiente 11, E-28049 Madrid, Spain"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3189-150X","authenticated-orcid":false,"given":"Alberto","family":"Sanchez","sequence":"additional","affiliation":[{"name":"Human Computer Technology Laboratory, EPS, Universidad Aut\u00f3noma de Madrid. Francisco Tom\u00e1s y Valiente 11, E-28049 Madrid, Spain"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-4357-7857","authenticated-orcid":false,"given":"Angel","family":"De Castro","sequence":"additional","affiliation":[{"name":"Human Computer Technology Laboratory, EPS, Universidad Aut\u00f3noma de Madrid. Francisco Tom\u00e1s y Valiente 11, E-28049 Madrid, Spain"}]},{"given":"Javier","family":"Garrido","sequence":"additional","affiliation":[{"name":"Human Computer Technology Laboratory, EPS, Universidad Aut\u00f3noma de Madrid. Francisco Tom\u00e1s y Valiente 11, E-28049 Madrid, Spain"}]}],"member":"1968","published-online":{"date-parts":[[2013,8,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"3324","DOI":"10.1016\/j.cor.2005.03.027","article-title":"Heuristic shortest path algorithms for transportation applications: State of the art","volume":"33","author":"Fu","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Antich, J., Ortiz, A., and Minguez, J. (2009, January 10\u201315). A Bug-Inspired Algorithm for Efficient Anytime Path Planning. Proceedings of the IEEE\/RSJ International Conference on Intelligent Robots and Systems, St. Louis, MO, USA.","DOI":"10.1109\/IROS.2009.5354182"},{"key":"ref_3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. (2001). Introduction to Algorithms, MIT Press. [2nd ed.]."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Idris, M., Bakar, S., Tamil, E., Razak, Z., and Noor, N. (2009, January 25\u201329). High-Speed Shortest Path Co-Processor Design. Proceedings of Third Asia International Conference on Modelling & Simulation, Bali, Indonesia.","DOI":"10.1109\/AMS.2009.91"},{"key":"ref_5","unstructured":"Cain, T. (2003). AI Game Programming Wisdom, Charles River Editors. [2nd ed.]."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Grant, K., and Mould, D. (2008, January 3\u20135). Combining Heuristic and Landmark Search for Path Planning. Proceedings of the Confereunce on Futre Play: Research, Play, Share, Toronto, ON, Canada.","DOI":"10.1145\/1496984.1496987"},{"key":"ref_7","unstructured":"Goto, T., Kosaka, T., and Noborio, H. (2003, January 27\u201331). On the Heuristics of A* or A Algorithm in ITS and Robot Path Planning. Proceedings of IEEE\/RSJ International Conference on Intelligent Robot and Systems, Las Vegas, NV, USA."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Bollobas, B. (1998). Modern Graph Theory, Springer.","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Selamat, A., Zolfpour-Arokhlo, M., and Hashim, S.Z. (2011, January 9\u201312). A Fast Path Planning Algorithm for Route Guidance System. Proceedings of IEEE International Conference on Systems, Man and Cybernetics, Anchorage, AK, USA.","DOI":"10.1109\/ICSMC.2011.6084092"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Langerwisch, M., and Wagner, B. (2011, January 5\u20137). Dynamic Path Planning for Coordinated Motion of multiple Mobile Robots. Proceedings of IEEE International Conference on Intelligent Transportation Systems, Washington, DC, USA.","DOI":"10.1109\/ITSC.2011.6083047"},{"key":"ref_11","unstructured":"Zhou, J., and Lin, H. (2011, January 21\u201325). A Self-Localization and Path Planning Technique for Mobile Robot Navigation. Proceedings of the Intelligent Control and Automation (WCICA), Taipei, China."},{"key":"ref_12","first-page":"2572","article-title":"A new hardware architecture for parallel shortest path searching processor based-on FPGA technology","volume":"1","author":"Alwan","year":"2012","journal-title":"Int. J. Electron. Comput. Sci. Eng."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Jiang, Z., and Wu, J. (2007, January 26\u201330). On Achieving the Shortest-Path Routing in 2-D Meshes. Proceedings of the Parallel and Distributed Processing Symposium, Long Beach, CA, USA.","DOI":"10.1109\/IPDPS.2007.370463"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/BF01840369","article-title":"Path-planning strategies for a point mobile automaton moving amidst obstacles of arbitrary shape","volume":"2","author":"Lumelsky","year":"1987","journal-title":"Algorithmica"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1109\/21.59969","article-title":"Incorporating range sensing in the robot navigation function","volume":"2","author":"Lumelsky","year":"1990","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1109\/70.650160","article-title":"Sensory-based motion planning with global proofs","volume":"13","author":"Kamon","year":"1997","journal-title":"IEEE Trans. Robot. Autom."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/j.robot.2011.02.004","article-title":"Adaptive navigation for autonomous robots","volume":"59","author":"Knudson","year":"2011","journal-title":"Auton. Robots"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Sharef, S.M., Sa\u2019id, W.K., and Khoshaba, F.S. (2010, January 27\u201330). A Rule-Based System for Trajectory Planning of an Indoor Mobile Robot. Proceedings of the International Multi-Conference on Systems Signals and Devices, Amman, Jordan.","DOI":"10.1109\/SSD.2010.5585504"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Yu, N., and Ma, C. (2011, January 17\u201318). Mobile Robot Map Building Based on Cellular Automata. Proceedings of the Pacific-Asia Conference on Circuits, Communications and System, Wuhan, China.","DOI":"10.1109\/PACCS.2011.5990224"},{"key":"ref_20","unstructured":"Gonzalez-Arjona, D., Sanchez, A., de Castro, A., and Garrido, J. (2011, January 16\u201318). Occupancy-Grid Indoor Mapping Using FPGA-Based Mobile Robots. Proceedings of the Conference on Design of Circuits and Integrated Systems, Albufeira, Portugal."},{"key":"ref_21","unstructured":"Buckland, M. (2005). Programming Game AI by Example, Wordware Publishing. [1st ed.]."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1147\/sj.41.0025","article-title":"Algorithm for computer control of a digital plotter","volume":"4","author":"Bresenham","year":"1965","journal-title":"IBM Syst. J."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/2\/3\/729\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T19:31:05Z","timestamp":1717183865000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/2\/3\/729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,9]]},"references-count":22,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2013,9]]}},"alternative-id":["ijgi2030729"],"URL":"https:\/\/doi.org\/10.3390\/ijgi2030729","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,9]]}}}