Cooperative UAV search strategy based on DMPC-AACO algorithm in restricted communication scenarios

Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research problem.In certain mission environments,due to the impact of many interference sources on real-time communication or mission requirements such as the need to implement communication regulations,the mission stages are represented as a dynamic combination of several communication-available and communication-unavailable stages.Furthermore,the data interaction between unmanned aerial vehicles(UAVs)can only be performed in specific communication-available stages.Traditional cooperative search algorithms cannot handle such situations well.To solve this problem,this study constructed a distributed model predictive control(DMPC)architecture for a collaborative control of UAVs and used the Voronoi diagram generation method to re-plan the search areas of all UAVs in real time to avoid repetition of search areas and UAV collisions while improving the search efficiency and safety factor.An attention mechanism ant-colony optimization(AACO)algorithm is proposed for UAV search-control decision planning.The search strategy is adaptively updated by introducing an attention mechanism for regular instruction information,a priori information,and emergent information of the mission to satisfy different search expectations to the maximum extent.Simulation results show that the proposed algorithm achieves better search performance than traditional algorithms in restricted communication constraint scenarios.

Cooperative Anti-Jamming and Interference Mitigation for UAV Networks: A Local Altruistic Game Approach

To improve the anti-jamming and interference mitigation ability of the UAV-aided communication systems, this paper investigates the channel selection optimization problem in face of both internal mutual interference and external malicious jamming. A cooperative anti-jamming and interference mitigation method based on local altruistic is proposed to optimize UAVs’ channel selection. Specifically, a Stackelberg game is modeled to formulate the confrontation relationship between UAVs and the jammer. A local altruistic game is modeled with each UAV considering the utilities of both itself and other UAVs. A distributed cooperative anti-jamming and interference mitigation algorithm is proposed to obtain the Stackelberg equilibrium. Finally, the convergence of the proposed algorithm and the impact of the transmission power on the system loss value are analyzed, and the anti-jamming performance of the proposed algorithm can be improved by around 64% compared with the existing algorithms.

Roles of N-cadherin in cerebral cortical development:cooperation with membrane trafficking and actin cytoskeletal regulation

Cell adhesion plays pivotal roles in the morphogenesis of multicellular organisms.Epithelial cells form several types of cell-to-cell adhesion,including zonula occludens(tight junctions),zonula adhaerens(adherens junctions),and macula adhaerens(desmosomes).Although these adhesion complexes are basically observed only in epithelial cells,cadherins,which are the major cell adhesion molecules of adherens junctions,are expressed in both epithelial and non-epithelial tissues,including neural tissues(Kawauchi,2012).The cadherin superfamily consists of more than 100 members,but classic cadherins.

Multi-UAV cooperative maneuver decision-making for pursuitevasion using improved MADRL

Aiming at the problem of multi-UAV pursuit-evasion confrontation, a UAV cooperative maneuver method based on an improved multi-agent deep reinforcement learning(MADRL) is proposed. In this method, an improved Comm Net network based on a communication mechanism is introduced into a deep reinforcement learning algorithm to solve the multi-agent problem. A layer of gated recurrent unit(GRU) is added to the actor-network structure to remember historical environmental states. Subsequently,another GRU is designed as a communication channel in the Comm Net core network layer to refine communication information between UAVs. Finally, the simulation results of the algorithm in two sets of scenarios are given, and the results show that the method has good effectiveness and applicability.

Optimization of Cooperative RelayingMolecular Communications for Nanomedical Applications

Recently,nano-systems based on molecular communications via diffusion(MCvD)have been implemented in a variety of nanomedical applications,most notably in targeted drug delivery system(TDDS)scenarios.Furthermore,because the MCvD is unreliable and there exists molecular noise and inter symbol interference(ISI),cooperative nano-relays can acquire the reliability for drug delivery to targeted diseased cells,especially if the separation distance between the nano transmitter and nano receiver is increased.In this work,we propose an approach for optimizing the performance of the nano system using cooperative molecular communications with a nano relay scheme,while accounting for blood flow effects in terms of drift velocity.The fractions of the molecular drug that should be allocated to the nano transmitter and nano relay positioning are computed using a collaborative optimization problem solved by theModified Central Force Optimization(MCFO)algorithm.Unlike the previous work,the probability of bit error is expressed in a closed-form expression.It is used as an objective function to determine the optimal velocity of the drug molecules and the detection threshold at the nano receiver.The simulation results show that the probability of bit error can be dramatically reduced by optimizing the drift velocity,detection threshold,location of the nano-relay in the proposed nano system,and molecular drug budget.

