{"id":"https://openalex.org/W7133767333","doi":"https://doi.org/10.1142/s1469026826500057","title":"Slime Mould Algorithm using Latin Hypercube Sampling and Improved Strategy for Solving Robot Gripper Problem","display_name":"Slime Mould Algorithm using Latin Hypercube Sampling and Improved Strategy for Solving Robot Gripper Problem","publication_year":2026,"publication_date":"2026-03-05","ids":{"openalex":"https://openalex.org/W7133767333","doi":"https://doi.org/10.1142/s1469026826500057"},"language":"en","primary_location":{"id":"doi:10.1142/s1469026826500057","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026826500057","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078485990","display_name":"Gauri Thakur","orcid":"https://orcid.org/0000-0002-3474-0264"},"institutions":[{"id":"https://openalex.org/I101407740","display_name":"Chandigarh University","ror":"https://ror.org/05t4pvx35","country_code":"IN","type":"education","lineage":["https://openalex.org/I101407740"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Gauri Thakur","raw_affiliation_strings":["Department of Mathematics, Chandigarh University, Mohali, Punjab 140413, India"],"raw_orcid":"https://orcid.org/0000-0002-3474-0264","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Chandigarh University, Mohali, Punjab 140413, India","institution_ids":["https://openalex.org/I101407740"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013280900","display_name":"Ashok Pal","orcid":"https://orcid.org/0000-0003-1306-7223"},"institutions":[{"id":"https://openalex.org/I101407740","display_name":"Chandigarh University","ror":"https://ror.org/05t4pvx35","country_code":"IN","type":"education","lineage":["https://openalex.org/I101407740"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ashok Pal","raw_affiliation_strings":["Department of Mathematics, Chandigarh University, Mohali, Punjab 140413, India"],"raw_orcid":"https://orcid.org/0000-0003-1306-7223","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Chandigarh University, Mohali, Punjab 140413, India","institution_ids":["https://openalex.org/I101407740"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078485990"],"corresponding_institution_ids":["https://openalex.org/I101407740"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.45640149,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"02","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.35429999232292175,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.35429999232292175,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13362","display_name":"Slime Mold and Myxomycetes Research","score":0.2614000141620636,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.1582999974489212,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.675599992275238},{"id":"https://openalex.org/keywords/latin-hypercube-sampling","display_name":"Latin hypercube sampling","score":0.6593999862670898},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6504999995231628},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5878000259399414},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5110999941825867},{"id":"https://openalex.org/keywords/grippers","display_name":"Grippers","score":0.48510000109672546},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.45649999380111694},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.43479999899864197}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7671999931335449},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.675599992275238},{"id":"https://openalex.org/C20820323","wikidata":"https://www.wikidata.org/wiki/Q6496514","display_name":"Latin hypercube sampling","level":3,"score":0.6593999862670898},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6504999995231628},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5878000259399414},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5110999941825867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4869999885559082},{"id":"https://openalex.org/C2775960376","wikidata":"https://www.wikidata.org/wiki/Q1435859","display_name":"Grippers","level":2,"score":0.48510000109672546},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4745999872684479},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.45649999380111694},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.43479999899864197},{"id":"https://openalex.org/C146599234","wikidata":"https://www.wikidata.org/wiki/Q511093","display_name":"Centroid","level":2,"score":0.4074000120162964},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.3984000086784363},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.37229999899864197},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3653999865055084},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3497999906539917},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.33629998564720154},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.2605000138282776},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C162500139","wikidata":"https://www.wikidata.org/wiki/Q2835887","display_name":"Estimation of distribution algorithm","level":2,"score":0.2556999921798706},{"id":"https://openalex.org/C151552104","wikidata":"https://www.wikidata.org/wiki/Q7705809","display_name":"Test suite","level":4,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1469026826500057","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026826500057","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W883434633","https://openalex.org/W1820657498","https://openalex.org/W1984360702","https://openalex.org/W2061438946","https://openalex.org/W2092803011","https://openalex.org/W2096166399","https://openalex.org/W2155946637","https://openalex.org/W2290883490","https://openalex.org/W2581883256","https://openalex.org/W2734960480","https://openalex.org/W3010014325","https://openalex.org/W3014974411","https://openalex.org/W3097250214","https://openalex.org/W3128624676","https://openalex.org/W3215430962","https://openalex.org/W4205146394","https://openalex.org/W4205165734","https://openalex.org/W4220814796","https://openalex.org/W4249517230","https://openalex.org/W4293206620","https://openalex.org/W4311650973","https://openalex.org/W4396768181","https://openalex.org/W4405568968","https://openalex.org/W4413484437"],"related_works":[],"abstract_inverted_index":{"Robotic":[0],"grippers":[1],"play":[2],"a":[3,51,78,107],"key":[4],"role":[5],"in":[6,144,276],"various":[7],"industries,":[8],"including":[9],"manufacturing,":[10],"logistics,":[11],"and":[12,22,30,96,105,155,170,173,201,221,262,281,285],"healthcare,":[13],"such":[14],"as":[15,130,136],"enabling":[16],"the":[17,32,36,42,64,69,76,87,112,123,126,133,148,157,174,182,191,218,222,227,234,238,248,255,259,270,273,282,288,295],"robot":[18,37,43,212,296],"to":[19,28,85,100,121,146,180,207,293],"grasp,":[20],"hold,":[21],"manipulate":[23],"objects.":[24],"It":[25],"is":[26,47,61,83,119,142,215,240,250],"essential":[27],"develop":[29],"design":[31],"best":[33],"configuration":[34,46],"for":[35],"gripper.":[38],"In":[39,98],"this":[40],"paper,":[41],"gripper\u2019s":[44],"geometric":[45],"optimized":[48],"through":[49],"proposing":[50],"novel":[52,79],"variant":[53],"of":[54,63,128,132,247,272,278,290],"Slime":[55],"Mould":[56],"Algorithm":[57],"(SMA).":[58],"The":[59,186,210,231,245,267],"SMA":[60,145],"one":[62],"metaheuristic":[65],"methods":[66],"that":[67,190,237],"mimics":[68],"slime":[70],"mould\u2019s":[71],"foraging":[72],"behavior.":[73],"To":[74],"improve":[75,101],"SMA,":[77],"algorithm":[80,193,275],"named,":[81],"LHISMA,":[82],"introduced":[84,143],"generate":[86],"optimal":[88],"outcomes":[89],"while":[90],"taking":[91],"into":[92],"account":[93],"its":[94,152,243],"shortcomings":[95],"features.":[97],"order":[99],"global":[102,203],"search":[103,113,140,204],"performance":[104],"attain":[106],"more":[108],"uniform":[109],"distribution":[110],"throughout":[111],"space,":[114],"Latin":[115],"Hypercube":[116],"Sampling":[117],"(LHS)":[118],"used":[120,292],"initialize":[122],"population":[124],"with":[125,217,226],"goal":[127],"covering":[129],"much":[131],"solution":[134,279],"space":[135],"possible.":[137],"An":[138],"improved":[139],"strategy":[141],"enrich":[147],"population\u2019s":[149],"diversity,":[150],"strengthening":[151],"exploitation":[153],"ability":[154],"enhancing":[156],"proposed":[158,183],"algorithm\u2019s":[159,184],"convergence":[160,196,199,283],"accuracy.":[161],"Experiments":[162],"employing":[163],"13":[164],"benchmark":[165],"functions,":[166],"encompassing":[167],"both":[168],"unimodal":[169],"multimodal":[171],"types,":[172],"CEC2022":[175],"test":[176],"suite":[177],"were":[178],"conducted":[179],"evaluate":[181],"performance.":[185],"experimental":[187],"findings":[188,232,268],"indicate":[189],"LHISMA":[192,219,239,274],"achieves":[194],"superior":[195],"accuracy,":[197,280],"faster":[198],"speed,":[200],"enhanced":[202],"capabilities":[205],"compared":[206,225],"other":[208],"methods.":[209],"complex":[211],"gripper":[213,297],"problem":[214],"solved":[216],"algorithm,":[220],"results":[223,249],"are":[224],"most":[228],"popular":[229],"algorithms.":[230],"from":[233],"comparison":[235],"show":[236,269],"better":[241],"than":[242],"competitors.":[244],"significance":[246],"also":[251],"examined":[252],"statistically":[253],"using":[254],"Wilcoxon":[256],"rank-sum":[257],"test,":[258,261],"Friedman":[260],"post":[263],"hoc":[264],"statistical":[265],"tests.":[266],"advantages":[271],"terms":[277],"curve":[284],"boxplot":[286],"illustrate":[287],"effects":[289],"algorithms":[291],"optimize":[294],"problem.":[298]},"counts_by_year":[],"updated_date":"2026-04-22T06:01:30.510260","created_date":"2026-03-06T00:00:00"}