To mitigate the detrimental effects of parameter perturbations and external load torque on the accuracy of speed and current tracking control in surface-mounted permanent magnet synchronous motor (SPMSM) drive systems...
详细信息
Simulators play a crucial role in autonomous driving, offering significant time, cost, and labor savings. Over the past few years, the number of simulators for autonomous driving has grown substantially. However, ther...
详细信息
Simulators play a crucial role in autonomous driving, offering significant time, cost, and labor savings. Over the past few years, the number of simulators for autonomous driving has grown substantially. However, there is a growing concern about the validity of algorithms developed and evaluated in simulators, indicating a need for a thorough analysis of the development status of the simulators. To address existing gaps in research, this paper undertakes a comprehensive review of the history of simulators, proposes a utility-based taxonomy, and investigates the critical issues within open-source simulators. Analysis of the past thirty years' development trajectory reveals a trend characterized by an increase in open-source simulators and an expansion of their functionality scope. The categorization of simulators based on feature functionalities delineates five primary classes: traffic flow, sensory data, driving policy, vehicle dynamics, and comprehensive simulators. Furthermore, the paper identifies critical unresolved issues in open-source simulators, including concerns regarding the fidelity of sensory data, representation of traffic scenarios, and accuracy in vehicle dynamics simulation, all of which have the potential to undermine experimental confidence. Additionally, challenges in data format inconsistency, labor-intensive map construction processes, sluggish step updating, and insufficient support for Hardware-In-the-Loop testing are discussed as hindrances to experimental efficiency. In light of these findings, the survey furnishes task-oriented recommendations to aid in the selection of simulators, taking into account factors such as accessibility, maintenance status, and quality, while highlighting the inherent limitations of existing open-source simulators in validating algorithms and facilitating real-world experimentation. IEEE
With the explosion of ChatGPT, the development of artificial intelligence technology ushered in another explosion. Similarly, with the rapid development of extended reality technology and Internet of Things technology...
详细信息
Genetic algorithm (GA) is an effective method for path planning problems. As a powerful variant of GA, island genetic algorithm (IGA) has considerable improvement in performance. In this paper, a new island model of G...
详细信息
Aiming at the problem of quality assurance of intelligent logistics service in 5G+ edge computing environment, this paper proposes a mechanism based on federated cooperative cache, which aims to utilize the computing ...
详细信息
Learning-based multi-view stereo (MVS) method heavily relies on feature matching, which requires distinctive and descriptive representations. An effective solution is to apply non-local feature aggregation, e.g., Tran...
Learning-based multi-view stereo (MVS) method heavily relies on feature matching, which requires distinctive and descriptive representations. An effective solution is to apply non-local feature aggregation, e.g., Transformer. Albeit useful, these techniques introduce heavy computation overheads for MVS. Each pixel densely attends to the whole image. In contrast, we propose to constrain nonlocal feature augmentation within a pair of lines: each point only attends the corresponding pair of epipolar lines. Our idea takes inspiration from the classic epipolar geometry, which shows that one point with different depth hypotheses will be projected to the epipolar line on the other view. This constraint reduces the 2D search space into the epipolar line in stereo matching. Similarly, this suggests that the matching of MVS is to distinguish a series of points lying on the same line. Inspired by this point-toline search, we devise a line-to-point non-local augmentation strategy. We first devise an optimized searching algorithm to split the 2D feature maps into epipolar line pairs. Then, an Epipolar Transformer (ET) performs non-local feature augmentation among epipolar line pairs. We incorporate the ET into a learning-based MVS baseline, named ET-MVSNet. ET-MVSNet achieves state-of-the-art reconstruction performance on both the DTU and Tanks-and-Temples benchmark with high efficiency. Code is available at https://***/TQTQliu/ET-MVSNet.
When encountering the distribution shift between the source(training) and target(test) domains, domain adaptation attempts to adjust the classifiers to be capable of dealing with different domains. Previous domain ada...
详细信息
When encountering the distribution shift between the source(training) and target(test) domains, domain adaptation attempts to adjust the classifiers to be capable of dealing with different domains. Previous domain adaptation research has achieved a lot of success both in theory and practice under the assumption that all the examples in the source domain are welllabeled and of high quality. However, the methods consistently lose robustness in noisy settings where data from the source domain have corrupted labels or features which is common in reality. Therefore, robust domain adaptation has been introduced to deal with such problems. In this paper, we attempt to solve two interrelated problems with robust domain adaptation:distribution shift across domains and sample noises of the source domain. To disentangle these challenges, an optimal transport approach with low-rank constraints is applied to guide the domain adaptation model training process to avoid noisy information influence. For the domain shift problem, the optimal transport mechanism can learn the joint data representations between the source and target domains using a measurement of discrepancy and preserve the discriminative information. The rank constraint on the transport matrix can help recover the corrupted subspace structures and eliminate the noise to some extent when dealing with corrupted source data. The solution to this relaxed and regularized optimal transport framework is a convex optimization problem that can be solved using the Augmented Lagrange Multiplier method, whose convergence can be mathematically proved. The effectiveness of the proposed method is evaluated through extensive experiments on both synthetic and real-world datasets.
The integration of renewable energy sources into the power grid has led to new challenges in maintaining the stability of the system frequency. This paper proposes a novel approach to address the Optimal Demand Side F...
The integration of renewable energy sources into the power grid has led to new challenges in maintaining the stability of the system frequency. This paper proposes a novel approach to address the Optimal Demand Side Frequency control (ODFC) problem using Multi-Agent Deep Deterministic Policy Gradient (MADDPG) method. The proposed method models the ODFC problem as a Markov game, with centralized training based on multi-agent cooperative self-learning and associative storage service. In the decentralized execution stage, each agent independently outputs control actions to the controlled plant using local observations. Numerical simulations show that the proposed method effectively addresses the ODFC problem with superior performance compared to traditional methods.
Continual learning aims to learn on a sequence of new tasks while maintaining the performance on previous tasks. Source-free domain adaptation (SFDA), which adapts a pretrained source model to a target domain, is usef...
Continual learning aims to learn on a sequence of new tasks while maintaining the performance on previous tasks. Source-free domain adaptation (SFDA), which adapts a pretrained source model to a target domain, is useful in protecting the source domain data privacy. Generalized SFDA (G-SFDA) combines continual learning and SFDA to achieve outstanding performance on both the source and the target domains. This paper proposes semi-supervised G-SFDA (SSG-SFDA) for domain incremental learning, where a pre-trained source model (instead of the source data), few labeled target data, and plenty of unlabeled target data, are available. The goal is to achieve good performance on all domains. To cope with domain-ID agnostic, SSG-SFDA trains a conditional variational auto-encoder (CVAE) for each domain to learn its feature distribution, and a domain discriminator using virtual shallow features generated by CVAE to estimate the domain ID. To cope with catastrophic forgetting, SSG-SFDA uses soft domain attention to improve the sparse domain attention in G-SFDA. To cope with insufficient labeled target data, SSG-SFDA uses MixMatch to augment the unlabeled target data and better exploit the few labeled target data. Experiments on three datasets demonstrated the effectiveness of SSG-SFDA.
Current state-of-the-art approaches for few-shot action recognition achieve promising performance by conducting frame-level matching on learned visual features. However, they generally suffer from two limitations: i) ...
详细信息
暂无评论