RESUMEN
Zeolites with uniform micropores are important shape-selective catalysts. However, the external acid sites of zeolites have a negative impact on shape-selective catalysis, and the microporosity may lead to serious diffusion limitation. Herein, we report on the direct synthesis of hierarchical hollow STW-type zeolite single crystals with a siliceous exterior. In an alkalinous fluoride medium, the nucleation of highly siliceous STW zeolites takes place first, and the nanocrystals are preferentially aligned on the outer surface of the gel agglomerates to grow into single crystalline shells upon crystallization. The lagged crystallization of the internal Al-rich amorphous gels onto the inner surface of nanocrystalline zeolite shells leads to the formation of hollow cavities in the core of the zeolite crystals. The hollow zeolite single crystals possess a low-to-high aluminum gradient from the surface to the core, resulting in an intrinsic inert external surface, and exhibit superior catalytic performance in toluene methylation reactions.
RESUMEN
Path planning technology is significant for planetary rovers that perform exploration missions in unfamiliar environments. In this work, we propose a novel global path planning algorithm, based on the value iteration network (VIN), which is embedded within a differentiable planning module, built on the value iteration (VI) algorithm, and has emerged as an effective method to learn to plan. Despite the capability of learning environment dynamics and performing long-range reasoning, the VIN suffers from several limitations, including sensitivity to initialization and poor performance in large-scale domains. We introduce the double value iteration network (dVIN), which decouples action selection and value estimation in the VI module, using the weighted double estimator method to approximate the maximum expected value, instead of maximizing over the estimated action value. We have devised a simple, yet effective, two-stage training strategy for VI-based models to address the problem of high computational cost and poor performance in large-size domains. We evaluate the dVIN on planning problems in grid-world domains and realistic datasets, generated from terrain images of a moon landscape. We show that our dVIN empirically outperforms the baseline methods and generalize better to large-scale environments.