scholarly journals On the use of the observability gramian for partially observed robotic path planning problems

2017 ◽  
Author(s):  
Mohammadhussein Rafieisakhaei ◽  
Suman Chakravorty ◽  
P. R. Kumar
Keyword(s):  
Path Planning ◽  
Partially Observed ◽  
Planning Problems ◽  
Observability Gramian

Collaborative Scheduling of Algorithms for Path Planning of Unmanned Systems

2021 ◽  
Vol 01 ◽  
Author(s):  
Ying Li ◽  
Chubing Guo ◽  
Jianshe Wu ◽  
Xin Zhang ◽  
Jian Gao ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Reinforcement Learning ◽  
Path Planning ◽  
Unmanned Systems ◽  
Ant Colony Optimization Algorithm ◽  
A Algorithm ◽  
Collaborative Scheduling ◽  
Simulation Results ◽  
Planning Problems ◽  
Effective Path

Background: Unmanned systems have been widely used in multiple fields. Many algorithms have been proposed to solve path planning problems. Each algorithm has its advantages and defects and cannot adapt to all kinds of requirements. An appropriate path planning method is needed for various applications. Objective: To select an appropriate algorithm fastly in a given application. This could be helpful for improving the efficiency of path planning for Unmanned systems. Methods: This paper proposes to represent and quantify the features of algorithms based on the physical indicators of results. At the same time, an algorithmic collaborative scheme is developed to search the appropriate algorithm according to the requirement of the application. As an illustration of the scheme, four algorithms, including the A-star (A*) algorithm, reinforcement learning, genetic algorithm, and ant colony optimization algorithm, are implemented in the representation of their features. Results: In different simulations, the algorithmic collaborative scheme can select an appropriate algorithm in a given application based on the representation of algorithms. And the algorithm could plan a feasible and effective path. Conclusion: An algorithmic collaborative scheme is proposed, which is based on the representation of algorithms and requirement of the application. The simulation results prove the feasibility of the scheme and the representation of algorithms.

A survey on the application of path-planning algorithms for multi-rotor UAVs in precision agriculture

2022 ◽  
pp. 1-20
Author(s):  
Amin Basiri ◽  
Valerio Mariani ◽  
Giuseppe Silano ◽  
Muhammad Aatif ◽  
Luigi Iannelli ◽  
...  
Keyword(s):  
Path Planning ◽  
Unmanned Aerial Vehicles ◽  
Flight Control ◽  
Precision Agriculture ◽  
Navigation Systems ◽  
Agricultural Crops ◽  
Cluttered Environments ◽  
Main Motivation ◽  
Autonomous Guidance ◽  
Planning Problems

Abstract Multi-rotor Unmanned Aerial Vehicles (UAVs), although originally designed and developed for defence and military purposes, in the last ten years have gained momentum, especially for civilian applications, such as search and rescue, surveying and mapping, and agricultural crops and monitoring. Thanks to their hovering and Vertical Take-Off and Landing (VTOL) capabilities and the capacity to carry out tasks with complete autonomy, they are now a standard platform for both research and industrial uses. However, while the flight control architecture is well established in the literature, there are still many challenges in designing autonomous guidance and navigation systems to make the UAV able to work in constrained and cluttered environments or also indoors. Therefore, the main motivation of this work is to provide a comprehensive and exhaustive literature review on the numerous methods and approaches to address path-planning problems for multi-rotor UAVs. In particular, the inclusion of a review of the related research in the context of Precision Agriculture (PA) provides a unified and accessible presentation for researchers who are initiating their endeavours in this subject.

Robot path planning based on genetic algorithm with hybrid initialization method

2021 ◽  
pp. 1-16
Author(s):  
Zhaojun Zhang ◽  
Rui Lu ◽  
Minglong Zhao ◽  
Shengyang Luan ◽  
Ming Bu
Keyword(s):  
Genetic Algorithm ◽  
Path Planning ◽  
Iteration Process ◽  
Initial Population ◽  
Local Optimum ◽  
Complex Environments ◽  
Random Initialization ◽  
Planning Problems ◽  
Complete Path

