{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T22:06:12Z","timestamp":1778537172917,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T00:00:00Z","timestamp":1580774400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T00:00:00Z","timestamp":1580774400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004595","name":"Universiti Sains Malaysia","doi-asserted-by":"publisher","award":["Publication Fund"],"award-info":[{"award-number":["Publication Fund"]}],"id":[{"id":"10.13039\/501100004595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00521-020-04764-3","type":"journal-article","created":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T18:02:47Z","timestamp":1580839367000},"page":"13155-13171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Adaptive path finding algorithm in dynamic environment for warehouse robot"],"prefix":"10.1007","volume":"32","author":[{"given":"Mun-Kit","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1750-7441","authenticated-orcid":false,"given":"Yung-Wey","family":"Chong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwang-man","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-Hoon","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Beng","family":"Leau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,4]]},"reference":[{"key":"4764_CR1","unstructured":"Dubois J, Hamilton R (2017) The team who created Amazon\u2019s warehouse robots returns with a new robot named Chuck. Retrieved from https:\/\/www.cnbc.com\/2017\/07\/26\/6-river-systems-former-kiva-execs-build-warehouse-robot.html"},{"key":"4764_CR2","unstructured":"Markets and Markets (2017) Warehouse robotics market by type mobile, articulated, cylindrical, SCARA, parallel & Cartesian. Retrieved from https:\/\/www.marketsandmarkets.com\/Market-Reports\/warehouse-robotic-market-128876258.html"},{"key":"4764_CR3","unstructured":"Ganeshmurthy M, Suresh G (2017) Path planning algorithm for autonomous mobile robot in dynamic environment. In: 2015 3rd International conference in signal processing, communication and networking (ICSCN), pp 1\u20136"},{"key":"4764_CR4","unstructured":"Ferguson D, Likhachev M, Stentz A (2005) A guide to heuristic-based path planning. In: Proceedings of the international workshop on planning under uncertainty for autonomous systems at international conference on automated planning and scheduling (ICAPS), pp 9\u201318"},{"key":"4764_CR5","doi-asserted-by":"crossref","unstructured":"Sariff N, Buniyamin N (2006) An overview of autonomous mobile robot path planning algorithms. In: 2006 4th student conference on research and development, pp 183\u2013188","DOI":"10.1109\/SCORED.2006.4339335"},{"key":"4764_CR6","doi-asserted-by":"crossref","unstructured":"Silva JB, Siebra CA, do Nascimento TP (2015) A new cost function heuristic applied to A* based path planning in static and dynamic environments. In: 2015 12th Latin American robotics symposium and 2015 3rd Brazilian symposium on robotics (LARS-SBR), pp 37\u201342","DOI":"10.1109\/LARS-SBR.2015.35"},{"issue":"14","key":"4764_CR7","first-page":"1","volume":"5","author":"A Atyabi","year":"2013","unstructured":"Atyabi A (2013) Powers DM (2013) Review of classical and heuristic-based navigation and path planning approaches. Int J Adv Comput Technol 5(14):1","journal-title":"Int J Adv Comput Technol"},{"key":"4764_CR8","volume-title":"Artificial intelligence: a modern approach","author":"SJ Russell","year":"2009","unstructured":"Russell SJ, Norvig P (2009) Artificial intelligence: a modern approach. Pearson Education Limited, New Delhi"},{"key":"4764_CR9","volume-title":"A survey of machine learning approaches to robotic path-planning","author":"MW Otte","year":"2015","unstructured":"Otte MW (2015) A survey of machine learning approaches to robotic path-planning. University of Colorado at Boulder, Boulder"},{"key":"4764_CR10","unstructured":"Games RB (2014) Introduction to A*. Retrieved from https:\/\/www.redblobgames.com\/pathfinding\/a-star\/introduction.html"},{"issue":"1","key":"4764_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"4764_CR12","unstructured":"Reddy H (2013) Path finding\u2014Dijkstra\u2019s and A* algorithm\u2019s. Int J IT Eng 1\u201315. Retrieved from http:\/\/cs.indstate.edu\/hgopireddy\/algor.pdf"},{"issue":"2","key":"4764_CR13","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100\u2013107","journal-title":"IEEE Trans Syst Sci Cybern"},{"key":"4764_CR14","unstructured":"Wang W, Ye S (2000) Principle and application of artificial intelligence. Electronic Industries Publishing Company"},{"issue":"5","key":"4764_CR15","first-page":"475","volume":"24","author":"L Li","year":"2002","unstructured":"Li L, Tao Y, Langton C (2002) Current situation and future of researching move robot technology. Robot 24(5):475\u2013480","journal-title":"Robot"},{"key":"4764_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.proeng.2014.12.098","volume":"96","author":"F Duchon","year":"2014","unstructured":"Duchon F, Babinec A, Kajan M, Beno P, Florek M, Fico T, Juri\u0161ica L (2014) Path planning with modified a star algorithm for a mobile robot. Procedia Eng 96:59\u201369","journal-title":"Procedia Eng"},{"key":"4764_CR17","doi-asserted-by":"crossref","unstructured":"Abiyev RH, Arslan M, Gunsel I, Cagman A (2017) Robot pathfinding using vision based obstacle detection. In: 3rd IEEE international conference on cybernetics (CYBCONF), pp 1\u20136","DOI":"10.1109\/CYBConf.2017.7985805"},{"key":"4764_CR18","unstructured":"Koenig S, Likhachev M (2002) D* Lite. In: Eighteenth national conference on artificial intelligence, pp 476\u2013483"},{"key":"4764_CR19","doi-asserted-by":"crossref","unstructured":"Bay H, Tuytelaars T, Van Gool L (2006) SURF: speeded up robust features. In: European conference on computer vision, pp 404\u2013417","DOI":"10.1007\/11744023_32"},{"key":"4764_CR20","unstructured":"Muja M, Lowe DG (2009) Fast approximate nearest neighbors with automatic algorithm configuration. In: International conference on computer vision theory and applications (VISAPP\u201909), pp 331\u2013340"},{"key":"4764_CR21","unstructured":"OpenCV (2017) Thresholding with OpenCV. Retrieved from https:\/\/docs.opencv.org\/3.4.0\/d7\/d4d\/tutorial_py_thresholding.html"},{"key":"4764_CR22","unstructured":"KaewTraKulPong P, Bowden R (2001) An improved adaptive background mixture model for real-time tracking with shadow detection. In: 2nd European workshop on advanced video based surveillance systems (AVBS01), pp 1\u20135"},{"issue":"3","key":"4764_CR23","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/TPAMI.2014.2345390","volume":"37","author":"JF Henriques","year":"2014","unstructured":"Henriques JF, Caseiro R, Martins P, Batista J (2014) High-speed tracking with kernelized correlation filters. IEEE Trans Pattern Anal Mach Intell 37(3):583\u2013596","journal-title":"IEEE Trans Pattern Anal Mach Intell"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-04764-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-020-04764-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-04764-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T01:04:53Z","timestamp":1612314293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-020-04764-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,4]]},"references-count":23,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["4764"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-04764-3","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,4]]},"assertion":[{"value":"2 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}