异构MAS结构下的空天资源多阶段协同任务规划方法

利用空天资源的互补优势进行协同观测是对地观测领域的新趋势.为提高对地观测效益和多阶段观测任务的完成度,分析了空天资源协同观测任务规划问题中的观测资源异构性和多阶段观测任务分解方式的多样性.针对卫星和无人机的任务规划模型不一致的特点,建立了异构多智能体系统(MAS)多阶段协同任务规划模型,根据模型特点将问题求解分解为两个协商过程,并分别提出了基于市场模型的异构MAS多阶段协同任务规划算法和基于自适应“超级步”的资源Agent协同任务规划算法.最后,研究了该方法在空天资源联合观测中的应用情况,实验及分析结果表明该方法能够有效解决空天资源对地观测协同任务规划问题.     

通信约束下异构多无人机任务分配方法

针对异构多无人机协同执行侦察和打击任务中,存在通信距离、时间延迟等约束条件下的局部任务分配问题,提出了一种基于合同网的分布式多无人机任务分配方法。首先建立了异构集群发现新目标时的局部任务分配问题模型,设计了局部无人机通信网络中的信息一致性算法,实现了任务分配过程中任务发布阶段各无人机的冲突消解。设计了任务分配过程中的联盟构建和无人机资源管理方法,使联盟中各无人机能够以更加平衡的方式消耗资源。仿真结果表明,该方法能够解决通信约束下,异构多无人机执行察打任务时,所触发的针对目标打击任务的任务分配问题,且能够获得最大的系统效能。     

考虑协同航路规划的多无人机任务分配

针对多无人机任务分配与协同航路规划问题，以分布式合同网拍卖算法为基础，构建无人机集群任务拍卖架构与拍卖收益函数，结合模拟退火算法协调任务执行次序，采用A^*算法完成两任务点间航程预估，在任务分配阶段同步完成多无人机间协同航路的初规划，确定最佳任务执行次序，实现任务分配与协同航路规划的紧耦合。仿真结果表明，在考虑禁飞区、障碍威胁情况下，该算法能够有效完成多架无人机不同类型任务的分配，且目标分配、执行次序合理，总执行代价小，各机间负载均衡；在任务分配阶段考虑协同航路规划具有明显的效果，能够有效提高任务分配的合理性。     

基于多策略GWO算法的不确定环境下异构多无人机任务分配

针对具有复杂约束的异构多无人机对地目标侦察打击任务分配问题，考虑不确定的任务执行时长、目标消失时间和无人机巡航速度等不确定因素对任务分配结果的影响，基于模糊可信性理论构建以最小化总成本为优化目标的异构多无人机任务分配的模糊机会约束规划模型，并提出一种多策略融合的灰狼优化算法（IMSGWO），通过引入自适应控制参数调整策略、自适应惯性权重策略、最优学习策略与跳出局部最优策略，在增强种群多样性的同时，提高算法的搜索能力。数值分析结果表明：所提算法能够有效求解不确定环境下的异构多无人机任务分配问题。     

基于改进狼群算法的多无人机协同多目标分配CSCD

针对现代空战多无人机协同多目标任务分配问题,结合标准狼群算法,提出了一种改进狼群算法的多目标任务分配方法。根据狼群的不同分工以及搜索属性,建立了基于自主游走机制的头狼产生规则、基于多策略知识库的探狼游走机制和基于自适应步长的猛狼奔袭及围攻方式,从而对传统狼群算法的随机性进行智能化约束与控制,以解决多无人机协同多目标任务分配问题。数值仿真结果表明,该方法能够快速有效获得任务分配方案,避免陷入局部最优。     

基于多基因遗传算法的异构多无人机协同任务分配

以异构多无人机对多目标执行侦查、攻击和评估任务为背景,开展协同任务分配问题建模、算法设计和仿真分析。综合考虑异构无人机任务执行能力、任务执行时序和自身运动学等约束,同时考虑各无人机机载弹药毁伤概率因素,建立以任务执行时间和攻击收益为综合性能指标的任务分配优化模型,提出避免产生"死锁"现象的基于多类型基因编码的改进遗传算法,实现对协同任务分配问题的求解。基于任务分配方案和无人机的最小转弯半径,采用Dubins路径协调方法,生成无人机的可飞航迹。仿真结果表明,改进遗传算法可快速有效地求解多约束条件下异构多无人机协同任务分配问题,基于Dubins路径协调可为每个无人机生成完整的可飞航迹。     

通信约束下UAV集群协同拦截任务分配算法

针对多无人机协同拦截多机动目标的任务分配问题,同时考虑到真实战场环境中存在的通信约束以及探测范围约束条件,本文提出了分步一致性拍卖算法（SCBAA）。首先,对真实战场环境中存在的通信约束以及探测范围约束等问题进行了描述分析,构建了多无人机协同拦截任务分配模型,设计了综合效能函数以及相应约束条件。其次,为解决多无人机协同打击单一目标的不平衡任务分配以及冲突消解问题,将原任务分配过程分为主要任务分配以及次要任务分配两部分,通过多次拍卖以及冲突消解实现多无人机对单一目标的任务分配。仿真结果表明,该算法可有效解决通信约束条件下的分布式多无人机协同拦截问题,并适应动态环境中任务分配对实时性的要求。     

