Top PDF Dynamic anytime task and path planning for mobile robots

Dynamic anytime task and path planning for mobile robots

Dynamic anytime task and path planning for mobile robots

aforementioned work focus on feasibility planning for high complexity problems involving object manipulation. However, far fewer works have applied CTMP concepts to planning for lower-complexity problems consisting of mobile robots. Yet CTMP can provide improvements to the optimality of long mission plans, or adapt task plans in response to failures or perceived dynamic changes to the world. We highlight the UP2TA framework [6], which integrates task and path planning for applications to exploration mission planning. However, UP2TA does not consider general cost spaces in path optimisation, nor facilitates dynamic re-planning. Thus the contributions of this work is two-fold: (i) we compare a base planner, which integrates task and path planning to enable optimal task planning in continuous cost spaces by making use of a multi-tree T-RRT* algorithm [7], against UP2TA and a planning-in-isolation approach, and (ii) we extend the base planner with dynamic, anytime capabilities to enable high- level re-planning and low-level path corrections in dynamic environments. We collectively refer to the proposed planner as the Dynamic, Anytime Task and Path Planner (DA-TPP).
Show more

5 Read more

Mobile Robots Control and Path Planning Strategies

Mobile Robots Control and Path Planning Strategies

as wind gusts. Moreover one of the tasks in the project includes the aerial and hand deployment operation, where the UAV has to be deployed by a human operator or from an helicopter in overturned initial condition. For this task, the need arises for a glob- ally stabilizing controller able to execute acrobatic maneuvers as attitude recovery and to stabilize the system from any initial configuration, avoiding dangerous crash. On the path planning side, the requirements for the project are: real-time and low computation algorithm for real on-board application, a robust algorithm able to take into account disturbances and to plan safe paths accordingly and suitable to replanning because of the unknown environment. Moreover a general framework for multiple heterogeneous robots had to be develop and shared between different agents. Me and my group were responsible for the multi-propeller UAV and the ground rover, hence the focus of this thesis is on control and path planning with applications on those platform, but suitable for other mobile robots. The two models of interest will be used throughout the whole thesis for examples and applications.
Show more

178 Read more

Optimized RRT-A* Path Planning Method for Mobile Robots in Partially Known Environment

Optimized RRT-A* Path Planning Method for Mobile Robots in Partially Known Environment

In recent years, RRT method has been combined with other path planning methods to help improve path quality. In [38], Gaussian process occupancy map was combined with RRT to plan secure path in cluttered environment. Tusi and Chung [34] combined RRT and artificial bee colony (ABC) methods. RRT algo- rithm was used in this method to generate nodes in the free configuration space and the best nodes were considered by applying ABC method to move the bees. The method was described to have performed bet- ter compared to particle swarm optimization (PSO) method. Any-angle search algorithm was combined with RRT to present theta*-RRT motion planning method for non-holonomic wheeled robots [29]. Theta*-RRT method was described to have generated shorter paths in shorter time compared to other RRT methods. To obtain near-optimal path of nonlinear dynamic mobile robots, Li et al. [23] combined neu- ral network and RRT to present NoD-RRT method. The authors considered the nonlinear kinodynamic constraints of the vehicles and revised RRT to per- form reconstruction to deal with the kinodynamic constraints problem. Results showed that NoD-RRT performed better compared to RRT and RRT*. An- other recent hybrid method involving RRT is RRT-A* motion planning method presented in [24]. The method focused on optimizing RRT path generation for non-holonomic mobile robots in known environ- ment. A* heuristic algorithm was used to decide the selection of the nearest node during the generation of the tree. The authors acknowledged the fact that the method suffered local minima problem. The authors indicated that the path length obtained using RRT-A* method was more optimal compared to goal-biased RRT method. This analysis, however, compared Man- hattan based RRT-A* to Euclidean based goal-bi- ased RRT which are of different metric functions as demonstrated in the paper. Comparing Euclide- an-based RRT-A* to Euclidean-based goal-biased RRT from their results, the proposed method utilized 849% of the time to achieve 6% path length improve- ment in sparse environment. In dense environment, 222% time was used to achieve 4.27% path length improvement over Euclidean-based goal biased RRT.
Show more

