{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T07:01:42Z","timestamp":1775890902822,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T00:00:00Z","timestamp":1581292800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T00:00:00Z","timestamp":1581292800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61503265"],"award-info":[{"award-number":["61503265"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012542","name":"Sichuan Province Science and Technology Support Program","doi-asserted-by":"publisher","award":["2017SZ0096"],"award-info":[{"award-number":["2017SZ0096"]}],"id":[{"id":"10.13039\/100012542","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00500-020-04749-3","type":"journal-article","created":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T06:02:32Z","timestamp":1581314552000},"page":"6139-6150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":91,"title":["An enhanced heuristic ant colony optimization for mobile robot path planning"],"prefix":"10.1007","volume":"24","author":[{"given":"Wenxiang","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1300-6394","authenticated-orcid":false,"given":"Qing","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beifa","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaru","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,10]]},"reference":[{"key":"4749_CR1","doi-asserted-by":"crossref","unstructured":"Benhala B, Kotti M, Ahaitouf A, Fakhfakh M (2015) Backtracking ACO for RF-circuit design optimization. In: Performance optimization techniques in analog, mixed-signal, and radio-frequency circuit design. IGI Global, pp 158\u2013179","DOI":"10.4018\/978-1-4666-6627-6.ch007"},{"key":"4749_CR2","doi-asserted-by":"crossref","unstructured":"Cekmez U, Ozsiginan M, Sahingoz OK (2016) Multi colony ant optimization for UAV path planning with obstacle avoidance. In: International conference on unmanned aircraft systems (ICUAS). IEEE, pp 47\u201352","DOI":"10.1109\/ICUAS.2016.7502621"},{"key":"4749_CR3","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/1932812","author":"G Chen","year":"2019","unstructured":"Chen G, Liu J (2019) Mobile robot path planning using ant colony algorithm and improved potential field method. Comput Intell Neurosci. https:\/\/doi.org\/10.1155\/2019\/1932812","journal-title":"Comput Intell Neurosci"},{"issue":"2","key":"4749_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00521-011-0682-7","volume":"22","author":"X Chen","year":"2013","unstructured":"Chen X, Kong Y, Fang X, Wu Q (2013) A fast two-stage ACO algorithm for robotic path planning. Neural Comput Appl 22(2):313\u2013319","journal-title":"Neural Comput Appl"},{"key":"4749_CR5","doi-asserted-by":"crossref","unstructured":"Deneubourg JL, Clip PL, Camazine SS (1994) Ants, buses and robots-self-organization of transportation systems. In: Proceedings from perception to action conference. IEEE, pp 12\u201323","DOI":"10.1109\/FPA.1994.636078"},{"key":"4749_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.neucom.2012.12.084","volume":"148","author":"X Deng","year":"2015","unstructured":"Deng X, Zhang L, Lin H, Luo L (2015) Pheromone mark ant colony optimization with a hybrid node-based pheromone update strategy. Neurocomputing 148:46\u201353","journal-title":"Neurocomputing"},{"key":"4749_CR7","doi-asserted-by":"crossref","unstructured":"Dorigo M, Di\u00a0Caro G (1999) Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406), vol\u00a02. IEEE, pp 1470\u20131477","DOI":"10.1109\/CEC.1999.782657"},{"issue":"1","key":"4749_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B (Cybern) 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"key":"4749_CR9","doi-asserted-by":"publisher","first-page":"16948","DOI":"10.1109\/ACCESS.2018.2802468","volume":"6","author":"P Friudenberg","year":"2018","unstructured":"Friudenberg P, Koziol S (2018) Mobile robot rendezvous using potential fields combined with parallel navigation. IEEE Access 6:16948\u201316957","journal-title":"IEEE Access"},{"issue":"3","key":"4749_CR10","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1016\/j.asoc.2009.02.014","volume":"9","author":"MP Garcia","year":"2009","unstructured":"Garcia MP, Montiel O, Castillo O, Sep\u00falveda R, Melin P (2009) Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation. Appl Soft Comput 9(3):1102\u20131110","journal-title":"Appl Soft Comput"},{"key":"4749_CR11","unstructured":"Gigras Y, Choudhary K, Gupta K, et\u00a0al (2015) A hybrid ACO-PSO technique for path planning. In: 2nd International conference on computing for sustainable global development (INDIACom). IEEE, pp 1616\u20131621"},{"key":"4749_CR12","doi-asserted-by":"crossref","unstructured":"Habib N, Purwanto D, Soeprijanto A (2016) Mobile robot motion planning by point to point based on modified ant colony optimization and voronoi diagram. In: International seminar on intelligent technology and its applications (ISITIA). IEEE, pp 613\u2013618","DOI":"10.1109\/ISITIA.2016.7828730"},{"key":"4749_CR13","unstructured":"Heegaard PE, Wittner OJ (2006) Restoration performance vs. overhead in a swarm intelligence path management system. In: International workshop on ant colony optimization and swarm intelligence. Springer, pp 282\u2013293"},{"key":"4749_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.asoc.2018.04.023","volume":"68","author":"PB Kumar","year":"2018","unstructured":"Kumar PB, Sahu C, Parhi DR (2018) A hybridized regression-adaptive ant colony optimization approach for navigation of humanoids in a cluttered environment. Appl Soft Comput 68:565\u2013585","journal-title":"Appl Soft Comput"},{"issue":"1","key":"4749_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.asoc.2006.10.012","volume":"8","author":"ZJ Lee","year":"2008","unstructured":"Lee ZJ, Su SF, Chuang CC, Liu KH (2008) Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment. Appl Soft Comput 8(1):55\u201378","journal-title":"Appl Soft Comput"},{"key":"4749_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.rcim.2018.05.008","volume":"54","author":"H Li","year":"2018","unstructured":"Li H, Savkin AV (2018) An algorithm for safe navigation of mobile robots by a sensor network in dynamic cluttered industrial environments. Robot Comput Integr Manuf 54:65\u201382","journal-title":"Robot Comput Integr Manuf"},{"key":"4749_CR17","doi-asserted-by":"crossref","unstructured":"Li X, Tian P (2006) An ant colony system for the open vehicle routing problem. In: International workshop on ant colony optimization and swarm intelligence. Springer, pp 356\u2013363","DOI":"10.1007\/11839088_33"},{"issue":"19","key":"4749_CR18","doi-asserted-by":"publisher","first-page":"5829","DOI":"10.1007\/s00500-016-2161-7","volume":"21","author":"J Liu","year":"2017","unstructured":"Liu J, Yang J, Liu H, Tian X, Gao M (2017) An improved ant colony algorithm for robot path planning. Soft Comput 21(19):5829\u20135839","journal-title":"Soft Comput"},{"issue":"3","key":"4749_CR19","doi-asserted-by":"publisher","first-page":"1940","DOI":"10.1109\/TIE.2018.2833021","volume":"66","author":"RC Luo","year":"2019","unstructured":"Luo RC, Hsiao TJ (2019) Dynamic wireless indoor localization incorporating with an autonomous mobile robot based on an adaptive signal model fingerprinting approach. IEEE Trans Ind Electron 66(3):1940\u20131951","journal-title":"IEEE Trans Ind Electron"},{"key":"4749_CR20","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.robot.2016.08.001","volume":"86","author":"TT Mac","year":"2016","unstructured":"Mac TT, Copot C, Tran DT, De Keyser R (2016) Heuristic approaches in robot path planning: a survey. Robot Auton Syst 86:13\u201328","journal-title":"Robot Auton Syst"},{"key":"4749_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2016.12.005","volume":"33","author":"M Mavrovouniotis","year":"2017","unstructured":"Mavrovouniotis M, Li C, Yang S (2017) A survey of swarm intelligence for dynamic optimization: algorithms and applications. Swarm Evol Comput 33:1\u201317","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"4749_CR22","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1109\/TII.2017.2780247","volume":"14","author":"MS Miah","year":"2018","unstructured":"Miah MS, Knoll J, Hevrdejs K (2018) Intelligent range-only mapping and navigation for mobile robots. IEEE Trans Ind Inform 14(3):1164\u20131174","journal-title":"IEEE Trans Ind Inform"},{"issue":"4","key":"4749_CR23","doi-asserted-by":"publisher","first-page":"1712","DOI":"10.1016\/j.asoc.2007.10.011","volume":"8","author":"C Mou","year":"2008","unstructured":"Mou C, Qing-xian W, Chang-sheng J (2008) A modified ant optimization algorithm for path planning of UCAV. Appl Soft Comput 8(4):1712\u20131718","journal-title":"Appl Soft Comput"},{"key":"4749_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.asoc.2018.11.026","volume":"75","author":"B Patle","year":"2019","unstructured":"Patle B, Parhi D, Jagadeesh A, Kashyap SK (2019) Application of probability to enhance the performance of fuzzy based mobile robot navigation. Appl Soft Comput 75:265\u2013283","journal-title":"Appl Soft Comput"},{"issue":"9","key":"4749_CR25","doi-asserted-by":"crossref","first-page":"4163","DOI":"10.1016\/j.amc.2012.10.097","volume":"219","author":"SU Se\u00e7kiner","year":"2013","unstructured":"Se\u00e7kiner SU, Ero\u011flu Y, Emrullah M, Dereli T (2013) Ant colony optimization for continuous functions by using novel pheromone updating. Appl Math Comput 219(9):4163\u20134175","journal-title":"Appl Math Comput"},{"issue":"2","key":"4749_CR26","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.asoc.2009.08.040","volume":"10","author":"J Yang","year":"2010","unstructured":"Yang J, Zhuang Y (2010) An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem. Appl Soft Comput 10(2):653\u2013660","journal-title":"Appl Soft Comput"},{"key":"4749_CR27","doi-asserted-by":"crossref","unstructured":"Yu L, Wei Z, Wang H, Ding Y, Wang Z (2017) Path planning for mobile robot based on fast convergence ant colony algorithm. In: IEEE international conference on mechatronics and automation (ICMA). IEEE, pp 1493\u20131497","DOI":"10.1109\/ICMA.2017.8016037"},{"key":"4749_CR28","doi-asserted-by":"publisher","first-page":"15140","DOI":"10.1109\/ACCESS.2019.2894626","volume":"7","author":"J Yuan","year":"2019","unstructured":"Yuan J, Wang H, Lin C, Liu D, Yu D (2019) A novel GRU-RNN network model for dynamic path planning of mobile robot. IEEE Access 7:15140\u201315151","journal-title":"IEEE Access"},{"key":"4749_CR29","doi-asserted-by":"crossref","unstructured":"Zhu Q, Wang L (2008) A new algorithm for robot path planning based on scout ant cooperation. In: Fourth international conference on natural computation, ICNC\u201908, vol\u00a07. IEEE, pp 444\u2013449","DOI":"10.1109\/ICNC.2008.185"},{"issue":"8","key":"4749_CR30","doi-asserted-by":"publisher","first-page":"4667","DOI":"10.1016\/j.asoc.2011.07.016","volume":"11","author":"Q Zhu","year":"2011","unstructured":"Zhu Q, Hu J, Cai W, Henschen L (2011) A new robot navigation algorithm for dynamic unknown environments based on dynamic path re-computation and an improved scout ant algorithm. Appl Soft Comput 11(8):4667\u20134676","journal-title":"Appl Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-04749-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-020-04749-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-04749-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T01:05:37Z","timestamp":1612919137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-020-04749-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,10]]},"references-count":30,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["4749"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-04749-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,10]]},"assertion":[{"value":"10 February 2020","order":1,"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":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}