期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
A UAV collaborative defense scheme driven by DDPG algorithm 被引量:1
1
作者 ZHANG Yaozhong WU Zhuoran +1 位作者 XIONG Zhenkai CHEN Long 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2023年第5期1211-1224,共14页
The deep deterministic policy gradient(DDPG)algo-rithm is an off-policy method that combines two mainstream reinforcement learning methods based on value iteration and policy iteration.Using the DDPG algorithm,agents ... The deep deterministic policy gradient(DDPG)algo-rithm is an off-policy method that combines two mainstream reinforcement learning methods based on value iteration and policy iteration.Using the DDPG algorithm,agents can explore and summarize the environment to achieve autonomous deci-sions in the continuous state space and action space.In this paper,a cooperative defense with DDPG via swarms of unmanned aerial vehicle(UAV)is developed and validated,which has shown promising practical value in the effect of defending.We solve the sparse rewards problem of reinforcement learning pair in a long-term task by building the reward function of UAV swarms and optimizing the learning process of artificial neural network based on the DDPG algorithm to reduce the vibration in the learning process.The experimental results show that the DDPG algorithm can guide the UAVs swarm to perform the defense task efficiently,meeting the requirements of a UAV swarm for non-centralization,autonomy,and promoting the intelligent development of UAVs swarm as well as the decision-making process. 展开更多
关键词 deep deterministic policy gradient(DDPG)algorithm unmanned aerial vehicles(UAVs)swarm task decision making deep reinforcement learning sparse reward problem
下载PDF
RECONFIGURABLE PRODUCTION LINE MODELING AND SCHEDULING USING PETRI NETS AND GENETIC ALGORITHM 被引量:8
2
作者 XIE Nan LI Aiping 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2006年第3期362-367,共6页
In response to the production capacity and functionality variations, a genetic algorithm (GA) embedded with deterministic timed Petri nets(DTPN) for reconfigurable production line(RPL) is proposed to solve its s... In response to the production capacity and functionality variations, a genetic algorithm (GA) embedded with deterministic timed Petri nets(DTPN) for reconfigurable production line(RPL) is proposed to solve its scheduling problem. The basic DTPN modules are presented to model the corresponding variable structures in RPL, and then the scheduling model of the whole RPL is constructed. And in the scheduling algorithm, firing sequences of the Petri nets model are used as chromosomes, thus the selection, crossover, and mutation operator do not deal with the elements in the problem space, but the elements of Petri nets model. Accordingly, all the algorithms for GA operations embedded with Petri nets model are proposed. Moreover, the new weighted single-objective optimization based on reconfiguration cost and E/T is used. The results of a DC motor RPL scheduling suggest that the presented DTPN-GA scheduling algorithm has a significant impact on RPL scheduling, and provide obvious improvements over the conventional scheduling method in practice that meets duedate, minimizes reconfiguration cost, and enhances cost effectivity. 展开更多
关键词 Reconfigurable production line deterministic timed Petri nets (DTPN) Modeling Scheduling Genetic algorithm(GA)
下载PDF
Normal projection: deterministic and probabilistic algorithms
3
作者 Dongmei LI Jinwang LIU Weijun LIU 《Frontiers of Mathematics in China》 SCIE CSCD 2014年第1期93-99,共7页
We consider the following problem: for a collection of points in an n-dimensional space, find a linear projection mapping the points to the ground field such that different points are mapped to different values. Such... We consider the following problem: for a collection of points in an n-dimensional space, find a linear projection mapping the points to the ground field such that different points are mapped to different values. Such projections are called normal and are useful for making algebraic varieties into normal positions. The points may be given explicitly or implicitly and the coefficients of the projection come from a subset S of the ground field. If the subset S is small, this problem may be hard. This paper deals with relatively large S, a deterministic algorithm is given when the points are given explicitly, and a lower bound for success probability is given for a probabilistic algorithm from in the literature. 展开更多
关键词 Normal projection primary decomposition of ideal deterministic algorithm
原文传递
Large Scale VLSI Module Placement Using LFF Heuristics by Stages
4
作者 魏少俊 董社勤 +1 位作者 洪先龙 吴有亮 《Journal of Semiconductors》 EI CAS CSCD 北大核心 2006年第5期812-818,共7页
We present a deterministic algorithm for large-scale VLSI module placement. Following the less flexibility first (LFF) principle,we simulate a manual packing process in which the concept of placement by stages is in... We present a deterministic algorithm for large-scale VLSI module placement. Following the less flexibility first (LFF) principle,we simulate a manual packing process in which the concept of placement by stages is introduced to reduce the overall evaluation complexity. The complexity of the proposed algorithm is (N1 + N2 ) × O( n^2 ) + N3× O(n^4lgn) ,where N1, N2 ,and N3 denote the number of modules in each stage, N1 + N2 + N3 = n, and N3〈〈 n. This complexity is much less than the original time complexity of O(n^5lgn). Experimental results indicate that this approach is quite promising. 展开更多
关键词 FLOORPLANNING placements large scale LFF principle deterministic placement algorithm
下载PDF
Arbitrary Rectilinear Block Packing Based on Less Flexibility First Principles
5
作者 杨中 董社勤 +1 位作者 洪先龙 吴有亮 《Journal of Semiconductors》 EI CAS CSCD 北大核心 2004年第11期1416-1422,共7页
The definition and formula of flexibility of arbitrary rectilinear blocks are introduced and LFF principles are extended to handle arbitrary rectilinear blocks and blocks with relative constraints.The experimental res... The definition and formula of flexibility of arbitrary rectilinear blocks are introduced and LFF principles are extended to handle arbitrary rectilinear blocks and blocks with relative constraints.The experimental results demonstrate the efficiency and effectiveness of the proposed method. 展开更多
关键词 LFF principles rectilinear block packing deterministic placement algorithm
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部