检索结果-南通市图书馆

Lie Bialgebras of a Family of Lie Algebras of Block Type

在线全文

学校读者我要写书评

暂无评论

Chinese Annals of Mathematics,Series B 2008年第5期29卷 487-500页

作者： Junbo LI Yucai SU bin xin Department of Mathematics Shanghai Jiao Tong University Shanghai 200240 China Department of Mathematics University of Science and Technology of China Hefei 230026 China

Lie bialgebra structures on a family of Lie algebras of Block type are shown to be triangular coboundary.

关键词： Lie bialgebras Yang-Baxter equation Lie algebra of Block type

Preface——Special Issue on New Directions in Nonlinear and Distributed Control

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2018年第1期31卷 1-3页

作者： LIU Tengfei xin bin JIANG Zhong-Ping State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang 110819 China School of Automation State Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology Beijing 100081 China Tandon School of Engineering New York University Brooklyn NY 11201 USA

Nonlinearity is ubiquitous in engineering and natural *** development of nonlinear control can be traced back to decades *** date,the research has reached the stage that emphasizes developing methodologies that can ha... 详细信息

关键词：控制问题非线性分布式工程应用程序电子物理自然系统生产线相互作用

A memetic algorithm for path planning of curvature-constrained UAVs performing surveillance of multiple ground targets

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Aeronautics 2014年第3期27卷 622-633页

作者： Zhang xing Chen Jie xin bin Peng Zhihong School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

The problem of generating optimal paths for curvature-constrained unmanned aerial vehicles （UAVs） performing surveillance of multiple ground targets is addressed in this paper. UAVs are modeled as Dubins vehicles so that the constraints of UAVs＇ minimal turning radius can be taken into account. In view of the effective surveillance range of the sensors equipped on UAVs, the problem is formulated as a Dubins traveling salesman problem with neighborhood （DTSPN）. Considering its prohibitively high computational complexity, the Dubins paths in the sense of terminal heading relaxation are introduced to simplify the calculation of the Dubins distance, and a boundary-based encoding scheme is proposed to determine the visiting point of every target neighborhood. Then, an evolutionary algorithm is used to derive the optimal Dubins tour. To further enhance the quality of the solutions, a local search strategy based on approximate gradient is employed to improve the visiting points of target neighborhoods. Finally, by a minor modification to the individual encoding, the algorithm is easily extended to deal with other two more sophisticated DTSPN variants （multi-UAV scenario and multiple groups of targets scenario）. The performance of the algorithm is demonstrated through comparative experiments with other two state-of-the-art DTSPN algorithms identified in literature. Numerical simulations exhibit that the algorithm proposed in this paper can find high-quality solutions to the DTSPN with lower computational cost and produce significantly improved performance over the other algorithms.

关键词： Approximate gradient Dubins traveling salesmanproblem with neighborhood Local search Memetic algorithm Unmanned aerial vehicles

The σ-Derivations of C[x^±1, y±1]

在线全文

学校读者我要写书评

暂无评论

Algebra Colloquium 2015年第2期22卷 251-258页

作者： Guang'ai Song Yuezhu Wu bin xin College of Mathematics and Information ScienceShandong Institute of Business and Technology Yantai Shandong 264005 China Department of Mathematics Changshu Institute of Technology Changshu Jiangsu 215500 China School of Mathematics and Computer ScienceGuizhou Normal University Guiyang 550001 China

In the present paper, the σ-derivations of C[x^±1, y±1] are determined, and their applications are considered.

关键词： σ-derivation inner σ-derivation, a-deformed Witt type algebra

Spin Assignment of the First Discovered Superdeformed Band 152Dy(1) and Some Superdeformed Bands in Neighboring Nuclei

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Physics Letters 1999年第9期16卷 632-634页

作者： LIU Shu-xin xin Xiao-bin ZENG Jin-yan Department of Physics Peking Universityj Beijing 100871

By using various approaches to the spin assignment, including the best-fit-method, the variation of moment of inertia with angular momentum, the bandhead moment of inertia J0 systematics, and the signature systematics, the spin of the lowest level observed in the first discovered superdeformed band 152Dy(1)is definitely predicted to be I0 = 26(Eγ(I0 + 2 → I0) = 602.4 keV), rather than the previously predicted I0 = 22,24, or 25. The spin prediction and properties of some superdeformed bands in the A ~ 150 region are discussed.

