{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T22:08:17Z","timestamp":1784153297626,"version":"3.55.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T00:00:00Z","timestamp":1671148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T00:00:00Z","timestamp":1671148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10845-022-02056-2","type":"journal-article","created":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T10:03:13Z","timestamp":1671184993000},"page":"587-612","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["A novel hybrid framework for single and multi-robot path planning in a complex industrial environment"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8290-406X","authenticated-orcid":false,"given":"Sunil","family":"Kumar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Afzal","family":"Sikander","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,16]]},"reference":[{"key":"2056_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.07.015","author":"B Akay","year":"2012","unstructured":"Akay, B., & Karaboga, D. (2012). A modified Artificial Bee Colony algorithm for real-parameter optimization. Information Sciences. https:\/\/doi.org\/10.1016\/j.ins.2010.07.015","journal-title":"Information Sciences"},{"key":"2056_CR2","doi-asserted-by":"publisher","first-page":"462","DOI":"10.3182\/20140313-3-IN-3024.00245","volume":"47","author":"T Bera","year":"2014","unstructured":"Bera, T., Bhat, M. S., & Ghose, D. (2014). Analysis of obstacle based probabilistic roadmap method using geometric probability. IFAC Proceedings Volumes, 47, 462\u2013469. https:\/\/doi.org\/10.3182\/20140313-3-IN-3024.00245","journal-title":"IFAC Proceedings Volumes"},{"key":"2056_CR3","doi-asserted-by":"publisher","unstructured":"Bhattacharjee, P., Rakshit, P., Goswami, I., Konar, A., & Nagar, A. K. (2011). Multi-robot path-planning using artificial bee colony optimization algorithm. In Proceedings of the 2011 3rd World Congress on Nature and Biologically Inspired Computing, NaBIC 2011. https:\/\/doi.org\/10.1109\/NaBIC.2011.6089601","DOI":"10.1109\/NaBIC.2011.6089601"},{"key":"2056_CR4","doi-asserted-by":"publisher","unstructured":"Chiang, H., Malone, N., Lesser, K., Oishi, M., & Tapia, L. (2015). Path-guided artificial potential fields with stochastic reachable sets for motion planning in highly dynamic environments. In IEEE international conference on robotics and automation (ICRA) (pp. 2347\u20132354). https:\/\/doi.org\/10.1109\/ICRA.2015.71395112347-2354.","DOI":"10.1109\/ICRA.2015.71395112347-2354"},{"key":"2056_CR5","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.robot.2005.09.002","volume":"53","author":"CM Clark","year":"2005","unstructured":"Clark, C. M. (2005). Probabilistic Road Map sampling strategies for multi-robot motion planning. Robotics and Autonomous Systems, 53, 244\u2013264. https:\/\/doi.org\/10.1016\/j.robot.2005.09.002","journal-title":"Robotics and Autonomous Systems"},{"key":"2056_CR6","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.asoc.2015.01.067","volume":"30","author":"MA Contreras-Cruz","year":"2015","unstructured":"Contreras-Cruz, M. A., Ayala-Ramirez, V., & Hernandez-Belmonte, U. H. (2015). Mobile robot path planning using artificial bee colony and evolutionary programming. Applied Soft Computing, 30, 319\u2013328. https:\/\/doi.org\/10.1016\/j.asoc.2015.01.067","journal-title":"Applied Soft Computing"},{"issue":"1","key":"2056_CR7","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1016\/j.asoc.2012.07.023","volume":"13","author":"M Davoodi","year":"2013","unstructured":"Davoodi, M., Panahi, F., Mohades, A., & Hashemi, S. N. (2013). Multi-objective path planning in discrete space. Applied Soft Computing Journal, 13(1), 709\u2013720. https:\/\/doi.org\/10.1016\/j.asoc.2012.07.023","journal-title":"Applied Soft Computing Journal"},{"key":"2056_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"271","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 271, 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"2056_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s11370-017-0244-7","volume":"11","author":"AQ Faridi","year":"2018","unstructured":"Faridi, A. Q., Sharma, S., Shukla, A., Tiwari, R., & Dhar, J. (2018). Multi-robot multi-target dynamic path planning using artificial bee colony and evolutionary programming in unknown environment. Intelligent Service Robotics, 11, 171\u2013186. https:\/\/doi.org\/10.1007\/s11370-017-0244-7","journal-title":"Intelligent Service Robotics"},{"key":"2056_CR10","volume-title":"Intelligence through simulated evolution : Forty years of evolutionary programming","author":"LJ Fogel","year":"1999","unstructured":"Fogel, L. J. (1999). Intelligence through simulated evolution\u202f: Forty years of evolutionary programming. Hoboken: Wiley."},{"key":"2056_CR11","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.robot.2011.12.004","volume":"60","author":"N Ghita","year":"2012","unstructured":"Ghita, N., & Kloetzer, M. (2012). Trajectory planning for a car-like robot by environment abstraction. Robotics and Autonomous Systems, 60, 609\u2013619. https:\/\/doi.org\/10.1016\/j.robot.2011.12.004","journal-title":"Robotics and Autonomous Systems"},{"issue":"7","key":"2056_CR12","doi-asserted-by":"publisher","first-page":"7873","DOI":"10.1007\/s12652-020-02514-w","volume":"12","author":"F Gul","year":"2021","unstructured":"Gul, F., Rahiman, W., Ahmad, S. S. N. A., Imran, A., & Abdul, M. (2021). Meta - heuristic approach for solving multi - objective path planning for autonomous guided robot using PSO \u2013 GWO optimization algorithm with evolutionary programming. Journal of Ambient Intelligence and Humanized Computing, 12(7), 7873\u20137890. https:\/\/doi.org\/10.1007\/s12652-020-02514-w","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"key":"2056_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.robot.2014.07.002","volume":"64","author":"MA Hossain","year":"2015","unstructured":"Hossain, M. A., & Ferdous, I. (2015). Autonomous robot path planning in dynamic environment using a new optimization technique inspired by bacterial foraging technique. Robotics and Autonomous Systems, 64, 137\u2013141. https:\/\/doi.org\/10.1016\/j.robot.2014.07.002","journal-title":"Robotics and Autonomous Systems"},{"issue":"4","key":"2056_CR14","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1007\/s10845-010-0404-5","volume":"23","author":"M Kapanoglu","year":"2012","unstructured":"Kapanoglu, M., Alikalfa, M., Ozkan, M., Yaz\u0131c\u0131, A., & Parlaktuna, O. (2012). A pattern-based genetic algorithm for multi-robot coverage path planning minimizing completion time. Journal of Intelligent Manufacturing, 23(4), 1035\u20131045. https:\/\/doi.org\/10.1007\/s10845-010-0404-5","journal-title":"Journal of Intelligent Manufacturing"},{"key":"2056_CR15","unstructured":"Karaboga, D. (2005). An idea based on Honey Bee Swarm for Numerical Optimization. Technical Report TR06, Erciyes University."},{"issue":"4","key":"2056_CR16","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki, L. E., \u0160vestka, P., Latombe, J. C., & Overmars, M. H. (1996). Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4), 566\u2013580. https:\/\/doi.org\/10.1109\/70.508439","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"3","key":"2056_CR17","doi-asserted-by":"publisher","first-page":"3519","DOI":"10.1007\/s13369-021-06326-8","volume":"47","author":"S Kumar","year":"2022","unstructured":"Kumar, S., & Sikander, A. (2022a). Optimum mobile robot path planning using improved artificial bee colony algorithm and evolutionary programming. Arabian Journal for Science and Engineering, 47(3), 3519\u20133539. https:\/\/doi.org\/10.1007\/s13369-021-06326-8","journal-title":"Arabian Journal for Science and Engineering"},{"key":"2056_CR18","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2022.2104840","author":"S Kumar","year":"2022","unstructured":"Kumar, S., & Sikander, A. (2022b). A modified probabilistic roadmap algorithm for efficient mobile robot path planning. Engineering Optimization. https:\/\/doi.org\/10.1080\/0305215X.2022.2104840","journal-title":"Engineering Optimization"},{"issue":"1","key":"2056_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2003.816583","volume":"8","author":"C Lee","year":"2004","unstructured":"Lee, C., & Yao, X. (2004). Based on the L\u00e9vy probability distribution. IEEE Transactions on Evolutionary Computation, 8(1), 1\u201313. https:\/\/doi.org\/10.1109\/TEVC.2003.816583","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"5","key":"2056_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-016-9115-2","volume":"61","author":"G Li","year":"2018","unstructured":"Li, G., & Chou, W. (2018). Path planning for mobile robot using self-adaptive learning particle swarm optimization. Science China Information Sciences, 61(5), 1\u201318. https:\/\/doi.org\/10.1007\/s11432-016-9115-2","journal-title":"Science China Information Sciences"},{"issue":"2","key":"2056_CR21","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10845-018-1459-y","volume":"31","author":"Z Li","year":"2020","unstructured":"Li, Z., Barenji, A. V., Jiang, J., Zhong, R. Y., & Xu, G. (2020). A mechanism for scheduling multi robot intelligent warehouse system face with dynamic demand. Journal of Intelligent Manufacturing, 31(2), 469\u2013480. https:\/\/doi.org\/10.1007\/s10845-018-1459-y","journal-title":"Journal of Intelligent Manufacturing"},{"key":"2056_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2014.09.006","author":"JH Liang","year":"2015","unstructured":"Liang, J. H., & Lee, C. H. (2015). Efficient collision-free path-planning of multiple mobile robots system using efficient artificial bee colony algorithm. Advances in Engineering Software. https:\/\/doi.org\/10.1016\/j.advengsoft.2014.09.006","journal-title":"Advances in Engineering Software"},{"issue":"6","key":"2056_CR24","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1007\/s00521-019-04172-2","volume":"32","author":"Q Luo","year":"2020","unstructured":"Luo, Q., Wang, H., Zheng, Y., & He, J. (2020). Research on path planning of mobile robot based on improved ant colony algorithm. Neural Computing and Applications, 32(6), 1555\u20131566. https:\/\/doi.org\/10.1007\/s00521-019-04172-2","journal-title":"Neural Computing and Applications"},{"key":"2056_CR25","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.asoc.2017.05.012","volume":"59","author":"TT Mac","year":"2017","unstructured":"Mac, T. T., Copot, C., Tran, D. T., & Keyser, R. D. (2017). A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization. Applied Soft Computing Journal, 59, 68\u201376. https:\/\/doi.org\/10.1016\/j.asoc.2017.05.012","journal-title":"Applied Soft Computing Journal"},{"key":"2056_CR26","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/0952813X.2014.971442","volume":"28","author":"PK Mohanty","year":"2016","unstructured":"Mohanty, P. K., & Parhi, D. R. (2016). Optimal path planning for a mobile robot using cuckoo search algorithm. Journal of Experimental and Theoretical Artificial Intelligence, 28, 35\u201352. https:\/\/doi.org\/10.1080\/0952813X.2014.971442","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"issue":"8\u20139","key":"2056_CR27","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1163\/156855312X633075","volume":"26","author":"B Park","year":"2012","unstructured":"Park, B., Choi, J., & Chung, W. K. (2012). Roadmap coverage improvement using a node rearrangement method for mobile robot path planning. Advanced Robotics, 26(8\u20139), 989\u20131012. https:\/\/doi.org\/10.1163\/156855312X633075","journal-title":"Advanced Robotics"},{"issue":"4","key":"2056_CR28","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.dt.2019.04.011","volume":"15","author":"BK Patle","year":"2019","unstructured":"Patle, B. K., Ganesh Babu, L., Pandey, A., Parhi, D. R. K., & Jagadeesh, A. (2019). A review\u202f: On path planning strategies for navigation of mobile robot. Defence Technology, 15(4), 582\u2013606. https:\/\/doi.org\/10.1016\/j.dt.2019.04.011","journal-title":"Defence Technology"},{"key":"2056_CR29","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.neucom.2013.04.020","volume":"120","author":"H Qu","year":"2013","unstructured":"Qu, H., Xing, K., & Alexander, T. (2013). An improved genetic algorithm with co-evolutionary strategy for global path planning of multiple mobile robots. Neurocomputing, 120, 509\u2013517. https:\/\/doi.org\/10.1016\/j.neucom.2013.04.020","journal-title":"Neurocomputing"},{"issue":"2","key":"2056_CR30","doi-asserted-by":"publisher","first-page":"1631","DOI":"10.1016\/j.asoc.2010.05.002","volume":"11","author":"K Samsudin","year":"2011","unstructured":"Samsudin, K., Ahmad, F. A., & Mashohor, S. (2011). A highly interpretable fuzzy rule base using ordinal structure for obstacle avoidance of mobile robot. Applied Soft Computing, 11(2), 1631\u20131637. https:\/\/doi.org\/10.1016\/j.asoc.2010.05.002","journal-title":"Applied Soft Computing"},{"issue":"3","key":"2056_CR31","doi-asserted-by":"publisher","first-page":"86","DOI":"10.5772\/63812","volume":"13","author":"B Tang","year":"2016","unstructured":"Tang, B., Zhu, Z., & Luo, J. (2016). Hybridizing particle swarm optimization and differential evolution for the mobile robot global path planning. International Journal of Advanced Robotic Systems, 13(3), 86. https:\/\/doi.org\/10.5772\/63812","journal-title":"International Journal of Advanced Robotic Systems"},{"issue":"1","key":"2056_CR32","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/4235.585889","volume":"1","author":"J Xiao","year":"1997","unstructured":"Xiao, J., Michalewicz, Z., Zhang, L., & Trojanowski, K. (1997). Adaptive evolutionary planner\/navigator for mobile robots. IEEE Transactions on Evolutionary Computation, 1(1), 18. https:\/\/doi.org\/10.1109\/4235.585889","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"2056_CR33","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10845-021-01867-z","volume":"33","author":"C Zhou","year":"2022","unstructured":"Zhou, C., Huang, B., & Fr\u00e4nti, P. (2022). A review of motion planning algorithms for intelligent robots. Journal of Intelligent Manufacturing, 33(2), 387\u2013424. https:\/\/doi.org\/10.1007\/s10845-021-01867-z","journal-title":"Journal of Intelligent Manufacturing"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-022-02056-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10845-022-02056-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-022-02056-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T09:08:37Z","timestamp":1706692117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10845-022-02056-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,16]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["2056"],"URL":"https:\/\/doi.org\/10.1007\/s10845-022-02056-2","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,16]]},"assertion":[{"value":"13 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}