检索结果-内蒙古大学图书馆

distribution algorithm FOR TORQUE CONTROL OF NEW ENERGY FOUR-WHEEL HUB MOTOR

RUSSIAN PHYSICS JOURNAL 2022年第9期64卷 1613-1628页

作者： Leng, Shuai Jin, Liqiang Jilin Univ Coll Automot Engn Changchun Peoples R China

Due to the nonlinear, strong coupling and uncertain parameters of the new energy four-wheel hub motor, it is more difficult to control the torque of the motor. In order to solve this problem, a torque control method based on the distribution algorithm is proposed for the new energy four-wheel hub motor. The dynamic model of the new energy four-wheel hub motor is suggested, and the unmeasurable flux, electric power and other state variables in the motor model are derived according to the degree of freedom of the body. The paper studies the whole four-wheel hub motor with the purpose to improve the efficiency of the drive system and proposes the distribution algorithm to control the electromagnetic torque of the motor. According to the simulation results, the torque control for the new energy four-wheel hub motor leads to a longer driving range of the vehicle, small change in the amplitude of stator flux and the stator current, better stability of the motor speed, and better torque control effect.

关键词： distribution algorithm new energy four-wheel hub motor torque control dynamic model

来源：评论

学校读者我要写书评

暂无评论

Controller node driven hop count based data distribution algorithm in ring connected binary tree network-on-chip for parallel processing

引用

International Journal of Information Technology (Singapore) 2024年第4期16卷 2535-2547页

作者： Uma, R. Sarojadevi, H. Sanju, V. Department of CSE Nitte Meenakshi Institute of Technology Visvesvaraya Technological University Karnataka Belagavi India School of CSE REVA University Karnataka Bangalore India

An effective distribution of packets is particularly important for the performance of a network-on-chip system. Ring connected binary tree structures do not have a defined distribution method and this paper elaborates the node architecture and a new distribution algorithm for ring connected binary tree structures. The distribution method described in this paper shows how optimized distribution of packets takes place for complex computations in ring connected binary tree. The controller node acts as a centralized node which creates the sub processing tasks and distributes to the computation nodes. The distribution of sub processing tasks is performed after figuring out the proximity of the computation nodes to the controller node in terms of hop count. In this work, the number of clock cycles for parallel processing is reduced by improving the synchronization between the transmit and receive operations thereby reducing the power consumption of the system. © The Author(s), under exclusive licence to Bharati Vidyapeeth's Institute of Computer Applications and Management 2024.

关键词： Controller node distribution algorithm Network-on-chip Parallel activities Ring Connected Binary Tree Topology

来源：评论

学校读者我要写书评

暂无评论

Preparation of Papers for IFAC Conferences & Symposia: Autonomous distribution algorithm for Formation Satellites Under Emergent Imaging Requests 21

Preparation of Papers for IFAC Conferences & Symposia: Auton...

引用

21st International-Federation-of-Automatic-Control (IFAC) Symposium on Automatic Control in Aerospace (ACA)

作者： Miao Yue Wang Feng Chen Xueqin Yu Yanjun Li Chaoyong Harbin Inst Technol Sch Astronaut Harbin 150080 Heilongjiang Peoples R China Zhejiang Univ Coll Elect Engn Hangzhou 310027 Zhejiang Peoples R China

In order to quick response to emergencies such as air crash and natural disaster, satellites on orbit are desirable to fast achieve imaging sequence for real-time tasks. To select targets in hot area for formation flying satellites, two types of "select-by-grade" algorithms are presented to obtain an appropriate imaging sequence for each satellite. First, ground targets are divided into different groups with different grades in terms of their significances. By making analysis on constraints of target locations and satellite performances, the autonomous task planning is treated as a stepwise optimization problem where the objective function is to maximize the overall imaging gain for all satellites. Second, to solve the optimization problem, the aforementioned different grades ground targets are assigned to different satellites by pre-defined distribution schemes. Finally, a simulation example is provided to illustrate the effectiveness of the proposed algorithms. Copyright (C) 2019. The Authors. Published by Elsevier Ltd. All rights reserved.

关键词： autonomous task planning formation imaging satellite distribution algorithm optimization imaging sequence

来源：评论

学校读者我要写书评

暂无评论

Preparation of Papers for IFAC Conferences & Symposia: Autonomous distribution algorithm for Formation Satellites Under Emergent Imaging Requests

引用

IFAC-PapersOnLine 2019年第12期52卷 460-465页

