Temat: robot path planning

Skocz do pozycji: 1.

Tytuł:: Novel path planning method using marine predator algorithm for mobile robot
Autorzy:: Wang, Qiang
Huang, Yinghui
Tematy:: robot path planning
marine predator algorithm
metaheuristic
optimization
autonomous driving; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Czasopisma i Monografie PAN
Powiązania:: https://bibliotekanauki.pl/articles/59111197.pdf Link otwiera się w nowym oknie
Opis:: The main goal of robot path planning is to design an optimal path for a robot to navigate from its starting point to its goal while avoiding obstacles and optimizing certain criteria. A novel method using marine predator algorithm which is used in the field of robot path planning is presented. The proposed method has two steps. First step is to build a mathematical model of path planning while second step is optimization process using marine predator algorithm. Simulation results show that the proposed method works well and has good performance in different situations. Therefore, this method is an effective method for robot path planning and related applications.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: A scalable tree based path planning for a service robot
Autorzy:: Nippun Kumaar, A. A.
Kochuvila, Sreeja
Nagaraja, S. R.
Tematy:: learning from demonstration
path mapping
path planning
navigation system
mobile robot
service robot; Pokaż więcej
Wydawca:: Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Powiązania:: https://bibliotekanauki.pl/articles/2204556.pdf Link otwiera się w nowym oknie
Opis:: Path planning plays a vital role in a mobile robot navi‐ gation system. It essentially generates the shortest tra‐ versable path between two given points. There are many path planning algorithms that have been proposed by re‐ searchers all over the world; however, there is very little work focussing on path planning for a service environ‐ ment. The general assumption is that either the environ‐ ment is fully known or unknown. Both cases would not be suitable for a service environment. A fully known en‐ vironment will restrict further expansion in terms of the number of navigation points and an unknown environ‐ ment would give an inefficient path. Unlike other envi‐ ronments, service environments have certain factors to be considered, like user‐friendliness, repeatability, sca‐ lability, and portability, which are very essential for a service robot. In this paper, a simple, efficient, robust, and environment‐independent path planning algorithm for an indoor mobile service robot is presented. Initially, the robot is trained to navigate to all the possible desti‐ nations sequentially with a minimal user interface, which will ensure that the robot knows partial paths in the en‐ vironment. With the trained data, the path planning al‐ gorithm maps all the logical paths between all the des‐ tinations, which helps in autonomous navigation. The al‐ gorithm is implemented and tested using a 2D simulator Player/Stage. The proposed system is tested with two dif‐ ferent service environment layouts and proved to have features like scalability, trainability, accuracy, and repe‐ atability. The algorithm is compared with various classi‐ cal path planning algorithms and the results show that the proposed path planning algorithm is on par with the other algorithms in terms of accuracy and efficient path generation.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: Humanoid robot path planning using rapidly explored random tree and motion primitives
Autorzy:: Szumowski, Maksymilian
Zielinska, Teresa
Tematy:: humanoid robot
path planning
rapidly exploring random tree; Pokaż więcej
Wydawca:: Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Powiązania:: https://bibliotekanauki.pl/articles/1837364.pdf Link otwiera się w nowym oknie
Opis:: Path planning is an essential function of the control sy‐ stem of any mobile robot. In this article the path planner for a humanoid robot is presented. The short description of an universal control framework and the Motion Ge‐ neration System is also presented. Described path plan‐ ner utilizes a limited number of motions called the Mo‐ tion Primitives. They are generated by Motion Generation System. Four different algorithms, namely the: Informed RRT, Informed RRT with random bias, and RRT with A* like heuristics were tested. For the last one the version with biased random function was also considered. All menti‐ oned algorithms were evaluated considering three diffe‐ rent scenarios. Obtained results are described and discus‐ sed.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: Collision-free autonomous robot navigation in unknown environments utilizing PSO for path planning
Autorzy:: Krell, Evan
Sheta, Alaa
Balasubramanian, Arun Prassanth Ramaswamy
King, Scott A.
Tematy:: mobile robot
particle swarm optimization (PSO)
path planning; Pokaż więcej
Wydawca:: Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Powiązania:: https://bibliotekanauki.pl/articles/91555.pdf Link otwiera się w nowym oknie
Opis:: The autonomous navigation of robots in unknown environments is a challenge since it needs the integration of a several subsystems to implement different functionality. It needs drawing a map of the environment, robot map localization, motion planning or path following, implementing the path in real-world, and many others; all have to be implemented simultaneously. Thus, the development of autonomous robot navigation (ARN) problem is essential for the growth of the robotics field of research. In this paper, we present a simulation of a swarm intelligence method is known as Particle Swarm Optimization (PSO) to develop an ARN system that can navigate in an unknown environment, reaching a pre-defined goal and become collision-free. The proposed system is built such that each subsystem manipulates a specific task which integrated to achieve the robot mission. PSO is used to optimize the robot path by providing several waypoints that minimize the robot traveling distance. The Gazebo simulator was used to test the response of the system under various envirvector representing a solution to the optimization problem.onmental conditions. The proposed ARN system maintained robust navigation and avoided the obstacles in different unknown environments. vector representing a solution to the optimization problem.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 5.