多无人机协同任务分配混合粒子群算法

针对多无人机协同任务分配问题(MTAP),设计了一种综合考虑飞行航程、任务收益以及任务完成时间窗口的混合粒子群任务分配算法。首先,将粒子位置编码为一组任务分配向量,针对同时打击场景可能存在的死锁问题,设计了一种基于多打击任务有向图的死锁检测和修复算法,解码出对应一组可行的任务分配解或方案,实现粒子群算法解的离散化。另外,对于传统粒子群算法(PSO)容易陷入局部收敛的缺点,提出一种基于变邻域搜索算法的跳出局部收敛策略,并建立局部搜索启动概率准则,实现跳出局部收敛和计算开销的平衡。最后,将跳出局部收敛的策略嵌入到粒子群算法中,得到协同任务分配的混合粒子群算法(HPSO)。另外,针对新目标发现导致的初始计划失效问题,设计了一种基于匹配策略的局部任务重分配方法。仿真实验证明,所提出的混合粒子群算法能够有效解决异构多无人机同时打击场景中的任务分配问题。     

基于时间约束集的多弹道式飞行器避撞发射时间规划

提出了通过调整发射时间解决多弹道式飞行器飞行避撞问题的算法框架,在该框架内针对多弹道式飞行器协同打击时是否发生飞行碰撞提出了检验算法,对于飞行器碰撞规避问题建立发射时间约束集模型,约束集由飞行器间发生碰撞的发射时间间隔约束构成。在该时间约束集的基础上建立以多弹道式飞行器同时打击为优化目标、含有不等于号表达式时间约束的优化问题,并通过"Big-M"法将该问题转化为非线性规划问题的标准形式,再利用序列二次规划(SQP)算法进行求解。该框架将发射时间调整问题转化为最优化规划问题,降低了传统遍历性发射时间调整算法的计算复杂度。基于MATLAB平台环境对所提模型及规划算法进行了仿真,验证了所提算法的合理性与有效性,同时具有较高的计算效率。     

基于群集智能的协同多目标攻击空战决策

为使各武器平台利用数据链（TADIL）交换和共享信息,自主协同计算实现多目标攻击决策,本文基于NASA/Ames研究中心提出的群集智能（COIN）理论,构建以作战单元为智能体（Agent）的协同多目标攻击决策模型,并通过定义Agent的贡献度扩展群集智能架构,用于解决分布式异构Agent造成的系统难以准确收敛问题。为提高收敛速度,减少求解过程中的盲目搜索和提高已形成解的收敛,研究加入了构造性启发和改进性启发两类启发方法。实验表明所提算法同传统算法相比,具有更好的稳定性和扩展性,减少了计算量,收敛速度也有一定的提高。     

Cooperative task assignment of multiple heterogeneous unmanned aerial vehicles using a modified genetic algorithm with multi-type genes

The task assignment problem of multiple heterogeneous unmanned aerial vehicles （UAVs）, concerned with cooperative decision making and control, is studied in this paper. The heterogeneous vehicles have different operational capabilities and kinematic constraints, and carry limited resources （e.g., weapons） onboard. They are designated to perform multiple consecutive tasks cooperatively on multiple ground targets. The problem becomes much more complicated because of these terms of heterogeneity. In order to tackle the challenge, we modify the former genetic algorithm with multi-type genes to stochastically search a best solution. Genes of chromo- somes are different, and they are assorted into several types according to the tasks that must be performed on targets. Different types of genes are processed specifically in the improved genetic operators including initialization, crossover, and mutation. We also present a mirror representation of vehicles to deal with the limited resource constraint. Feasible chromosomes that vehicles could perform tasks using their limited resources under the assignment are created and evolved by genetic operators. The effect of the proposed algorithm is demonstrated in numerical simulations. The results show that it effectively provides good feasible solutions and finds an optimal one.     

Satellite group autonomous operation mechanism and planning algorithm for marine target surveillance

In terms of fast response problem of unanticipated marine target, it is necessary to design the satellite-ground-combined operation mechanism and planning algorithm for autonomous task planning. Firstly, based on the autonomous operation and task planning of remote sensing satellite group, it is divided into two parts: ground planning and satellite autonomous planning. Secondly,the satellite-ground-combined operation mechanism and operation flow for task planning are proposed after fully considering the resource characteristics and task demand characteristics of the ground and satellite. The satellite autonomous task planning algorithm based on extended contract net is designed. Through the simulation operation of the self-developed distributed simulation demonstration software, it shows that the operation mechanism can coordinate and cooperate effectively between the satellite autonomous task planning and ground planning. It can give full play to the advantages of the ground computing resources, reflect the control intention, make full use of the real-time feature and flexibility of the satellite calculation, and respond fast to the unanticipated task. Besides, it has solved problems of the untimely response of ground control on unanticipated observation task, the limitation of satellite computing resources and satellite-ground planning and coordination, which can effectively improve the responsiveness of remote sensing satellite to the observation task of maritime unanticipated target.     

