Zezwala się na korzystanie z artykułu na warunkach licencji Creative Commons Uznanie autorstwa 3.0 IntroductionMobile robots have been successfully applied in many areas such as medical and military applications, space exploration, public and domestic duties. They can perform difficult and hazardous tasks with complex requirements and often have to do so autonomously, without the aid of a human operator. To function in that manner they must be able to navigate the environment they are placed in.Collision-free path planning plays an important role in mobile robots navigation and is often a fundamental requirement for proper task execution. The main goal of such planning in an environment with static (stationary) and dynamic (moving) obstacles is to find a suitable movement path from a starting location to a destination, while avoiding the collision with any of these objects. This complex task poses many difficulties: computational complexity, adaptation to changing environment and determining a reasonable evaluation function for the generated path.Path planning is an active research area and many methods have been developed to deal with this problem. They can be classified into classical and heuristic based search algorithms [1], mainly discerned by the type of optimization techniques utilized.Recently some classical approaches, such as cell decomposition [2], potential field method [3][4][5], road map [6] and sub goal network have been presented in the field of mobile robotics. In a cell decomposition method a two-dimensional map is divided into several grids and the path is created in them. Another case of a classical approach is a potential field method in which the controlled robot is attracted by the destination while simultaneously being repelled by the obstacles.These path planning algorithms suffer from some drawbacks [1], e.g., a solution may not be optimal because the algorithm gets stuck in local minima or a new solution has to be generated again when the environment changes and therefore the original path can become infeasible.As a result, many heuristic based methods, such as fuzzy logic [7], artificial neural network [8], nature inspired algorithms [9-12] and hybrid algorithms were created. These methods can overcome drawbacks of the classical ones, but they do not guarantee to find the best solution. Still, the result can be sufficiently close to the optimal one. In this paper the authors used one of those methods -the Particle Swarm Optimization algorithm; it serves as a base solver for collision-free path planning problem.Particle Swarm Optimization (PSO) is a metaheuristic algorithm which is inspired by the social foraging behavior of some animals such as bird flocking and fish schooling. It was developed by Kennedy and Eberhart in 1995 and its description is presented in [13]. Since then, many approaches have been suggested by the researches to solve the collision-free path planning problem using the PSO algorithm [11,[14][15][16][17].Further sections of this paper are arranged as follows: Sect...
The article discusses the issue of creating an environment’s map with semantic division of areas. This simplifies some aspects of mobile robot control and permits the robot to carry out tasks issued in a human-understandable form. The article presents an innovative algorithm for mapping the environment by a mobile robot. Its novelty stems from the use of a semantic description of the world and Delaunay triangulation method with constraints. This description is used to segment the map of the environment and to reduce redundant information. The developed algorithm is based on the idea of extending the borders of the already discovered areas; they are expanded as the new data are collected from the environment. These data contain information about the location of semantic types in the explored space and is used to update the areas during analysis of the environment’s map. The beforementioned triangulation method is used in that process. The performance of the proposed algorithm is tested in simulation studies. The obtained results show a good computational efficiency of the method, which is crucial in the problem of environment exploration by mobile robots with limited computational resources.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.