Multi-Robot Collaborative Hunting in Cluttered Environments With Obstacle-Avoiding Voronoi Cells

This work proposes an online collaborative hunting strategy for multi-robot systems based on obstacle-avoiding Voronoi cells in a complex dynamic environment. This involves firstly designing the construction method using a support vector machine(SVM) based on the definition of buffered Voronoi cells(BVCs). Based on the safe collision-free region of the robots, the boundary weights between the robots and the obstacles are dynamically updated such that the robots are tangent to the buffered Voronoi safety areas without intersecting with the obstacles. Then, the robots are controlled to move within their own buffered Voronoi safety area to achieve collision-avoidance with other robots and obstacles. The next step involves proposing a hunting method that optimizes collaboration between the pursuers and evaders. Some hunting points are generated and distributed evenly around a circle. Next, the pursuers are assigned to match the optimal points based on the Hungarian algorithm.Then, a hunting controller is designed to improve the containment capability and minimize containment time based on collision risk. Finally, simulation results have demonstrated that the proposed cooperative hunting method is more competitive in terms of time and travel distance.

Path-Following Control With Obstacle Avoidance of Autonomous Surface Vehicles Subject to Actuator Faults

This paper investigates the path-following control problem with obstacle avoidance of autonomous surface vehicles in the presence of actuator faults,uncertainty and external disturbances.Autonomous surface vehicles inevitably suffer from actuator faults in complex sea environments,which may cause existing obstacle avoidance strategies to fail.To reduce the influence of actuator faults,an improved artificial potential function is constructed by introducing the lower bound of actuator efficiency factors.The nonlinear state observer,which only depends on measurable position information of the autonomous surface vehicle,is used to address uncertainties and external disturbances.By using a backstepping technique and adaptive mechanism,a path-following control strategy with obstacle avoidance and fault tolerance is designed which can ensure that the tracking errors converge to a small neighborhood of zero.Compared with existing results,the proposed control strategy has the capability of obstacle avoidance and fault tolerance simultaneously.Finally,the comparison results through simulations are given to verify the effectiveness of the proposed method.

Research on Anthropomorphic Obstacle Avoidance Trajectory Planning for Adaptive Driving Scenarios Based on Inverse Reinforcement Learning Theory

The forward design of trajectory planning strategies requires preset trajectory optimization functions,resulting in poor adaptability of the strategy and an inability to accurately generate obstacle avoidance trajectories that conform to real driver behavior habits.In addition,owing to the strong time-varying dynamic characteristics of obstacle avoidance scenarios,it is necessary to design numerous trajectory optimization functions and adjust the corresponding parameters.Therefore,an anthropomorphic obstacle-avoidance trajectory planning strategy for adaptive driving scenarios is proposed.First,numerous expert-demonstrated trajectories are extracted from the HighD natural driving dataset.Subsequently,a trajectory expectation feature-matching algorithm is proposed that uses maximum entropy inverse reinforcement learning theory to learn the extracted expert-demonstrated trajectories and achieve automatic acquisition of the optimization function of the expert-demonstrated trajectory.Furthermore,a mapping model is constructed by combining the key driving scenario information that affects vehicle obstacle avoidance with the weight of the optimization function,and an anthropomorphic obstacle avoidance trajectory planning strategy for adaptive driving scenarios is proposed.Finally,the proposed strategy is verified based on real driving scenarios.The results show that the strategy can adjust the weight distribution of the trajectory optimization function in real time according to the“emergency degree”of obstacle avoidance and the state of the vehicle.Moreover,this strategy can generate anthropomorphic trajectories that are similar to expert-demonstrated trajectories,effectively improving the adaptability and acceptability of trajectories in driving scenarios.

LSDA-APF:A Local Obstacle Avoidance Algorithm for Unmanned Surface Vehicles Based on 5G Communication Environment

