Rotary unmanned aerial vehicles path planning in rough terrain based on multi-objective particle swarm optimization

This paper presents a path planning approach for rotary unmanned aerial vehicles(R-UAVs)in a known static rough terrain environment.This approach aims to find collision-free and feasible paths with minimum altitude,length and angle variable rate.First,a three-dimensional(3D)modeling method is proposed to reduce the computation burden of the dynamic models of R-UAVs.Considering the length,height and tuning angle of a path,the path planning of R-UAVs is described as a tri-objective optimization problem.Then,an improved multi-objective particle swarm optimization algorithm is developed.To render the algorithm more effective in dealing with this problem,a vibration function is introduced into the collided solutions to improve the algorithm efficiency.Meanwhile,the selection of the global best position is taken into account by the reference point method.Finally,the experimental environment is built with the help of the Google map and the 3D terrain generator World Machine.Experimental results under two different rough terrains from Guilin and Lanzhou of China demonstrate the capabilities of the proposed algorithm in finding Pareto optimal paths.     

A multiple heterogeneous UAVs reconnaissance mission planning and re-planning algorithm

Reconnaissance mission planning of multiple unmanned aerial vehicles(UAVs) under an adversarial environment is a discrete combinatorial optimization problem which is proved to be a non-deterministic polynomial(NP)-complete problem. The purpose of this study is to research intelligent multiUAVs reconnaissance mission planning and online re-planning algorithm under various constraints in mission areas. For numerous targets scattered in the wide area, a reconnaissance mission planning and re-planni...     

Multi-Objective Cooperative Salvo Attack Against Group Target

This paper proposes a solution for the problem of cooperative salvo attack of multiple cruise missiles against targets in a group. Synchronization of the arrival time of missiles to hit their common target, minimizing the time consumption of attack and maximizing the expected damage to group targets are taken into consideration simultaneously. These operational objectives result in a hierarchical mixed-variable optimization problem which includes two types of subproblems, namely the multi-objective missile-target assignment(MOMTA) problem at the upper level and the time-optimal coordinated path planning(TOCPP) problems at the lower level. In order to solve the challenging problem, a recently proposed coordinated path planning method is employed to solve the TOCPP problems to achieve the soonest salvo attack against each target. With the aim of finding a more competent solver for MOMTA, three state-of-the-art multi-objective optimization methods(MOMs),namely NSGA-II, MOEA/D and DMOEA-εC, are adopted. Finally, a typical example is used to demonstrate the advantage of the proposed method. A simple rule-based method is also employed for comparison. Comparative results show that DMOEA-εC is the best choice among the three MOMs for solving the MOMTA problem. The combination of DMOEA-εC for MOMTA and the coordinated path planning method for TOCPP can generate obviously better salvo attack schemes than the rule-based method.     

A deep learning-based binocular perception system

An obstacle perception system for intelligent vehicle is proposed.The proposed system combines the stereo version technique and the deep learning network model,and is applied to obstacle perception tasks in complex environment.In this paper,we provide a complete system design project,which includes the hardware parameters,software framework,algorithm principle,and optimization method.In addition,special experiments are designed to demonstrate that the performance of the proposed system meets the requirements of actual application.The experiment results show that the proposed system is valid to both standard obstacles and non-standard obstacles,and suitable for different weather and lighting conditions in complex environment.It announces that the proposed system is flexible and robust to the intelligent vehicle.     

Virtual reality mobility model for wireless ad hoc networks

For wireless ad hoc networks simulation, node＇s mobility pattern and traffic pattern are two key elements. A new simulation model is presented based on the virtual reality collision detection algorithm in obstacle environment, and the model uses the path planning method to avoid obstacles and to compute the node＇s moving path. Obstacles also affect node＇s signal propagation. Considering these factors, this study implements the mobility model for wireless ad hoc networks. Simulation results show that the model has a significant impact on the performance of protocols.     

Particle Swarm Optimization Bat Algorithm Path Automatically Planning Research for Police Drones in Hilly Cities

Mountain cities are complex asymmetric dynamic network architectures, and the flight of UAVs in this environment is subject to various constraints, while efficiency is a crucial factor in the trajectory planning of police UAVs, which need to maintain high efficiency and safe flight paths between their starting and ending points, but the traditional trajectory planning method cannot meet the requirements of rapid maneuvering of police UAVs. To achieve this, a 3D terrain map is built,an objective ...     

Predicting relevant empty spots in social interaction

An empty spot refers to an empty hard-to-fill space which can be found in the records of the social interaction, and is the clue to the persons in the underlying social network who do not appear in the records. This contribution addresses a problem to predict relevant empty spots in social interaction. Homogeneous and inhomogeneous networks are studied as a model underlying the social interaction. A heuristic predictor function method is presented as a new method to address the problem. Simulation experiment is demonstrated over a homogeneous network. A test data set in the form of market baskets is generated from the simulated communication. Precision to predict the empty spots is calculated to demonstrate the performance of the presented method.     

