{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T09:10:22Z","timestamp":1771924222088,"version":"3.50.1"},"reference-count":52,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T00:00:00Z","timestamp":1690502400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62271193"],"award-info":[{"award-number":["62271193"]}],"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":["20185142003"],"award-info":[{"award-number":["20185142003"]}],"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":["222300420433"],"award-info":[{"award-number":["222300420433"]}],"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":["21HASTIT030"],"award-info":[{"award-number":["21HASTIT030"]}],"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":["2020GGJS073"],"award-info":[{"award-number":["2020GGJS073"]}],"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":["231100220200"],"award-info":[{"award-number":["231100220200"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012130","name":"Aeronautical Science Foundation of China","doi-asserted-by":"publisher","award":["62271193"],"award-info":[{"award-number":["62271193"]}],"id":[{"id":"10.13039\/501100012130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012130","name":"Aeronautical Science Foundation of China","doi-asserted-by":"publisher","award":["20185142003"],"award-info":[{"award-number":["20185142003"]}],"id":[{"id":"10.13039\/501100012130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012130","name":"Aeronautical Science Foundation of China","doi-asserted-by":"publisher","award":["222300420433"],"award-info":[{"award-number":["222300420433"]}],"id":[{"id":"10.13039\/501100012130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012130","name":"Aeronautical Science Foundation of China","doi-asserted-by":"publisher","award":["21HASTIT030"],"award-info":[{"award-number":["21HASTIT030"]}],"id":[{"id":"10.13039\/501100012130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012130","name":"Aeronautical Science Foundation of China","doi-asserted-by":"publisher","award":["2020GGJS073"],"award-info":[{"award-number":["2020GGJS073"]}],"id":[{"id":"10.13039\/501100012130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012130","name":"Aeronautical Science Foundation of China","doi-asserted-by":"publisher","award":["231100220200"],"award-info":[{"award-number":["231100220200"]}],"id":[{"id":"10.13039\/501100012130","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Henan Province, China","award":["62271193"],"award-info":[{"award-number":["62271193"]}]},{"name":"Natural Science Foundation of Henan Province, China","award":["20185142003"],"award-info":[{"award-number":["20185142003"]}]},{"name":"Natural Science Foundation of Henan Province, China","award":["222300420433"],"award-info":[{"award-number":["222300420433"]}]},{"name":"Natural Science Foundation of Henan Province, China","award":["21HASTIT030"],"award-info":[{"award-number":["21HASTIT030"]}]},{"name":"Natural Science Foundation of Henan Province, China","award":["2020GGJS073"],"award-info":[{"award-number":["2020GGJS073"]}]},{"name":"Natural Science Foundation of Henan Province, China","award":["231100220200"],"award-info":[{"award-number":["231100220200"]}]},{"name":"Science and Technology Innovative Talents in Universities of Henan Province, China","award":["62271193"],"award-info":[{"award-number":["62271193"]}]},{"name":"Science and Technology Innovative Talents in Universities of Henan Province, China","award":["20185142003"],"award-info":[{"award-number":["20185142003"]}]},{"name":"Science and Technology Innovative Talents in Universities of Henan Province, China","award":["222300420433"],"award-info":[{"award-number":["222300420433"]}]},{"name":"Science and Technology Innovative Talents in Universities of Henan Province, China","award":["21HASTIT030"],"award-info":[{"award-number":["21HASTIT030"]}]},{"name":"Science and Technology Innovative Talents in Universities of Henan Province, China","award":["2020GGJS073"],"award-info":[{"award-number":["2020GGJS073"]}]},{"name":"Science and Technology Innovative Talents in Universities of Henan Province, China","award":["231100220200"],"award-info":[{"award-number":["231100220200"]}]},{"name":"Young Backbone Teachers in Universities of Henan Province, China","award":["62271193"],"award-info":[{"award-number":["62271193"]}]},{"name":"Young Backbone Teachers in Universities of Henan Province, China","award":["20185142003"],"award-info":[{"award-number":["20185142003"]}]},{"name":"Young Backbone Teachers in Universities of Henan Province, China","award":["222300420433"],"award-info":[{"award-number":["222300420433"]}]},{"name":"Young Backbone Teachers in Universities of Henan Province, China","award":["21HASTIT030"],"award-info":[{"award-number":["21HASTIT030"]}]},{"name":"Young Backbone Teachers in Universities of Henan Province, China","award":["2020GGJS073"],"award-info":[{"award-number":["2020GGJS073"]}]},{"name":"Young Backbone Teachers in Universities of Henan Province, China","award":["231100220200"],"award-info":[{"award-number":["231100220200"]}]},{"name":"Major Science and Technology Projects of Longmen Laboratory","award":["62271193"],"award-info":[{"award-number":["62271193"]}]},{"name":"Major Science and Technology Projects of Longmen Laboratory","award":["20185142003"],"award-info":[{"award-number":["20185142003"]}]},{"name":"Major Science and Technology Projects of Longmen Laboratory","award":["222300420433"],"award-info":[{"award-number":["222300420433"]}]},{"name":"Major Science and Technology Projects of Longmen Laboratory","award":["21HASTIT030"],"award-info":[{"award-number":["21HASTIT030"]}]},{"name":"Major Science and Technology Projects of Longmen Laboratory","award":["2020GGJS073"],"award-info":[{"award-number":["2020GGJS073"]}]},{"name":"Major Science and Technology Projects of Longmen Laboratory","award":["231100220200"],"award-info":[{"award-number":["231100220200"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Path planning is receiving considerable interest in mobile robot research; however, a large number of redundant nodes are typically encountered in the path search process for large-scale maps, resulting in decreased algorithmic efficiency. To address this problem, this paper proposes a graph search path planning algorithm that is based on map preprocessing for creating a weighted graph in the map, thus obtaining a structured search framework. In addition, the reductions in the DBSCAN algorithm were analyzed. Subsequently, the optimal combination of the minPts and Eps required to achieve an efficient and accurate clustering of obstacle communities was determined. The effective edge points were then found by performing obstacle collision detection between special grid nodes. A straight-line connection or A* planning strategy was used between the effective edge points to establish a weighted, undirected graph that contained the start and end points, thereby achieving a structured search framework. This approach reduces the impact of map scale on the time cost of the algorithm and improves the efficiency of path planning. The results of the simulation experiments indicate that the number of nodes to be calculated in the search process of the weighted graph decreases significantly when using the proposed algorithm, thus improving the path planning efficiency. The proposed algorithm offers excellent performance for large-scale maps with few obstacles.<\/jats:p>","DOI":"10.3390\/sym15081498","type":"journal-article","created":{"date-parts":[[2023,7,28]],"date-time":"2023-07-28T07:35:24Z","timestamp":1690529724000},"page":"1498","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Path Planning Algorithm Based on Obstacle Clustering Analysis and Graph Search"],"prefix":"10.3390","volume":"15","author":[{"given":"Lei","family":"Wang","sequence":"first","affiliation":[{"name":"School of International Education, Henan University of Science and Technology, Luoyang 471023, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lifan","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Henan University of Science and Technology, Luoyang 471023, China"},{"name":"Longmen Laboratory, Luoyang 471000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/3564696","article-title":"Multiple Mobile Robot Task and Motion Planning: A Survey","volume":"55","author":"Antonyshyn","year":"2023","journal-title":"ACM Comput. Surv."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"120254","DOI":"10.1016\/j.eswa.2023.120254","article-title":"Path planning techniques for mobile robots: Review and prospect","volume":"227","author":"Liu","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.eswa.2018.08.008","article-title":"Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm","volume":"115","author":"Nazarahari","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2351006","DOI":"10.1142\/S0218001423510060","article-title":"Characteristics and Optimization Strategies of A* Algorithm and Ant Colony Optimization in Global Path Planning Algorithm","volume":"37","author":"Ni","year":"2023","journal-title":"Int. J. Pattern Recognit."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1177\/09544070221100677","article-title":"Improved A-star algorithm based on multivariate fusion heuristic function for autonomous driving path planning","volume":"237","author":"Wang","year":"2022","journal-title":"Proc. Inst. Mech. Eng. Part D-J. Automob. Eng."},{"key":"ref_6","first-page":"915","article-title":"Development of Path Planning Approach Using Improved A-star Algorithm in AGV System","volume":"20","author":"Zhang","year":"2019","journal-title":"J. Internet Technol."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1729881418820223","DOI":"10.1177\/1729881418820223","article-title":"Path planning method with obstacle avoidance for manipulators in dynamic environment","volume":"15","author":"Chen","year":"2018","journal-title":"Int. J. Adv. Robot. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Iram, N., Amna, K., Khurshid, A., and Zulfiqar, H. (2019). A Path-Planning Performance Comparison of RRT*-AB with MEA* in a 2-Dimensional Environment. Symmetry, 11.","DOI":"10.3390\/sym11070945"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Chien-Ming, C., Shi, L., Jirsen, N., and Jimmy, W. (2023). A Genetic Algorithm for the Waitable Time-Varying Multi-Depot Green Vehicle Routing Problem. Symmetry, 15.","DOI":"10.3390\/sym15010124"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"17298806221127953","DOI":"10.1177\/17298806221127953","article-title":"A jump point search improved ant colony hybrid optimization algorithm for path planning of mobile robot","volume":"19","author":"Chen","year":"2022","journal-title":"Int. J. Adv. Robot. Syst."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"11364","DOI":"10.1109\/ACCESS.2023.3240518","article-title":"Optimal Path Planning Method for IMU System-Level Calibration Based on Improved Dijkstra\u2019s Algorithm","volume":"11","author":"Bai","year":"2023","journal-title":"IEEE Access"},{"key":"ref_12","unstructured":"Yilmaz, A., and Ozturk, O. (2021, January 27\u201329). Designing a LoRa Network Using Dijkstra\u2019s Algorithm. Proceedings of the 6th International Conference on Smart City Applications, Safranbolu, Turkey."},{"key":"ref_13","first-page":"356","article-title":"Path Planning for Smart Car Based on Dijkstra Algorithm and Dynamic Window Approach","volume":"2021","author":"Liu","year":"2021","journal-title":"Wirel. Commun. Mob. Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1736","DOI":"10.1007\/s00224-017-9841-2","article-title":"Space Efficient Linear Time Algorithms for BFS, DFS and Applications","volume":"62","author":"Banerjee","year":"2018","journal-title":"Theor. Comput. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Lai, W.K., Shieh, C.S., and Yang, C.P. (2022). A D2D Group Communication Scheme Using Bidirectional and InCremental A-Star Search to Configure Paths. Mathematics, 10.","DOI":"10.3390\/math10183321"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Wang, H., Qi, X., Lou, S., Jing, J., He, H., and Liu, W. (2021). An Efficient and Robust Improved A* Algorithm for Path Planning. Symmetry, 13.","DOI":"10.3390\/sym13112213"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.eswa.2016.12.003","article-title":"A new weighted pathfinding algorithms to reduce the search time on grid maps","volume":"71","author":"Zeyad","year":"2017","journal-title":"Expert Syst. Appl."},{"key":"ref_18","first-page":"3503","article-title":"A Big Data Based Dynamic Weight Approach for RFM Segmentation","volume":"74","author":"Lang","year":"2023","journal-title":"CMC-Comput. Mater. Contin."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"10307","DOI":"10.1007\/s10489-021-02962-7","article-title":"Fault diagnosis of diesel engine information fusion based on adaptive dynamic weighted hybrid distance-taguchi method (ADWHD-T)","volume":"52","author":"Liu","year":"2022","journal-title":"Appl. Intell."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1675","DOI":"10.1002\/asjc.2896","article-title":"Control allocation technology based on fault diagnosis for the unmanned aerial vehicle system subject to physical constraints and fault reconfiguration mismatch","volume":"25","author":"Wang","year":"2022","journal-title":"Asian J. Control"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Yang, R., and Cheng, L. (2019, January 14\u201315). Path planning of restaurant service robot based on a-star algorithms with updated weights. Proceedings of the 2019 12th International Symposium on Computational Intelligence and Design (ISCID), Hangzhou, China.","DOI":"10.1109\/ISCID.2019.00074"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Shang, E., Dai, B., Nie, Y., Zhu, Q., Xiao, L., and Zhao, D. (2020, January 20\u201323). A Guide-line and Key-point based A-star Path Planning Algorithm For Autonomous Land Vehicles. Proceedings of the 23rd IEEE International Conference on Intelligent Transportation Systems (ITSC), Rhodes, Greece.","DOI":"10.1109\/ITSC45102.2020.9294336"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Sun, J., Sun, Z., Wei, P., Liu, B., Wang, Y., Zhang, T., and Yan, C. (2023). Path Planning Algorithm for a Wheel-Legged Robot Based on the Theta* and Timed Elastic Band Algorithms. Symmetry, 15.","DOI":"10.3390\/sym15051091"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"4149","DOI":"10.1007\/s00500-015-1750-1","article-title":"Relaxed Dijkstra and A* with linear complexity for robot path planning problems in large-scale grid environments","volume":"20","author":"Ammar","year":"2016","journal-title":"Soft. Comput."},{"key":"ref_25","unstructured":"Harabor, D., and Grastien, A. (2012, January 19\u201321). The JPS pathfinding system. Proceedings of the 5th Annual Symposium on Combinatorial Search, Niagara Falls, ON, Canada."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Harabor, D., and Grastien, A. (2011, January 7\u201311). Online graph pruning for pathfinding on grid maps. Proceedings of the AAAI Conference on Artificial Intelligence, San Francisco, CA, USA.","DOI":"10.1609\/aaai.v25i1.7994"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Fahed, J., and Mohammed, H. (2020). Exploiting Obstacle Geometry to Reduce Search Time in Grid-Based Pathfinding. Symmetry, 12.","DOI":"10.3390\/sym12071186"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1002\/spe.3188","article-title":"The Floyd-Warshall all-pairs shortest paths algorithm for disconnected and very sparse graphs","volume":"53","author":"Toroslu","year":"2023","journal-title":"Softw. Pract. Exp."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"668","DOI":"10.2112\/SI106-151.1","article-title":"Application of Floyd Algorithm in the Design of a Coastal Tourism Route Optimization System","volume":"106","author":"Yang","year":"2020","journal-title":"J. Coastal. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.ins.2023.02.088","article-title":"A review on semi-supervised clustering","volume":"632","author":"Cai","year":"2023","journal-title":"Inf. Sci."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"5126","DOI":"10.1109\/TPAMI.2022.3188160","article-title":"Self-Constrained Spectral Clustering","volume":"45","author":"Bai","year":"2023","journal-title":"IEEE Trans. Pattern Anal."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1109\/TCYB.2018.2884715","article-title":"Incomplete Multiview Spectral Clustering with Adaptive Graph Learning","volume":"50","author":"Wen","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"14575","DOI":"10.1109\/ACCESS.2022.3147951","article-title":"A Novel Mean-Shift Algorithm for Data Clustering","volume":"10","author":"Cariou","year":"2022","journal-title":"IEEE Access"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"80716","DOI":"10.1109\/ACCESS.2020.2988796","article-title":"Unsupervised K-Means Clustering Algorithm","volume":"8","author":"Sinaga","year":"2020","journal-title":"IEEE Access"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Zhou, W., Wang, L., Han, X., Wang, Y., Zhang, Y., and Jia, Z. (2023). Adaptive Density Spatial Clustering Method Fusing Chameleon Swarm Algorithm. Entropy, 25.","DOI":"10.3390\/e25050782"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.neucom.2023.02.035","article-title":"Fast density estimation for density-based clustering methods","volume":"532","author":"Cheng","year":"2023","journal-title":"Neurocomputing"},{"key":"ref_37","first-page":"23","article-title":"A Modified DBSCAN Algorithm for Anomaly Detection in Time-series Data with","volume":"19","author":"Jain","year":"2022","journal-title":"Int. Arab. J. Inf. Technol."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1109\/TSMC.2017.2745493","article-title":"DHeat: A Density Heat-Based Algorithm for Clustering with Effective Radius","volume":"48","author":"Chen","year":"2018","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.ins.2016.08.009","article-title":"Decentralized clustering by finding loose and distributed density cores","volume":"433","author":"Chen","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"12648","DOI":"10.1109\/TITS.2021.3115827","article-title":"Improvement of Maneuverability Within a Multiagent Fuzzy Transportation System with the Use of Parallel Biobjective Real-Coded Genetic Algorithm","volume":"23","author":"Akopov","year":"2022","journal-title":"IEEE Trans. Intell. Transp."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Zhu, L., Zhu, J., Bao, C., Zhou, L., Wang, C., and Kong, B. (2018, January 21\u201323). Improvement of DBSCAN Algorithm Based on Adaptive Eps Parame-ter Estimation. Proceedings of the International Conference on Algorithms, Computing and Artificial Intelligence (ACAI 2018), Sanya, China.","DOI":"10.1145\/3302425.3302493"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"7378801","DOI":"10.1155\/2022\/7378801","article-title":"A Dynamic Density Peak Clustering Algorithm Based on K-Nearest Neighbor","volume":"2022","author":"Du","year":"2022","journal-title":"Secur. Commun. Netw."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.comcom.2021.03.021","article-title":"A novel adaptive density-based spatial clustering of application with noise based on bird swarm optimization algorithm","volume":"174","author":"Wang","year":"2021","journal-title":"Comput. Commun."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"114183","DOI":"10.1016\/j.microrel.2021.114183","article-title":"A self-adaptive DBSCAN-based method for wafer bin map defect pattern classification","volume":"123","author":"Chen","year":"2021","journal-title":"Microelectron. Reliab."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Chen, F. (2021, January 28\u201330). An Improved DBSCAN Algorithm for Adaptively Determining Parameters in Multi-density Environment. Proceedings of the 2nd International Conference on Artificial Intelligence and Information Systems (ICAIIS), Chongqing, China.","DOI":"10.1145\/3469213.3470400"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"104824","DOI":"10.1016\/j.knosys.2019.06.032","article-title":"Fast density peak clustering for large scale data based on KNN","volume":"187","author":"Chen","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"3939","DOI":"10.1109\/TSMC.2019.2956527","article-title":"KNN-BLOCK DBSCAN: Fast Clustering for Large-Scale Data","volume":"51","author":"Chen","year":"2021","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"1833","DOI":"10.1109\/TCYB.2018.2887094","article-title":"Robust Graph Learning from Noisy Data","volume":"50","author":"Kang","year":"2020","journal-title":"IEEE. Trans. Cybern."},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Zhou, G., Zhou, X., Li, W., Zhao, D., Song, B., Xu, C., Zhang, H., Liu, Z., Xu, J., and Lin, G. (2022). Development of a Lightweight Single-Band Bathymetric LiDAR. Remote Sens., 14.","DOI":"10.3390\/rs14225880"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"26483","DOI":"10.1007\/s11042-022-12185-8","article-title":"Monophonic music composition using genetic algorithm and Bresenham\u2019s line algorithm","volume":"81","author":"Shukla","year":"2022","journal-title":"Multimed. Tools Appl."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"109780","DOI":"10.1016\/j.asoc.2022.109780","article-title":"Cloud service selection based on weighted KD tree nearest neighbor search","volume":"131","author":"Bi","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1109\/TVCG.2021.3114865","article-title":"KD-Box: Line-segment-based KD-tree for Interactive Exploration of Large-scale Time-Series Data","volume":"28","author":"Zhao","year":"2022","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/8\/1498\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:21:26Z","timestamp":1760127686000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/15\/8\/1498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,28]]},"references-count":52,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2023,8]]}},"alternative-id":["sym15081498"],"URL":"https:\/\/doi.org\/10.3390\/sym15081498","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,28]]}}}