In view of the complex marine environment of navigation,especially in the case of multiple static and dynamic obstacles,the traditional obstacle avoidance algorithms applied to unmanned surface vehicles(USV)are prone to fall into the trap of local optimization.Therefore,this paper proposes an improved artificial potential field(APF)algorithm,which uses 5G communication technology to communicate between the USV and the control center.The algorithm introduces the USV discrimination mechanism to avoid the USV falling into local optimization when the USV encounter different obstacles in different scenarios.Considering the various scenarios between the USV and other dynamic obstacles such as vessels in the process of performing tasks,the algorithm introduces the concept of dynamic artificial potential field.For the multiple obstacles encountered in the process of USV sailing,based on the International Regulations for Preventing Collisions at Sea(COLREGS),the USV determines whether the next step will fall into local optimization through the discriminationmechanism.The local potential field of the USV will dynamically adjust,and the reverse virtual gravitational potential field will be added to prevent it from falling into the local optimization and avoid collisions.The objective function and cost function are designed at the same time,so that the USV can smoothly switch between the global path and the local obstacle avoidance.The simulation results show that the improved APF algorithm proposed in this paper can successfully avoid various obstacles in the complex marine environment,and take navigation time and economic cost into account.

Solutions of the Growing Use of Anti-dumping Measures by Countries in Recent Decades

In recent decades, international trade has evolved into a complex system of trade barriers to ensure the protection of domestic industry and its workers interests. However as tariffs have fallen and international trade tends to be free trade, countries have found another way of protecting domestic industries from foreign competition—non-tariff protection. Among them anti-dumping is the most controversial subject that is involved in the foreign trade. This theme will analyze the reason and effect of growing use anti-dumping measures by countries in recent decades and try to give some possible solutions.

有限维空间中Ray Avoiding映射的不动点定理

在Hilbert空间中引入RayAvoiding映射 ,证明了在一定条件下 ,Hilbert空间的有界闭凸集D中RayAvoiding映射至少存在 3个不动点 .

Application of A* Algorithm for Real-time Path Re-planning of an Unmanned Surface Vehicle Avoiding Underwater Obstacles

This paper describes path re-planning techniques and underwater obstacle avoidance for unmanned surface vehicle(USV) based on multi-beam forward looking sonar(FLS). Near-optimal paths in static and dynamic environments with underwater obstacles are computed using a numerical solution procedure based on an A* algorithm. The USV is modeled with a circular shape in 2 degrees of freedom(surge and yaw). In this paper, two-dimensional(2-D) underwater obstacle avoidance and the robust real-time path re-planning technique for actual USV using multi-beam FLS are developed. Our real-time path re-planning algorithm has been tested to regenerate the optimal path for several updated frames in the field of view of the sonar with a proper update frequency of the FLS. The performance of the proposed method was verified through simulations, and sea experiments. For simulations, the USV model can avoid both a single stationary obstacle, multiple stationary obstacles and moving obstacles with the near-optimal trajectory that are performed both in the vehicle and the world reference frame. For sea experiments, the proposed method for an underwater obstacle avoidance system is implemented with a USV test platform. The actual USV is automatically controlled and succeeded in its real-time avoidance against the stationary undersea obstacle in the field of view of the FLS together with the Global Positioning System(GPS) of the USV.

A Study on Development of a Hybrid Aerial/Terrestrial Robot System for Avoiding Ground Obstacles by Flight

To date, many studies related to robots have been performed around the world. Many of these studies have assumed operation at locations where entry is difficult, such as disaster sites, and have focused on various terrestrial robots, such as snake-like, humanoid, spider-type, and wheeled units. Another area of active research in recent years has been aerial robots with small helicopters for operation indoors and outdoors. However,less research has been performed on robots that operate both on the ground and in the air. Accordingly, in this paper, we propose a hybrid aerial/terrestrial robot system. The proposed robot system was developed by equipping a quadcopter with a mechanism for ground movement. It does not use power dedicated to ground movement, and instead uses the flight mechanism of the quadcopter to achieve ground movement as well. Furthermore, we addressed the issue of obstacle avoidance as part of studies on autonomous control. Thus, we found that autonomous control of ground movement and flight was possible for the hybrid aerial/terrestrial robot system, as was autonomous obstacle avoidance by flight when an obstacle appeared during ground movement.

WORST SUBCARRIER AVOIDING WATER-FILLING SUBCARRIER ALLOCATION SCHEME FOR OFDM-BASED CRN

Efficient and reliable subcarrier power joint allocation is served as a promising problem in cognitive OFDM-based Cognitive Radio Networks (CRN). This paper focuses on optimal subcarrier allocation for OFDM-based CRN. We mainly propose subcarrier allocation scheme denoted as Worst Subcarrier Avoiding Water-filling (WSAW), which is based on Rate Adaptive (RA) criterion and three constraints are considered in CRN. The algorithm divides the assignment procedure into two phases. The first phase is an initial subcarrier allocation based on the idea of avoiding selecting the worst subcarrier in order to maximize the transmission rate; while the second phase is an iterative adjustment process which is realized by swapping pairs of subcarriers between arbitrary users. The proposed scheme could assign subcarriers in accordance with channel coherence time. Hence, real time subcarrier allocation could be implemented. Simulation results show that, comparing with the similar existing algorithms, the proposed scheme could achieve larger capacity and a near-optimal BER performance.

