Optimal deployment of swarm positions in cooperative interception of multiple UAV swarms

In order to prevent the attacker from breaking through the blockade of the interception,deploying multiple Unmanned Aerial Vehicle(UAV)swarms on the interception line is a new combat style.To solve the optimal deployment of swarm positions in the cooperative interception,an optimal deployment optimization model is presented by minimizing the penetration zones'area and the analytical expression of the optimal deployment positions is deduced.Firstly,from the view of the attackers breaking through the interception line,the situations of vertical penetration and oblique penetration are analyzed respectively,and the mathematical models of penetration zones are obtained under the condition of a single UAV swarm and multiple UAV swarms.Secondly,based on the optimization goal of minimizing the penetration area,the optimal deployment optimization model for swarm positions is proposed,and the analytical solution of the optimal deployment is solved by using the convex programming theory.Finally,the proposed optimal deployment is compared with the uniform deployment and random deployment to verify the validity of the theoretical analysis.

New partial cooperation model for bilevel programming problems

Partial cooperation models are studied for many years to solve the bilevel programming problems where the follower’s optimal reaction is not unique. However, in these existed models, the follower’s cooperation level does not depend on the leader’s decision. A new model is proposed to solve this deficiency. It is proved the feasibility of the new model when the reaction set of the lower level is lower semicontinuous. And the numerical results show that the new model has optimal solutions when the reaction set of the lower level is discrete, lower semi-continuous and non-lower semi-continuous.

A Cooperation-planning Model Based on Bilevel Programming Decision

This paper is based on a resource constrained active network project;the constraint of the local resource and the time constraint of the cooperation resource are considered simultaneously.And the respective benefit of the manager and cooperation partners is also considered simultaneously.And a cooperation planning model based on bilevel multi-objective programming is de- signed,according to the due time and total cost.And an extended CNP based on the permitted range for resource and time requests is presented.A larger task set in scheduling cycle is on the permitting for the request of cooperation resource and time while the task manager itself may be permitted biding for tasks.As a result,the optimization space for the cooperation planning is enlarged.So not every bidding task is successfully bid by invitee,and the task manager itself takes on some bidding tasks.Finally,the genetic algorithm is given and the validity and feasibility of the model is proved by a case.

New partial cooperation model for ill-posed bilevel programming problem via satisfactory degree

Partial cooperation formulation is a more viable option than optimistic＇s and pessimistic＇s to solve an ill-posed bilevel programming problem.Aboussoror＇s partial cooperation model uses a constant as a cooperation index to describe the degree of follower＇s cooperation.The constant only indicates the leader＇s expectation coefficient for the follower＇s action,not the follower＇s own willingness.To solve this situation,a new model is proposed by using the follower＇s satisfactory degree as the cooperation degree.Then,because this new cooperation degree is a function which is dependent on the leader＇s choice and decided by the follower＇s satisfactory degree,this paper proves such proposed model not only leads an optimal value between the optimistic value and pessimistic＇s,but also leads a more satisfactory solution than Aboussoror＇s.Finally,a numerical experiment is given to demonstrate the feasibility of this new model.

Reasons Behind the Growing Popularity of Sino-Foreign Cooperative Educational Programs

The continuously expanding program scale and increasing student enrollment number of Sino-foreign cooperative educational programs in recent years have demonstrated their increasing acceptance among Chinese students.This paper aims to explore and analyze the reasons behind the growing popularity of Sino-foreign joint educational programs.

PROGRESS IN “APPLIED RESEARCH ON DROUGHT & DESERTIFICATION”——A fruitful cooperative program between China and the World Laboratory

World Laboratory (WL) is an international organ financed by the Italian Ministry of Foreign Affairs and its operation is exclusively for the Third World countries, where basic research projects are carried out and research results are applied to the benefit of the local areas and the world as a whole. The Project of"Applied Research on Drought &

Task assignment under constraint of timing sequential for cooperative air combat

According to the previous achievement, the task assignment under the constraint of timing continuity for a cooperative air combat is studied. An extensive task assignment scenario with the background of the cooperative air combat is proposed. The utility and time of executing a task as well as the continuous combat ability are defined. The concept of the matching method of weapon and target is modified based on the analysis of the air combat scenario. The constraint framework is also redefined according to a new objective function. The constraints of timing and continuity are formulated with a new method, at the same time, the task assignment and integer programming models of the cooperative combat are established. Finally, the assignment problem is solved using the integrated linear programming software and the simulation shows that it is feasible to apply this modified model in the cooperative air combat for tasks cooperation and it is also efficient to optimize the resource assignment.

Cooperative path planning for multi-AUV in time-varying ocean flows

For low-speed underwater vehicles, the ocean currents has a great influence on them, and the changes in ocean currents is complex and continuous, thus whose impact must be taken into consideration in the path planning. There are still lack of authoritative indicator and method for the cooperating path planning. The calculation of the voyage time is a difficult problem in the time-varying ocean, for the existing methods of the cooperating path planning, the computation time will increase exponentially as the autonomous underwater vehicle（AUV） counts increase, rendering them unfeasible. A collaborative path planning method is presehted for multi-AUV under the influence of time-varying ocean currents based on the dynamic programming algorithm. Each AUV cooperates with the one who has the longest estimated time of sailing, enabling the arrays of AUV to get their common goal in the shortest time with minimum timedifference. At the same time, they could avoid the obstacles along the way to the target. Simulation results show that the proposed method has a promising applicability.