作者： A. Miao Yue B. Wang Feng C. Chen Xueqin D. Yu Yanjun E. Li Chaoyong

In order to quick response to emergencies such as air crash and natural disaster, satellites on orbit are desirable to fast achieve imaging sequence for real-time tasks. To select targets in hot area for formation flying satellites, two types of “select-by-grade” algorithms are presented to obtain an appropriate imaging sequence for each satellite. First, ground targets are divided into different groups with different grades in terms of their significances. By making analysis on constraints of target locations and satellite performances, the autonomous task planning is treated as a stepwise optimization problem where the objective function is to maximize the overall imaging gain for all satellites. Second, to solve the optimization problem, the aforementioned different grades ground targets are assigned to different satellites by pre-defined distribution schemes. Finally, a simulation example is provided to illustrate the effectiveness of the proposed algorithms.

关键词： autonomous task planning formation imaging satellite distribution algorithm optimization imaging sequence

来源：评论

学校读者我要写书评

暂无评论

Clustering Molecular Dynamics Trajectories with a Univariate Estimation of distribution algorithm

Clustering Molecular Dynamics Trajectories with a Univariate...

引用

IEEE Congress on Evolutionary Computation

作者： Rodrigo C. Barros Christian V. Quevedo Renata De Paris Márcio P. Basgalupp Pontifícia Universidade Católica do Rio Grande do Sul Faculdade de Informática Porto Alegre RS Brazil Universidade Federal de S?o Paulo Instituto de Ciência e Tecnologia S?o José dos Campos SP Brazil

ISBN: (纸本)9781479974931

Molecular Dynamics simulations of protein receptors are an emergent tool in rational drug discovery. Nevertheless, employing Molecular Dynamics trajectories in virtual screening of large repositories is a very costly procedure, which ultimately may become unfeasible. Data clustering have been applied in this context with the goal of reducing the overall computational cost in order to make this task feasible. In this paper, we develop a novel estimation of distribution algorithm called Clus-EDA for clustering entire trajectories using structural features from the substrate-binding cavity of the protein receptor. This novel approach is capable of reducing the original trajectory to about 4% of its original size whilst keeping all relevant information for the analysis of receptor-ligand binding. The resulting partition generated by the estimation of distribution algorithm is further validated by analyzing the interactions between 20 ligands and a Fully-Flexible Receptor model containing a 20 ns Molecular Dynamics simulation trajectory. Results show that Clus-EDA is capable of outperforming traditional clustering algorithms such as k-means and hierarchical clustering by providing the smallest variance of the free energy of binding within the conformations in each cluster.

关键词： Clustering Molecular Dynamics Trajectories Univariate Estimation distribution algorithm

来源：评论

学校读者我要写书评

暂无评论

ROSE: Robustly Safe Charging for Wireless Power Transfer

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2022年第6期21卷 2180-2197页

作者： Dai, Haipeng Xu, Yun Chen, Guihai Dou, Wanchun Tian, Chen Wu, Xiaobing He, Tian Nanjing Univ State Key Lab Novel Software Technol Nanjing 210023 Peoples R China Univ Canterbury Wireless Res Ctr Christchurch 8041 New Zealand Univ Minnesota Comp Sci & Engn Dept Minneapolis MN 55455 USA

One critical issue for wireless power transfer is to avoid human health impairments caused by electromagnetic radiation (EMR) exposure. The existing studies mainly focus on scheduling wireless chargers so that (expected) EMR at any point in the area does not exceed a threshold R-t. Nevertheless, they overlook the EMR jitter that leads to exceeding of R-t even if the expected EMR is no more than R-t. This paper studies the fundamental problem of RObustly SafE charging for wireless power transfer (ROSE), that is, scheduling the power of chargers so that the charging utility for all rechargeable devices is maximized while the probability that EMR anywhere does not exceed R, is no less than a given confidence. We first build our empirical probabilistic charging model and EMR model. Then, we present EMR approximation and area discretization techniques to formulate ROSE into a Second-Order Cone Program. After that, we propose the first redundant second-order cone constraints reduction algorithm to reduce the computational cost, and therefore obtain a (1 - epsilon)-approximation centralized algorithm. Further, we propose a (1 - epsilon)-approximation fully distributed algorithm scalable with network size for ROSE. We conduct both simulation and field experiments, and the results show that our algorithms can outperform comparison algorithms by 480.19 percent.

