期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Distributed adaptive coalition task allocation based on reachable region online prediction for munition swarm 认领 引用 被引量:1
1
作者 Yuze Zhou Teng Long +2 位作者 Jingliang Sun Junzhi Li Jianxin Zhong 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2025年第11期169-183,共15页
Task allocation for munition swarms is constrained by reachable region limitations and real-time requirements.This paper proposes a reachable region guided distributed coalition formation game(RRGDCF)method to address... Task allocation for munition swarms is constrained by reachable region limitations and real-time requirements.This paper proposes a reachable region guided distributed coalition formation game(RRGDCF)method to address these issues.To enable efficient online task allocation,a reachable region prediction strategy based on fully connected neural networks(FCNNs)is developed.This strategy integrates high-fidelity data generated from the golden section method and low-fidelity data from geometric approximation in an optimal mixing ratio to form multi-fidelity samples,significantly enhancing prediction accuracy and efficiency under limited high-fidelity samples.These predictions are then incorporated into the coalition formation game framework.A tabu search mechanism guided by the reachable region center directs munitions to execute tasks within their respective reachable regions,mitigating redundant operations on ineffective coalition structures.Furthermore,an adaptive guidance coalition formation strategy optimizes allocation plans by leveraging the hit probabilities of munitions,replacing traditional random coalition formation methods.Simulation results demonstrate that RRGDCF surpasses the contract network protocol and traditional coalition formation game algorithms in optimality and computational efficiency.Hardware experiments further validate the method's practicality in dynamic scenarios. 展开更多
关键词 Munition swarm Reachable region Coalition formation game Distributed task allocation
暂未订购 下载PDF
A Theory for the Initial Allocating of Real Time Tasks in Distributed Systems 认领 引用
2
作者 鄢勇 金灿明 《Journal of Computer Science & Technology》 SCIE EI 1992年第2期185-188,共4页
Referring to a set of real time tasks with arriving time,executing time and deadline,this paperdiscusses the problem of polynomial time initial-allocating approximation algorithms in a distributedsystem and five new r... Referring to a set of real time tasks with arriving time,executing time and deadline,this paperdiscusses the problem of polynomial time initial-allocating approximation algorithms in a distributedsystem and five new results are gained which provide a theory for the designing of initial-allocating algorithmsof real time tasks. 展开更多
关键词 real time A Theory for the Initial Allocating of Real Time Tasks in Distributed Systems OP
暂未订购 下载PDF
上一页 1 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