Effect of distribution of fines on evolution of cooperation in spatial public goods game

In the realm of public goods game,punishment,as a potent tool,stands out for fostering cooperation.While it effectively addresses the first-order free-rider problem,the associated costs can be substantial.Punishers incur expenses in imposing sanctions,while defectors face fines.Unfortunately,these monetary elements seemingly vanish into thin air,representing a loss to the system itself.However,by virtue of the redistribution of fines to cooperators and punishers,not only can we mitigate this loss,but the rewards for these cooperative individuals can be enhanced.Based upon this premise,this paper introduces a fine distribution mechanism to the traditional pool punishment model.Under identical parameter settings,by conducting a comparative experiment with the conventional punishment model,the paper aims to investigate the impact of fine distribution on the evolution of cooperation in spatial public goods game.The experimental results clearly demonstrate that,in instances where the punishment cost is prohibitively high,the cooperative strategies of the traditional pool punishment model may completely collapse.However,the model enriched with fine distribution manages to sustain a considerable number of cooperative strategies,thus highlighting its effectiveness in promoting and preserving cooperation,even in the face of substantial punishment cost.

User Preference Aware Hierarchical Edge-User Cooperative Caching Strategy

The emergence of various new services has posed a huge challenge to the existing network architecture.To improve the network delay and backhaul pressure,caching popular contents at the edge of network has been considered as a feasible scheme.However,how to efficiently utilize the limited caching resources to cache diverse contents has been confirmed as a tough problem in the past decade.In this paper,considering the time-varying user requests and the heterogeneous content sizes,a user preference aware hierarchical cooperative caching strategy in edge-user caching architecture is proposed.We divide the caching strategy into three phases,that is,the content placement,the content delivery and the content update.In the content placement phase,a cooperative content placement algorithm for local content popularity is designed to cache contents proactively.In the content delivery phase,a cooperative delivery algorithm is proposed to deliver the cached contents.In the content update phase,a content update algorithm is proposed according to the popularity of the contents.Finally,the proposed caching strategy is validated using the MovieLens dataset,and the results reveal that the proposed strategy improves the delay performance by at least 35.3%compared with the other three benchmark strategies.

Discreet investors exert greater influence on cooperation in the public goods game

This paper studies the evolutionary process of cooperative behavior in a public goods game model with heterogeneous investment strategies in square lattices.In the proposed model,players are divided into defectors,cooperators and discreet investors.Among these,defectors do not participate in investing,discreet investors make heterogeneous investments based on the investment behavior and cooperation value of their neighbors,and cooperators invest equally in each neighbor.In real life,heterogeneous investment is often accompanied by time or economic costs.The discreet investors in this paper pay a certain price to obtain their neighbors'investment behavior and cooperation value,which quantifies the time and economic costs of the heterogeneous investment process.The results of Monte Carlo simulation experiments in this study show that discreet investors can effectively resist the invasion of the defectors,form a stable cooperative group and expand the cooperative advantage in evolution.However,when discreet investors pay too high a price,they lose their strategic advantage.The results in this paper help us understand the role of heterogeneous investment in promoting and maintaining human social cooperation.

Cooperative Rate Splitting Transmit Design for Full-Duplex-Enabled Multiple Multicast Communication Systems