关键词： Robustly safe charging wireless power transfer approximation algorithm distribution algorithm

来源：评论

学校读者我要写书评

暂无评论

A continuous estimation of distribution algorithm by evolving graph structures using reinforcement learning

A continuous estimation of distribution algorithm by evolvin...

引用

Congress on Evolutionary Computation

作者： Xianneng Li Bing Li Shingo Mabu Kotaro Hirasawa Graduate School of Information Production and Systems Waseda University Japan

ISBN: (纸本)9781467315104

A novel graph-based Estimation of distribution algorithm (EDA) named Probabilistic Model Building Genetic Network Programming (PMBGNP) has been proposed. Inspired by classical EDAs, PMBGNP memorizes the current best individuals and uses them to estimate a distribution for the generation of the new population. However, PMBGNP can evolve compact programs by representing its solutions as graph structures. Therefore, it can solve a range of problems different from conventional ones in EDA literature, such as data mining and Reinforcement Learning (RL) problems. This paper extends PMBGNP from discrete to continuous search space, which is named PMBGNP-AC. Besides evolving the node connections to determine the optimal graph structures using conventional PMBGNP, Gaussian distribution is used for the distribution of continuous variables of nodes. The mean value μ and standard deviation σ are constructed like those of classical continuous Population-based incremental learning (PBILc). However, a RL technique, i.e., Actor-Critic (AC), is designed to update the parameters (μ and σ). AC allows us to calculate the Temporal-Difference (TD) error to evaluate whether the selection of the continuous value is better or worse than expected. This scalar reinforcement signal can decide whether the tendency to select this continuous value should be strengthened or weakened, allowing us to determine the shape of the probability density functions of the Gaussian distribution. The proposed algorithm is applied to a RL problem, i.e., autonomous robot control, where the robot's wheel speeds and sensor values are continuous. The experimental results show the superiority of PMBGNP-AC comparing with the conventional algorithms.

关键词： Continuous Estimation distribution algorithm Evolving Graph Structures

来源：评论

学校读者我要写书评

暂无评论

Comparison of the effectiveness of optic atmosphere investigation tasks distribution techniques in local network 21

Comparison of the effectiveness of optic atmosphere investig...

引用

21st International Symposium On Atmospheric and Ocean Optics - Atmospheric Physics

作者： Petrov, Alexey A. Kalayda, Vladimir T. Natl Res Tomsk State Univ Tomsk 634050 Russia

The research introduces a comparative review of atmosphere investigation tasks distribution techniques in local network. The article provides information about algorithms, simulation modeling methods and the results o... 详细信息

ISBN: (纸本)9781628419085

关键词： distributed system distribution algorithm distributed computing simulation modeling

来源：评论

学校读者我要写书评

暂无评论

A Distributed algorithm based on RSSI for Intelligent Vehicle Localization

A Distributed Algorithm based on RSSI for Intelligent Vehicl...

引用

International Conference on Measurement, Instrumentation and Automation (ICMIA 2012)

作者： Ren, Rui Acad Armored Force Engn Dept Control Engn Beijing 100072 Peoples R China

ISBN: (纸本)9783037855454

Wireless sensor network is added on traditional GPS to realize double location in this paper. The widely used distributed distance measure algorithm of RSSI based in wireless sensor network is adopted. At the beginning work of this position system, unknown position node A broadcast its localization request, after all the base node received this request, they reply node A with its own location info and the RSSI value from other base node. Node A select the most closest base node as base to determine his own location, moreover, distance between base node and signal strength is take as reference to adjust the weight value of every base node, then the precise position is got after final calculation. In the end, precise of this algorithm is proved by simulation experiment.

关键词： Intelligent Vehicle Location Technology distribution algorithm RSSI

来源：评论

学校读者我要写书评

暂无评论

A novel task resource distribution algorithm based on MDLS and GA

A novel task resource distribution algorithm based on MDLS a...

引用

6th International Conference on Machine Learning and Cybernetics

作者： Wang, Jiang-Feng Bao, Wei-Dong Zhang, Mao-Jun Natl Univ Def Technol Coll Informat Syst & Management Changsha 410073 Peoples R China

In this paper, we proposed a novel task resource distribution algorithm based on Multidimensional Dynamic List Scheduling and Genetic algorithm. The mathematical formulation and implementation of the inner and outer m... 详细信息

ISBN: (纸本)9781424409723

关键词： distribution algorithm group technology MDLS algorithm genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：