Tytuł:: Intelligent Control for a Perturbed Autonomous Wheeled Mobile Robot Using Type-2 Fuzzy Logic and Genetic Algorithms
Autorzy:: Martínez, R.
Castillo, O.
Aguilar, L. T.
Tematy:: mobile robot
path planning
fuzzy logic
genetic algorithms
autonomous mobile robot navigation; Pokaż więcej
Wydawca:: Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Powiązania:: https://bibliotekanauki.pl/articles/384492.pdf Link otwiera się w nowym oknie
Opis:: We describe a tracking controller for the dynamic model of a unicycle mobile robot by integrating a kinematic and a torque controller based on Type-2 Fuzzy Logic Theory and Genetic Algorithms. Computer simulations are presented confirming the performance of the tracking controller and its application to different navigation problems.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 6.

Tytuł:: Any-angle Global Path Planning for Skid-Steered Mobile Robots on Heterogeneous Terrain
Autorzy:: Jaroszek, P.
Tematy:: spath planning
skid-steered mobile robot
Theta*
any-angle path planning
A*; Pokaż więcej
Wydawca:: Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Powiązania:: https://bibliotekanauki.pl/articles/384522.pdf Link otwiera się w nowym oknie
Opis:: The paper is concerned with selection of the algorithm of path planning for a skid-steered mobile robot operating on heterogeneous terrain. Methods of path searching were reviewed and their applicability to particular kinematic structure of a robot was assessed. The Theta* graph search algorithm was selected, because of its property of returning any-angle paths. Because in this method variable terrain type is not considered, necessary changes in algorithm structure were proposed to check homogeneity of the terrain. In order to enable choice of arbitrary optimization criterion, the model of cost dependent on terrain properties was introduced, which includes both longitudinal motion and turning. Operation of the modified algorithm with the introduced cost model was verified by means of simulation against A* reference algorithm often used in path planning tasks.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 7.

Tytuł:: Model–based energy efficient global path planning for a four–wheeled mobile robot
Autorzy:: Jaroszek, P.
Trojnacki, M.
Tematy:: four-wheeled mobile robot
global path planning
robot dynamics model
heuristic algorithm
energy efficiency; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Powiązania:: https://bibliotekanauki.pl/articles/206564.pdf Link otwiera się w nowym oknie
Opis:: This paper concerns an energy efficient global path planning algorithm for a four-wheeled mobile robot (4WMR). First, the appropriate graph search methods for robot path planning are described. The A* heuristic algorithm is chosen to find an optimal path on a 2D tile-decomposed map. Various criteria of optimization in path planning, like mobility, distance, or energy are reviewed. The adequate terrain representation is introduced. Each cell in the map includes information about ground height and type. Tire-ground interface for every terrain type is characterized by coefficients of friction and rolling resistance. The goal of the elaborated algorithm is to find an energy minimizing route for the given environment, based on the robot dynamics, its motor characteristics, and power supply constraints. The cost is introduced as a function of electrical energy consumption of each motor and other robot devices. A simulation study was performed in order to investigate the power consumption level for diverse terrain. Two 1600 m2 test maps, representing field and urban environments, were decomposed into 20x20 equal-sized square-shaped elements. Several simulation experiments have been carried out to highlight the differences between energy consumption of the classic shortest path approach, where cost function is represented as the path length, and the energy efficient planning method, where cost is related to electrical energy consumed during robot motion.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 8.

