Shortest Path Algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model
Accurate and fast path calculation is essential for applications such as vehicle navigation systems and transportation network routing. Although many shortest path algorithms for restricted search areas have been developed in the past ten years to speed up the efficiency of path query, the performan...
Uložené v:
| Vydané v: | Sensors (Basel, Switzerland) Ročník 21; číslo 1; s. 203 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Switzerland
MDPI
30.12.2020
MDPI AG |
| Predmet: | |
| ISSN: | 1424-8220, 1424-8220 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Accurate and fast path calculation is essential for applications such as vehicle navigation systems and transportation network routing. Although many shortest path algorithms for restricted search areas have been developed in the past ten years to speed up the efficiency of path query, the performance including the practicability still needs to be improved. To settle this problem, this paper proposes a new method of calculating statistical parameters based on a unidirectional road network model that is more in line with the real world and a path planning algorithm for dynamically restricted search areas that constructs virtual boundaries at a lower confidence level. We conducted a detailed experiment on the proposed algorithm with the real road network in Zhengzhou. As the experiment shows, compared with the existing algorithms, the proposed algorithm improves the search performance significantly in the condition of optimal path under the premise of ensuring the optimal path solution. |
|---|---|
| AbstractList | Accurate and fast path calculation is essential for applications such as vehicle navigation systems and transportation network routing. Although many shortest path algorithms for restricted search areas have been developed in the past ten years to speed up the efficiency of path query, the performance including the practicability still needs to be improved. To settle this problem, this paper proposes a new method of calculating statistical parameters based on a unidirectional road network model that is more in line with the real world and a path planning algorithm for dynamically restricted search areas that constructs virtual boundaries at a lower confidence level. We conducted a detailed experiment on the proposed algorithm with the real road network in Zhengzhou. As the experiment shows, compared with the existing algorithms, the proposed algorithm improves the search performance significantly in the condition of optimal path under the premise of ensuring the optimal path solution. Accurate and fast path calculation is essential for applications such as vehicle navigation systems and transportation network routing. Although many shortest path algorithms for restricted search areas have been developed in the past ten years to speed up the efficiency of path query, the performance including the practicability still needs to be improved. To settle this problem, this paper proposes a new method of calculating statistical parameters based on a unidirectional road network model that is more in line with the real world and a path planning algorithm for dynamically restricted search areas that constructs virtual boundaries at a lower confidence level. We conducted a detailed experiment on the proposed algorithm with the real road network in Zhengzhou. As the experiment shows, compared with the existing algorithms, the proposed algorithm improves the search performance significantly in the condition of optimal path under the premise of ensuring the optimal path solution.Accurate and fast path calculation is essential for applications such as vehicle navigation systems and transportation network routing. Although many shortest path algorithms for restricted search areas have been developed in the past ten years to speed up the efficiency of path query, the performance including the practicability still needs to be improved. To settle this problem, this paper proposes a new method of calculating statistical parameters based on a unidirectional road network model that is more in line with the real world and a path planning algorithm for dynamically restricted search areas that constructs virtual boundaries at a lower confidence level. We conducted a detailed experiment on the proposed algorithm with the real road network in Zhengzhou. As the experiment shows, compared with the existing algorithms, the proposed algorithm improves the search performance significantly in the condition of optimal path under the premise of ensuring the optimal path solution. |
| Author | He, Xiaohui Wei, Haitao Zhang, Shusheng |
| AuthorAffiliation | School of Earth Science and Technology, Zhengzhou University, No. 75 Daxue North Road, Erqi District, Zhengzhou 450052, China; zzu_wei@zzu.edu.cn (H.W.); zhangssgiser@gs.zzu.edu.cn (S.Z.) |
| AuthorAffiliation_xml | – name: School of Earth Science and Technology, Zhengzhou University, No. 75 Daxue North Road, Erqi District, Zhengzhou 450052, China; zzu_wei@zzu.edu.cn (H.W.); zhangssgiser@gs.zzu.edu.cn (S.Z.) |
| Author_xml | – sequence: 1 givenname: Haitao surname: Wei fullname: Wei, Haitao – sequence: 2 givenname: Shusheng surname: Zhang fullname: Zhang, Shusheng – sequence: 3 givenname: Xiaohui surname: He fullname: He, Xiaohui |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/33396895$$D View this record in MEDLINE/PubMed |
| BookMark | eNptkUlvFDEQRlsoiCxw4A8gH-EwxFsvviBNwhYpLArkiKxquzzj0GMH25Mo_x6HCaMEcaqS6_mV5W-_2QkxYNM8Z_S1EIoeZs4oo5yKR80ek1zOBs7pzr1-t9nP-YJSLoQYnjS7tahuUO1e8-PbMqaCuZCvUJZkPi1i8mW5Ij6QtzcBVt6QszpO3hS0ZJ4QyBHk2sZAzoO3PqEpPgaYyFkESz5juY7pJ_kULU5Pm8cOpozP7upBc_7-3ffjj7PTLx9OjuenMyMlKzPJjOUtVdYBHxHYSBkYwBE6rjgOo6WMgxsAW-Ooki3QkQtjjWuHUWHnxEFzsvHaCBf6MvkVpBsdwes_BzEtNKTizYTadlIw1zs-mF7KjinJe0MpUjbQ1nFeXW82rsv1uEJrMJQE0wPpw0nwS72IV7rvVSt7WgUv7wQp_lrXv9Mrnw1OEwSM66y57FuhRCe7ir64v2u75G8-FXi1AUyKOSd0W4RRfZu93mZf2cN_WOML3GZTn-mn_9z4DVOysJA |
| CitedBy_id | crossref_primary_10_3390_s21124219 crossref_primary_10_3390_app15084162 crossref_primary_10_1007_s11277_022_09670_6 crossref_primary_10_1109_TNSM_2023_3245544 crossref_primary_10_3390_s23125471 crossref_primary_10_1016_j_disopt_2023_100761 crossref_primary_10_1177_03611981231172961 |
| Cites_doi | 10.1109/3468.594911 10.1023/A:1008751210054 10.3390/s18124275 10.1371/journal.pone.0192274 10.1007/BF01386390 10.1177/1550147719873815 10.1016/j.amc.2011.01.019 10.1126/science.220.4598.671 10.1016/j.ejor.2014.11.003 10.1109/TSSC.1968.300136 10.1016/j.optlaseng.2013.08.011 10.3390/electronics8070722 10.1016/j.ejor.2019.01.007 10.1109/TKDE.2002.1033772 10.1016/j.cor.2008.02.002 10.1007/BF01933251 10.1016/j.ijdrr.2019.101080 10.1109/TEVC.2002.802444 10.1016/0377-2217(91)90094-C 10.1016/j.cie.2006.07.007 10.1017/S0263574719000183 10.3390/s16071013 10.1109/TVT.2017.2661316 10.1016/j.compeleceng.2015.10.011 10.1109/CSCWD.2013.6581044 10.1109/3477.484436 |
| ContentType | Journal Article |
| Copyright | 2020 by the authors. 2020 |
| Copyright_xml | – notice: 2020 by the authors. 2020 |
| DBID | AAYXX CITATION NPM 7X8 5PM DOA |
| DOI | 10.3390/s21010203 |
| DatabaseName | CrossRef PubMed MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed MEDLINE - Academic |
| DatabaseTitleList | PubMed CrossRef MEDLINE - Academic |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals 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 | Engineering |
| EISSN | 1424-8220 |
| ExternalDocumentID | oai_doaj_org_article_d6431f7f28c744619427c00e01805f22 PMC7795470 33396895 10_3390_s21010203 |
| Genre | Journal Article |
| GroupedDBID | --- 123 2WC 53G 5VS 7X7 88E 8FE 8FG 8FI 8FJ AADQD AAHBH AAYXX ABDBF ABUWG ACUHS ADBBV ADMLS AENEX AFFHD AFKRA AFZYC ALMA_UNASSIGNED_HOLDINGS BENPR BPHCQ BVXVI CCPQU CITATION CS3 D1I DU5 E3Z EBD ESX F5P FYUFA GROUPED_DOAJ GX1 HH5 HMCUK HYE KQ8 L6V M1P M48 MODMG M~E OK1 OVT P2P P62 PHGZM PHGZT PIMPY PJZUB PPXIY PQQKQ PROAC PSQYO RNS RPM TUS UKHRP XSB ~8M 3V. ABJCF ALIPV ARAPS HCIFZ KB. M7S NPM PDBOC 7X8 5PM |
| ID | FETCH-LOGICAL-c441t-41cd2509dfa2bea1b01acaeba6292e8bd012af8ae5cf0945a0b23cdcf58b9e6f3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 9 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000606077600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1424-8220 |
| IngestDate | Mon Nov 10 04:35:23 EST 2025 Tue Nov 04 02:01:40 EST 2025 Sun Nov 09 13:34:48 EST 2025 Wed Feb 19 02:29:29 EST 2025 Sat Nov 29 07:15:54 EST 2025 Tue Nov 18 22:16:51 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | unidirectional road network navigation statistical parameter restrict search area path planning Dijkstra algorithm |
| Language | English |
| License | Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c441t-41cd2509dfa2bea1b01acaeba6292e8bd012af8ae5cf0945a0b23cdcf58b9e6f3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://doaj.org/article/d6431f7f28c744619427c00e01805f22 |
| PMID | 33396895 |
| PQID | 2475393646 |
| PQPubID | 23479 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_d6431f7f28c744619427c00e01805f22 pubmedcentral_primary_oai_pubmedcentral_nih_gov_7795470 proquest_miscellaneous_2475393646 pubmed_primary_33396895 crossref_primary_10_3390_s21010203 crossref_citationtrail_10_3390_s21010203 |
| PublicationCentury | 2000 |
| PublicationDate | 20201230 |
| PublicationDateYYYYMMDD | 2020-12-30 |
| PublicationDate_xml | – month: 12 year: 2020 text: 20201230 day: 30 |
| PublicationDecade | 2020 |
| PublicationPlace | Switzerland |
| PublicationPlace_xml | – name: Switzerland |
| PublicationTitle | Sensors (Basel, Switzerland) |
| PublicationTitleAlternate | Sensors (Basel) |
| PublicationYear | 2020 |
| Publisher | MDPI MDPI AG |
| Publisher_xml | – name: MDPI – name: MDPI AG |
| References | Jung (ref_26) 2015; 14 Gao (ref_3) 2016; 51 Lu (ref_13) 2011; 217 ref_35 ref_12 ref_11 ref_33 ref_10 Hart (ref_16) 1968; 4 Duque (ref_30) 2015; 242 Bing (ref_23) 1997; 27 Sergiyenko (ref_2) 2014; 54 Wang (ref_34) 2011; 31 Wang (ref_22) 2006; 1 Climaco (ref_27) 1981; 40 Dijkstra (ref_15) 1959; 1 Schilling (ref_24) 2005; 11 Liu (ref_8) 2019; 37 Leandro (ref_5) 2019; 36 ref_25 Divitini (ref_36) 2000; 9 Lin (ref_18) 2020; 3 Kirkpatrick (ref_19) 1983; 220 ref_21 Stutzle (ref_37) 2002; 6 ref_20 Dorigo (ref_17) 1996; 26 Fu (ref_32) 2004; 10 Raith (ref_29) 2009; 36 Lu (ref_31) 1999; 10 Colebrook (ref_14) 2019; 276 Jung (ref_1) 2006; 51 ref_9 Mote (ref_28) 1991; 53 ref_4 ref_7 ref_6 |
| References_xml | – volume: 27 start-page: 436 year: 1997 ident: ref_23 article-title: Route finding by using knowledge about the road network publication-title: IEEE Trans. Syst. ManCybern Part A Syst. Hum. doi: 10.1109/3468.594911 – volume: 9 start-page: 365 year: 2000 ident: ref_36 article-title: supporting different dimensions of adaptability in workflow modeling publication-title: Comput. Supported Coop. Work doi: 10.1023/A:1008751210054 – ident: ref_10 doi: 10.3390/s18124275 – ident: ref_12 doi: 10.1371/journal.pone.0192274 – volume: 3 start-page: 1 year: 2020 ident: ref_18 article-title: A genetic algorithm for the fuzzy shortest path problem in a fuzzy network publication-title: Complex. Intell. Syst. – volume: 1 start-page: 269 year: 1959 ident: ref_15 article-title: A note on two problems in connexion with graphs publication-title: Numer. Math. doi: 10.1007/BF01386390 – ident: ref_9 doi: 10.1177/1550147719873815 – volume: 31 start-page: 1158 year: 2011 ident: ref_34 article-title: Ellipse-based shortest path algorithm for typical urban road networks publication-title: Syst. Eng. Theory Pract. – volume: 217 start-page: 6401 year: 2011 ident: ref_13 article-title: Finding the shortest paths by node combination publication-title: Appl. Math. Comput. doi: 10.1016/j.amc.2011.01.019 – volume: 220 start-page: 671 year: 1983 ident: ref_19 article-title: Optimization by simulated annealing publication-title: Science doi: 10.1126/science.220.4598.671 – volume: 242 start-page: 788 year: 2015 ident: ref_30 article-title: An exact method for the biobjective shortest path problem for large-scale road networks publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2014.11.003 – volume: 4 start-page: 100 year: 1968 ident: ref_16 article-title: A formal basis for the heuristic determination of minimum cost paths publication-title: IEEE Trans. Syst. Sci. Cybern. doi: 10.1109/TSSC.1968.300136 – volume: 54 start-page: 141 year: 2014 ident: ref_2 article-title: Optimization of 3D laser scanning speed by use of combined variable step publication-title: Opt. Lasers Eng. doi: 10.1016/j.optlaseng.2013.08.011 – volume: 1 start-page: 123 year: 2006 ident: ref_22 article-title: Shortest path algorithm based on limiting parallelogram and its application in traffic networks publication-title: J. Jilin Univ. – volume: 11 start-page: 1 year: 2005 ident: ref_24 article-title: Partitioning graphs to speed up Dijkstra’s algorithm publication-title: J. Exp. Algorithmics – volume: 10 start-page: 3 year: 1999 ident: ref_31 article-title: Time shortest path algorithm for restricted searching area in transportation networks publication-title: J. Image Graph. – volume: 10 start-page: 881 year: 2004 ident: ref_32 article-title: A route planning algorithm for the shortest distance within a restricted searching area publication-title: J. Beijing Inst. Technol. – ident: ref_11 doi: 10.3390/electronics8070722 – ident: ref_6 – volume: 276 start-page: 106 year: 2019 ident: ref_14 article-title: A biobjective Dijkstra algorithm publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2019.01.007 – volume: 14 start-page: 1029 year: 2015 ident: ref_26 article-title: An efficient path computation model for hierarchically structured topographical road maps publication-title: IEEE Trans. Knowl. Data Eng. doi: 10.1109/TKDE.2002.1033772 – ident: ref_25 – volume: 36 start-page: 1299 year: 2009 ident: ref_29 article-title: A comparison of solution strategies for biobjective shortest path problems publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2008.02.002 – ident: ref_33 – ident: ref_21 doi: 10.1007/BF01933251 – volume: 36 start-page: 101080 year: 2019 ident: ref_5 article-title: Proposal to planning facility location using UAV and geographic information systems in a post-disaster scenario publication-title: Int. J. Disaster Risk Reduct. doi: 10.1016/j.ijdrr.2019.101080 – volume: 6 start-page: 358 year: 2002 ident: ref_37 article-title: A short convergence proof for a class of ant colony optimization algorithms publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2002.802444 – volume: 53 start-page: 81 year: 1991 ident: ref_28 article-title: A parametric approach to solving bicriterion shortest path problems publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(91)90094-C – volume: 51 start-page: 154 year: 2006 ident: ref_1 article-title: Integration of GIS, GPS, and optimization technologies for the effective control of parcel delivery service publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2006.07.007 – volume: 37 start-page: 1663 year: 2019 ident: ref_8 article-title: Obstacle Avoidance through Gesture Recognition: Business Advancement Potential in Robot Navigation Socio-Technology publication-title: Robotica doi: 10.1017/S0263574719000183 – volume: 40 start-page: 255 year: 1981 ident: ref_27 article-title: On the determination of the nondominated paths in a multiobjective network problem publication-title: Methods. Oper Res. – ident: ref_20 – ident: ref_4 doi: 10.3390/s16071013 – ident: ref_7 doi: 10.1109/TVT.2017.2661316 – volume: 51 start-page: 370 year: 2016 ident: ref_3 article-title: Interacting multiple model for improving the precision of vehicle-mounted global position system publication-title: Comput. Electr. Eng. doi: 10.1016/j.compeleceng.2015.10.011 – ident: ref_35 doi: 10.1109/CSCWD.2013.6581044 – volume: 26 start-page: 29 year: 1996 ident: ref_17 article-title: Ant system: Optimization by a colony of cooperating agents publication-title: IEEE Trans. Syst. Man. Cybern. Part. B doi: 10.1109/3477.484436 |
| SSID | ssj0023338 |
| Score | 2.386156 |
| Snippet | Accurate and fast path calculation is essential for applications such as vehicle navigation systems and transportation network routing. Although many shortest... |
| SourceID | doaj pubmedcentral proquest pubmed crossref |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Enrichment Source |
| StartPage | 203 |
| SubjectTerms | Dijkstra algorithm navigation path planning restrict search area statistical parameter unidirectional road network |
| Title | Shortest Path Algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/33396895 https://www.proquest.com/docview/2475393646 https://pubmed.ncbi.nlm.nih.gov/PMC7795470 https://doaj.org/article/d6431f7f28c744619427c00e01805f22 |
| Volume | 21 |
| WOSCitedRecordID | wos000606077600001&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 Directory of Open Access Journals customDbUrl: eissn: 1424-8220 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023338 issn: 1424-8220 databaseCode: DOA dateStart: 20010101 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: 1424-8220 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023338 issn: 1424-8220 databaseCode: M~E dateStart: 20010101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1424-8220 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023338 issn: 1424-8220 databaseCode: BENPR dateStart: 20010101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Health & Medical Collection customDbUrl: eissn: 1424-8220 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023338 issn: 1424-8220 databaseCode: 7X7 dateStart: 20010101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1424-8220 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023338 issn: 1424-8220 databaseCode: PIMPY dateStart: 20010101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lj9MwEB7BwgEOiDfhURnEgUu0jvOwfdxCV3DYKioglQOK_NxWKslq290jv51xnFYtWokLlxwcK7FmJpnviyffALzPbZ4pRU0a_mtMC1uKVBmuU6O0FZXFGOC6bzbBp1Mxn8t6r9VXqAmL8sDRcMcWU2bmuWfCcKQuyLkZN5S6IDxVeta_fSmXWzI1UK0cmVfUEcqR1B-vkdhkYc_tIPv0Iv03Icu_CyT3Ms7pQ3gwQEVyEpf4CG659jHc3xMQfAI_vy5Csex6Q2pEcuRkdd4h2V_8IsuWfIq95snMhdYcBpElXsopMsa8ZUnXEoSbMaH1XwPJrFOWTGNVOAkt0lZP4fvp5NvHz-nQMCE1iGo2aZEZi5BGWq-YdirTNFNGOa0qJpkTGk3PlBfKlcYjrSsV1Sw31vhSaOkqnz-Do7Zr3QsgOUOPWVpoUVqkmFbYrNSeOyqZDZo2CXzYGrIxg5p4aGqxapBVBJs3O5sn8G439SJKaNw0aRy8sZsQVK_7AYyFZoiF5l-xkMDbrS8bfErC1odqXXe1bliBtEzmVVEl8Dz6dncrjBVZCVkmwA-8frCWwzPtctErcXMuy4LTl_9j8a_gHgtcPohI0tdwtLm8cm_grrneLNeXI7jN57w_ihHcGU-m9WzUhzwez35PcKz-clb_-AP1ugXo |
| 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=Shortest+Path+Algorithm+in+Dynamic+Restricted+Area+Based+on+Unidirectional+Road+Network+Model&rft.jtitle=Sensors+%28Basel%2C+Switzerland%29&rft.au=Wei%2C+Haitao&rft.au=Zhang%2C+Shusheng&rft.au=He%2C+Xiaohui&rft.date=2020-12-30&rft.issn=1424-8220&rft.eissn=1424-8220&rft.volume=21&rft.issue=1&rft_id=info:doi/10.3390%2Fs21010203&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1424-8220&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1424-8220&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1424-8220&client=summon |