16 Read more

Intelligent Control and Path Planning of Multiple Mobile Robots Using Hybrid Ai Techniques

Intelligent Control and Path Planning of Multiple Mobile Robots Using Hybrid Ai Techniques

This work reports the problem of intelligent control and path planning of multiple mobile robots. Soft computing methods, based on three main approaches i.e. 1) Bacterial Foraging Optimization Algorithm, 2) Radial Basis Function Network and 3) Bees Algorithm are presented. Initially, Bacterial foraging Optimization Algorithm (BFOA) with constant step size is analyzed for the navigation of mobile robots. Then the step size has been made adaptive to develop an Adaptive Bacterial Foraging Optimization (ABFO) controller. Further, another controller using radial basis function neural network has been developed for the mobile robot navigation. Number of training patterns are intended to train the RBFN controller for different conditions arises during the navigation. Moreover, Bees Algorithm has been used for the path planning of the mobile robots in unknown environments. A new fitness function has been used to perform the essential navigational tasks effectively and efficiently.
Show more

213 Read more

Exploratory Path Planning for Mobile Robots in Dynamic Environments with Ant Colony Optimization

Exploratory Path Planning for Mobile Robots in Dynamic Environments with Ant Colony Optimization

In the path planning task for autonomous mobile robots, robots should be able to plan their trajectory to leave the start position and reach the goal, safely. There are several path planning approaches for mobile robots in the literature. Ant Colony Optimization algo- rithms have been investigated for this problem, giving promising results. In this paper, we propose the Max-Min Ant System for Dy- namic Path Planning algorithm for the exploratory path planning task for autonomous mobile robots based on topological maps. A topological map is an environment representation whose focus is the main reference points of the environment and their connec- tions. Based on this representation, the path can be composed by a sequence of state/actions pairs, which facilitates the navigability of the path, with no need to have the information of the complete map. The proposed algorithm was evaluated in static and dynamic envi- ronments, showing promising results in both of them. Experiments in dynamic environments show the adaptability of our proposal.
Show more

10 Read more

Path Planning of Multiple Mobile Robots

Path Planning of Multiple Mobile Robots

ABSTRACT: In this paper, we study how and to what extent multiple mobile robots can be guided to in a desired direction to explore an unknown environment and map an area of interest. The scope of the work focuses mainly on the controllers’ design for multiple robotspath planning and motion coordination. Fuzzy control methodology is developed to: 1. Ensure a best path planning and motion coordination of the mobiles, 2. Avoid the collision and store the position of the obstacles. Genetic algorithm is implemented to optimize the different parameters of the controllers and optimize the robotspath in case of collision avoidance. To store the obstacle and map the area, the sensors localize the obstacles and store their coordinates in a binary matrix. The algorithms and their implementation are explained in addition to the demonstration of experimental results to illustrate the efficiency and the performances of the study.
Show more

9 Read more

SmartPATH: An Efficient Hybrid. ACO-GA Algorithm for Solving the Global Path Planning Problem of Mobile Robots

SmartPATH: An Efficient Hybrid. ACO-GA Algorithm for Solving the Global Path Planning Problem of Mobile Robots

solution for all the different environments. In [26], the authors investigated the capabilities of genetic algorithms (GA) for solving the global path planning problem in large-scale grid maps. They proposed a GA approach for efficiently finding an (or near) optimal path in the grid map. They considered three differents crossover operators, namely one-point crossover, two-point crossover and an improved crossover. A statistical evaluation of the proposed GA approach in terms of solution quality was conducated, and compared against the well-known A* algorithm as a reference. Simulation results showed that GA is able to find the optimal paths in large environments equally to A* in almost all the simulated cases. The execution time was not evaluated in this work. In [32], the authors proposed a new path planning algorithm for a mobile robot based on the genetic algorithms approach. The authors considered both static and dynamic obstacles in an unknown environment. The interesting point of this paper is that the novel algorithm was tested on a real-world application using Pioneer III mobile robot. The authors were positive toward the effectiveness of GA for solving path planning, however we believe that the experimental results was not extensive and still need further investigation as the paper didn’t provide a comparison between simulation and experimental studies. In [33], the authors proposed a genetic algorithm with only the crossover operator to improve execution time and computational cost. They used adaptive population size and fixed length chromosomes, each path is represented by two chromosomes, one for x-coordinate and one for y-coordinate. A comparative study between different metaheuristic approaches classified as trajectory-based and population-based approaches for solving the global path planning problem of mobile robots was conducted in [34] . Three methods were evaluated namely tabu search, simulated annealing and GA. It was demonstrated through simulations that simulated annealing outperforms the other planners in terms of execution time, while tabu search was proved to provide the best solution in terms of path length.
Show more

