{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:53:29Z","timestamp":1770814409916,"version":"3.50.1"},"reference-count":35,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T00:00:00Z","timestamp":1630281600000},"content-version":"vor","delay-in-days":241,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK200170116"],"award-info":[{"award-number":["BK200170116"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41801303"],"award-info":[{"award-number":["41801303"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61375121"],"award-info":[{"award-number":["61375121"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012221","name":"Jinling Institute of Technology","doi-asserted-by":"publisher","award":["D2020005"],"award-info":[{"award-number":["D2020005"]}],"id":[{"id":"10.13039\/501100012221","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012221","name":"Jinling Institute of Technology","doi-asserted-by":"publisher","award":["JIT-rcyj-201505"],"award-info":[{"award-number":["JIT-rcyj-201505"]}],"id":[{"id":"10.13039\/501100012221","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Multirobot motion planning is always one of the critical techniques in edge intelligent systems, which involve a variety of algorithms, such as map modeling, path search, and trajectory optimization and smoothing. To overcome the slow running speed and imbalance of energy consumption, a swarm intelligence solution based on parallel computing is proposed to plan motion paths for multirobot with many task nodes in a complex scene that have multiple irregularly\u2010shaped obstacles, which objective is to find a smooth trajectory under the constraints of the shortest total distance and the energy\u2010balanced consumption for all robots to travel between nodes. In a practical scenario, the imbalance of task allocation will inevitably lead to some robots stopping on the way. Thus, we firstly model a gridded scene as a weighted MTSP (multitraveling salesman problem) in which the weights are the energies of obstacle constraints and path length. Then, a hybridization of particle swarm and ant colony optimization (GPSO\u2010AC) based on a platform of Compute Unified Device Architecture (CUDA) is presented to find the optimal path for the weighted MTSPs. Next, we improve the A\u2217 algorithm to generate a weighted obstacle avoidance path on the gridded map, but there are still many sharp turns on it. Therefore, an improved smooth grid path algorithm is proposed by integrating the dynamic constraints in this paper to optimize the trajectory smoothly, to be more in line with the law of robot motion, which can more realistically simulate the multirobot in a real scene. Finally, experimental comparisons with other methods on the designed platform of GPUs demonstrate the applicability of the proposed algorithm in different scenarios, and our method strikes a good balance between energy consumption and optimality, with significantly faster and better performance than other considered approaches, and the effects of the adjustment coefficient <jats:italic>q<\/jats:italic> on the performance of the algorithm are also discussed in the experiments.<\/jats:p>","DOI":"10.1155\/2021\/8902328","type":"journal-article","created":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T21:20:09Z","timestamp":1630358409000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Parallel Swarm Intelligent Motion Planning with Energy\u2010Balanced for Multirobot in Obstacle Environment"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2036-7646","authenticated-orcid":false,"given":"Shoubao","family":"Su","sequence":"first","affiliation":[]},{"given":"Wei","family":"Zhao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6536-0574","authenticated-orcid":false,"given":"Chishe","family":"Wang","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,8,30]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114660"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2021.01.003"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1177\/1729881419839596"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3085026"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2020.3017677"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2939126"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.07.018"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1126\/scirobotics.abc3000"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-019-01112-z"},{"key":"e_1_2_9_10_2","volume-title":"Dijkstra\u2032s and A-Star in Finding the Shortest Path: a Tutorial Inter Conf Data Science","author":"Candra A.","year":"2020"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2020.103447"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/tase.2020.3016276"},{"key":"e_1_2_9_13_2","doi-asserted-by":"crossref","unstructured":"WangJ. WuN. andZhaoW. X. Empowering A search algorithms with neural networks for personalized route recommendation Proceedings of the 25th Inter Conf Knowledge Discovery & Data Mining (ACM SIGKDD) 2019 539\u2013547.","DOI":"10.1145\/3292500.3330824"},{"key":"e_1_2_9_14_2","doi-asserted-by":"crossref","unstructured":"TianZ. GuoC. andLiuY. An improved RRT robot autonomous exploration and SLAM construction method 2020 5th International Conference on Automation Control and Robotics Engineering (CACRE) 2020 IEEE 612\u2013619.","DOI":"10.1109\/CACRE50138.2020.9230216"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100844"},{"key":"e_1_2_9_16_2","doi-asserted-by":"crossref","unstructured":"UriolR.andMoranA. Mobile robot path planning in complex environments using ant colony optimization algorithm 3rd inter Conf control automation and robotics (ICCAR) 2017 Nagoya Japan 15\u201321.","DOI":"10.1109\/ICCAR.2017.7942653"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106960"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2021.3093318"},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2705-5"},{"key":"e_1_2_9_20_2","doi-asserted-by":"crossref","unstructured":"PaikrayH. K. DasP. K. andPandaS. Improved shuffled frog leaping algorithm for path planning of multiple mobile-robot 2nd Int Conf Innovations in Electronics Signal Processing and Communication (IESC) 2019 Shillong India 132\u2013137.","DOI":"10.1109\/IESPC.2019.8902457"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3038905"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1126\/scirobotics.abd7710"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3030240"},{"key":"e_1_2_9_24_2","doi-asserted-by":"crossref","unstructured":"ShuklaS. ShuklaN. andSachanV. K. Multi robot path planning parameter analysis based on particle swarm optimization (PSO) in an intricate unknown environments Int Conf Issues and Challenges in Intelligent Computing Techniques (ICICT) 2019 Ghaziabad India 1\u201310.","DOI":"10.1109\/ICICT46931.2019.8977689"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2018.12.002"},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2019.2896401"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2883829"},{"key":"e_1_2_9_28_2","doi-asserted-by":"publisher","DOI":"10.31209\/2019.100000110"},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/LNET.2020.3037741"},{"key":"e_1_2_9_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.01.050"},{"key":"e_1_2_9_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.2983835"},{"key":"e_1_2_9_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2020.103645"},{"key":"e_1_2_9_33_2","doi-asserted-by":"crossref","unstructured":"De AlmeidaM. M. MogheR. andAkellaM. Real-time minimum snap trajectory generation for quadcopters: algorithm speed-up through machine learning 2019 International Conference on Robotics and Automation (ICRA) 2019 IEEE 683\u2013689.","DOI":"10.1109\/ICRA.2019.8793569"},{"key":"e_1_2_9_34_2","first-page":"1455","article-title":"UAV polynomial trajectory optimization based on minimizing snap method","volume":"38","author":"Tang G.","year":"2021","journal-title":"Computer Application Research"},{"key":"e_1_2_9_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3041802"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/8902328.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/8902328.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/8902328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T10:07:46Z","timestamp":1723025266000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/8902328"}},"subtitle":[],"editor":[{"given":"Xiaoxian","family":"Yang","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/8902328"],"URL":"https:\/\/doi.org\/10.1155\/2021\/8902328","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"value":"1530-8669","type":"print"},{"value":"1530-8677","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-06-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-08-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-08-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8902328"}}