结合B样条优化的UAV多区域路径规划融合算法

为解决无人机(UAV,Unmanned Aerial Vehicle)在多个目标区域之间快速找到最佳遍历路径的类旅行商问题(TSP,Travelling Salesman Problem),设计一种基于蚁群算法、A*算法以及三次B样条优化的融合规划算法;尽管蚁群算法相对其他优化算法在解决TSP问题上有较为良好的表现,但其规划路径处理时间长、生成路径转折多、路径质量和安全性较差;算法首先改进传统A*算法的节点扩展方式,快速生成两两目标区之间的局部路径,然后将蚁群算法和改进A*算法融合使用进行全局路径规划,最后结合改进三次B样条对路径进行平滑处理;基于栅格地图的仿真结果证明了该算法相比传统算法具有更好的高效性和稳定性。     

基于定向A*算法的多无人机同时集结分步策略

设计一种基于定向A*算法的多无人机同时集结分步策略.首先,提出一种定向A*算法,将无人机最大俯仰角与偏航角作为A*算法搜索约束,从而缩小节点扩展区域,并通过循环寻优规避“死区”点,进而产生平滑可飞的预规划航迹;其次,论述了补偿航程差的变步长多点搜索、三维盘旋机动、虚拟威胁等分步再规划算法,使得多无人机同时集结于目标点附近.仿真结果表明,所提出的算法能够有效完成多无人机同时集结任务.     

基于稀疏A*搜索和改进人工势场的无人机动态航迹规划

针对不同属性的障碍物所构成的威胁分布模型, 本文提出了一种基于稀疏A*搜索算法预规划和改进人工势场相结合的无人机动态避障算法. 该算法首先对威胁分布建立栅格化模型; 然后根据静态威胁, 基于稀疏A*搜索算法进行全局航迹规划; 最后结合预规划路径和动态威胁分布, 利用改进人工势场法完成无人机的动态避障. 仿真结果表明, 该方法能够规划出给定威胁指标下的全局最优路径并达到良好的动态规避性能.     

基于改进A和DWA的无人艇路径规划算法

针对存在动态障碍的复杂海洋环境中无人艇的应用,提出了基于改进A*和DWA的无人艇路径规划算法.在全局路径规划时,基于动态改变步长方法设计了一种改进的快速平滑A*算法,克服了传统A*算法存在的大范围搜索时效率低下、生成路径不平滑等缺点,基于无人艇传感及导航信息,通过在DWA的评价函数中增加路径偏差项,将全局规划与局部规划相结合,实现了动态环境下无人艇的路径规划.仿真实验结果表明,该算法相比传统A*算法,规划的路径平滑,运行效率提升了约30倍,并可以躲避环境中可能存在的动态障碍,确保无人艇安全、高效地到达目标点.     

复杂装配体多层次装配路径规划研究

针对传统装配路径规划方法应用于复杂装配体时出现的组合爆炸问题,提出了一种基于人机交互的改进A-Star(A*)算法多层次装配路径规划方法。算法在传统启发式路径规划算法的基础上引入了干涉威胁概率、平滑度代价、权重系数参数,实现了算法不同侧重方向的最优路径寻找。算法首先根据基于人机交互的路径规划方法结合操作者的装配经验将复杂装配体划分为多个装配层次段,其次对各层次段中的装配零部件运用改进A*算法求解最优拆卸路径,并最终根据路径反演原则生成整个复杂装配体最优装配路径。结合算法仿真对比与KUKA工业机器人路径规划实例验证,得出上述方法较传统启发式路径规划方法提升了路径规划效率,满足了工业生产中复杂装配体自动路径规划需求。     

基于改进A*算法的无人机航迹规划

在无人机航迹规划问题的研究中,针对在执行飞行任务前,需要根据所经区域内已知的地形、地貌、障碍和威胁等信息以及飞机本身机动能力的限制计算出飞行航迹, 并根据规划出的航迹完成飞行任务.能准确识别起始点到目标航路,提出了一种基于改进A*算法的无人机航迹规划方法,将无人机自身的性能和飞行任务结合到A*算法中去,在节点的搜索过程中解决了A*算法大空间搜索耗时多的问题.通过简单的路径消减算法去除不必要的航迹点,使得规划出来的航迹能够最大程度上满足无人机的运动特性.仿真结果表明采用的方法计算速度快并且规划达到最优性能.     

无人机三维航迹规划方法研究

航迹规划算法是无人机关键技术之一,同时也是任务规划系统（Mission Planning System）核心之一。针对固定目标规划问题,提出一种voronoi图改进算法和动态稀疏A*算法融合的三维航迹规划方法。该方法针对固定威胁目标,通过改进voronoi图规划算法快速求解二维航迹路径,然后在该路径参考下,用动态稀疏A*算法求解符合无人机飞行动力学约束的三维航迹。试验表明,该算法比动态稀疏A*算法规划速度快,并保证了航迹最优性。     

UAV/UGV协同环境下的目标识别与全局路径规划研究

