{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:49:36Z","timestamp":1774367376237,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T00:00:00Z","timestamp":1630368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T00:00:00Z","timestamp":1630368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key R&D Program of China","award":["2017YFB1301700"],"award-info":[{"award-number":["2017YFB1301700"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11370-021-00381-8","type":"journal-article","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T04:02:30Z","timestamp":1630382550000},"page":"583-596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Automatic task scheduling optimization and collision-free path planning for multi-areas problem"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8233-1019","authenticated-orcid":false,"given":"Wenxiang","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youhe","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yulong","family":"Lan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shijie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mutian","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,31]]},"reference":[{"key":"381_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104793","author":"LR Abreu","year":"2019","unstructured":"Abreu LR, Cunha JO, Prata BA, Framinan JM (2019) A genetic algorithm for scheduling open shops with sequence-dependent setup times. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2019.104793","journal-title":"Comput Oper Res"},{"key":"381_CR2","doi-asserted-by":"crossref","unstructured":"Alatartsev S, Belov A, Nykolaichuk M, Ortmeier F (2015a) Robot trajectory optimization for the relaxed end-effector path. In: International Conference on Informatics in Control","DOI":"10.5220\/0005093103850390"},{"key":"381_CR3","doi-asserted-by":"crossref","unstructured":"Alatartsev S, Mersheeva V, Augustine M, Ortmeier F (2013) On optimizing a sequence of robotic tasks. In: IEEE\/RSJ international conference on intelligent robots and systems (IROS). IEEE, pp 217\u2013223","DOI":"10.1109\/IROS.2013.6696356"},{"key":"381_CR4","doi-asserted-by":"crossref","unstructured":"Alatartsev S, Ortmeier F (2014) Improving the sequence of robotic tasks with freedom of execution. In: 2014 IEEE\/RSJ international conference on intelligent robots and systems. IEEE, pp 4503\u20134510","DOI":"10.1109\/IROS.2014.6943200"},{"issue":"2","key":"381_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10846-015-0190-6","volume":"80","author":"S Alatartsev","year":"2015","unstructured":"Alatartsev S, Stellmacher S, Ortmeier F (2015) Robotic task sequencing problem: a survey. J Intell Rob Syst 80(2):279\u2013298","journal-title":"J Intell Rob Syst"},{"key":"381_CR6","unstructured":"Applegate DL, Bixby RE, Chvatal V, Cook WJ (2006) The traveling salesman problem: a computational study. Princeton University Press."},{"key":"381_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.robot.2016.11.022","volume":"89","author":"MJ Bays","year":"2017","unstructured":"Bays MJ, Wettergren TA (2017) Service agent\u2013transport agent task planning incorporating robust scheduling techniques. Robot Autonom Syst 89:15\u201326","journal-title":"Robot Autonom Syst"},{"key":"381_CR8","doi-asserted-by":"crossref","unstructured":"Best G, Faigl J, Fitch R (2016) Multi-robot path planning for budgeted active perception with self-organising maps. In: IEEE\/RSJ International conference on intelligent robots and systems (IROS). IEEE, pp 3164\u20133171","DOI":"10.1109\/IROS.2016.7759489"},{"issue":"4","key":"381_CR9","first-page":"715","volume":"42","author":"G Best","year":"2018","unstructured":"Best G, Faigl J, Fitch RJAR (2018) Online planning for multi-robot active perception with self-organising maps 42(4):715\u2013738","journal-title":"Online planning for multi-robot active perception with self-organising maps"},{"key":"381_CR10","doi-asserted-by":"crossref","unstructured":"Eskandari L, Jafarian A, Rahimloo P, Baleanu D (2019) A modified and enhanced ant colony optimization algorithm for traveling salesman problem. In: Mathematical methods in engineering. Springer, pp 257\u2013265.","DOI":"10.1007\/978-3-319-91065-9_13"},{"key":"381_CR11","first-page":"388","volume":"38","author":"JM Esposito","year":"2019","unstructured":"Esposito JM, Wright JNJTIJORR (2019) Matrix completion as a post-processing technique for probabilistic roadmaps. IJRR 38:388\u2013400","journal-title":"IJRR"},{"key":"381_CR12","doi-asserted-by":"crossref","unstructured":"Faigl J, P\u011bni\u010dka R, Best G (2016) Self-organizing map-based solution for the orienteering problem with neighborhoods. In: IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, pp 001315\u2013001321","DOI":"10.1109\/SMC.2016.7844421"},{"key":"381_CR13","unstructured":"Faigl J, Von\u00e1sek V, Preucil L (2011) A multi-goal path planning for goal regions in the polygonal domain. In: ECMR, 2011. pp 171\u2013176"},{"key":"381_CR14","doi-asserted-by":"crossref","unstructured":"Gammell JD, Srinivasa SS, Barfoot TD (2014) Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic. In: 2014 IEEE\/RSJ international conference on intelligent robots and systems, 2014. IEEE, pp. 2997\u20133004","DOI":"10.1109\/IROS.2014.6942976"},{"key":"381_CR15","doi-asserted-by":"crossref","unstructured":"Gao W, Tang Q, Yao J, Yang Y, Yu D (2018) Heuristic bidirectional fast marching tree for optimal motion planning. In: 2018 3rd Asia-Pacific conference on intelligent robot systems (ACIRS). IEEE, pp 71\u201377","DOI":"10.1109\/ACIRS.2018.8467243"},{"issue":"2","key":"381_CR16","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1080\/10556788.2011.648932","volume":"28","author":"I Gentilini","year":"2013","unstructured":"Gentilini I, Margot F, Shimada K (2013) The travelling salesman problem with neighbourhoods: MINLP solution. Optimization Methods and Software 28(2):364\u2013378","journal-title":"Optimization Methods and Software"},{"issue":"1","key":"381_CR17","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1109\/TRO.2018.2795034","volume":"34","author":"MC Gombolay","year":"2018","unstructured":"Gombolay MC, Wilcox RJ, Shah JA (2018) Fast scheduling of robot teams performing tasks with temporospatial constraints. IEEE Trans Rob 34(1):220\u2013239","journal-title":"IEEE Trans Rob"},{"issue":"2","key":"381_CR18","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 Transactions on Systems Science & Cybernetics 4(2):100\u2013107","journal-title":"IEEE Transactions on Systems Science & Cybernetics"},{"key":"381_CR19","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.cor.2018.06.002","volume":"110","author":"P Helo","year":"2019","unstructured":"Helo P, Phuong D, Hao Y (2019) Cloud manufacturing\u2013scheduling as a service for sheet metal manufacturing. Comput Oper Res 110:208\u2013219","journal-title":"Comput Oper Res"},{"issue":"1","key":"381_CR20","first-page":"106","volume":"126","author":"KJE Helsgaun","year":"2000","unstructured":"Helsgaun KJE (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic. JoOR 126(1):106\u2013130","journal-title":"JoOR"},{"issue":"6","key":"381_CR21","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/S1000-9361(09)60276-4","volume":"23","author":"X Hong","year":"2010","unstructured":"Hong X, Yuan L, Kaifu Z, Jianfeng Y, Zhenxing L, Jianbin S (2010) Multi-objective optimization method for automatic drilling and riveting sequence planning. Chin J Aeronaut 23(6):734\u2013742","journal-title":"Chin J Aeronaut"},{"issue":"7","key":"381_CR22","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1177\/0278364915577958","volume":"34","author":"L Janson","year":"2015","unstructured":"Janson L, Schmerling E, Clark A, Pavone M (2015) Fast marching tree: a fast marching sampling-based method for optimal motion planning in many dimensions. Int J Robot Res 34(7):883\u2013921","journal-title":"Int J Robot Res"},{"issue":"7","key":"381_CR23","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. Int J Robot Res 30(7):846\u2013894","journal-title":"Int J Robot Res"},{"key":"381_CR24","unstructured":"Kavraki L, Svestka P, Overmars MH (1994) Probabilistic roadmaps for path planning in high-dimensional configuration spaces, vol 1994. Unknown Publisher."},{"issue":"2","key":"381_CR25","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.robot.2013.09.005","volume":"62","author":"E Kolakowska","year":"2014","unstructured":"Kolakowska E, Smith SF, Kristiansen M (2014) Constraint optimization model of a scheduling problem for a robotic arm in automatic systems. Robot Auton Syst 62(2):267\u2013280","journal-title":"Robot Auton Syst"},{"issue":"1","key":"381_CR26","first-page":"129","volume":"40","author":"Kothari, R., Ghosh, D. J. C., & Research, O","year":"2013","unstructured":"Kothari, R., Ghosh, D. J. C., & Research, O (2013) Insertion based Lin-Kernighan heuristic for single row facility layout 40(1):129\u2013136","journal-title":"Insertion based Lin-Kernighan heuristic for single row facility layout"},{"key":"381_CR27","doi-asserted-by":"crossref","unstructured":"Kurtser P, Edan Y (2020) Planning the sequence of tasks for harvesting robots. Robot Autonom Syst 103591","DOI":"10.1016\/j.robot.2020.103591"},{"key":"381_CR28","first-page":"1","volume":"99","author":"J Li","year":"2016","unstructured":"Li J, Deng G, Luo C, Lin Q, Zhong M (2016) A Hybrid Path Planning Method in Unmanned Air\/Ground Vehicle (UAV\/UGV) Cooperative Systems. IEEE Trans Vehic Technol 99:1","journal-title":"IEEE Trans Vehic Technol"},{"key":"381_CR29","first-page":"S09252312173161","volume":"275","author":"Y Liu","year":"2018","unstructured":"Liu Y, Bucknall R (2018) Efficient multi-task allocation and path planning for unmanned surface vehicle in support of ocean operations. Neurocomputing 275:S092523121731617X","journal-title":"Neurocomputing"},{"key":"381_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.rcim.2016.09.008","volume":"45","author":"Y Liu","year":"2017","unstructured":"Liu Y, Xu X, Zhang L, Wang L, Zhong RY (2017) Workload-based multi-task scheduling in cloud manufacturing. Robotics and Computer-Integrated Manufacturing 45:3\u201320","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"issue":"3","key":"381_CR31","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1016\/j.ejor.2017.06.001","volume":"263","author":"TC Lopes","year":"2017","unstructured":"Lopes TC, Sikora CGS, Molina RG, Schibelbain D, Rodrigues LC, Magat\u00e3o L (2017) Balancing a robotic spot welding manufacturing line: an industrial case study. Eur J Oper Res 263(3):1033\u20131048","journal-title":"Eur J Oper Res"},{"key":"381_CR32","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.jocs.2017.04.003","volume":"21","author":"MA Mohammed","year":"2017","unstructured":"Mohammed MA, Ghani MKA, Hamed RI, Mostafa SA, Ahmad MS, Ibrahim DA (2017) Solving vehicle routing problem by using improved genetic algorithm for optimal solution. J Comput Sci 21:255\u2013262","journal-title":"J Comput Sci"},{"key":"381_CR33","doi-asserted-by":"crossref","unstructured":"Nasir J, Islam F, Malik U, Ayaz Y, Hasan O, Khan M, et al (2013) RRT*-SMART: A rapid convergence implementation of RRT. 10(7):299.","DOI":"10.5772\/56718"},{"key":"381_CR34","unstructured":"Song G, Miller S, Amato NM (2001) Customizing PRM roadmaps at query time. In: Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation, 2001, vol 25. IEEE, pp 1500\u2013150"},{"key":"381_CR35","doi-asserted-by":"crossref","unstructured":"Su\u00e1rez-Ruiz F, Lembono TS, Pham Q-C (2018) Robotsp\u2013a fast solution to the robotic task sequencing problem. In: IEEE international conference on robotics and automation (ICRA). IEEE, pp 1611\u20131616","DOI":"10.1109\/ICRA.2018.8460581"},{"key":"381_CR36","unstructured":"Tong G, Jiang N, Biyue L, Xi Z, Ya W, Wenbo D (2020) UAV navigation in high dynamic environments: A deep reinforcement learning approach. Chin. J Aeronaut"},{"key":"381_CR37","doi-asserted-by":"crossref","unstructured":"V\u00e1\u0148a P, Sl\u00e1ma J, Faigl J (2018) The Dubins traveling salesman problem with neighborhoods in the three-dimensional space. In: IEEE international conference on robotics and automation (ICRA). IEEE, pp 374\u2013379","DOI":"10.1109\/ICRA.2018.8460957"},{"key":"381_CR38","doi-asserted-by":"crossref","unstructured":"Vitolo F, Franciosa P, Ceglarek D, Patalano S, De Martino MA (2019) Generalised multi-attribute task sequencing approach for robotics optical inspection systems. In 2019 II workshop on metrology for industry 4.0 and IoT (MetroInd4. 0&IoT), 2019. IEEE, pp 117\u2013122","DOI":"10.1109\/METROI4.2019.8792869"},{"key":"381_CR39","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.neucom.2017.02.041","volume":"240","author":"H Wang","year":"2017","unstructured":"Wang H, Zhang N, Cr\u00e9put JC (2017) A massively parallel neural network approach to large-scale Euclidean traveling salesman problems. Neurocomputing 240:137\u2013151","journal-title":"Neurocomputing"},{"key":"381_CR40","doi-asserted-by":"crossref","unstructured":"Wong C, Yang E, Yan X-T, Gu D (2018) Optimal path planning based on a multi-tree T-RRT* approach for robotic task planning in continuous cost spaces. In: 12th France\u2013Japan and 10th Europe-Asia congress on mechatronics. IEEE, pp 242\u2013247","DOI":"10.1109\/MECATRONICS.2018.8495886"},{"issue":"1","key":"381_CR41","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/TCYB.2017.2763682","volume":"49","author":"B Ye","year":"2017","unstructured":"Ye B, Tang Q, Yao J, Gao W (2017) Collision-free path planning and delivery sequence optimization in noncoplanar radiation therapy. IEEE Trans Cybern 49(1):42\u201355","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"381_CR42","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.rcim.2004.04.003","volume":"21","author":"PT Zacharia","year":"2005","unstructured":"Zacharia PT, Aspragathos N (2005) Optimal robot task scheduling based on genetic algorithms. Robot Comput-Integr Manuf 21(1):67\u201379","journal-title":"Robot Comput-Integr Manuf"},{"issue":"6","key":"381_CR43","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.rcim.2013.05.002","volume":"29","author":"PT Zacharia","year":"2013","unstructured":"Zacharia PT, Xidias EK, Aspragathos NA (2013) Task scheduling and motion planning for an industrial manipulator. Robot Comput-Integr Manuf 29(6):449\u2013462","journal-title":"Robot Comput-Integr Manuf"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-021-00381-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11370-021-00381-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-021-00381-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T11:57:23Z","timestamp":1633607843000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11370-021-00381-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,31]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["381"],"URL":"https:\/\/doi.org\/10.1007\/s11370-021-00381-8","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,31]]},"assertion":[{"value":"10 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2021","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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}