Hybrid hierarchical trajectory planning for a fixed-wing UCAV performing air-to-surface multi-target attack

This paper considers the problem of generating a flight trajectory for a single fixed-wing unmanned combat aerial vehicle (UCAV) performing an air-to-surface multi-target attack (A/SMTA) mission using satellite-guided bombs. First, this problem is formulated as a variant of the traveling salesman problem (TSP), called the dynamic-constrained TSP with neighborhoods (DCTSPN). Then, a hierarchical hybrid approach, which partitions the planning algorithm into a roadmap planning layer and an optimal control layer, is proposed to solve the DCTSPN. In the roadmap planning layer, a novel algorithm based on an updatable probabilistic roadmap (PRM) is presented, which operates by randomly sampling a finite set of vehicle states from continuous state space in order to reduce the complicated trajectory planning problem to planning on a finite directed graph. In the optimal control layer, a collision-free state-to-state trajectory planner based on the Gauss pseudospectral method is developed, which can generate both dynamically feasible and optimal flight trajectories. The entire process of solving a DCTSPN consists of two phases. First, in the offline preprocessing phase, the algorithm constructs a PRM, and then converts the original problem into a standard asymmetric TSP (ATSP). Second, in the online querying phase, the costs of directed edges in PRM are updated first, and a fast heuristic searching algorithm is then used to solve the ATSP. Numerical experiments indicate that the algorithm proposed in this paper can generate both feasible and near-optimal solutions quickly for online purposes.     

Learning and fatigue inspired method for optimized HTN planning

Learning is widely used in intelligent planning to shorten the planning process or improve the plan quality.This paper aims at introducing learning and fatigue into the classical hierarchical task network (HTN) planning process so as to create better highquality plans quickly.The process of HTN planning is mapped during a depth-first search process in a problem-solving agent,and the models of learning in HTN planning is conducted similar to the learning depth-first search (LDFS).Based on the models,a learning method integrating HTN planning and LDFS is presented,and a fatigue mechanism is introduced to balance exploration and exploitation in learning.Finally,experiments in two classical domains are carried out in order to validate the effectiveness of the proposed learning and fatigue inspired method.     

3D multipath planning for UAV based on network graph

According to the characteristic and the requirement of multipath planning,a new multipath planning method is proposed based on network.This method includes two steps:the construction of network and multipath searching.The construction of network proceeds in three phases:the skeleton extraction of the configuration space,the judgment of the cross points in the skeleton and how to link the cross points to form a network.Multipath searching makes use of the network and iterative penalty method (IPM) to plan multi-paths,and adjusts the planar paths to satisfy the requirement of maneuverability of unmanned aerial vehicle (UAV).In addition,a new height planning method is proposed to deal with the height planning of 3D route.The proposed algorithm can find multiple paths automatically according to distribution of terrain and threat areas with high efficiency.The height planning can make 3D route following the terrain.The simulation experiment illustrates the feasibility of the proposed method.     

基于碰撞危险度的无陷阱动态航路规划

由于人工势场法中障碍物的影响距离通常为一个固定值,不可避免地导致无谓避碰行为的出现,极大影响航路规划的效率。本文在动态环境下,针对无谓避碰行为,提出碰撞危险度评估模型和障碍物影响距离确定模型;针对障碍物在目标附近目标不可及问题(goals nonreachable with obstacles nearby,GNRON),提出能够区别评估障碍物的时间碰撞危险度模型;针对陷阱问题,提出虚拟障碍物法,以此构成基于碰撞危险度的无陷阱动态航路规划法。仿真结果表明该方法能够有效避免无谓避碰行为和陷阱问题的发生,且无GNRON问题,所得路径也较短且平滑。     

基于速度障碍圆弧法的UAV自主避障规划研究

提高复杂环境下无人飞行器(unmanned aerial vehicle, UAV)自主避障能力成为亟待解决的关键问题。针对现有避障算法忽略“潜在危险”障碍的影响和对多障碍避碰复杂的问题,建立障碍物威胁分级模型,提出一种速度障碍圆弧法,该方法通过速度障碍圆弧参数量化了威胁障碍的影响。同时,给出了速度障碍圆弧参数的系统计算方法,考虑了复杂环境下UAV与威胁障碍之间不同相对位置和相对速度情况。基于速度障碍圆弧法给出相应的避碰算法。以路径规划为实例对避碰算法进行了仿真验证,仿真结果验证了算法的有效性和实用性。     

基于滚动窗口的移动机器人路径规划

借鉴预测控制滚动优化原理 ,研究了全局环境未知且存在动态障碍物情况下的移动机器人路径规划问题。提出的基于滚动窗口的移动机器人路径规划方法充分利用机器人实时测得的局部环境信息 ,并通过有效的场景预测 ,以滚动方式进行在线规划 ,结合了优化和反馈机制 ,具有计算量小、反应迅速的特点。大量仿真结果表明 ,该方法能很好地适应动态不确定环境。     

多障碍物场景中的行人运动模型