This paper examines the performance of Full-Duplex Cooperative Rate Splitting(FD-CRS)with Simultaneous Wireless Information and Power Transfer(SWIPT)support in Multiple Input Single Output(MISO)networks.In a Rate Splitting Multiple Access(RSMA)multicast system with two local users and one remote user,the common data stream contains the needs of all users,and all users can decode the common data stream.Therefore,each user can receive some information that other users need,and local users with better channel conditions can use this information to further enhance the reception reliability and data rate of users with poor channel quality.Even using Cell-Center-Users(CCUs)as a cooperative relay to assist the transmission of common data can improve the average system speed.To maximize the minimum achievable rate,we optimize the beamforming vector of Base Station(BS),the common streamsplitting vector,the cooperative distributed beamvector and the strong user transmission power under the power budget constraints of BS and relay devices and the service quality requirements constraints of users.Since the whole problem is not convex,we cannot solve it directly.Therefore,we propose a low complexity algorithm based on Successive Convex Approximation(SCA)technology to find the optimal solution to the problemunder consideration.The simulation results show that FD C-RSMA has better gain andmore powerful than FD C-NOMA,HD C-RSMA,RSMA and NOMA.

Role Dynamic Allocation of Human-Robot Cooperation Based on Reinforcement Learning in an Installation of Curtain Wall

A real-time adaptive roles allocation method based on reinforcement learning is proposed to improve humanrobot cooperation performance for a curtain wall installation task.This method breaks the traditional idea that the robot is regarded as the follower or only adjusts the leader and the follower in cooperation.In this paper,a self-learning method is proposed which can dynamically adapt and continuously adjust the initiative weight of the robot according to the change of the task.Firstly,the physical human-robot cooperation model,including the role factor is built.Then,a reinforcement learningmodel that can adjust the role factor in real time is established,and a reward and actionmodel is designed.The role factor can be adjusted continuously according to the comprehensive performance of the human-robot interaction force and the robot’s Jerk during the repeated installation.Finally,the roles adjustment rule established above continuously improves the comprehensive performance.Experiments of the dynamic roles allocation and the effect of the performance weighting coefficient on the result have been verified.The results show that the proposed method can realize the role adaptation and achieve the dual optimization goal of reducing the sum of the cooperator force and the robot’s Jerk.

Cooperative guidance law based on super-twisting observer for target maneuvering

To solve the problem that multiple missiles should simultaneously attack unmeasurable maneuvering targets,a guidance law with temporal consistency constraint based on the super-twisting observer is proposed.Firstly,the relative motion equations between multiple missiles and targets are established,and the topological model among multiple agents is considered.Secondly,based on the temporal consistency constraint,a cooperative guidance law for simultaneous arrival with finite-time convergence is derived.Finally,the unknown target maneuver-ing is regarded as bounded interference.Based on the second-order sliding mode theory,a super-twisting sliding mode observer is devised to observe and track the bounded interfer-ence,and the stability of the observer is proved.Compared with the existing research,this approach only needs to obtain the sliding mode variable which simplifies the design process.The simulation results show that the designed cooperative guidance law for maneuvering targets achieves the expected effect.It ensures successful cooperative attacks,even when confronted with strong maneuvering targets.

A Pricing-Based Cooperative Relay Selection Scheme for Reliable Communications

With the rapid development and application of energy harvesting technology,it has become a prominent research area due to its significant benefits in terms of green environmental protection,convenience,and high safety and efficiency.However,the uneven energy collection and consumption among IoT devices at varying distances may lead to resource imbalance within energy harvesting networks,thereby resulting in low energy transmission efficiency.To enhance the energy transmission efficiency of IoT devices in energy harvesting,this paper focuses on the utilization of collaborative communication,along with pricing-based incentive mechanisms and auction strategies.We propose a dynamic relay selection scheme,including a ladder pricing mechanism based on energy level and a Kuhn-Munkre Algorithm based on an auction theory employing a negotiation mechanism,to encourage more IoT devices to participate in the collaboration process.Simulation results demonstrate that the proposed algorithm outperforms traditional algorithms in terms of improving the energy efficiency of the system.

Joint computation offloading and parallel scheduling to maximize delay-guarantee in cooperative MEC systems

