Skip to content
naulon

Not checkedNot checked for notices yet.

High-throughput discovery of fluoride-ion conductors via a decoupled, dynamic, and iterative (DDI) framework

Jack D. Sundberg, Daniel L. Druffel, Lauren M. McRae and 3 more

npj Computational Materials · 2022

doi:10.1038/s41524-022-00786-8 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Abstract Fluoride–ion batteries are a promising alternative to lithium–ion batteries with higher theoretical capacities and working voltages, but they have experienced limited success due to the poor ionic conductivities of known electrolytes and electrodes. Here, we report a high-throughput computational screening of 9747 fluoride-containing materials in search of fluoride-ion conductors. Via a combination of empirical, lightweight DFT, and nudged elastic band (NEB) calculations, we identified >10 crystal systems with high fluoride mobility. We applied a search strategy where calculations are performed in any order (decoupled), computational resources are reassigned based on need (dynamic), and predictive models are repeatedly updated (iterative). Unlike hierarchical searches, our decoupled, dynamic, and iterative framework (DDI) began by calculating high-quality barrier heights for fluoride-ion mobility in a large and diverse group of materials. This high-quality dataset provided a benchmark against which a rapid calculation method could be refined. This accurate method was then used to measure the barrier heights for 6797 fluoride–ion pathways. The final dataset has allowed us to discover many fascinating, high-performance conductors and to derive the design rules that govern their performance. These materials will accelerate experimental research into fluoride–ion batteries, while the design rules will provide an improved foundation for understanding ionic conduction.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.