Ghude Sumedh, Chowdhury Chandra
Department of Physics, Indian Institute of Technology Madras, Chennai, 600036, India.
Institute of Catalysis Research and Technology (IKFT), Karlsruhe Institute of Technology (KIT), 76344, Eggeinstein-Leopoldshafen, Germany.
Chemistry. 2023 Dec 11;29(69):e202301840. doi: 10.1002/chem.202301840. Epub 2023 Oct 25.
Metal-organic Frameworks (MOFs) can be employed for gas storage, capture, and sensing. Finding the MOF with the best adsorption property from a large database is usual for adsorption calculations. In high-throughput computational research, the expense of computing thermodynamic quantities limits the finding of MOFs for separations and storage. In this work, we demonstrate the usefulness of Bayesian optimization (BO) for estimating the H uptake capability of MOFs by using an existing dataset containing 98000 real and hypothetical MOFs. We demonstrate that in order to recover the best candidate MOFs, less than 0.027 % of the database needs to be screened using the BO method. This allows future adsorption experiments on a small sample of MOFs to be undertaken with minimal experimental effort by effectively screening MOF databases. In addition, the presented BO can provide comprehensible material design insights, and the framework will be transferable to optimizing other target properties. We also suggest using Particle Swarm Optimisation (PSO), a swarm intelligence technique in artificial intelligence, to estimate MOFs' H uptake potential to achieve results comparable to BO. In addition, we implement a novel modification of PSO called Evolutionary-PSO (EPSO) to compare and find interesting outcomes.
金属有机框架(MOFs)可用于气体存储、捕获和传感。从大型数据库中找到具有最佳吸附性能的MOF通常用于吸附计算。在高通量计算研究中,计算热力学量的成本限制了用于分离和存储的MOF的发现。在这项工作中,我们通过使用包含98000个真实和假设MOF的现有数据集,证明了贝叶斯优化(BO)在估计MOF的氢吸收能力方面的有用性。我们证明,为了找到最佳候选MOF,使用BO方法只需筛选不到0.027%的数据库。这使得未来可以通过有效筛选MOF数据库,以最少的实验工作量对一小部分MOF进行吸附实验。此外,所提出的BO可以提供可理解的材料设计见解,并且该框架将可转移用于优化其他目标属性。我们还建议使用粒子群优化(PSO),一种人工智能中的群体智能技术,来估计MOF的氢吸收潜力,以获得与BO相当的结果。此外,我们对PSO进行了一种名为进化粒子群优化(EPSO)的新颖改进,以进行比较并找到有趣的结果。