The growing development of the Internet of Things(IoT)is accelerating the emergence and growth of new IoT services and applications,which will result in massive amounts of data being generated,transmitted and pro-cessed in wireless communication networks.Mobile Edge Computing(MEC)is a desired paradigm to timely process the data from IoT for value maximization.In MEC,a number of computing-capable devices are deployed at the network edge near data sources to support edge computing,such that the long network transmission delay in cloud computing paradigm could be avoided.Since an edge device might not always have sufficient resources to process the massive amount of data,computation offloading is significantly important considering the coop-eration among edge devices.However,the dynamic traffic characteristics and heterogeneous computing capa-bilities of edge devices challenge the offloading.In addition,different scheduling schemes might provide different computation delays to the offloaded tasks.Thus,offloading in mobile nodes and scheduling in the MEC server are coupled to determine service delay.This paper seeks to guarantee low delay for computation intensive applica-tions by jointly optimizing the offloading and scheduling in such an MEC system.We propose a Delay-Greedy Computation Offloading(DGCO)algorithm to make offloading decisions for new tasks in distributed computing-enabled mobile devices.A Reinforcement Learning-based Parallel Scheduling(RLPS)algorithm is further designed to schedule offloaded tasks in the multi-core MEC server.With an offloading delay broadcast mechanism,the DGCO and RLPS cooperate to achieve the goal of delay-guarantee-ratio maximization.Finally,the simulation results show that our proposal can bound the end-to-end delay of various tasks.Even under slightly heavy task load,the delay-guarantee-ratio given by DGCO-RLPS can still approximate 95%,while that given by benchmarked algorithms is reduced to intolerable value.The simulation results are demonstrated the effective-ness of DGCO-RLPS for delay guarantee in MEC.

Layered Coded Cache Placement and Cooperative Delivery with Sharing Links in Satellite-Terrestrial Integrated Networks

Cooperative utilization of multidimensional resources including cache, power and spectrum in satellite-terrestrial integrated networks(STINs) can provide a feasible approach for massive streaming media content delivery over the seamless global coverage area. However, the on-board supportable resources of a single satellite are extremely limited and lack of interaction with others. In this paper, we design a network model with two-layered cache deployment, i.e., satellite layer and ground base station layer, and two types of sharing links, i.e., terrestrial-satellite sharing(TSS) links and inter-satellite sharing(ISS) links, to enhance the capability of cooperative delivery over STINs. Thus, we use rateless codes for the content divided-packet transmission, and derive the total energy efficiency(EE) in the whole transmission procedure, which is defined as the ratio of traffic offloading and energy consumption. We formulate two optimization problems about maximizing EE in different sharing scenarios(only TSS and TSS-ISS),and propose two optimized algorithms to obtain the optimal content placement matrixes, respectively.Simulation results demonstrate that, enabling sharing links with optimized cache placement have more than 2 times improvement of EE performance than other traditional placement schemes. Particularly, TSS-ISS schemes have the higher EE performance than only TSS schemes under the conditions of enough number of satellites and smaller inter-satellite distances.

Improved STNModels and Heuristic Rules for Cooperative Scheduling in Automated Container Terminals

Improving the cooperative scheduling efficiency of equipment is the key for automated container terminals to copewith the development trend of large-scale ships. In order to improve the solution efficiency of the existing spacetimenetwork (STN) model for the cooperative scheduling problem of yard cranes (YCs) and automated guidedvehicles (AGVs) and extend its application scenarios, two improved STN models are proposed. The flow balanceconstraints in the original model are decomposed, and the trajectory constraints of YCs and AGVs are added toacquire the model STN_A. The coupling constraint in STN_A is updated, and buffer constraints are added toSTN_A so that themodel STN_B is built.As the size of the problem increases, the solution speed of CPLEX becomesthe bottleneck. So a heuristic method containing three groups of heuristic rules is designed to obtain a near-optimalsolution quickly. Experimental results showthat the computation time of STN_A is shortened by 49.47% on averageand the gap is reduced by 1.69% on average compared with the original model. The gap between the solution ofthe heuristic rules and the solution of CPLEX is less than 3.50%, and the solution time of the heuristic rules is onaverage 99.85% less than the solution time of CPLEX. Compared with STN_A, the computation time for solvingSTN_B increases by 58.93% on average.

