{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:49:03Z","timestamp":1760150943550,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T00:00:00Z","timestamp":1643414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Shanghai Innovation Project","award":["20AZ10, 20AZ11"],"award-info":[{"award-number":["20AZ10, 20AZ11"]}]},{"name":"Shanghai Educational Science Research Project","award":["C2022120"],"award-info":[{"award-number":["C2022120"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11661009"],"award-info":[{"award-number":["11661009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the High Level Innovation Teams and Excellent Scholars Program in Guangxi institutions of higher education","award":["[2019]52"],"award-info":[{"award-number":["[2019]52"]}]},{"name":"the Guangxi Natural Science Key Fund","award":["2017GXNSFDA198046"],"award-info":[{"award-number":["2017GXNSFDA198046"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>This paper investigates the Discrete Targets Search Problem, (DTSP), which aims to quickly search for discrete objects scattered in a vast symmetry region. Different from continuous function extremal value search, the discrete points search cannot make use of the properties of regular functions, such as function analytic, single\/multiple extreme, and monotonicity. Thus, in this paper a new search scheme based on L\u00e9vy random distribution is investigated. In comparison with the TraditionalCarpet search or Random search based on other distributions, DTSP can provide much faster search speed which is demonstrated by simulation with different scales problems for the selected scenarios. The simulations experiment proves that DTSP is faster for searching for a discrete single target or multiple targets in a wide area. It provides a new method for solving the discrete target search problem.<\/jats:p>","DOI":"10.3390\/sym14020272","type":"journal-article","created":{"date-parts":[[2022,1,30]],"date-time":"2022-01-30T00:12:56Z","timestamp":1643501576000},"page":"272","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A L\u00e9vy Distribution Based Searching Scheme for the Discrete Targets in Vast Region"],"prefix":"10.3390","volume":"14","author":[{"given":"Zhigang","family":"Lian","sequence":"first","affiliation":[{"name":"School of Electronic and Information Engineering, Shanghai Dianji University, Shanghai 201306, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Baise University, Baise 533000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingrong","family":"Dai","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Shanghai Maritime University, Shanghai 201306, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yangquan","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Engineering, University of California, Merced, CA 95343, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,1,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1814","DOI":"10.4236\/jamp.2019.78124","article-title":"Quasi-coordinate search for a randomly moving target","volume":"8","author":"Teamah","year":"2019","journal-title":"J. Appl. Math. Phys."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s00182-021-00761-5","article-title":"Search for a moving target in a competitive environment","volume":"50","author":"Duvocelle","year":"2021","journal-title":"Int. J. Game Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/s11263-013-0620-5","article-title":"Smeulders, Selective search for object recognition","volume":"104","author":"Uijlings","year":"2013","journal-title":"Int. J. Comput. Vis."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.patrec.2013.08.025","article-title":"Constraining image object search by multi-scale spectral residue analysis","volume":"39","author":"Silva","year":"2014","journal-title":"Pattern Recognit. Lett."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.dsp.2016.10.001","article-title":"A fast ground moving target focusing method based on first-order discrete polynomial-phase transform","volume":"60","author":"Xin","year":"2017","journal-title":"Digit. Signal Proc."},{"key":"ref_6","first-page":"38","article-title":"Fuzzy optimal search plan for N-Dimensional randomly moving target","volume":"13","author":"Hadidy","year":"2016","journal-title":"Int. J. Comput. Method"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/j.neucom.2016.06.052","article-title":"Parallel search strategy in kernel feature space to track FLIR target","volume":"214","author":"Shi","year":"2016","journal-title":"Neurocomputing"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Li, X., Chen, J., Deng, F., and Li, H. (2019). Profit-driven adaptive moving targets search with UAV swarms. Sensors, 7.","DOI":"10.3390\/s19071545"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Song, T., Huo, X., and Wu, X. (2020). A two-stage method for target searching in the path Planning for mobile robots. Sensors, 23.","DOI":"10.3390\/s20236919"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Wong, W.K., Ye, S., Liu, H., and Wang, Y. (2020). Effective mobile target searching using robots. Mob. Netw. Appl., 1\u201317.","DOI":"10.1007\/s11036-020-01628-x"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1627","DOI":"10.1017\/S0263574719001668","article-title":"Trajectory planning and the target search by the mobile robot in an environment using a behavior-based neural network approach","volume":"9","author":"Pandey","year":"2020","journal-title":"Robotica"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1093\/bioinformatics\/btv578","article-title":"FogLight: An efficient matrix-based approach to construct metabolic pathways by search space reduction","volume":"32","author":"Khosraviani","year":"2016","journal-title":"Bioinformatics"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1957","DOI":"10.1016\/j.patrec.2007.05.006","article-title":"Image registration using robust M-estimators","volume":"28","author":"Arya","year":"2007","journal-title":"Pattern Recognit. Lett."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.asoc.2017.07.053","article-title":"Bio-inspired computation: Recent development on the modifications of the cuckoo search algorithm","volume":"61","author":"Chiroma","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00521-013-1367-1","article-title":"Cuckoo search: Recent advances and applications","volume":"24","author":"Yang","year":"2014","journal-title":"Neural Comput. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s11831-013-9083-7","article-title":"Selected engineering applications of gradient free optimisation using Cuckoo search and proper orthogonal decomposition","volume":"20","author":"Walton","year":"2013","journal-title":"Arch. Comput. Methods Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1504\/IJMHEUR.2018.091882","article-title":"A two-phase local search algorithm for the ordered clustered travelling salesman problem","volume":"1","author":"Alsheddy","year":"2018","journal-title":"Int. J. Metaheuristics"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.trpro.2017.03.012","article-title":"Accelerating local search algorithms for the travelling salesman problem through the effective use of GPU","volume":"22","year":"2017","journal-title":"Transp. Res. Procedia"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s00170-012-4013-7","article-title":"Cuckoo search algorithm for the selection of optimal machining parameters in milling operations","volume":"1\u20134","author":"Yildiz","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3597","DOI":"10.1016\/j.patcog.2014.04.003","article-title":"A hybrid mobile object tracker based on the modified Cuckoo search algorithm and the Kalman filter","volume":"11","author":"Ljouad","year":"2014","journal-title":"Pattern Recognit."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"6315","DOI":"10.1016\/j.eswa.2014.03.012","article-title":"Intelligent video target tracking using an evolutionary particle filter based upon improved cuckoo search","volume":"41","author":"Walia","year":"2014","journal-title":"Expert Syst. Appl."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"107254","DOI":"10.1016\/j.compchemeng.2021.107254","article-title":"A review on robust M-estimators for regression analysis","volume":"147","author":"Prata","year":"2021","journal-title":"Comput. Chem. Eng."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.cam.2015.09.031","article-title":"On Mittag-Leffler distributions and related stochastic processes","volume":"296","author":"Huillet","year":"2016","journal-title":"J. Comput. Appl. Math."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1109\/TEVC.2010.2102038","article-title":"Multi population pattern searching algorithm: A new evolutionary method based on the idea of messy genetic algorithm","volume":"15","author":"Kwasnicka","year":"2011","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/2\/272\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:11:05Z","timestamp":1760134265000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/2\/272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,29]]},"references-count":24,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,2]]}},"alternative-id":["sym14020272"],"URL":"https:\/\/doi.org\/10.3390\/sym14020272","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2022,1,29]]}}}