Search

In unstructured environments, obstacles are diverse and lack lane markings, making trajectory planning for intelligent vehicles a challenging task. Traditional trajectory planning methods typically involve multiple stages, including path planning, speed planning, and trajectory optimization. These methods require the manual design of numerous parameters for each stage, resulting in significant workload and computational burden. While end-to-end trajectory planning methods are simple and efficient, they often fail to ensure that the trajectory meets vehicle dynamics and obstacle avoidance constraints in unstructured scenarios. Therefore, this paper proposes a novel trajectory planning method based on Graph Neural Networks (GNN) and numerical optimization. The proposed method consists of two stages: (1) initial trajectory prediction using the GNN, (2) trajectory optimization using numerical optimization. First, the graph neural network processes the environment information and predicts a rough trajectory, replacing traditional path and speed planning. This predicted trajectory serves as the initial solution for the numerical optimization stage, which optimizes the trajectory to ensure compliance with vehicle dynamics and obstacle avoidance constraints. We conducted simulation experiments to validate the feasibility of the proposed algorithm and compared it with other mainstream planning algorithms. The results demonstrate that the proposed method simplifies the trajectory planning process and significantly improves planning efficiency.

Regularized generalized canonical correlation analysis (RGCCA) is a generalization of regularized canonical correlation analysis to three or more sets of variables, which is a component-based approach aiming to study the relationships between several sets of variables. Sparse generalized canonical correlation analysis (SGCCA) (proposed in Tenenhaus et al. (2014)), combines RGCCA with an `1-penalty, in which blocks are not necessarily fully connected, makes SGCCA a flexible method for analyzing a wide variety of practical problems, such as biology, chemistry, sensory analysis, marketing, food research, etc. In Tenenhaus et al. (2014), an iterative algorithm for SGCCA was designed based on the solution to the subproblem (LM-P1 for short) of maximizing a linear function on the intersection of an `1-norm ball and a unit `2-norm sphere proposed in Witten et al. (2009). However, the solution to the subproblem (LM-P1) proposed in Witten et al. (2009) is not correct, which may become the reason that the iterative algorithm for SGCCA is slow and not always convergent. For this, we first characterize the solution to the subproblem LM-P1, and the subproblems LM-P2 and LM-P3, which maximize a linear function on the intersection of an `1-norm sphere and a unit `2-norm sphere, and an `1-norm ball and a unit `2-norm sphere, respectively. Then we provide more efficient block coordinate descent (BCD) algorithms for SGCCA and its two variants, called SGCCA-BCD1, SGCCA-BCD2 and SGCCA-BCD3, corresponding to the subproblems LM-P1, LM-P2 and LM-P3, respectively, prove that they all globally converge to their stationary points. We further propose gradient projected (GP) methods for SGCCA and its two variants when using the Horst scheme, called SGCCA-GP1, SGCCA-GP2 and SGCCA-GP3, corresponding to the subproblems LM-P1, LM-P2 and LM-P3, respectively, and prove that they all

Emergent quasiparticles with a Dirac dispersion in condensed matter systems can be described by the Dirac equation for relativistic electrons, in analogy with Dirac particles in high-energy physics. For example, electrons with a Dirac dispersion have been intensively studied in electronic systems such as graphene and topological insulators. However, charge is not a prerequisite for Dirac fermions, and the emergence of Dirac fermions without charge degree of freedom has been theoretically predicted to be realized in Dirac quantum spin liquids. These quasiparticles carry a spin of 1/2 but are charge-neutral, and so are called spinons. Here we show that the spin excitations of a kagome antiferromagnet, YCu$_3$(OD)$_6$Br$_2$[Br$_{0.33}$(OD)$_{0.67}$], are conical with a spin continuum inside, which is consistent with the convolution of two Dirac spinons. The predictions of a Dirac spin liquid model with a spinon velocity obtained from the spectral measurements are in agreement with the low-temperature specific heat of the sample. Our results thus provide spectral evidence for the Dirac quantum spin liquid state emerging in this kagome lattice antiferromagnet. However, the locations of the conical spin excitations differ from those calculated by the nearest neighbor Heisenberg model, suggesting the Dirac spinons have an unexpected origin., Comment: 6 pages, 4 figures

The precision of the weak equivalence principle (WEP) test using atom interferometers (AIs) is expected to be extremely high in microgravity environment. The microgravity scientific laboratory cabinet (MSLC) in the China Space Station (CSS) can provide a higher-level microgravity than the CSS itself, which provides a good experimental environment for scientific experiments that require high microgravity. We designed and realized a payload of a dual-species cold rubidium atom interferometer. The payload is highly integrated and has a size of 460 mm * 330 mm * 260 mm. It will be installed in the MSLC to carry out high-precision WEP test experiment. In this article, we introduce the constraints and guidelines of the payload design, the compositions and functions of the scientific payload, the expected test precision in space, and some results of the ground test experiments, Comment: 24 pages,7 figures

In this paper, we study the problem of parameter estimation in a sensor network, where the measurements and updates of some sensors might be arbitrarily manipulated by adversaries. Despite the presence of such misbehaviors, normally behaving sensors make successive observations of an unknown $d$-dimensional vector parameter and aim to infer its true value by cooperating with their neighbors over a directed communication graph. To this end, by leveraging the so-called dynamic regressor extension and mixing procedure, we transform the problem of estimating the vector parameter to that of estimating $d$ scalar ones. For each of the scalar problem, we propose a resilient combine-then-adapt diffusion algorithm, where each normal sensor performs a resilient combination to discard the suspicious estimates in its neighborhood and to fuse the remaining values, alongside an adaptation step to process its streaming observations. With a low computational cost, this estimator guarantees that each normal sensor exponentially infers the true parameter even if some of them are not sufficiently excited.

We focus on a simulation-based optimization problem of choosing the best design from the feasible space. Although the simulation model can be queried with finite samples, its internal processing rule cannot be utilized in the optimization process. We formulate the sampling process as a policy searching problem and give a solution from the perspective of Reinforcement Learning (RL). Concretely, Actor-Critic (AC) framework is applied, where the Actor serves as a surrogate model to predict the performance on unknown designs, whereas the actor encodes the sampling policy to be optimized. We design the updating rule and propose two algorithms for the cases where the feasible spaces are continuous and discrete respectively. Some experiments are designed to validate the effectiveness of proposed algorithms, including two toy examples, which intuitively explain the algorithms, and two more complex tasks, i.e., adversarial attack task and RL task, which validate the effectiveness in large-scale problems. The results show that the proposed algorithms can successfully deal with these problems. Especially note that in the RL task, our methods give a new perspective to robot control by treating the task as a simulation model and solving it by optimizing the policy generating process, while existing works commonly optimize the policy itself directly.

We discuss the problem of decentralized multi-agent reinforcement learning (MARL) in this work. In our setting, the global state, action, and reward are assumed to be fully observable, while the local policy is protected as privacy by each agent, and thus cannot be shared with others. There is a communication graph, among which the agents can exchange information with their neighbors. The agents make individual decisions and cooperate to reach a higher accumulated reward. Towards this end, we first propose a decentralized actor-critic (AC) setting. Then, the policy evaluation and policy improvement algorithms are designed for discrete and continuous state-action-space Markov Decision Process (MDP) respectively. Furthermore, convergence analysis is given under the discrete-space case, which guarantees that the policy will be reinforced by alternating between the processes of policy evaluation and policy improvement. In order to validate the effectiveness of algorithms, we design experiments and compare them with previous algorithms, e.g., Q-learning \cite{watkins1992q} and MADDPG \cite{lowe2017multi}. The results show that our algorithms perform better from the aspects of both learning speed and final performance. Moreover, the algorithms can be executed in an off-policy manner, which greatly improves the data efficiency compared with on-policy algorithms.

We have calculated the stellar $\beta$-decay rate of the important s-process branching point ${}^{134}$Cs based on the state of the art shell model calculations. At typical $s$-process temperatures ($T\sim$ 0.2-0.3 GK), our new rate is one order of magnitude lower than the widely-used rate from Takahashi and Yokoi (hereafter TY87). The impact on the nucleosynthesis in AGB stars is investigated with various masses and metallicities. Our new decay rate leads to an overall decrease in the ${}^{134}$Ba/${}^{136}$Ba ratio, and well explains the measured ratio in meteorities without introducing the $i$ process. We also derive the elapsed time from the last AGB nucleosynthetic event that polluted the early Solar System to be $>$28 Myr based on the ${}^{135}$Cs/${}^{133}$Cs ratio, which is consistent with the elapsed times derived from ${}^{107}$Pd and ${}^{182}$Hf. The $s$-process abundance sum of ${}^{135}$Ba and ${}^{135}$Cs is found to increase, resulting in a smaller $r$-process contribution of ${}^{135}$Ba in the Solar System., Comment: accepted for publication in Astrophysical Journal Letters, 2021

We studied the magnetic properties of YCu$_3$(OH)$_6$Br$_2$[Br$_{1-x}$(OH)$_{x}$] ($x$ = 0.33), where Cu$^{2+}$ ions form two-dimensional kagome layers. There is no magnetic order down to 50 mK while the Curie-Weiss temperature is on the order of -100 K. At zero magnetic field, the low-temperature specific heat shows a $T^2$ dependence. Above 2 T, a linear temperature dependence term in specific heat emerges, and the value of $\gamma = C/T$ increases linearly with the field. Furthermore, the magnetic susceptibility tends to a constant value at $T = 0$. Our results suggest that the magnetic ground state of YCu$_3$(OH)$_6$Br$_2$[Br$_{1-x}$(OH)$_{x}$] is consistent with a Dirac quantum-spin-liquid state with a linearly dispersing spinon strongly coupled to an emergent gauge field, which has long been theoretically proposed as a candidate ground state in the two-dimensional kagome Heisenberg antiferromagnetic system., Comment: 7 pages, 3 figures

Nowadays the world is facing a prominent paradox regarding thermal energy. The production of heat accounts for more than 50% of global final energy consumption while the waste heat potential analysis reveals that 72% of the global primary energy consumption is lost after conversion mainly in the form of heat. Towards global decarbonization, it is of vital importance to establish a solution to thermal energy utilization under full control. Here, we propose and realize an unprecedented concept -- barocaloric thermal batteries based on the inverse colossal barocaloric effect of NH4SCN. Thermal charging is initialized upon pressurization through an order-to-disorder phase transition below 364 K and in turn the discharging of 43 J g-1, which are eleven times more than the input mechanical energy, occurs on demand at depressurization at lower temperatures. The discharging is also manifested as a directly measured temperature rise of 12 K. The thermodynamic equilibrium nature of the pressure-restrained heat-carrying phase guarantees stable storage and/or transport over a variety of temporal and/or spatial scales. The barocaloric thermal batteries reinforced by their solid microscopic mechanism are expected to significantly advance the ability to take advantage of waste heat., Comment: 5 figures in the main text plus the Extended Data. Adiabatic-temperature-change data were added