关键词： inertia momentum signature

An adaptive large neighborhood search for the multi-point dynamic aggregation problem

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Control Theory and Technology 2024年第3期22卷 360-378页

作者： Shengyu Lu bin xin Jie Chen Miao Guo School of Automation Beijing Institute of TechnologyBeijing 100081China National Key Lab of Autonomous Intelligent Unmanned Systems Beijing 100081China Department of Control Science and Engineering Tongji UniversityShanghai 201804China

The multi-point dynamic aggregation(MPDA)problem is a challenging real-world *** the MPDA problem,the demands of tasks keep changing with their inherent incremental rates,while a heterogeneous robot fleet is required to travel between these tasks to change the time-varying state of each *** robots are allowed to collaborate on the same task or work separately until all tasks are *** is challenging to generate an effective task execution plan due to the tight coupling between robots abilities and tasks'incremental rates,and the complexity of robot *** effectiveness consideration,we use the variable length encoding to avoid redundancy in the solution *** creatively use the adaptive large neighborhood search(ALNS)framework to solve the MPDA *** the proposed algorithm,high-quality initial solutions are generated through multiple problem-specific solution construction *** heuristics are also used to fix the broken solution in the novel integrated decoding-construction repair process of the ALNS *** results of statistical analysis by the Wilcoxon rank-sum test demonstrate that the proposed ALNS can obtain better task execution plans than some state-of-the-art algorithms in most MPDA instances.

关键词： Adaptive large neighborhood search(ALNS) Multi-point dynamic aggregation(MPDA) Heuristic solution construction Multi-robot collaboration

Bandwidth Allocation with Minimum Rate Constraints in Cluster-based Femtocell Networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

International Journal of Automation and computing 2015年第1期12卷 77-82页

作者： Kai Ma Liang Li Jie Yang Zhi-xin Liu xin-bin Li xin-Ping Guan School of Electrical Engineering Key Laboratory of Industrial Computer Control Engineering of Hebei Province Yanshan University Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information ProcessingMinistry of Education

Inter-femtocell interference becomes serious when femtocells are densely deployed. To mitigate the inter-femtocell interference, this paper proposes a cluster-based bandwidth allocation algorithm. We create femtocell clusters by constructing a weighted interference graph and allocate bandwidth to each cluster based on a Nash bargaining solution(NBS). Simulation results show that the cluster-based bandwidth allocation algorithm can reduce the inter-femtocell interference and meet the minimum rate constraint of each cluster.

关键词： Femtocell cluster inter-femtocell interference bandwidth allocation Nash bargaining solution(NBS)

A novel memetic algorithm for distributed shape formation of swarm robots with both acceleration and velocity constraints

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第12期67卷 157-175页

作者： Yun QU bin xin Qinqin WANG Ruocheng LI Zhaofeng DU National Key Lab of Autonomous Intelligent Unmanned Systems Beijing Institute of Technology Science and Technology Innovation Center

This article investigates the problem of distributed shape formation(DSF) in swarm robot systems. DSF involves each robot autonomously selecting and moving toward a target point to achieve a desired shape. A comprehensive mathematical model for DSF of swarm robots is developed, capturing the relationships among states, behaviors, and kinematics constraints. A novel memetic algorithm(MA) is proposed to generate and evolve behavior strategies that enable real-time decision-making for each *** proposed MA includes specifically designed behaviors to address subproblems within DSF, such as target selection conflict, collision, and deadlock. These behaviors, along with propositions about the states of robots,are utilized to construct strategies by a tree-based encoding scheme. An evaluation mechanism based on multiagent simulation is devised to evaluate the performance of strategies. Additionally, a repair mechanism is introduced to eliminate redundant or unreachable subtrees in a strategy. To further improve the performance of generated strategies, tree-based local search operators are employed to exploit the neighborhood of the best strategy found yet during the iteration. Experimental results and the Wilcoxon rank-sum test show that the strategies generated by the proposed MA outperform state-of-the-art algorithms, significantly reducing the completion time of DSF.

关键词： distributed shape formation swarm memetic algorithm strategy decision-making

Evolutionary Design of Controllers with Optimized Structure and Its Application in a Maglev Ball Control System 36

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Evolutionary Design of Controllers with Optimized Structure ...