Avoiding Non-Manhattan Obstacles Based on Projection of Spatial Corners in Indoor Environment

Monocular vision-based navigation is a considerable ability for a home mobile robot. However, due to diverse disturbances, helping robots avoid obstacles, especially nonManhattan obstacles, remains a big challenge. In indoor environments, there are many spatial right-corners that are projected into two dimensional projections with special geometric configurations. These projections, which consist of three lines,might enable us to estimate their position and orientation in 3 D scenes. In this paper, we present a method for home robots to avoid non-Manhattan obstacles in indoor environments from a monocular camera. The approach first detects non-Manhattan obstacles. Through analyzing geometric features and constraints,it is possible to estimate posture differences between orientation of the robot and non-Manhattan obstacles. Finally according to the convergence of posture differences, the robot can adjust its orientation to keep pace with the pose of detected non-Manhattan obstacles, making it possible avoid these obstacles by itself. Based on geometric inferences, the proposed approach requires no prior training or any knowledge of the camera’s internal parameters,making it practical for robots navigation. Furthermore, the method is robust to errors in calibration and image noise. We compared the errors from corners of estimated non-Manhattan obstacles against the ground truth. Furthermore, we evaluate the validity of convergence of differences between the robot orientation and the posture of non-Manhattan obstacles. The experimental results showed that our method is capable of avoiding non-Manhattan obstacles, meeting the requirements for indoor robot navigation.

关于k-sum-avoiding子集基数的估计

对sum-avoiding子集进行推广,对任意正整数k(k 2),若集合S是A■N的一个子集,且S中任意k个元素的和都不属于A,则S称为集合A的k-sum-avoiding子集.估计了当|A|=n时,A的k-sum-avoiding子集S的最大基数.

Co-Frequency Interference Analysis and Avoidance Between NGSO Constellations: Challenges, Techniques, and Trends

In recent years,as giant satellite constellations grow rapidly worldwide,the co-existence between constellations has been widely concerned.In this paper,we overview the co-frequency interference(CFI)among the giant non-geostationary orbit(NGSO)constellations.Specifically,we first summarize the CFI scenario and evaluation index among different NGSO constellations.Based on statistics about NGSO constellation plans,we analyse the challenges in mitigation and analysis of CFI.Next,the CFI calculation methods and research progress are systematically sorted out from the aspects of interference risk analysis framework,numerical calculation and link construction.Then,the feasibility of interference mitigation technologies based on space,frequency domain isolation,power control,and interference alignment mitigation in the NGSO mega-constellation CFI scenario are further sorted out.Finally,we present promising directions for future research in CFI analysis and CFI avoidance.

Improved RRT^(∗)Algorithm for Automatic Charging Robot Obstacle Avoidance Path Planning in Complex Environments

A new and improved RRT∗algorithm has been developed to address the low efficiency of obstacle avoidance planning and long path distances in the electric vehicle automatic charging robot arm.This algorithm enables the robot to avoid obstacles,find the optimal path,and complete automatic charging docking.It maintains the global completeness and path optimality of the RRT algorithmwhile also improving the iteration speed and quality of generated paths in both 2D and 3D path planning.After finding the optimal path,the B-sample curve is used to optimize the rough path to create a smoother and more optimal path.In comparison experiments,the new algorithmyielded reductions of 35.5%,29.2%,and 11.7%in search time and 22.8%,19.2%,and 9%in path length for the 3D environment.Finally,experimental validation of the automatic charging of electric vehicles was conducted to further verify the effectiveness of the algorithm.The simulation experimental validation was carried out by kinematic modeling and building an experimental platform.The error between the experimental results and the simulation results is within 10%.The experimental results show the effectiveness and practicality of the algorithm.

Reflections on China’s Targeted Poverty Alleviation Strategy from the Perspective of Drawing on Advantages and Avoiding Disadvantages in the New Era