An Open Environment for Cooperative Equational Solving

We describe a system called CFLP which aims at the integration of the best features of functional logic programming (FLP), cooperative constraint solving (CCS), and distributed computing. FLP provides support for defining one's own abstractions over a constraint domain in an easy and comfortable way, whereas CCS is employed to solve systems of mixed constraints by iterating specialized constraint solving methods in accordance with a well defined strategy. The system is a distributed implementation of a cooperative constraint functional logic programming scheme that combines higher order lazy narrowing with cooperative constraint solving. The model takes advantage of the existence of several constraint solving resources located in a distributed environment (e.g., a network of computers), which communicate asynchronously via message passing. To increase the openness of the system, we are redesigning CFLP based on CORBA. We discuss some design and implementation issues of the system.

Optimal Set of Multiple Relays and Distributed Self-Selection in Cooperative Networks

In this paper we derive analytically the optimal set of relays for the maximal destination signal-to-noise ratio (SNR) in a two-hop amplify-and-forward cooperative network with frequency-selective fading channels. Simple rules are derived to determine the optimal relays from all available candidates. Our results show that a node either participates in relaying with full power or does not participate in relaying at all, and that a node is a valid relay if and only if its SNR is higher than the optimal destination SNR. In addition, we develop a simple distributed algorithm for each node to determine whether participating in relaying by comparing its own SNR with the broadcasted destination SNR. This algorithm has extremely low overhead, and is shown to converge to the optimal solution fast and exactly within a finite number of iterations. The extremely high efficiency makes it especially suitable to time-varying mobile networks.

Invasive Species Control Based on a Cooperative Game

We develop a long-term dynamic model for controlling invasive species using the theory of cooperative games. The model is applied to control of invasive buffelgrass in the Arizona desert, which directly competes with indigenous species and can increase wildfire risk. Interest groups care about damages to three threatened resources: saguaro, cactus, riparian vegetation, and buildings. The model optimally allocates labor and a budget to protect these resources by controlling the buffelgrass population over a multi-period planning horizon. The solution is based on computing the Shapley values for the interest groups. A homeowner strategy of creating defensible space around structures to protect against wildfire affords less protection to the other resources. A similar result holds for protection of saguaros, which are also spatially concentrated. Under the optimal solution, groups caring about spatially-dispersed, riparian vegetation would compensate homeowners and groups caring about saguaros for a reallocation of resources toward greater protection of dispersed vegetation. Results highlight the importance of the spatial configuration of players and the resources they wish to protect in invasive species control problems.

国际合作培养生物医学工程-神经科学交叉领域创新型人才项目的执行分析和思考

创新型人才国际合作培养项目是拓展高水平国际合作交流渠道的关键抓手。如何围绕创新型人才培养进一步发展学科建设,创新培养模式,建立优质合作交流是当前面临的主要任务。为了满足中国对高层次国际化的脑科学交叉领域人才的迫切需求,同时为了推动生物医学工程学科的拓展和提升,2019年电子科技大学与加拿大麦吉尔大学开展生物医学工程-神经科学交叉领域创新型人才国际合作培养项目,选拔电子科技大学生物医学工程背景的硕士研究生攻读麦吉尔大学的神经科学博士学位,以培养具有强交叉背景的下一代神经科学家。本文针对该项目展开深入探讨,就项目执行现状、项目运行经验、创新型国际化人才培养模式探索进行梳理分析和思考。

基于装卸顺序的中型机多航段协同配载优化

多航段、多经停的航空货运航班,飞行过程中需要合理控制飞机的重心(CG)位置,保持平衡状态,中转站装卸操作过程中需要避免额外装卸操作,减少时间和劳力浪费,因此,研究多航段航班的协同配载问题具有重要现实意义。根据航空器自身特点与集装器(ULD)装卸顺序,结合各航段飞机装载平衡与过站机场ULD装卸操作要求,通过协调分配各航段ULD和散货位置,建立了中型机联程航班多目标整数线性规划模型。模型考虑了ULD和散货的质量、体积及与舱位的匹配限制,航空器限重、舱位限重、舱位及区域累积限重、上下舱联合限重和CG位置的平衡限制,以及前后航段ULD和散货的连接性约束。根据造成中间机场额外装卸操作的2种原因,基于装卸顺序,提出装卸优化模型,通过ULD的舱内平移,优化了CG,减少了装卸次数。以B757-200F机型为例,在两装一卸、一装两卸和两装两卸3种场景下,采用商用求解器Gurobi,分别针对3种不同目标函数组合进行求解和分析对比。实验表明:所提模型可以有效协调过站货物的额外装卸次数,优化前后两航段的CG位置。

加拿大公共图书馆的健康信息服务项目