Coactive design of explainable agent-based task planning and deep reinforcement learning for human-UAVs teamwork

Unmanned Aerial Vehicles (UAVs) are useful in dangerous and dynamic tasks such as search-and-rescue, forest surveillance, and anti-terrorist operations. These tasks can be solved better through the collaboration of multiple UAVs under human supervision. However, it is still difficult for human to monitor, understand, predict and control the behaviors of the UAVs due to the task complexity as well as the black-box machine learning and planning algorithms being used. In this paper, the coactive design method is adopted to analyze the cognitive capabilities required for the tasks and design the interdependencies among the heterogeneous teammates of UAVs or human for coherent collaboration. Then, an agent-based task planner is proposed to automatically decompose a complex task into a sequence of explainable subtasks under constrains of resources, execution time, social rules and costs. Besides, a deep reinforcement learning approach is designed for the UAVs to learn optimal policies of a flocking behavior and a path planner that are easy for the human operator to understand and control. Finally, a mixed-initiative action selection mechanism is used to evaluate the learned policies as well as the human’s decisions. Experimental results demonstrate the effectiveness of the proposed methods.     

基于并行蚁群优化的多UCAV任务分配仿真平台

多无人作战飞机(UCAV)协同作战是UCAV参与战斗的主要模式,而多UCAV任务分配是多UCAV协同作战研究的关键问题。针对现有多UCAV任务分配方法中所存在的计算量大、运行时间长等问题,提出了一种基于并行蚁群优化(ACO)的多UCAV任务分配方法。在构建多UCAV空战优势矩阵的基础上,给出了综合态势评估函数;随后阐述了基本ACO算法的基本原理和数学模型,提出了一种用并行ACO算法解决多UCAV任务分配问题的实现方法;最后基于MATLAB图形用户界面(GUI)开发了一种基于并行蚁群优化的多UCAV任务分配仿真平台。实践证明该仿真平台具有良好、开放的可扩展性,且使用方便。     

基于多智能体混合学习的多星协同动态任务规划算法(英文)

针对多星协同动态任务规划问题,以往多采用基于启发式的重规划算法,但是由于启发式策略依赖于具体任务,使得优化性受到影响。注意到协同规划的历史信息对后续协同规划的影响,本文提出了一种基于策略迭代的多智能体强化学习和迁移学习的混合学习算法求解该问题近似最优策略。本文的多智能体强化学习方法利用神经网络描述各颗卫星的强化学习策略,通过协同进化的方法迭代搜索具有最优拓扑结构和连接权重的策略神经网络个体。针对随机出现的观测任务请求导致历史学习策略失效,通过迁移学习将历史学习策略转换为当前初始策略,保证规划质量前提下加快多星协同任务规划速度。仿真实验及分析结果表明本文算法对动态随机出现的任务请求有良好的适应性。     

Management of transponder resources in mobile satellite systems

Allocation of L-band spectrum for land mobile satellite (MSAT) services in Mobile-WARC-87 paves the way for the introduction of such services in the early 1990s. An overview of the proposed network architecture of the Canadian MSAT network is presented. Management of transponder resources, i.e. power, bandwidth, and spot-beam antennas, which poses a set of unique and significant problems in the design and operation of MSAT networks, is addressed. The three-level hierarchical approach used by the Canadian network is described, and the technical requirements for solving the above problems are identified. The two upper levels employ reconfigurable fixed assignment for allocating transponders to antenna spot beams, and transponder power and bandwidth to different services. The lowest level employs demand assignment and packet multiple access protocols for resource sharing among different subscribers. Uncoupling the resource management problems into manageable portions reduces the complexity and enhances the robustness of the network     

Exploring mission planning method for a team of carrier aircraft launching

High-level efficiency and safety are of great significance for improving the fighting capability of an aircraft carrier. One way to enhance efficiency and safety level is to organize the carrier aircraft into combat effectively. This paper studies the mission planning problem for a team of carrier aircraft launching, and a novel distributed mission planning architecture is proposed. The architecture is hierarchical and is comprised of four levels, namely, the input level, the coordination level,the path planning level and the execution level. Realistic constraints in each level of the distributed architecture, such as the vortex flow effect, the crowd effect and the motion of aircraft, are considered in the model. To solve this problem, a distributed path planning algorithm based on the asynchronous planning strategy is developed. The proposed Mission Planning Approach for Carrier Aircraft Launching(MPACAL) is validated using the setups of the Nimitz-class aircraft carrier.Compared to the isolated planning architecture and the centralized planning architecture, the proposed distributed planning architecture has advantages in coordinating the launch tasks not only belonging to the same catapult but also when all different catapults are considered. The proposed MPACAL provides a modeling method for the flight deck operation on aircraft carrier.