The new era has put forward new requirements for targeted poverty alleviation.Coordinating disaster prevention,mitigation and relief and ecological civilization construction to assist targeted poverty alleviation has become an important direction for alleviating poverty from the perspective of drawing on advantages and avoiding disadvantages.The Outline of the 13th Five-Year Plan for National Economic and Social Development of the People's Republic of China has planned and deployed to fully implement the task of poverty alleviation.The current poverty alleviation is extending from fixed-point poverty alleviation to collaborative poverty alleviation and targeted poverty alleviation.Combining the needs of disaster response,climate adaptation,resource utilization,ecological construction,and information utilization in poverty-stricken areas,the role of disaster risk monitoring,forecasting and early warning services is displayed.The disaster prevention,mitigation and relief and poverty alleviation in the new era should be integrated into the national poverty alleviation pattern,actively serve poverty alleviation projects of industry development,relocation and ecological protection,deeply explore the value of disaster risk information and improve the effective supply of disaster prevention,mitigation and relief services,letting disaster prevention,mitigation and relief and ecological civilization construction help the implementation of targeted poverty alleviation.

Non-Associative Property of 123-Avoiding Class of Aunu Permutation Patterns

This paper presents the non-associative and non-commutative properties of the 123-avoiding patterns of Aunu permutation patterns. The generating function of the said patterns has been reported earlier by the author [1] [2]. The paper describes how these non-associative and non commutative properties can be established by using the Cayley table on which a binary operation is defined to act on the 123-avoiding and 132-avoiding patterns of Aunu permutations using a pairing scheme. Our results have generated larger matrices from permutations of points of the Aunu patterns of prime cardinality. It follows that the generated symbols can be used in further studies and analysis in cryptography and game theory thereby providing an interdisciplinary approach and applications of these important permutation patterns.

A Novel Obstacle Avoidance Consensus Control for Multi-AUV Formation System

In this paper, the fixed-time event-triggered obstacle avoidance consensus control for a multi-AUV time-varying formation system in a 3D environment is presented by using an improved artificial potential field and leader-follower strategy(IAPF-LF). Firstly, the proposed fixed-time control can achieve the desired multi-AUV formation within a fixed settling time in any initial system state. Secondly, an event-triggered communication strategy is developed to govern the communication among AUVs, and the communication energy consumption can be decremented. The time-varying formation obstacle avoidance control algorithm based on IAPF-LF is designed to avoid static and dynamic obstacles, the desired formation is maintained in the presence of external disturbances, and there is no Zeno behavior under the fixed-time event-triggered consensus control strategy.The stability of the system is proved by the Lyapunov function and inequality scaling. Finally, simulation examples and water pool experiments are reported to verify the performance of the proposed theoretical algorithms.

Why Has China Become a Target of Anti-dumping Activities?

Although the benefits of China’s trade expansion have been distributed much more broadly than those of some early industrialized nations,China has become the primary target of anti-dumping activities.Being a new and relatively efficient new rival in the global market may be an important reason for this.On the other hand,China’s development stage and her trade structure also place her in a disadvantageous position when it comes to anti-dumping activities.

T_GRASP: Optimization Algorithm of Ship Avoiding Typhoon Route

AGRASP-based algorithm called T_GRASP for avoiding typhoon route optimization is suggested to increase the security and effectiveness of ship navigation.One of the worst natural calamities that can disrupt a ship’s navigation and result in numerous safety mishaps is a typhoon.Currently,the captains manually review the collected weather data and steer clear of typhoons using their navigational expertise.The distribution of heavy winds andwaves produced by the typhoon also changes dynamically as a result of the surrounding large-scale air pressure distribution,which significantly enhances the challenge of the captain’s preparation for avoiding typhoon navigation.It is now necessary to find a solution to the challenge of designing a highsafety and effective ship navigation path to avoid typhoons.The T_GRASP algorithm is suggested to optimize the candidate set’s structure based on the GRASP algorithm’s frame.The algorithm can guarantee the safety of the ship to avoid typhoons and assure high route efficiency by using the lowest risk function,the shortest sailing time,and the least fuel consumption as the objective functions and the ship speed and highest safety as the model constraints.The outcomes of the simulation demonstrate the superiority of the suggested T_GRASP algorithm over both the conventional A∗algorithm and the ant colony algorithm.In addition to addressing issues with the traditional A∗algorithm,like its wide search space and poor efficiency,the proposed algorithm also addresses issues with the ant colony algorithm,like its excessive iterations and sluggish convergence.