社会力模型是一类重要的行人运动模型,在行人建模仿真领域得到广泛应用.然而该模型仅能应用于简单空间场景,当空间中有障碍物,行人与目标点不满足通视条件时,行人不能绕过障碍,会出现穿透障碍、轨迹振荡等问题.本文引入规避障碍行为,与社会力模型融合在一起,实现行人在复杂二维空间中的运动.规避障碍行为的核心是确定绕行点,以期望行走路线最短为准则构造了求解绕行点的计算几何方法,并解决复杂空间场景中的多重遮挡问题.建立行人运动逻辑,设计渐进式路径规划算法,实现行人运动.开发了行人仿真系统,对所提出的模型进行验证.仿真结果表明:在多障碍物空间场景中,行人能自然的规避障碍,形成合理的运动轨迹.     

基于碰撞预测的无碰撞航路规划

人工势场法作为路径规划的一种算法,由于其数学描述简洁且易于执行,所得路径较短且平滑,在许多工程领域中被广泛使用.由于势函数斥力作用仅考虑机器人与障碍物的距离,这就使航路规划在障碍物附近无差别的采取避碰措施,这就导致无谓避碰行为的出现,极大影响航路规划的效率,且容易出现狭窄通道无法识别以及由周边多个障碍物的合斥力造成的局部极小值问题.针对无谓避碰行为,提出碰撞危险度评估模型和障碍物影响距离确定模型,针对局部极小值和航路点震荡问题,提出虚拟障碍物法和过滤震荡点法,以此构成基于碰撞预测的航路规划法.仿真结果表明该方法能够有效的避免无谓避碰行为,且无局部极小值和航路点震荡问题,所得路径也较短.     

复杂环境下基于A*算法的无人机路径再规划

针对实际战场环境中规避突然出现的危险/威胁区域或任务变更时的无人机(unmanned aerial vehicle, UAV)路径动态再规划问题,为了适应复杂动态环境下危险/威胁区域需建模为圆形、凹/凸多边形以及可能存在相邻危险/威胁区域的间距较小甚至重叠的情形,对基于A*算法的线段求交无人机路径规划方法进行改进以适应圆形、凹/凸多边形危险/威胁区域同时存在的情形,提出了子节点安全性检测策略,采用基于A*算法的两步寻优路径搜索策略,进行UAV路径动态规划。仿真结果表明,采用本文提出的改进方法可实现上述复杂环境下的无人机路径动态再规划。     

改进的快速扩展随机树在航迹规划中的应用

通过在快速扩展随机树(rapidly-exploring random tree)算法的基础上融入状态-时间空间(state-timespace)的思想,使改进后的算法能够有效地处理动态环境中的航迹规划问题。仿真试验首先采用四元素法建立航天飞行器的六自由度动力学模型,在三维空间中验证该算法搜索高维空间的能力。其次运用改进的算法在动态环境中进行航迹规划试验,证明了该算法的有效性。     

基于正六边形栅格JPS算法的智能体路径规划

通过构建正六边形栅格地图, 并修改传统跳点搜索(jump point search, JPS)算法的邻居剪枝、强制邻居判断的规则和JPS策略, 提出一种新的正六边形栅格JPS算法, 并且利用该算法解决智能体在环境地图存在障碍物时的路径规划问题。利用Pycharm平台进行仿真研究, 并与传统正方形栅格A^*算法和JPS算法进行路径规划仿真比较, 结果表明正六边形栅格JPS算法可更好地实现路径规划, 所规划出的路径可避免穿越墙角的不安全行为、减少转向次数, 且该算法可减少路径规划时间, 提高了路径规划的质量和效率。     

神经网络在移动机器人路径规划中的应用

对于环境信息完全已知的移动机器人的全局路径规划问题,应用了一种并联的神经网络结构与模拟退火算法相结合的方法,并提出了一种局部路径修正算法,最终得到一条最优的平滑路径。计算机仿真研究表明,该算法计算简单,收敛速度快,规划的路径为一条最短无碰且安全的平滑路径。在计算机仿真验证的基础上,以P3-AT型轮式移动机器人为平台,通过机器人模拟实验验证了该算法的有效性。     

基于行为动力学的移动机器人安全导航方法

研究机器人行为动力学方法的导航问题,该方法在动态环境下存在碰撞危险。提出一种改进迭代最近点算法,可以在机器人导航过程中实时获取障碍物的位姿变化。根据位姿变化将障碍物分为静止障碍物、移动障碍物。结合环境信息的不完整性和运动障碍物速度信息,提出可感知速度障碍物（perceivable velocity obstacles, PVO）概念,该概念定义的障碍物是机器人感知障碍物区域沿其相对运动方向膨胀得到的避障区域,是一种虚拟障碍物。将PVO作为障碍物应用于行为动力学方法完成机器人导航控制。所提出的改进方法在不改变原有行为动力学方法的基础上,增加了安全导航功能,简单易用。仿真实例证实,在动态环境下,改进的行为动力学导航方法比经典的行为动力学导航方法更加安全。