- Research Article
10
- 10.1016/j.ast.2015.09.022
OARPER-MAFO algorithm for anti-ship missile path planning
- Sep 25, 2015
- Aerospace Science and Technology
- Gang Liu + 4 more +4
OARPER-MAFO algorithm for anti-ship missile path planning
Trajectory optimization of multiple quad-rotor UAVs in collaborative assembling task
OARPER-MAFO algorithm for anti-ship missile path planning
OARPER-MAFO algorithm for anti-ship missile path planning
Six-Element Yagi-Uda Array: An Example of Using Negative Gravity in Central Force Optimization for Improving Decision Space Exploration
State-of-the-art antenna design and optimization (D/O) is increasingly being done using Global Search and Optimization (GSO) algorithms such as Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), Differential Evolution (DE), and a plethora of other evolutionary algorithms, among them Central Force Optimization (CFO), which is the subject of this note. CFO analogizes real gravity in the real Universe so that its gravity is usually attractive in nature, that is, “positive”. But in metaphorical CFO space the algorithm designer is free to turn gravity on its head by making it negative, and doing so to a small extent can improve CFO’s exploration of the search space thus providing even better results. This extension is discussed in some detail and applied to a 6-element Yagi-Uda array as an example.
Read moreA hierarchic approach for path planning in virtual reality
This work considers path-planning processes for manipulation tasks such as assembly, maintenance or disassembly in a virtual reality (VR) context. The approach consists in providing a collaborative system associating a user immersed in VR and an automatic path planning process. It is based on semantic, topological and geometric representations of the environment and the planning process is split in two phases: coarse and fine planning. The automatic planner suggests a path to the user and guides him trough a haptic device. The user can escape from the proposed solution if he wants to explore a possible better way. In this case, the interactive system detects the users intention and computes in real-time a new path starting from the users guess. Experiments illustrate the different aspects of the approach: multi-representation of the environment, path planning process, users intent prediction and control sharing.
Read moreDeep Neural Network Enhanced Sampling-Based Path Planning in 3D Space
Robot path planning in 3D space is a challenging problem for its complex configuration. Sampling-based algorithms have gained great success in solving path planning problems in 3D space, but the quality of the initial path is not guaranteed and the convergence to the optimal solution is slow. To address these problems, in this article, we present a novel sampling-based path planning framework enhanced by the deep neural network (DNN) with applications to 3D space. In the proposed framework, we first train the DNN with a number of successful path planning cases in 3D space. Then the DNN is utilized to predict the promising region where the feasible path probably exists for a given path planning problem. This predicted promising region serves as a nonuniform sampling heuristic to bias the sampling process of the path planner. In this way, the path planner can focus on the promising region in the exploration and exploitation process so that the path planning speed gets accelerated. We conduct numerical simulations to evaluate the performance of the proposed algorithm and the results show that it can perform much better than conventional path planning algorithms. Furthermore, we also investigate the performance of different DNN architectures for path planning in 3D space. Note to Practitioners—In this work, we aim to provide an efficient learning-based method to accelerate the robot path planning process in 3D space. Conventional path planning algorithms need to perceive the environment first, and then implement a series of calculations such as collision checking and data storing to generate a feasible path. When facing complex and high-dimensional environments, they do not perform well. But the proposed neural network method in this article can predict the promising region where the feasible path exists for any given environment. This prediction result is used to guide the path planning process so that the algorithm performance can get significantly improved. Apart from sampling-based algorithms, the proposed neural network model can also be extended to other types of path planning algorithms.
Read moreCentral Force Optimization
Central Force Optimization(CFO) is a new deterministic multi-dimensional optimization algorithm based on the metaphor of gravitational kinematics.The probes'positions and accelerations equations are determined using the analogy of particle motion in a gravitational field.In CFO,through the acceleration updates to realize the objective function fitness updates and simulation in physics universal gravitation choose to find the optimal solution of the optimal solution.Introduced is the new optimization algorithm emphatically,and the result of this algorithm is analyzed.Based on this idea,presented is a kind of improved gravity center,and the optimization algorithm for several typical examples of the algorithm is validated,and the results indicate that the algorithm is effective.
Read moreMulti-agent Collaborative Region Exploration and Path Planning Based on Q-Learning Algorithm Under Communication-Limited Condition
This paper addresses multi-agent cooperative region exploration and path planning. For region exploration, a double probability matrix updating rule based on distance weight is proposed and its convergence is proved by us. Compared with traditional Bayes updating rules, this updating rule improves the convergence speed of the exploration probability matrix and is applicable to multiple environments, thus improving the robustness. Secondly, a multi-agent region exploration strategy based on distance weight is proposed. Compared with the traditional coverage control algorithm, this method improves the search efficiency, reduces the variance of the results thus improves the confidence of the data. For path planning, a multi-agent hierarchical Q-learning algorithm is proposed and we use a multi-agent collaborative process of region exploration and path planning to visualize the influence of region exploration’s result on path planning algorithm. The above algorithm is modeled and simulated based on the cooperative search and rescue task at sea, and the simulation results verify the above conclusions.KeywordsMulti-agentRegion explorationPath planningQ-learning
Read moreVariable Z0applied to the optimal design of multi-stub matching network and a meander monopole
VariableZ0, a new concept in antenna design and optimization, is applied to two optimization problems: a multi-stub matching network (MSMN) using biogeography-based optimization (BBO), and an ultra wideband meander monopole antenna (MMA) using central force optimization (CFO). BBO is a newly-proposed stochastic global search and optimization evolutionary algorithm (EA) used to determine MSMN stub lengths and locations for optimum (minimum) reflection coefficient. CFO is a deterministic EA used to optimize the MMA's impedance bandwidth (IBW) while maintaining good average gain without considering the radiation pattern in detail. Two cases are investigated for both problems: (a) fixed characteristic impedanceZ0, and (b) variable characteristic impedance. In the first case,Z0is a fixed user-specified parameter (the traditional methodology), whereas in the second, it is a true variable quantity whose value is determined by the optimization methodology, which is a new technology. VariableZ0is a fundamentally different design approach in optimization problems. BBO's fixedZ0results for MSMN are compared to published data computed using Nelder–Mead optimization with BBO exhibiting better performance. BBO's results are improved even more using VariableZ0technology. A similar performance improvement is seen for VariableZ0applied to the CFO-optimized MMA.
Read moreAnytime Reactive Planning with Decision Automation
In many outdoor robotic applications several factors have to be taken into account during a path planning process. In different situations the importance of these factors vary. This paper presents a path planning method for mobile robots that incorporates decision theory to guide the search. A neural structure is proposed to determine the relative importance of the objectives that makes the robot capable of planning in unfamiliar situations. The method is able to handle an arbitrary number of objectives simultaneously and also enables the incorporation of human logic into the planning process. All parts of the algorithm suit real-time implementation.
Read moreOptimal Trajectory and Schedule Planning for Autonomous Guided Vehicles in Flexible Manufacturing System
This paper proposed an algorithm to solve major challenges in the domain of autonomous transportation systems. These challenges are trajectory planning and collision avoidance. Generally, in a shared infrastructure where several agents aim to use limited capacity resources, finding a set of optimal and conflict-free paths for each single agent is the most critical part. In such a dynamic environment where continual planning and scheduling are required, we have adopted a coupled (centralized) technique and face the problem by breaking it into two distinct phases: path planning and collision avoidance. In the first phase, the lowest cost path is planned for each agent by a modified version of Dijkstra algorithm. Following that, in the second phase, the head-on collisions can be foreseen and avoided by detecting the agents' common segments of the path choices. Finally, based on the capacity of each resource and the feasibility of each path, the task assignment and scheduling algorithm allocates different tasks between agents.
Read moreA Survey of Trajectory Planning Techniques for Autonomous Systems
This work offers an overview of the effective communication techniques for space exploration of ground, aerial, and underwater vehicles. We not only comprehensively summarize the trajectory planning, space exploration, optimization, and other challenges encountered but also present the possible directions for future work. Because a detailed study like this is uncommon in the literature, an attempt has been made to fill the gap for readers interested in path planning. This paper also includes optimization strategies that can be used to implement terrestrial, underwater, and airborne applications. This study addresses numerical, bio-inspired, and hybrid methodologies for each dimension described. Throughout this study, we endeavored to establish a centralized platform in which a wealth of research on autonomous vehicles (on the land and their trajectory optimizations), airborne vehicles, and underwater vehicles, is published.
Read moreA Reinforcement Learning Framework for Efficient Informative Sensing
Large-scale spatial data can be collected using mobile robots with sensing and navigation capabilities. Due to limited battery lifetime and scarcity of charging stations, it is important to plan informative paths so as to maximize the utility of data given a limited travel budget, which is known as the informative path planning (IPP) problem. IPP is NP-hard, and existing solutions suffer from high complexity or low optimality. In this paper, we present a novel IPP solution based on reinforcement learning (RL). The basic idea is to learn the structural characteristics of informative paths, so informative paths can be predicted. As such, when budgets change, we avoid solving the problem from scratch and thus path planning efficiency can be improved dramatically. Among the 20 path planning experiments in two areas, the proposed RL based solution achieves the best path utility in 15 experiments, compared with state-of-the-art algorithms. More importantly, the inference complexity is linear with respect to the budget (equivalently, the maximum number of steps in RL), which is lower than other solutions. Despite the NP-hardness, the path planning process can be finished within a few seconds in our experiments on two graphs of different sizes.
Read moreAutonomous navigation and adaptive path planning in dynamic greenhouse environments utilizing improved LeGO‐LOAM and OpenPlanner algorithms
The autonomous navigation of greenhouse robots depends on precise mapping, accurate localization information and a robust path planning strategy. However, the complex agricultural environment introduces significant challenges to robot perception and path planning. In this study, a hardware system designed exclusively for greenhouse agricultural environments is presented, employing multi‐sensor fusion to diminish the interference of complex environmental conditions. Furthermore, a robust autonomous navigation framework based on the improved lightweight and ground optimized lidar odometry and mapping (LeGO‐LOAM) and OpenPlanner has been proposed. In the perception phase, a relocalization module is integrated into the LeGO‐LOAM framework. Comprising two key steps—map matching and filtering optimization, it ensures a more precise pose relocalization. During the path planning process, ground structure and plant density are considered in our Enhanced OpenPlanner. Additionally, a hysteresis strategy is introduced to enhance the stability of system state transitions. The performance of the navigation system in this paper was evaluated in several complex greenhouse environments. The integration of the relocalization module significantly decreases the absolute pose error (APE) in the perception process, resulting in more accurate pose estimation and relocalization information. In our experiments, the APE was reduced by at least 24.42%. Moreover, our enhanced OpenPlanner exhibits the capability to plan safer trajectories and achieve more stable state transitions in the experiments. The results underscore the safety and robustness of our proposed approach, highlighting its promising application prospects in autonomous navigation for agricultural robots.
Read moreChaotic predator–prey biogeography-based optimization approach for UCAV path planning
Chaotic predator–prey biogeography-based optimization approach for UCAV path planning
Autonomous Robot KUKA YouBot Navigation Based on Path Planning and Traffic Signals Recognition
We present the successful demonstration of autonomous robot KUKA YouBot navigation based on path planning and traffic signals recognition. The integration of both capabilities path planning and traffic signals recognition was carried out, thanks to the integration among Robot Operating System, MATrix LABoratory software and Open Source Computer Vision Library working environments. The Robot Operating System allows the simulation of the autonomous robot navigation by using Gazebo and provides the implementation of the algorithms in simulated and real platforms. MATrix LABoratory software improves the communication tasks taking advantage of data processing tools in the path planning process. Finally, Open Source Computer Vision Library allows the traffic signals recognition by using the Scale-Invariant Feature Transform and Speeded-Up Robust Features algorithm. The integration of Robot Operating System, MATrix LABoratory software and Open Source Computer Vision Library is a promising approach to provide autonomous navigation capability in any mobile robot and in uncontrolled environments.
Read moreA new optimization-driven path planning method with probabilistic completeness for wheeled mobile robots
Wheeled mobile robots are widely utilized for environment-exploring tasks both on earth and in space. As a basis for global path planning tasks for wheeled mobile robots, in this study we propose a method for establishing an energy-based cost map. Then, we utilize an improved dual covariant Hamiltonian optimization for motion planning method, to perform point-to-region path planning in energy-based maps. The method is capable of efficiently handling high-dimensional path planning tasks with non-convex cost functions through applying a robust active set algorithm, that is, non-monotone gradient projection algorithm. To solve the problem that the path planning process is locked in weak minima or non-convergence, we propose a randomized variant of the improved dual covariant Hamiltonian optimization for motion planning based on simulated annealing and Hamiltonian Monte Carlo methods. The results of simulations demonstrate that the final paths generated can be time efficient, energy efficient and smooth. And the probabilistic completeness of the method is guaranteed.
Read more