15 Read more

Dynamic Path Planning for Mobile Robots with Cellular Learning Automata

Dynamic Path Planning for Mobile Robots with Cellular Learning Automata

The main contribution of this study is to provide path planning alternatives for mobile robots using cellular learning automata. Existing path planning methods for mobile robots implemented in ROS (Robot Operating System) [17] were designed using Dijkstra’s algorithm and the A* algorithm, where the path planning is computed step by step between two nodes of an irregular mesh. Our approach extends the existing method by exploiting the regularity of cellular automata in which the distance between two adjacent cells is equal. Furthermore, we use cellular learning automata to optimize the path generated in the first stage.
Show more

14 Read more

Grey Wolf Optimizer-Based Approaches to Path Planning and Fuzzy Logic-based Tracking Control for Mobile Robots

Grey Wolf Optimizer-Based Approaches to Path Planning and Fuzzy Logic-based Tracking Control for Mobile Robots

High performance controllers are currently developed for mobile robots in order to cope with the three main navigation control problems [25], [24], [17], [20], i.e. path planning (or following), point stabilization and tracking control (or tracking a reference trajectory, further divided in local and global tracking problems [24]. The control of Nonholonomic Wheeled Mobile Robots (NWMRs) has received much research interest during the past two decades because of the effects of nonholo- nomic constraints on the feasible control signals of this class of nonsmooth or nonholonomic systems. Representative approaches to tracking control are backstepping [75], adaptive [49], [23], fuzzy [10], periodic [9] and neural networks [30] control. Multi-robot Path planning (PaPl) problems are gen- erally solved by centralized and decentralized algorithms. While decentralized algorithms generate independently (separately) collision-free paths for each robot avoiding possible inter-robot collisions, centralized algorithms consider each robot as a subsystem, thus global optimization is enabled.
Show more

17 Read more

Path Planning Usage For Mobile Robots

Path Planning Usage For Mobile Robots

Meza street 1/4-547, Riga, LV 1048, Latvia; ph.: +(371)67089584, e-mail: err@inbox.lv Abstract. The paper deals with path planning programme for mobile robots. The aim of the paper is to develop a path planning programme for mobile robots that is based on simulation software development. The results of the careful analysis were considered for optimal path planning algorithms. The experimental evidence was proposed to demonstrate the effectiveness of the algorithm for steady covered space. The results described in this work can be extended in a number of directions, and applied to other algorithms.
Show more

6 Read more

A NEW METHOD FOR LOCALIZATION OF WIRELESS SENSOR NETWORKS BASED ON PATH PLANNING OF MOBILE ROBOTS

A NEW METHOD FOR LOCALIZATION OF WIRELESS SENSOR NETWORKS BASED ON PATH PLANNING OF MOBILE ROBOTS

Pathiran et. al [2] used radio waves and mo- bile robot for localization and measurement of the power of the received signal to estimate the distance of a mobile robot. Their simulation was made for four sensors and they did not present a clear path for movement of their mobile ro- bot. Corke et. al [3, 4] used a flying robot which is equipped with GPS for localization and the measurement of radio waves’ power to estimate the distance to a mobile robot. There are fixed robots in their method which localize a percent- age of network nodes. Sichitiu and Ramadurai [5, 6] used GPS and measurement of the re- ceived signal power of radio waves to determine the distance between the node and mobile robot. Su et. al [7, 8] presented a method independent of the distance. In this method, a mobile robot which is equipped with GPS moves in opera- tion environment and broadcasts its location. To design the path of mobile robot so that network nodes can localize the robot using the received signals of their own, three static paths of Scan, Doublescan and Hilbert are suggested in [9]. Then, some methods were proposed to improve movement path of robot to increase the accura- cy of localization. In [10], two paths of Circles and S-curves were suggested. Also, in [11], two dynamic algorithms for the path designing were called BRF and BTG were proposed which have better performance with respect to the energy consumed by robot compared with static meth- ods of path designing.
Show more

8 Read more

Investigation On Path Planning For Autonomous Mobile Robots In Partially Observable Environment

Investigation On Path Planning For Autonomous Mobile Robots In Partially Observable Environment

When there are changes in the domain map due to changes in object arrangements, the robot automatically updates the map and recalculates the path to a destination [12]. The path planning algorithm such as modified pulse-coupled neural network (MPCNN) [13] uses a simple neural network by first collecting the robot’s location, destination and obstacles that plan the shortest collision-free path so that the robot moves to the grid cell containing the highest reward [12]. Energy consumed by the robot can be reduced when planning an optimal path [13]. However, MPCNN do not include a learning function that lets the robot to learn.
Show more

24 Read more

Design and performance analysis of global path planning techniques for autonomous mobile robots in grid environments

Design and performance analysis of global path planning techniques for autonomous mobile robots in grid environments

. A  generates an optimal path but its computational time is high and the clearance space from the obstacle is low. The APF algorithm suffers from local minima problem. In case of FCE, the path length and turning value are comparatively larger than all other methods. The authors considered that in case of planning in unknown environments, a good path is relatively short, keeps some clearance distance from the obstacles and is smooth. They concluded that APF and the proposed FCE techniques are better with respect to this attributes. Al-Arif et al. 20 evaluated the performance of A*, Dijkstra and breadth-first search to find out the most suitable path planning algorithm for rescue operation. The three methods are compared for two cases: for one starting one-goal cells and for one starting multi-goal cells in 256  256 grid in terms of path length, number of explored nodes and CPU time. A* was found to be the best choice in case of maps containing obstacles. However, for free maps, breadth- first search is the best algorithm for both cases (one starting one-goal cell and one starting multi-goal cells) if the execu- tion time is the selection criteria. A* can be a better alterna- tive if the memory consumption is the selection criteria.
Show more

17 Read more

Efficient Path Planning for Nonholonomic Mobile Robots

Efficient Path Planning for Nonholonomic Mobile Robots

Abstract— This work addresses path planning for nonholo- nomic robots moving in two-dimensional space. The problem consists in computing a sequence of line segments that leads from the current configuration of the robot to a target location, while avoiding a given set of obstacles. We describe a planning algorithm that has the advantage of being very efficient, requiring less of one millisecond of CPU time for the case studies that we have considered, and produces short paths. Our method relies on a search in a Voronoi graph that characterizes the possible ways of moving around obstacles, followed by a string-pulling procedure aimed at improving the resulting path.
Show more

6 Read more

Path Planning Algorithms for Autonomous Mobile Robots

Path Planning Algorithms for Autonomous Mobile Robots

The idea of generating a set of waypoints and tracking the waypoints is one of the ear- liest problems in video game development [31]. Like all other problems in robotics, game developers have already come up with a smart, efficient and easy to implement algorithm for this problem. The pure-pursuit algorithm are among the most common algorithms of path tracking for mobile robots or even UAVs [30]. The algorithm and its variations are so efficient and powerful that they were used by multiple different teams in the 2007 DARPA grand challenge, MIT [21] , Stanford [34] and Carnegie [35]. The Stanford team even won the competitions with this algorithm with a slight change in both name 1 and logic. The algorithm for mobile robot and car like vehicles was first introduced by Craig Coulter [9] at Carnegie Mellon University. If the speed of the vehicle is restricted, such as an indoor lab environment, the problem of controlling the steering of a robot can be approached as a pure kinematic problem. The performance of the algorithm has been compared to other modern
Show more

118 Read more

Probabilistic roadmap based path planning for mobile robots

Probabilistic roadmap based path planning for mobile robots

The review includes Path Planning Approaches, Global Path Planning, Local Path Planning, Classification of Robot Path Planning Method, Metric Maps, Path Planning on Metric Maps and Confi[r]

34 Read more

Experimental Comparison of Trajectory Planning Algorithms for Wheeled Mobile Robots

Experimental Comparison of Trajectory Planning Algorithms for Wheeled Mobile Robots

Mobile robotics is an active research area that is continuously evolving to enable mobile robots display precise movements through simple user-generated velocity commands. Nowadays, unmanned mobile robot application domains has extended in industrial as well as in service sectors [1]. It has also attracted lot of interests from scientific, governmental, and residential areas [2-3]. Another great result from this advancement is that places unreachable to mankind before are now accessible through meticulous operations of mobile robot systems such as exploration of outer space bodies [4], recognition of targets in conflict and disaster zones [5], navigation in hazardous environments, and dangerous military operations [6]. In cases where the operating environment is known, navigation of mobile robots is a systematic operation that is divided into three main phases; path planning [7], trajectory generation [8], and tracking control [9].
Show more

5 Read more

Motion Control of Automated Mobile Robots in Dynamic Environment

Motion Control of Automated Mobile Robots in Dynamic Environment

Robot path planning in the unknown dynamic environment has been a challenge for the researchers from the last decades. The solution of this kind of problem plays a crucial role in the field of robotics. The main task of path planning of robot is to move the robot from its source to a goal position while avoiding obstacles and follow the optimum path. It’s an optimization problem because it involves the generation of optimal collision free trajectories by the mobile robot. There are two types of path planning problem such as global path planning and local path planning. In global path planning problem the environment will be familiar with the robot while in local path planning the robot is ignorant of the surrounding. For solving the optimization problem a socially inspired popular meta-heuristic optimization algorithm is used; which is known as Particle Swarm Optimization (PSO) technique. PSO was inspired by the social behaviour of birds and fish.
Show more

58 Read more

Guidelines in Nonholonomic Motion Planning for Mobile Robots

Guidelines in Nonholonomic Motion Planning for Mobile Robots

Perhaps the most exciting issues come from practical applications. The mo- tion of the robot should be performed in the physical world. The gap between the world modeling and the real world is critical. Usually, path planning as- sumes a two-steps approach consisting in planning a path and then executing it via feedback control. This assumption holds under the condition that the geometric model of the environment is accurate and that the robot’s Cartesian coordinates are directly and exactly measured. Designing a control law that executes a planed path defined in a robot centered frame may be sufficient in manufacturing applications; it is not when dealing with applications such as mobile robot outdoor navigation for instance. In practice, the geometric model of the world and the localisation of the robot should be often performed through the use of embarked extereoceptive sensors (ultrasonic proximeters, infrared or laser range finder, laser or video cameras . . . ).
Show more

54 Read more

A Cooperative Path Planning Algorithm for a Multiple Mobile Robot System in a Dynamic Environment

A Cooperative Path Planning Algorithm for a Multiple Mobile Robot System in a Dynamic Environment

The probabilistic roadmap method is also a popular path planning scheme for mobile robots. This method uses a sampling technique to discover a sparse representation of obstacles in a configuration space. Reference [9] makes use of a probabilistic roadmap to avoid occlusions of the target and any obstacles. The probabilistic roadmap method is easily implemented and can be applied to complex environments. However, this method may fail when the environment does not have a sufficient number of free points with which to construct a probabilistic map. There are also many heuristic methods that can be used for path planning, such as rapidly exploring random trees [10], neural networks [11], genetic algorithms [12], simulated annealing [13], ant colony optimization [14], particle swarm optimizer and fuzzy logic [15, 16]. These methods can yield feasible schemes; however, their optimality cannot be assured with any of the above-mentioned methods.
Show more

13 Read more

Show all 10000 documents...