The research of path planning method based on genetic algorithm (GA) for the mobile robot has received much attention in recent years. GA, as one evolutionary computation model, mimics the process of natural evolution and genetics. The quality of the initial population plays an essential role in improving the performance of GA. However, when GA based on a random initialization method is applied to path planning problems, it will lead to the emergence of infeasible solutions and reduce the performance of the algorithm. A novel GA with a hybrid initialization method, termed NGA, is proposed to solve this problem in this paper. In the initial population, NGA first randomly selects three free grids as intermediate nodes. Then, a part of the population uses a random initialization method to obtain the complete path. The other part of the population obtains the complete path using a greedy-related method. Finally, according to the actual situation, the redundant nodes or duplicate paths in the path are deleted to avoid the redundant paths. In addition, the deletion operation and the reverse operation are also introduced to the NGA iteration process to prevent the algorithm from falling into the local optimum. Simulation experiments are carried out with other algorithms to verify the effectiveness of the NGA. Simulation results show that NGA is superior to other algorithms in convergence accuracy, optimization ability, and success rate. Besides, NGA can generate the optimal feasible paths in complex environments.

Path Planning in a Mobile Robot

2019 ◽  
pp. 582-608
Author(s):  
Diego Alexander Tibaduiza Burgos ◽  
Maribel Anaya Vejar
Keyword(s):  
Genetic Algorithms ◽  
Path Planning ◽  
Mobile Robot ◽  
Fitness Function ◽  
Experimental Setup ◽  
Robot Path Planning ◽  
Natural Evolution ◽  
On Line ◽  
Planning Problems ◽  
Robot Path

This chapter presents the development and implementation of three approaches that contribute to solving the mobile robot path planning problems in dynamic and static environments. The algorithms include some items regarding the implementation of on-line and off-line situations in an environment with static and mobile obstacles. A first technique involves the use of genetic algorithms where a fitness function and the emulation of the natural evolution are used to find a free-collision path. The second and third techniques consider the use of potential fields for path planning using two different ways. Brief descriptions of the techniques and experimental setup used to test the algorithms are also included. Finally, the results applying the algorithms using different obstacle configurations are presented and discussed.

Research on the Sheepdog Problem Using Cellular Automata

2007 ◽  
Vol 11 (9) ◽  
pp. 1099-1106
Author(s):  
Yoshinobu Adachi ◽  
◽  
Masayoshi Kakikura
Keyword(s):  
Cellular Automata ◽  
Path Planning ◽  
Multiagent Systems ◽  
Cooperative Behavior ◽  
Herd Behavior ◽  
Simulation Framework ◽  
Pursuit Problem ◽  
Complex Issue ◽  
Robot Systems ◽  
Planning Problems

The simulation framework we propose for complex path planning problems with multiagent systems focuses on the sheepdog problem for handling distributed autonomous robot systems – an extension of the pursuit problem for handling one prey robot and multiple predator robot. The sheepdog problem involves a more complex issue in which multiple dog robot chase and herd multiple sheep robot. We use the Boids model and cellular automata to model sheep flocking and chase and herd behavior for dog robots. We conduct experiments using a Sheepdog problem simulator and study cooperative behavior.

Pigeon-inspired optimization: a new swarm intelligence optimizer for air robot path planning

2014 ◽  
Vol 7 (1) ◽  
pp. 24-37 ◽  
Author(s):  
Haibin Duan ◽  
Peixin Qiao
Keyword(s):  
Path Planning ◽  
Swarm Intelligence ◽  
Implementation Process ◽  
Robot Path Planning ◽  
Operator Model ◽  
Content Type ◽  
De Algorithm ◽  
The Mathematical Model ◽  
Planning Problems ◽  
Robot Path

Purpose – The purpose of this paper is to present a novel swarm intelligence optimizer — pigeon-inspired optimization (PIO) — and describe how this algorithm was applied to solve air robot path planning problems. Design/methodology/approach – The formulation of threat resources and objective function in air robot path planning is given. The mathematical model and detailed implementation process of PIO is presented. Comparative experiments with standard differential evolution (DE) algorithm are also conducted. Findings – The feasibility, effectiveness and robustness of the proposed PIO algorithm are shown by a series of comparative experiments with standard DE algorithm. The computational results also show that the proposed PIO algorithm can effectively improve the convergence speed, and the superiority of global search is also verified in various cases. Originality/value – In this paper, the authors first presented a PIO algorithm. In this newly presented algorithm, map and compass operator model is presented based on magnetic field and sun, while landmark operator model is designed based on landmarks. The authors also applied this newly proposed PIO algorithm for solving air robot path planning problems.

Sign in / Sign up

Export Citation Format

Share Document