Path planning of intelligent tennis ball picking robot integrating twin network target tracking algorithm
Intelligent tennis picking robots can effectively improve the efficiency of tennis training and competition, and reduce manual labor intensity. However, the real-time tracking of targets in existing intelligent robot path planning is poor and susceptible to becoming entrenched in local optimal solut...
Saved in:
| Published in: | Scientific reports Vol. 15; no. 1; pp. 20668 - 17 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
London
Nature Publishing Group UK
01.07.2025
Nature Portfolio |
| Subjects: | |
| ISSN: | 2045-2322, 2045-2322 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Intelligent tennis picking robots can effectively improve the efficiency of tennis training and competition, and reduce manual labor intensity. However, the real-time tracking of targets in existing intelligent robot path planning is poor and susceptible to becoming entrenched in local optimal solutions. Therefore, this study proposes an intelligent tennis ball picking robot path planning method that integrates a twin network object tracking algorithm. In terms of target tracking, a hybrid attention mechanism is introduced, which utilizes a transformer structure to achieve hierarchical feature fusion. In terms of path planning, this study combines an improved rapidly-exploring random trees with an artificial potential field ant colony algorithm to enhance the obstacle avoidance capability of robot path planning. Among them, the hybrid attention mechanism enhances local feature extraction and reduces the influence of occlusion by combining grouped convolution transformation and spatially gated embedding. Additionally, the Transformer structure improves tracking accuracy by capturing the global context relationship. In path planning, the improved bidirectional rapidly-exploring random tree algorithm is enhanced through sector constraint sampling to improve search efficiency. The artificial potential field ant colony algorithm optimizes the obstacle avoidance ability and path smoothness. The results showed that in the training dataset, the accuracy of the proposed target tracking algorithm was as high as 0.981, which was 5.40–25.56% higher than existing algorithms such as SiamFC, MORT, SiamRPN, MeMOT, and FROG MOT. In both test datasets, the expected average overlap values were 0.405 and 0.437. The path planning length and time of the proposed method were 42.07 m and 56.12 s, significantly lower than other methods. This indicates that the research method can provide accurate target position information for robots, optimize path planning, and improve the efficiency of picking up tennis balls. This method provides an effective solution for target tracking and path planning of intelligent tennis ball picking robots in complex environments and has important practical application value. |
|---|---|
| AbstractList | Intelligent tennis picking robots can effectively improve the efficiency of tennis training and competition, and reduce manual labor intensity. However, the real-time tracking of targets in existing intelligent robot path planning is poor and susceptible to becoming entrenched in local optimal solutions. Therefore, this study proposes an intelligent tennis ball picking robot path planning method that integrates a twin network object tracking algorithm. In terms of target tracking, a hybrid attention mechanism is introduced, which utilizes a transformer structure to achieve hierarchical feature fusion. In terms of path planning, this study combines an improved rapidly-exploring random trees with an artificial potential field ant colony algorithm to enhance the obstacle avoidance capability of robot path planning. Among them, the hybrid attention mechanism enhances local feature extraction and reduces the influence of occlusion by combining grouped convolution transformation and spatially gated embedding. Additionally, the Transformer structure improves tracking accuracy by capturing the global context relationship. In path planning, the improved bidirectional rapidly-exploring random tree algorithm is enhanced through sector constraint sampling to improve search efficiency. The artificial potential field ant colony algorithm optimizes the obstacle avoidance ability and path smoothness. The results showed that in the training dataset, the accuracy of the proposed target tracking algorithm was as high as 0.981, which was 5.40-25.56% higher than existing algorithms such as SiamFC, MORT, SiamRPN, MeMOT, and FROG MOT. In both test datasets, the expected average overlap values were 0.405 and 0.437. The path planning length and time of the proposed method were 42.07 m and 56.12 s, significantly lower than other methods. This indicates that the research method can provide accurate target position information for robots, optimize path planning, and improve the efficiency of picking up tennis balls. This method provides an effective solution for target tracking and path planning of intelligent tennis ball picking robots in complex environments and has important practical application value. Intelligent tennis picking robots can effectively improve the efficiency of tennis training and competition, and reduce manual labor intensity. However, the real-time tracking of targets in existing intelligent robot path planning is poor and susceptible to becoming entrenched in local optimal solutions. Therefore, this study proposes an intelligent tennis ball picking robot path planning method that integrates a twin network object tracking algorithm. In terms of target tracking, a hybrid attention mechanism is introduced, which utilizes a transformer structure to achieve hierarchical feature fusion. In terms of path planning, this study combines an improved rapidly-exploring random trees with an artificial potential field ant colony algorithm to enhance the obstacle avoidance capability of robot path planning. Among them, the hybrid attention mechanism enhances local feature extraction and reduces the influence of occlusion by combining grouped convolution transformation and spatially gated embedding. Additionally, the Transformer structure improves tracking accuracy by capturing the global context relationship. In path planning, the improved bidirectional rapidly-exploring random tree algorithm is enhanced through sector constraint sampling to improve search efficiency. The artificial potential field ant colony algorithm optimizes the obstacle avoidance ability and path smoothness. The results showed that in the training dataset, the accuracy of the proposed target tracking algorithm was as high as 0.981, which was 5.40-25.56% higher than existing algorithms such as SiamFC, MORT, SiamRPN, MeMOT, and FROG MOT. In both test datasets, the expected average overlap values were 0.405 and 0.437. The path planning length and time of the proposed method were 42.07 m and 56.12 s, significantly lower than other methods. This indicates that the research method can provide accurate target position information for robots, optimize path planning, and improve the efficiency of picking up tennis balls. This method provides an effective solution for target tracking and path planning of intelligent tennis ball picking robots in complex environments and has important practical application value.Intelligent tennis picking robots can effectively improve the efficiency of tennis training and competition, and reduce manual labor intensity. However, the real-time tracking of targets in existing intelligent robot path planning is poor and susceptible to becoming entrenched in local optimal solutions. Therefore, this study proposes an intelligent tennis ball picking robot path planning method that integrates a twin network object tracking algorithm. In terms of target tracking, a hybrid attention mechanism is introduced, which utilizes a transformer structure to achieve hierarchical feature fusion. In terms of path planning, this study combines an improved rapidly-exploring random trees with an artificial potential field ant colony algorithm to enhance the obstacle avoidance capability of robot path planning. Among them, the hybrid attention mechanism enhances local feature extraction and reduces the influence of occlusion by combining grouped convolution transformation and spatially gated embedding. Additionally, the Transformer structure improves tracking accuracy by capturing the global context relationship. In path planning, the improved bidirectional rapidly-exploring random tree algorithm is enhanced through sector constraint sampling to improve search efficiency. The artificial potential field ant colony algorithm optimizes the obstacle avoidance ability and path smoothness. The results showed that in the training dataset, the accuracy of the proposed target tracking algorithm was as high as 0.981, which was 5.40-25.56% higher than existing algorithms such as SiamFC, MORT, SiamRPN, MeMOT, and FROG MOT. In both test datasets, the expected average overlap values were 0.405 and 0.437. The path planning length and time of the proposed method were 42.07 m and 56.12 s, significantly lower than other methods. This indicates that the research method can provide accurate target position information for robots, optimize path planning, and improve the efficiency of picking up tennis balls. This method provides an effective solution for target tracking and path planning of intelligent tennis ball picking robots in complex environments and has important practical application value. Abstract Intelligent tennis picking robots can effectively improve the efficiency of tennis training and competition, and reduce manual labor intensity. However, the real-time tracking of targets in existing intelligent robot path planning is poor and susceptible to becoming entrenched in local optimal solutions. Therefore, this study proposes an intelligent tennis ball picking robot path planning method that integrates a twin network object tracking algorithm. In terms of target tracking, a hybrid attention mechanism is introduced, which utilizes a transformer structure to achieve hierarchical feature fusion. In terms of path planning, this study combines an improved rapidly-exploring random trees with an artificial potential field ant colony algorithm to enhance the obstacle avoidance capability of robot path planning. Among them, the hybrid attention mechanism enhances local feature extraction and reduces the influence of occlusion by combining grouped convolution transformation and spatially gated embedding. Additionally, the Transformer structure improves tracking accuracy by capturing the global context relationship. In path planning, the improved bidirectional rapidly-exploring random tree algorithm is enhanced through sector constraint sampling to improve search efficiency. The artificial potential field ant colony algorithm optimizes the obstacle avoidance ability and path smoothness. The results showed that in the training dataset, the accuracy of the proposed target tracking algorithm was as high as 0.981, which was 5.40–25.56% higher than existing algorithms such as SiamFC, MORT, SiamRPN, MeMOT, and FROG MOT. In both test datasets, the expected average overlap values were 0.405 and 0.437. The path planning length and time of the proposed method were 42.07 m and 56.12 s, significantly lower than other methods. This indicates that the research method can provide accurate target position information for robots, optimize path planning, and improve the efficiency of picking up tennis balls. This method provides an effective solution for target tracking and path planning of intelligent tennis ball picking robots in complex environments and has important practical application value. |
| ArticleNumber | 20668 |
| Author | Wang, Zegang |
| Author_xml | – sequence: 1 givenname: Zegang surname: Wang fullname: Wang, Zegang email: wangzegang@126.com organization: School of Physical Education, Xichang University |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/40594171$$D View this record in MEDLINE/PubMed |
| BookMark | eNp9kk1v1DAQhi1UREvbP8AB5cgl4M_EOSFU8VGpUnugZ2scO1lvvfZie1nx7_FuStVe8MXW-Jl3NDPvW3QSYrAIvSP4I8FMfsqciEG2mIoWc9mJdv8KnVHMRUsZpSfP3qfoMuc1rkfQgZPhDTrlWNRXT86Qu4OyarYeQnBhbuLUuFCs9262oTTF1nBuNHjfbN34cEBS1LEcqTlBOUTK3oUm2LKP6aEpkGZbMxMsOPg5JldWmwv0egKf7eXjfY7uv339efWjvbn9fn315aYdedeVttdWANadNKzDkrChdjeySfaadIb1YKQGwbjpjbFsMIwPYNjQG067HpvRsnN0veiaCGu1TW4D6Y-K4NQxENOsIBU3eqsIUK45pnTidVh20kxPvBMcj0bSCcuq9XnR2u70xlb1UPvyL0Rf_gS3UnP8rQilhAuMq8KHR4UUf-1sLmrj8lgHDMHGXVZ1Px0TXJK-ou-fF3uq8m9ZFaALMKaYc7LTE0KwOphCLaZQ1RTqaAq1r0lsScoVDrNNah13KdQN_C_rL-rsvBE |
| Cites_doi | 10.1109/JSEN.2022.3220341 10.1007/s00521-022-07456-2 10.47852/bonviewAIA2202331 10.1109/TAES.2022.3198925 10.47852/bonviewAIA32021018 10.3390/jmse12091528 10.1145/3627341.3630401 10.1109/TVT.2021.3129504 10.1109/TWC.2022.3162749 10.3390/rs14102357 10.3390/app12030943 10.1109/ACCESS.2024.3355278 10.1109/TIE.2021.3078390 10.1177/09544100211007381 10.20965/jaciii.2021.p0121 10.1109/TETCI.2020.3041019 10.3233/JIFS-212220 10.1609/aaai.v36i11.21633 10.1109/TCSVT.2022.3207202 10.1145/3441656 10.1504/IJVD.2022.128016 10.3390/s23021041 10.3390/fi15020084 10.1109/TCYB.2022.3189688 10.3390/app14209511 10.15918/j.jbit1004-0579.2022.076 10.3390/app11083605 10.1007/s10462-023-10558-5 10.1109/TASE.2022.3212428 10.1016/j.dt.2020.11.014 10.3390/electronics12020275 10.3390/s22166198 10.21608/dusj.2023.291056 10.1109/TMC.2022.3193499 10.1109/TPAMI.2022.3212594 10.1109/TITS.2022.3202225 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2025 2025. The Author(s). The Author(s) 2025 2025 |
| Copyright_xml | – notice: The Author(s) 2025 – notice: 2025. The Author(s). – notice: The Author(s) 2025 2025 |
| DBID | C6C AAYXX CITATION NPM 7X8 5PM DOA |
| DOI | 10.1038/s41598-025-04865-w |
| DatabaseName | Springer Nature OA Free Journals CrossRef PubMed MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed MEDLINE - Academic |
| DatabaseTitleList | PubMed MEDLINE - Academic |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Open Access Full Text url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 2045-2322 |
| EndPage | 17 |
| ExternalDocumentID | oai_doaj_org_article_1a24b4022f4045efb3bf46540cd82f08 PMC12214500 40594171 10_1038_s41598_025_04865_w |
| Genre | Journal Article |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 2345678 |
| GroupedDBID | 0R~ 4.4 53G 5VS 7X7 88E 88I 8FE 8FH 8FI 8FJ AAFWJ AAJSJ AAKDD AASML ABDBF ABUWG ACGFS ACUHS ADBBV ADRAZ AENEX AEUYN AFKRA AFPKN ALIPV ALMA_UNASSIGNED_HOLDINGS AOIJS AZQEC BAWUL BBNVY BCNDV BENPR BHPHI BPHCQ BVXVI C6C CCPQU DIK DWQXO EBD EBLON EBS ESX FYUFA GNUQQ GROUPED_DOAJ GX1 HCIFZ HH5 HMCUK HYE KQ8 LK8 M1P M2P M7P M~E NAO OK1 PHGZM PHGZT PIMPY PQQKQ PROAC PSQYO RNT RNTTT RPM SNYQT UKHRP AAYXX AFFHD CITATION PJZUB PPXIY PQGLB NPM 7X8 PUEGO 5PM |
| ID | FETCH-LOGICAL-c466t-7be5a0b68d3608139048c3f87b16d37ad8ba534d7dde39d349ad397d42670dce3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001523033000025&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2045-2322 |
| IngestDate | Fri Oct 03 12:45:28 EDT 2025 Tue Nov 04 02:04:52 EST 2025 Tue Aug 26 08:59:21 EDT 2025 Mon Jul 21 06:03:37 EDT 2025 Sat Nov 29 07:46:56 EST 2025 Wed Jul 02 02:43:43 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Twin network Tennis Path planning Target tracking algorithm Intelligent robots |
| Language | English |
| License | 2025. The Author(s). Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c466t-7be5a0b68d3608139048c3f87b16d37ad8ba534d7dde39d349ad397d42670dce3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://doaj.org/article/1a24b4022f4045efb3bf46540cd82f08 |
| PMID | 40594171 |
| PQID | 3226354817 |
| PQPubID | 23479 |
| PageCount | 17 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_1a24b4022f4045efb3bf46540cd82f08 pubmedcentral_primary_oai_pubmedcentral_nih_gov_12214500 proquest_miscellaneous_3226354817 pubmed_primary_40594171 crossref_primary_10_1038_s41598_025_04865_w springer_journals_10_1038_s41598_025_04865_w |
| PublicationCentury | 2000 |
| PublicationDate | 2025-07-01 |
| PublicationDateYYYYMMDD | 2025-07-01 |
| PublicationDate_xml | – month: 07 year: 2025 text: 2025-07-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: England |
| PublicationTitle | Scientific reports |
| PublicationTitleAbbrev | Sci Rep |
| PublicationTitleAlternate | Sci Rep |
| PublicationYear | 2025 |
| Publisher | Nature Publishing Group UK Nature Portfolio |
| Publisher_xml | – name: Nature Publishing Group UK – name: Nature Portfolio |
| References | J Chang (4865_CR33) 2022; 58 4865_CR12 4865_CR34 Y Tao (4865_CR6) 2021; 11 Y Li (4865_CR35) 2022; 21 4865_CR32 H Wang (4865_CR37) 2024 H Suljagic (4865_CR24) 2022; 34 4865_CR16 4865_CR18 M Latifinavid (4865_CR3) 2023; 15 Z Essam (4865_CR31) 2023; 6 L Zhou (4865_CR11) 2022; 22 L Huang (4865_CR27) 2022; 23 B Li (4865_CR15) 2021; 17 C Lin (4865_CR29) 2022; 24 W Chi (4865_CR17) 2021; 69 H Bao (4865_CR10) 2022; 33 D Li (4865_CR20) 2022; 40 X Cao (4865_CR23) 2022; 53 4865_CR21 J Wang (4865_CR19) 2021; 25 Y Li (4865_CR25) 2023; 32 C Shen (4865_CR2) 2022; 51 Z Xia (4865_CR9) 2021; 71 A Williams (4865_CR1) 2022; 1 AJ Moshayedi (4865_CR22) 2024 MS Lee (4865_CR30) 2022; 36 C Fu (4865_CR13) 2023; 56 A Pramanik (4865_CR26) 2021; 6 X Han (4865_CR28) 2024 Z Tang (4865_CR38) 2022; 89 4865_CR7 4865_CR8 F Kiani (4865_CR4) 2022; 12 4865_CR5 S Javed (4865_CR14) 2022; 45 L Zhai (4865_CR36) 2022; 42 |
| References_xml | – volume: 23 start-page: 20681 issue: 18 year: 2022 ident: 4865_CR27 publication-title: IEEE Sens. J. doi: 10.1109/JSEN.2022.3220341 – volume: 34 start-page: 18171 year: 2022 ident: 4865_CR24 publication-title: NEURAL COMPUT. APPL. doi: 10.1007/s00521-022-07456-2 – volume: 1 start-page: 118 issue: 2 year: 2022 ident: 4865_CR1 publication-title: AIA doi: 10.47852/bonviewAIA2202331 – volume: 58 start-page: 4953 issue: 6 year: 2022 ident: 4865_CR33 publication-title: IEEE Trans. Aerosp. Electron. Syst. doi: 10.1109/TAES.2022.3198925 – ident: 4865_CR7 doi: 10.47852/bonviewAIA32021018 – year: 2024 ident: 4865_CR28 doi: 10.3390/jmse12091528 – volume: 51 start-page: 866 issue: 4 year: 2022 ident: 4865_CR2 publication-title: J. Opt. doi: 10.1145/3627341.3630401 – volume: 71 start-page: 931 issue: 1 year: 2021 ident: 4865_CR9 publication-title: IEEE Trans. Veh. Technol. doi: 10.1109/TVT.2021.3129504 – volume: 21 start-page: 7897 issue: 10 year: 2022 ident: 4865_CR35 publication-title: IEEE T WIREL. COMM. doi: 10.1109/TWC.2022.3162749 – ident: 4865_CR16 doi: 10.3390/rs14102357 – volume: 12 start-page: 943 issue: 3 year: 2022 ident: 4865_CR4 publication-title: Appl. Sci. doi: 10.3390/app12030943 – year: 2024 ident: 4865_CR22 doi: 10.1109/ACCESS.2024.3355278 – volume: 69 start-page: 4926 issue: 5 year: 2021 ident: 4865_CR17 publication-title: IEEE Trans. Ind. Electron. doi: 10.1109/TIE.2021.3078390 – ident: 4865_CR34 doi: 10.1177/09544100211007381 – volume: 25 start-page: 121 issue: 1 year: 2021 ident: 4865_CR19 publication-title: J. Adv. Comput. Intell. Intell. Inf. doi: 10.20965/jaciii.2021.p0121 – volume: 6 start-page: 171 issue: 1 year: 2021 ident: 4865_CR26 publication-title: IEEE Trans. Emerg. Top. Comput. Intell. doi: 10.1109/TETCI.2020.3041019 – volume: 42 start-page: 5773 issue: 6 year: 2022 ident: 4865_CR36 publication-title: J. Intell. Fuzzy Syst. doi: 10.3233/JIFS-212220 – volume: 36 start-page: 12993 issue: 11 year: 2022 ident: 4865_CR30 publication-title: AAAI Conf. Artif. Intell. doi: 10.1609/aaai.v36i11.21633 – volume: 33 start-page: 847 issue: 2 year: 2022 ident: 4865_CR10 publication-title: IEEE Trans. Circuits Syst. Video Technol. doi: 10.1109/TCSVT.2022.3207202 – ident: 4865_CR8 doi: 10.1145/3441656 – volume: 89 start-page: 1 year: 2022 ident: 4865_CR38 publication-title: Int. J. Veh. Des. doi: 10.1504/IJVD.2022.128016 – ident: 4865_CR32 doi: 10.3390/s23021041 – volume: 15 start-page: 84 issue: 2 year: 2023 ident: 4865_CR3 publication-title: Future Internet doi: 10.3390/fi15020084 – volume: 53 start-page: 1968 issue: 3 year: 2022 ident: 4865_CR23 publication-title: IEEE T Cybern doi: 10.1109/TCYB.2022.3189688 – year: 2024 ident: 4865_CR37 doi: 10.3390/app14209511 – volume: 32 start-page: 82 issue: 1 year: 2023 ident: 4865_CR25 publication-title: J. Beijing Inst. Technol. doi: 10.15918/j.jbit1004-0579.2022.076 – volume: 11 start-page: 3605 issue: 8 year: 2021 ident: 4865_CR6 publication-title: Appl. Sci. doi: 10.3390/app11083605 – volume: 56 start-page: 1417 year: 2023 ident: 4865_CR13 publication-title: Artif. Intell. Rev. doi: 10.1007/s10462-023-10558-5 – ident: 4865_CR21 – volume: 40 start-page: 2321 issue: 4 year: 2022 ident: 4865_CR20 publication-title: IEEE Trans. Autom. Sci. Eng. doi: 10.1109/TASE.2022.3212428 – volume: 17 start-page: 457 issue: 2 year: 2021 ident: 4865_CR15 publication-title: DEF. TECHNOL. doi: 10.1016/j.dt.2020.11.014 – ident: 4865_CR12 doi: 10.3390/electronics12020275 – ident: 4865_CR18 doi: 10.3390/s22166198 – volume: 6 start-page: 247 issue: 1 year: 2023 ident: 4865_CR31 publication-title: Qayyum Dev. Auton. Table Tennis Ball Retrieving Robot Delta Univ. Scient J. doi: 10.21608/dusj.2023.291056 – ident: 4865_CR5 – volume: 22 start-page: 6526 issue: 11 year: 2022 ident: 4865_CR11 publication-title: IEEE Trans. Mob. Comput. doi: 10.1109/TMC.2022.3193499 – volume: 45 start-page: 6552 issue: 5 year: 2022 ident: 4865_CR14 publication-title: IEEE Trans. Pattern Anal. Mach. Intell. doi: 10.1109/TPAMI.2022.3212594 – volume: 24 start-page: 8580 issue: 8 year: 2022 ident: 4865_CR29 publication-title: IEEE Trans. Intell. Transp. Syst. doi: 10.1109/TITS.2022.3202225 |
| SSID | ssj0000529419 |
| Score | 2.4590578 |
| Snippet | Intelligent tennis picking robots can effectively improve the efficiency of tennis training and competition, and reduce manual labor intensity. However, the... Abstract Intelligent tennis picking robots can effectively improve the efficiency of tennis training and competition, and reduce manual labor intensity.... |
| SourceID | doaj pubmedcentral proquest pubmed crossref springer |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Publisher |
| StartPage | 20668 |
| SubjectTerms | 639/705/1042 639/705/117 Humanities and Social Sciences Intelligent robots multidisciplinary Path planning Science Science (multidisciplinary) Target tracking algorithm Tennis Twin network |
| Title | Path planning of intelligent tennis ball picking robot integrating twin network target tracking algorithm |
| URI | https://link.springer.com/article/10.1038/s41598-025-04865-w https://www.ncbi.nlm.nih.gov/pubmed/40594171 https://www.proquest.com/docview/3226354817 https://pubmed.ncbi.nlm.nih.gov/PMC12214500 https://doaj.org/article/1a24b4022f4045efb3bf46540cd82f08 |
| Volume | 15 |
| WOSCitedRecordID | wos001523033000025&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Open Access Full Text customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: DOA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M~E dateStart: 20110101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M7P dateStart: 20110101 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Health Medical collection customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: 7X7 dateStart: 20110101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: BENPR dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: PIMPY dateStart: 20110101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M2P dateStart: 20110101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELagBYkL4k14rIzEDaImthM7R4pawaGrCIG0nCw_Yhppm6w2Kav--47t7KoLCC5c5uA4iudhzzgef4PQWytU2ZSlTitBVcoqR1LtDE1VxT3gmqbMqFBsgs_nYrGo6hulvnxOWIQHjoI7yhVhGjY5xDGIPhqnqXYeAywzVhAXr_lmvLqxmYqo3qRieTXdksmoOBrAU_nbZKRIPcpckW72PFEA7P9TlPl7suQvJ6bBEZ0-QPenCBJ_iCN_iG413SN0N9aUvHqM2hpiOryaahHh3uF2h7o54tEnswxYq-USr1rj_5Pjda_7EW9xI3zLuGk73MUEcRxzxTGMKnZXyx_9uh3PL56gb6cnXz9-Sqd6CqlhZTmmXDeFynQpLC0hEqAVCMJQJ7jOS0u5skKrgjLLYcmjlaWsUhbCFQtOnGfAP32KDrq-a54jzOFdbsC3KWaZyIxwhGtaCGOYFU7rBL3bylauImyGDMfdVMioCQmakEETcpOgYy_-XU8PeR0awBDkZAjyX4aQoDdb5UmYIv7cQ3VNfzlIWLMgrGIi5wl6FpW5-xTzeDU5zxMk9tS8N5b9J117HmC4c-JR3rMsQe-3FiGnBWD4C7Mv_gezL9E9EkzZ5w2_Qgfj-rJ5je6Yn2M7rGfoNl_wQMUMHR6fzOsvszA_gJ6R2lMO9LD-fFZ_vwb45xW3 |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Path+planning+of+intelligent+tennis+ball+picking+robot+integrating+twin+network+target+tracking+algorithm&rft.jtitle=Scientific+reports&rft.au=Wang%2C+Zegang&rft.date=2025-07-01&rft.issn=2045-2322&rft.eissn=2045-2322&rft.volume=15&rft.issue=1&rft.spage=20668&rft_id=info:doi/10.1038%2Fs41598-025-04865-w&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2045-2322&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2045-2322&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2045-2322&client=summon |