调查分析加拿大公共图书馆开展健康信息服务现状,可为“健康中国”战略下公共图书馆全面推进健康信息服务提供借鉴。文章通过网络调研,从项目类型、主题内容、合作对象、项目特色等方面对14个公共图书馆的健康信息服务项目展开分析;建议我国公共图书馆从项目运行常态化、服务共建深度化、内容供给侧优化、健康服务精准化和打造健康生态圈等方面全面推进健康信息服务,以提高个人和社会的健康与福祉水平。

合作环境下共享枢纽选址决策与优化

针对多承运商联合选址及枢纽共享决策与优化问题,从横向合作角度出发,以总成本最小为目标,分别构建共享及非共享情形下,考虑多分配模式且有容量限制的枢纽选址模型,并分析企业共享决策对运作成本的影响。结果表明:共享枢纽网络在一定条件下比不共享枢纽网络更能节约成本,共享的额外补充成本直接影响着承运商的共享决策及枢纽选址的优化效果;随机式分布对额外补充成本因子相对不敏感,合理规划初始枢纽选址并适当地调整补充成本因子,有助于枢纽网络实现成本控制目标。该研究可对物流网络枢纽选址及合作决策的制定提供参考。

“以弱协强”何以成功?——基于“程序-认知”框架的案例研究

新世纪是“新公共管理运动”迈向“合作治理”的时代,然而合作不是自动发生的。在强制型合作背景下,弱势能部门采取哪些策略建立内部合法性,推动强势能部门“真诚合作”,现有文献尚未给予足够重视并深入探究具体的实现策略。因此,整合合作治理研究中相对割裂的政治学和组织管理的两种路径,将程序和认知这两种独立的路径整合为理解内部合法性的两个不同层面,从而构建起弱势能部门建立内部合法性的“程序—认知”分析框架,进而以X市学校体育场地设施对外开放政策的跨部门合作作为典型个案,探讨弱势能部门推动强势能部门合作过程中获取内部合法性的策略。案例研究结果表明,纵向权威、社会需求可以为弱势能部门带来较强的外部合法性,而内部合法性的建设则需经历对话参与、协商谈判和承诺协议等三重程序阶段,同时伴随共享认识、理解信任和内生认同三重认知层面的层层生发才得以实现。在“以弱协强”这一约束性情境中奏效的策略,将在约束条件放松或其他支持性条件下获得更为广阔的施展空间。

建构主义视角下创新实验提升中外合作班医学生课程适应能力剖析

建构主义(Constructivism)认为学习是学习者主动建构自己知识的过程。中外合作办学已成为重庆医科大学医学本科教育改革的重要组成部分。重庆医科大学设立了多层级的创新实验项目,为临床医学中外合作办学专业(以下简称“国际班”)学生提供课外科研探索实践的机会,助力学生综合素养的提升。本研究基于建构主义学习理论,阐述国际班学生参与创新课题,逐渐建立医学知识学习的各种场景,最终使学生对所学知识产生意义建构,以更好地适应国际班课程的设置及投入专业课程的学习。

An integrated MINLP model for multi-party coordination in downstream oil supply chain

Cooperation among enterprises can bring overall and individual performance improvement,and a smooth coordination method is indispensable.However,due to the lack of customized coordination methods,cooperation in the downstream oil supply chain cannot be carried out smoothly.This paper intends to propose a multi-party coordination method to promote cooperation between oil shippers and pipeline operator by optimizing oil transportation,oil substitution and pipeline pricing schemes.An integrated game-theoretic modeling and analysis approach is developed to characterize the operation behaviors of all stakeholders in the downstream oil supply chain.The proposed mixed integer nonlinear programming model constrains supply and demand capacity,transportation routes,oil substitution rules and pipeline freight levels.Logarithm transformation and price discretization are introduced for model linear approximation.Simulation experiments are carried out in the oil distribution system in South China.The results show that compared to the business-as-usual scheme,the new scheme saves transportation cost by 3.48%,increases pipeline turnover by 5.7%,and reduces energy consumption and emissions by 7.66%and 6.77%.It is proved that the proposed method improves the revenue of the whole system,achieves fair revenue distribution,and also improves the energy and environmental benefits of the oil supply chain.

汽车门板内饰多机器人焊接的动态协同规划

为了减小多机器人协同焊接的路径长度并提高机器人之间的负载均衡度,提出了基于动态规划-个体差异进化遗传算法的协同焊接规划方法。以多机器人协同焊接路径长度、负载均衡度为优化目标建立了优化模型,并分析了协同焊接约束条件。针对单机器人焊接路径规划问题,在遗传算法中针对染色体进化能力的差异性,提出了个体差异进化策略,给出了基于个体差异进化遗传算法的路径规划方法。针对多机器人协同焊接问题,使用动态规划将其划分为3个子问题,实现了多机器人协同焊接任务分配和路径规划。经某型汽车前门焊点路径规划验证,个体差异进化遗传算法规划的路径最佳长度、平均长度均优于传统遗传算法;经后门焊点的4机器人协同焊接验证,在满足无干涉约束下,这里方法的路径长度、负载均衡度优于文献[11]离散粒子群算法。实验验证了这里方法在多机器人协同焊接分配和规划问题中的优越性。