319 research outputs found
Subequivariant Graph Reinforcement Learning in 3D Environments
Learning a shared policy that guides the locomotion of different agents is of
core interest in Reinforcement Learning (RL), which leads to the study of
morphology-agnostic RL. However, existing benchmarks are highly restrictive in
the choice of starting point and target point, constraining the movement of the
agents within 2D space. In this work, we propose a novel setup for
morphology-agnostic RL, dubbed Subequivariant Graph RL in 3D environments
(3D-SGRL). Specifically, we first introduce a new set of more practical yet
challenging benchmarks in 3D space that allows the agent to have full
Degree-of-Freedoms to explore in arbitrary directions starting from arbitrary
configurations. Moreover, to optimize the policy over the enlarged state-action
space, we propose to inject geometric symmetry, i.e., subequivariance, into the
modeling of the policy and Q-function such that the policy can generalize to
all directions, improving exploration efficiency. This goal is achieved by a
novel SubEquivariant Transformer (SET) that permits expressive message
exchange. Finally, we evaluate the proposed method on the proposed benchmarks,
where our method consistently and significantly outperforms existing approaches
on single-task, multi-task, and zero-shot generalization scenarios. Extensive
ablations are also conducted to verify our design. Code and videos are
available on our project page: https://alpc91.github.io/SGRL/.Comment: ICML 2023 Ora
Adapted Delaunay triangulation method for free-form surface generation from random point clouds for stochastic optimization applications
Free-form surfaces are defined with NURBS (non-uniform rational basis spline) for most computer-aided engineering (CAE) applications. The NURBS method requires the definition of parameters such as weights, knot vectors and degree of the curves which make the configuration of the surface computationally expensive and complex. When the control points are randomly spaced in the point cloud and the topology of the desired surface is unknown, surface configuration with NURBS method becomes a challenging task. Optimization attempts for such surfaces create enormous amounts of computing data when coupled with physics solvers such as finite element analysis (FEA) tools and computational fluid dynamics (CFD) tools. In this paper, an adapted Delaunay triangulation (ADT) method for surface generation from the random points cloud is proposed and compared with widely used implicit functions based NURBS fitting method. The surface generated from ADT method can be simultaneously used with stochastic optimization algorithms (SOA) and CFD applications to search for the optimal results with minimum computational costs. It was observed while comparing ADT with NURBS-based geometry configuration that the computation time can be reduced by 3 folds. The corresponding deviation between both geometry configuration methods has been observed as low as 5% for all optimisation scenarios during the comparison. In addition, ADT method can provide light weight CFD approach as any instance of design iteration has at least half storage footprint as compared to corresponding NURBS surface. The proposed approach provides novel methodology towards establishing light weight CFD geometry, absence of which currently isolates methodologies for optimization and CFD analysis
PG-NeuS: Robust and Efficient Point Guidance for Multi-View Neural Surface Reconstruction
Recently, learning multi-view neural surface reconstruction with the
supervision of point clouds or depth maps has been a promising way. However,
due to the underutilization of prior information, current methods still
struggle with the challenges of limited accuracy and excessive time complexity.
In addition, prior data perturbation is also an important but rarely considered
issue. To address these challenges, we propose a novel point-guided method
named PG-NeuS, which achieves accurate and efficient reconstruction while
robustly coping with point noise. Specifically, aleatoric uncertainty of the
point cloud is modeled to capture the distribution of noise, leading to noise
robustness. Furthermore, a Neural Projection module connecting points and
images is proposed to add geometric constraints to implicit surface, achieving
precise point guidance. To better compensate for geometric bias between volume
rendering and point modeling, high-fidelity points are filtered into a Bias
Network to further improve details representation. Benefiting from the
effective point guidance, even with a lightweight network, the proposed PG-NeuS
achieves fast convergence with an impressive 11x speedup compared to NeuS.
Extensive experiments show that our method yields high-quality surfaces with
high efficiency, especially for fine-grained details and smooth regions,
outperforming the state-of-the-art methods. Moreover, it exhibits strong
robustness to noisy data and sparse data
A multi-node energy prediction approach combined with optimum prediction interval for RF powered WSNs
Energy prediction plays a vital role in designing an efficient power management system for any environmentally powered Wireless Sensor Networks (WSNs). Most of the Moving Average (MA)-based energy prediction methods depend on past energy readings of the concerned node to predict its future energy availability. However, in case of RF powered WSNs the harvesting history of the main node along with neighbouring nodes can also be used to develop a more robust prediction technique. In this paper, we propose a Multi-Node energy prediction method for Radio Frequency Energy Harvesting (RF-EH) WSNs, which predicts the future energy availability by taking into account harvesting history of all nodes surrounding the main node. We analyse the effective distance for prediction and also develop a mathematical model to compute the optimum value of prediction interval, which has a major effect in prediction accuracy and system design, considering energy neutrality. Results show that Multi-Node prediction is less sensitive to prediction interval while inheriting the advantages of MA techniques. Also, nodes located at a larger distance were utilized less for prediction, and as the prediction interval increased, the utilization of more distant nodes decreased. Furthermore, we also establish a linear relation between the prediction interval and the energy threshold limit
4-[(2-CarbÂoxyÂethÂyl)amino]Âbenzoic acid monohydrate
In the title compound, C10H11NO4·H2O, the carboxyl group is twisted at a dihedral angle of 6.1 (3)° with respect to the benzene ring. In the crystal, the organic molÂecules are linked by pairs of O—H⋯O hydrogen bonds involving both carboxyl groups, forming zigzag chains propagating along the b-axis direction. The water molÂecules form [100] chains linked by O—H⋯O hydrogen bonds. The organic molÂecule and water chains are cross-linked by N—H⋯Owater and Owater—H⋯O hydrogen bonds, generating (001) sheets
- …