Enhancing Mutual Trust and Tapping into New Areas and Potentials for Bilateral Cooperation——Exclusive Interview with Namibian Ambassador to China,Elia George Kaiyamo

The 2024 Forum on ChinaAfrica Cooperation Summit was held in Beijing from September 4 to 6.Economic and trade cooperation serves as the"ballast stone"and"propeller"of China-Africa relations.During an exclusive interview with China's Foreign Trade conducted in Beijing recently,Namibian Ambassador to China,Elia George Kaiyamo,discussed Namibian-China bilateral trade and twoway investment,stating that since the establishment of diplomatic relations in1990,China and Namibia have made remarkable achievements in both economic and trade cooperation,which have become the most dynamic and potential components of bilateral relations.

BRICS seeks trade development and standards cooperation

The BRICS Economic and Trade Forum was held on October 28 in Beijing, co-organized by the China Council for the Promotion of International Trade(CCPIT), China General Technology(Group) Holding Co., Ltd., and the Chinese chapter of the BRICS Business Council.The forum focused on trade development and standards cooperation among BRICS countries, and aimed to implement the outcomes of the BRICS Leaders' Meeting. It was attended by more than 500 representatives from ISO, standardization administrative departments of BRICS countries, business councils, enterprises, and foreign embassies in China in person or online.

Resilience-driven cooperative reconfiguration strategy for unmanned weapon system-of-systems

As the unmanned weap system-of systems(UWSoS)becomes complex,the inevitable uncertain interference gradu-ally increases,which leads to a strong emphasis on the resilience of UWSoS.Hence,this paper presents a resilience-driven cooperative reconfiguration strategy to enhance the resilience of UWSoS.First,a unified resilience-driven coopera-tive reconfiguration strategy framework is designed to guide the UWSoS resilience enhancement.Subsequently,a cooperative reconfiguration strategy algorithm is proposed to identify the optimal cooperative reconfiguration sequence,combining the cooperative pair resilience contribution index(CPRCI)and coop-erative pair importance index(CPII).At last,the effectiveness and superiority of the proposed algorithm are demonstrated through various attack scenario simulations that include differ-ent attack modes and intensities.The analysis results can pro-vide a reference for decision-makers to manage UWSoS.

How to promote cooperative innovation in environmentally friendly technology:a case of agricultural biotechnology in China

This study explored the factors influencing cooperative innovation in environmentally friendly agricultural biotechnology in China.First,we constructed an evolutionary game model comprising the factors of net income of cooperative innovation,net income of independent innovation,market constraints,and government subsidies.Using MATLAB simulation,we assigned different values to the aforementioned variables to explore the evolutionary trend of innovators’willingness to cooperate.Results showed that when the values of net income of cooperative innovation,net income of independent innovation,market constraints,and government subsidies exceeded the threshold,innovators’willingness to cooperate was significantly enhanced.Furthermore,the proportion of innovators who cooperated with others gradually increased to 100%;otherwise,it gradually decreased to 0%.Comparing the simulation curve with the real evolution curve of cooperative innovation in agricultural biotechnology in China,we found that the gradual decline in the willingness to cooperate could be due to insufficient subsidies for cooperative innovation,low income from cooperative innovation,weak profitability of innovators,and weak market constraints.

Resource Allocation for IRS Assistedmm Wave Wireless Powered Sensor Networks with User Cooperation

In this paper,we investigate IRS-aided user cooperation(UC)scheme in millimeter wave(mmWave)wirelesspowered sensor networks(WPSN),where two single-antenna users are wireless powered in the wireless energy transfer(WET)phase first and then cooperatively transmit information to a hybrid access point(AP)in the wireless information transmission(WIT)phase,following which the IRS is deployed to enhance the system performance of theWET andWIT.We maximized the weighted sum-rate problem by jointly optimizing the transmit time slots,power allocations,and the phase shifts of the IRS.Due to the non-convexity of the original problem,a semidefinite programming relaxation-based approach is proposed to convert the formulated problem to a convex optimization framework,which can obtain the optimal global solution.Simulation results demonstrate that the weighted sum throughput of the proposed UC scheme outperforms the non-UC scheme whether equipped with IRS or not.