Tytuł:: A differential motion planning algorithm for controlling multi-robot systems handling a common object
Autorzy:: Tzafestas, C.
Prokopiou, P.
Tzafestas, S.
Tematy:: robot
cooperative robots
incremental robot motion planning
manipulator kinematic
master and two-slaves system
multi-robot kinematics
multi-robot systems
path planning
rigidity condition; Pokaż więcej
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Powiązania:: https://bibliotekanauki.pl/articles/205881.pdf Link otwiera się w nowym oknie
Opis:: Multi-robot systems have substantially increased capabilities over single-robot systems and can handle very large or peculiar objects. This paper presents a differential (incremental) motion planning algorithm for an m-robot system (m >or=2) to cooperatively transfer an object from an initial to a desired final position / orientation by rigidly holding it at given respective points Q[sub 1], Q[sub 2],..., Q[sub m]. One of the robots plays the role of a "master" while other robots operate in the "slave" mode maintaining invariant their relative positions and orientations during the system motion. The method employs the differential displacements of the end-effector of each robot arm. Then, the differential displacements of the joints of the m robots are computed for the application of incremental motion control. The algorithm was tested on many examples. A representative of them is shown here, concerning the case of three STAUBLI RX-90L robots similar to 6-dof PUMA robots. The results obtained show the practicality and effectiveness of the method, which, however, needs particular care for completely eliminating the cumulative errors that may occur.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 9.

Tytuł:: An ACO Path Planner Using a FIS for Path Selection Adjusted with a Simple Tuning Algorithm
Autorzy:: Porta-Garcia, M.
Montiel, O.
Sepulveda, R.
Tematy:: ant colony optimization
ACO
autonomous mobile robot
navigation
fuzzy logic
path planning; Pokaż więcej
Wydawca:: Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Powiązania:: https://bibliotekanauki.pl/articles/384490.pdf Link otwiera się w nowym oknie
Opis:: This paper presents a path planner application for mobile robots based on Ant Colony Optimization (ACO). The selection of the optimal path relies in the criterion of a Fuzzy Inference System (FIS), which is adjusted using a Simple Tuning Algorithm (STA). The path planner can be executed in Mode I and Mode II. The first mode only works in the virtual environment of the interface, while Mode II embraces the wireless communication with a real robot; once the ACO algorithm finds the best route, the coordinates are sent to a mobile robot via Bluetooth communication; if the robot senses a new obstacle, the computer is notified and does a rerouting routine in order to avoid the obstacle and reach the goal. In other words, the application supports dynamic search spaces.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 10.

Tytuł:: Artifical potential fields algorithm for Mars rover path planning in an unknown enviroment
Autorzy:: Wyrąbkiewicz, K.
Tarczewski, T.
Grzesiak, L. M.
Tematy:: autonomous mobile robot
Mars rover
path planning
artificial potential fields
bug algorithm; Pokaż więcej
Wydawca:: Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Powiązania:: https://bibliotekanauki.pl/articles/377644.pdf Link otwiera się w nowym oknie
Opis:: In this paper artificial potential fields method applied to autonomous mobile robot - Mars rover is presented. It is assumed that Mars rover operates in an unknown environment. In order to visualize the robot's path in environment Matlab software is used. Inserted by graphic data input interface in top view mode obstacles are deployed in environment area. The method of artificial potential fields is extended by an additional algorithm to avoid a local minimum. The proposed algorithm is implemented as a state machine. In this paper simulations results of the developed algorithm are presented.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "robot path planning" wg kryterium: Temat