Real-time path planning optimisation algorithm for obstacle avoidance

This paper presents a new real-time path planning algorithm suitable for implementation on small mobile robots to aid navigation in unknown environments. The Random Obstacle Avoidance (R.O.A) algorithm was developed for small robots and it can be used as the basis for mapping the environment. The algorithm has been tested through a specially developed simulation environment using MATLAB. The main characteristics of the algorithm are simplicity, ease of implementation, speed, and efficiency

Safe Local Exploration for Replanning in Cluttered Unknown Environments for Micro-Aerial Vehicles

In order to enable Micro-Aerial Vehicles (MAVs) to assist in complex, unknown, unstructured environments, they must be able to navigate with guaranteed safety, even when faced with a cluttered environment they have no prior knowledge of. While trajectory optimization-based local planners have been shown to perform well in these cases, prior work either does not address how to deal with local minima in the optimization problem, or solves it by using an optimistic global planner. We present a conservative trajectory optimization-based local planner, coupled with a local exploration strategy that selects intermediate goals. We perform extensive simulations to show that this system performs better than the standard approach of using an optimistic global planner, and also outperforms doing a single exploration step when the local planner is stuck. The method is validated through experiments in a variety of highly cluttered environments including a dense forest. These experiments show the complete system running in real time fully onboard an MAV, mapping and replanning at 4 Hz.Comment: Accepted to ICRA 2018 and RA-L 201

Numerical approach of collision avoidance and optimal control on robotic manipulators

Collision-free optimal motion and trajectory planning for robotic manipulators are solved by a method of sequential gradient restoration algorithm. Numerical examples of a two degree-of-freedom (DOF) robotic manipulator are demonstrated to show the excellence of the optimization technique and obstacle avoidance scheme. The obstacle is put on the midway, or even further inward on purpose, of the previous no-obstacle optimal trajectory. For the minimum-time purpose, the trajectory grazes by the obstacle and the minimum-time motion successfully avoids the obstacle. The minimum-time is longer for the obstacle avoidance cases than the one without obstacle. The obstacle avoidance scheme can deal with multiple obstacles in any ellipsoid forms by using artificial potential fields as penalty functions via distance functions. The method is promising in solving collision-free optimal control problems for robotics and can be applied to any DOF robotic manipulators with any performance indices and mobile robots as well. Since this method generates optimum solution based on Pontryagin Extremum Principle, rather than based on assumptions, the results provide a benchmark against which any optimization techniques can be measured

Hybrid PSO-cubic spline for autonomous robots optimal trajectory planning

This paper presents a new version of the Particle Swarm Optimization algorithm where the particles are replaced by spline functions. The developed algorithm generates smooth motion trajectories with two times continuously differentiable curvature avoiding obstacles placed in the workspace. It can be used for autonomous robot path planning or transport problems. The spline based trajectory generation gives us continuous, smooth and optimized path trajectories. Simulation and experimental results demonstrate the effectiveness of the proposed method.info:eu-repo/semantics/publishedVersio

Path Planning Based on Parametric Curves

Parametric curves are extensively used in engineering. The most commonly used parametric curves are, Bézier, B-splines, (NURBSs), and rational Bézier. Each and every one of them has special features, being the main difference between them the complexity of their mathematical definition. While Bézier curves are the simplest ones, B-splines or NURBSs are more complex. In mobile robotics, two main problems have been addressed with parametric curves. The first one is the definition of an initial trajectory for a mobile robot from a start location to a goal. The path has to be a continuous curve, smooth and easy to manipulate, and the properties of the parametric curves meet these requirements. The second one is the modification of the initial trajectory in real time attending to the dynamic properties of the environment. Parametric curves are capable of enhancing the trajectories produced by path planning algorithms adapting them to the kinematic properties of the robot. In order to avoid obstacles, the shape modification of parametric curves is required. In this chapter, an algorithm is proposed for computing an initial Bézier trajectory of a mobile robot and subsequently modifies it in real time in order to avoid obstacles in a dynamic environment

Development and implementation of a B-Spline motion planning framework for autonomous mobile robots

O projeto enquadra-se na área da robótica. A ideia deste projeto é utilizar as propriedades das curvas b-spline para resolver problemas de otimização de motion planning. Esta abordagem permite desviar dos tradicionais motion planning algorithms que são normalmente utilizados. Devido á sua natureza matemática, esta abordagem permite a utilização de teoremas como o Separating Hyperplane Thereoem para realizar o desvio de obstáculos. Um aspecto importante a ter em conta é que este projeto irá ser integrado com os projetos desenvolvidos por outros alunos de modo a participar na competição The Autonomous Ship Challenge, a ser realizada na Noruega.This project fits within the area of robotics. The main idea is to utilize the properties of b-splines curves in order to solve motion planning optimization problems. This approach allows to deviate from the traditional motion planning algorithms, that are usually used. Due to its mathematical nature, this approach allows the use of theorems like the Separating Hyperplane Theorem for the obstacle avoidance problem. An important aspect to notice is that this project will be integrated with the other projects developed by other students in order to participate in "The Autonomous Ship Challenge" competition to be held in Norway