针对单独机器人难以执行复杂环境中任务的问题,Unmanned Air/Ground Vehicle(UAV/UGV)协同系统近年来受到了广泛关注。为了提高执行任务的工作效率,提出一种基于视觉传感器下UAV/UGV协同系统中UAV目标识别下UGV全局路径规划的方法,无人机利用高空视野优势获取目标物与环境信息, SURF算法和图像分割实现环境建模。无人车根据无人机获取的信息,利用优化的A*算法完成全局路径规划,并且在典型搜救场景中进行了仿真验证。实验表明,SURF算法能满足目标识别的精确度、实时性和鲁棒性;并且利用优化的A*算法实现了UGV快速准确的全局路径规划。     

融合改进A*与DWA算法的机器人动态路径规划

传统A*算法是移动机器人全局路径规划的常用算法之一,但是算法搜索效率低、规划路径转折点多、面对复杂环境中随机出现的动态障碍物无法实现动态路径规划。针对这些问题,在考虑全局最优的基础上将改进A*与DWA算法融合,量化环境中的障碍物信息,根据此信息调节A*算法启发函数的权重,提高算法的效率和灵活性。基于Floyd算法思想设计路径节点优化算法,删除冗余节点,减少转折,提高路径平滑度。基于全局最优设计DWA算法的动态窗口评价函数,用于区分已知障碍物和未知动态、静态障碍物,提取改进A*算法规划路径的关键点作为DWA算法的临时目标点,在全局最优的基础上实现了改进A*与DWA算法融合。实验结果表明,在复杂环境中,融合算法规划路径既能保证全局最优,又能及时有效地躲避环境中出现的动静态障碍物,实现复杂环境中的动态路径规划。     

基于人工势场算法和RRT算法的多无人机路径规划

为了解决在城市和山区复杂环境中的多无人机任务分配及路径规划问题,提出了一种基于人工势场算法和RRT融合算法的多无人机协同路径规划方法。基于人工势场算法基础优化斥力函数,加入机间斥力因子,实现了协同避撞。引入RRT算法进行拓展搜索,解决了无人机陷入局部极值点时单一人工势场算法目标不可达的问题。通过三维路径规划仿真实验和算法对比实验验证该方法的可行性,结果表明,融合路径规划算法可以在约束条件下找到全局最优路径。     

Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms

The problem of integrating task assignment and planning paths for a group of cooperating uninhabited aerial vehicles, servicing multiple targets, is addressed. In the problem of interest the uninhabited aerial vehicles need to perform multiple consecutive tasks cooperatively on each ground target. A Dubins car model is used for motion planning, taking into account each vehicle's specific constraint of minimum turn radius. By using a finite set to define the visitation angle of a vehicle over a target we pose the integrated problem of task assignment and path optimization in the form of a graph. This new approach results in suboptimal trajectory assignments. Refining the visitation angle discretization allows for an improved solution. Due to the computational complexity of the resulting combinatorial optimization problem, we propose genetic algorithms for the stochastic search of the space of solutions. We distinguish between two cases of vehicle group composition: homogeneous, where all vehicles are identical; and heterogeneous, where the vehicles may have different operational capabilities and kinematic constraints. The performance of the genetic algorithms is demonstrated through sample runs and a Monte Carlo simulation study. Results show that the algorithms quickly provide good feasible solutions, and find the optimal solution for small sized problems.     

基于遗传算法的动态资源调度问题研究

建立了无人作战飞机任务规划问题的数学模型，提出了分层递阶的任务规划系统结构．针对任务规划的核心资源调度问题，设计了基于遗传算法的动态资源调度算法，有效地解决了多无人作战飞机的资源调度问题，计算结果表明了算法的有效性．     

自主车的运动仿真

在自主车的运动路径规划中,局部路径规划特别重要,而且是自主车的一项关键技术。该文提出了将自主式多智能体的任务和反应性行为模型嵌入到离散事件系统框架中作局部路径规划的方法,此方法克服了势场法（包括早期的虚力场法）的缺陷,为确保自主车运动路径规划的可靠性和合理性,该文就局部路径规划对自主车作运动仿真。     

On‐line estimation and path planning for multiple vehicles in an uncertain environment

A unified approach to cooperative target tracking and path planning for multiple vehicles is presented. All vehicles, friendly and adversarial, are assumed to be aircraft. Unlike the typical target tracking problem that uses the linear state and nonlinear output dynamics, a set of aircraft nonlinear dynamics is used in this work. Target state information is estimated in order to integrate into a path planning framework. The objective is to fly from a start point to a goal in a highly dynamic, uncertain environment with multiple friendly and adversarial vehicles, without collision. The estimation architecture proposed is consistent with most path planning methods. Here, the path planning approach is based on evolutionary computation technique which is then combined with a nonlinear extended set membership filter in order to demonstrate a unified approach. A cooperative estimation approach among friendly vehicles is shown to improve speed and routing of the path. Copyright © 2004 John Wiley & Sons, Ltd.     

Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms

A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algorithm for solving such a problem is proposed. The algorithm allows us to efficiently solve this NP-hard problem that has prohibitive computational complexity for classical combinatorial optimization methods. It also allows us to take into account the unique requirements of the scenario such as task precedence and coordination, timing constraints, and trajectory limitations. A matrix representation of the genetic algorithm chromosomes simplifies the encoding process and the application of the genetic operators. The performance of the algorithm is compared to that of deterministic branch and bound search and stochastic random search methods. Monte Carlo simulations demonstrate the viability of the genetic algorithm by showing that it consistently and quickly provides good feasible solutions. This makes the real time implementation for high-dimensional problems feasible.     

A Continuous Local Motion Planning Framework for Unmanned Vehicles in Complex Environments

As the complexity of an unmanned vehicle’s operational environment increases so does the need to consider the obstacle space continually, and this is aided by splitting the motion planning functionality into distinct global and local layers. This paper presents a new continuous local motion planning framework, where the output and control space elements of the traditional receding horizon control problem are separated into distinct layers. This separation reduces the complexity of the local motion trajectory optimisation, enabling faster design and increased horizon length. The focus of this paper is on the output space component of this framework. Bezier polynomial functions are used to describe local motion trajectories which are constrained to vehicle performance limits and optimised to track a global trajectory. Development and testing is in simulation, targeted at a nonlinear model of a quadrotor unmanned air vehicle. The defined framework is used to provide situation-aware tracking of a global trajectory in the presence of static and dynamic obstacles, as well as realistic turbulence and gusts. Also demonstrated is the immediate-term decentralised deconfliction of multiple unmanned vehicles, and multiple formations of unmanned vehicles.     

Designing for flexible interaction between humans and automation: delegation interfaces for supervisory control

OBJECTIVE: To develop a method enabling human-like, flexible supervisory control via delegation to automation. BACKGROUND: Real-time supervisory relationships with automation are rarely as flexible as human task delegation to other humans. Flexibility in human-adaptable automation can provide important benefits, including improved situation awareness, more accurate automation usage, more balanced mental workload, increased user acceptance, and improved overall performance. METHOD: We review problems with static and adaptive (as opposed to "adaptable") automation; contrast these approaches with human-human task delegation, which can mitigate many of the problems; and revise the concept of a "level of automation" as a pattern of task-based roles and authorizations. We argue that delegation requires a shared hierarchical task model between supervisor and subordinates, used to delegate tasks at various levels, and offer instruction on performing them. A prototype implementation called Playbook is described. RESULTS: On the basis of these analyses, we propose methods for supporting human-machine delegation interactions that parallel human-human delegation in important respects. We develop an architecture for machine-based delegation systems based on the metaphor of a sports team's "playbook." Finally, we describe a prototype implementation of this architecture, with an accompanying user interface and usage scenario, for mission planning for uninhabited air vehicles. CONCLUSION: Delegation offers a viable method for flexible, multilevel human-automation interaction to enhance system performance while maintaining user workload at a manageable level. APPLICATION: Most applications of adaptive automation (aviation, air traffic control, robotics, process control, etc.) are potential avenues for the adaptable, delegation approach we advocate. We present an extended example for uninhabited air vehicle mission planning.     

Receding-Horizon Trajectory Planning for Under-Actuated Autonomous Vehicles Based on Collaborative Neurodynamic Optimization

This paper addresses a major issue in planning the trajectories of under-actuated autonomous vehicles based on neurodynamic optimization. A receding-horizon vehicle trajectory planning task is formulated as a sequential global optimization problem with weighted quadratic navigation functions and obstacle avoidance constraints based on given vehicle goal configurations. The feasibility of the formulated optimization problem is guaranteed under derived conditions. The optimization problem is sequentially solved via collaborative neurodynamic optimization in a neurodynamics-driven trajectory planning method/procedure. Simulation results with under-actuated unmanned wheeled vehicles and autonomous surface vehicles are elaborated to substantiate the efficacy of the neurodynamics-driven trajectory planning method.      

Two-dimensional path finding subject to geometric constraints

The trajectory planning on a plane is considered as the problem of finding a path in a graph of a special form. Algorithms that are able to solve this problem in the case of geometric constraints, more precisely, under the assumptions that the trajectory is composed of a sequence of straight segments such that the angle between the adjacent segments does not exceed a given threshold, are analyzed. This statement is important for the development of effective navigation methods for unmanned vehicles. A novel algorithm for solving this problem is proposed, and the results of theoretical and experimental studies are presented. The experimental results confirm that the proposed algorithm can be used in practice for planning the trajectory of low-flying unmanned multirotor aerial vehicles in an urban area. They also show that the proposed algorithm significantly exceeds other available algorithms in terms of the number of successfully accomplished tasks.     

移动威胁情况下的无人机路径规划

针对路径规划中存在快速移动威胁, 提出基于威胁状态预测的模型预测控制(MPC)算法, 进行无人机动态路径规划. 采用转换量测卡尔曼滤波算法预测移动威胁的状态, 弥补MPC算法无法有效预测快速移动威胁的不足. 根据移动威胁的预测状态, 评估无人机的威胁代价, 与路径长度等约束共同构建目标函数, 通过滚动优化目标函数, 得到一系列在线控制量, 完成路径规划. 仿真结果表明该方法可以有效躲避移动威胁, 进行实时路径规划.