{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:12:10Z","timestamp":1778692330732,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:00:00Z","timestamp":1778457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:00:00Z","timestamp":1778457600000},"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 Supercomput"],"DOI":"10.1007\/s11227-026-08534-1","type":"journal-article","created":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T02:36:36Z","timestamp":1778466996000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Trajectory planning for target sweep coverage with mobile sensors"],"prefix":"10.1007","volume":"82","author":[{"given":"Rinku","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saumya","family":"Jaipuria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajib K.","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,11]]},"reference":[{"issue":"3","key":"8534_CR1","doi-asserted-by":"publisher","first-page":"1736","DOI":"10.1109\/TNSE.2019.2952369","volume":"7","author":"TN Nguyen","year":"2019","unstructured":"Nguyen TN, Liu B-H, Wang S-Y (2019) On new approaches of maximum weighted target coverage and sensor connectivity: hardness and approximation. IEEE Trans Netw Sci Eng 7(3):1736\u20131751","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"8534_CR2","doi-asserted-by":"crossref","unstructured":"Sen R, Das RK (2021) Distributed algorithms for k-coverage in mobile sensor networks. 2021 International Conference on Computational Science and Computational Intelligence (CSCI). IEEE, pp 1323\u20131328","DOI":"10.1109\/CSCI54926.2021.00269"},{"issue":"2","key":"8534_CR3","first-page":"695","volume":"62","author":"J Wang","year":"2020","unstructured":"Wang J, Gao Y, Zhou C, Sherratt S, Wang L (2020) Optimal coverage multi-path scheduling scheme with multiple mobile sinks for WSNS. Comput Mater Contin 62(2):695\u2013711","journal-title":"Comput Mater Contin"},{"issue":"8","key":"8534_CR4","doi-asserted-by":"publisher","first-page":"2699","DOI":"10.1016\/j.jpdc.2014.02.009","volume":"74","author":"B Gorain","year":"2014","unstructured":"Gorain B, Mandal PS (2014) Approximation algorithms for sweep coverage in wireless sensor networks. J Parallel Distrib Comput 74(8):2699\u20132707","journal-title":"J Parallel Distrib Comput"},{"key":"8534_CR5","first-page":"129","volume-title":"Area sweep coverage: a trade-off between tour length and memory requirements","author":"R Sen","year":"2025","unstructured":"Sen R, Jaipuria S, Das RK (2025) Area sweep coverage: a trade-off between tour length and memory requirements. River Publishers, Denmark, pp 129\u2013143"},{"issue":"03","key":"8534_CR6","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1142\/S0129054119500138","volume":"30","author":"B Gorain","year":"2019","unstructured":"Gorain B, Mandal PS (2019) Approximation algorithms for barrier sweep coverage. Int J Found Comput Sci 30(03):425\u2013448","journal-title":"Int J Found Comput Sci"},{"key":"8534_CR7","doi-asserted-by":"crossref","unstructured":"Sen R, Khatua S, Das RK (2024) Cost efficient mobile trajectory planning in barrier sweep coverage. Proceedings of the 2024 Sixteenth International Conference on Contemporary Computing. pp 618\u2013627","DOI":"10.1145\/3675888.3676121"},{"key":"8534_CR8","doi-asserted-by":"crossref","unstructured":"Gao X, Zhu X, Feng Y, Wu F, Chen G (2016) Data ferry trajectory planning for sweep coverage problem with multiple mobile sensors. In: 2016 13th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON), IEEE, pp. 1\u20139","DOI":"10.1109\/SAHCN.2016.7732979"},{"issue":"2","key":"8534_CR9","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1109\/TMC.2020.3008348","volume":"21","author":"X Gao","year":"2020","unstructured":"Gao X, Fan J, Wu F, Chen G (2020) Cooperative sweep coverage problem with mobile sensors. IEEE Trans Mob Comput 21(2):480\u2013494","journal-title":"IEEE Trans Mob Comput"},{"key":"8534_CR10","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2022","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2022) Introduction to Algorithms, 4th edn. The MIT Press, Cambridge","edition":"4"},{"issue":"6","key":"8534_CR11","doi-asserted-by":"publisher","first-page":"1332","DOI":"10.1109\/TMC.2019.2910074","volume":"19","author":"X Gao","year":"2019","unstructured":"Gao X, Chen Z, Pan J, Wu F, Chen G (2019) Energy efficient scheduling algorithms for sweep coverage in mobile sensor networks. IEEE Trans Mob Comput 19(6):1332\u20131345","journal-title":"IEEE Trans Mob Comput"},{"issue":"11","key":"8534_CR12","doi-asserted-by":"publisher","first-page":"1534","DOI":"10.1109\/TMC.2010.237","volume":"10","author":"M Li","year":"2011","unstructured":"Li M, Cheng W, Liu K, He Y, Li X, Liao X (2011) Sweep coverage with mobile sensors. IEEE Trans Mob Comput 10(11):1534\u20131545","journal-title":"IEEE Trans Mob Comput"},{"key":"8534_CR13","doi-asserted-by":"crossref","unstructured":"Liu C, Du H, Ye Q (2016) Sweep coverage with return time constraint. In: 2016 IEEE Global Communications Conference (GLOBECOM), pp 1\u20136","DOI":"10.1109\/GLOCOM.2016.7842310"},{"issue":"2","key":"8534_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s11590-023-02008-6","volume":"18","author":"W Liang","year":"2024","unstructured":"Liang W, Zhang Z, Du D-Z (2024) A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems. Optim Lett 18(2):575\u2013589","journal-title":"Optim Lett"},{"key":"8534_CR15","doi-asserted-by":"crossref","unstructured":"Garg N (2005) Saving an epsilon: a 2-approximation for the k-MST problem in graphs. Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing. pp 396\u2013402","DOI":"10.1145\/1060590.1060650"},{"key":"8534_CR16","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2021.02.028","volume":"864","author":"Z Nie","year":"2021","unstructured":"Nie Z, Du H (2021) An approximation algorithm for general energy restricted sweep coverage problem. Theor Comput Sci 864:70\u201379","journal-title":"Theor Comput Sci"},{"key":"8534_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2022.06.026","volume":"929","author":"W Liang","year":"2022","unstructured":"Liang W, Zhang Z (2022) Approximation algorithm for prize-collecting sweep cover with base stations. Theor Comput Sci 929:1\u201310","journal-title":"Theor Comput Sci"},{"key":"8534_CR18","doi-asserted-by":"publisher","first-page":"34931","DOI":"10.1109\/ACCESS.2024.3373543","volume":"12","author":"D Liang","year":"2024","unstructured":"Liang D, Feng B, Liao X (2024) A path planning method for chargeable sweep coverage with multiple charging stations. IEEE Access 12:34931\u201334941","journal-title":"IEEE Access"},{"key":"8534_CR19","doi-asserted-by":"crossref","unstructured":"Srinivas M, Donta PK, Amgoth T (2021) Efficient algorithms for point and area sweep-coverage in wireless sensor networks. 2021 Sixth International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET). pp 315\u2013320","DOI":"10.1109\/WiSPNET51692.2021.9419463"},{"key":"8534_CR20","doi-asserted-by":"crossref","unstructured":"Chen Z, Zhu X, Gao X, Wu F, Gu J, Chen G (2016) Efficient scheduling strategies for mobile sensors in sweep coverage problem. In: 2016 13th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON), pp 1\u20134","DOI":"10.1109\/SAHCN.2016.7732985"},{"key":"8534_CR21","doi-asserted-by":"crossref","unstructured":"Li F, Dong B, Wu X, Xu H (2021) Geometry assisted energy efficient sweep coverage algorithm for wireless sensor networks. 2021 IEEE Congress on Evolutionary Computation (CEC). pp 1005\u20131011","DOI":"10.1109\/CEC45853.2021.9504736"},{"key":"8534_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2020.05.012","volume":"836","author":"C Liu","year":"2020","unstructured":"Liu C, Du H, Ye Q, Xu W (2020) Group sweep coverage with guaranteed approximation ratio. Theor Comput Sci 836:1\u201315","journal-title":"Theor Comput Sci"},{"issue":"3","key":"8534_CR23","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-005-0638-6","volume":"105","author":"R Franceschi","year":"2006","unstructured":"Franceschi R, Fischetti M, Toth P (2006) A new ILP-based refinement heuristic for Vehicle Routing Problems. Math Program 105(3):471\u2013499. https:\/\/doi.org\/10.1007\/s10107-005-0638-6","journal-title":"Math Program"},{"key":"8534_CR24","doi-asserted-by":"crossref","unstructured":"Du J, Li Y, Liu H, Sha K (2010) On sweep coverage with minimum mobile sensors. In: 2010 IEEE 16th International Conference on Parallel and Distributed Systems, IEEE, pp 283\u2013290","DOI":"10.1109\/ICPADS.2010.109"},{"key":"8534_CR25","doi-asserted-by":"crossref","unstructured":"Liu BH, Nguyen NT (2014) An efficient method for sweep coverage with minimum mobile sensor. Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing. pp 289\u2013292","DOI":"10.1109\/IIH-MSP.2014.78"},{"key":"8534_CR26","doi-asserted-by":"crossref","unstructured":"Yang M, Kim D, Li D, Chen W, Du H, Tokuta AO (2013) Sweep-coverage with energy-restricted mobile wireless sensor nodes. In: Wireless Algorithms, Systems, and Applications: 8th International Conference, WASA 2013, Zhangjiajie, China, August 7\u201310, 2013. Proceedings 8, Springer, pp 486\u2013497","DOI":"10.1007\/978-3-642-39701-1_40"},{"issue":"7","key":"8534_CR27","doi-asserted-by":"publisher","first-page":"1308","DOI":"10.1109\/TMC.2012.105","volume":"12","author":"L He","year":"2012","unstructured":"He L, Pan J, Xu J (2012) A progressive approach to reducing data collection latency in wireless sensor networks with mobile elements. IEEE Trans Mob Comput 12(7):1308\u20131320","journal-title":"IEEE Trans Mob Comput"},{"issue":"7","key":"8534_CR28","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1016\/j.adhoc.2012.03.005","volume":"10","author":"R Moazzez-Estanjini","year":"2012","unstructured":"Moazzez-Estanjini R, Paschalidis IC (2012) On delay-minimized data harvesting with mobile elements in wireless sensor networks. Ad Hoc Netw 10(7):1191\u20131203","journal-title":"Ad Hoc Netw"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08534-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08534-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08534-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:27:48Z","timestamp":1778689668000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08534-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,11]]},"references-count":28,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2026,5]]}},"alternative-id":["8534"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08534-1","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,11]]},"assertion":[{"value":"3 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2026","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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"410"}}