Safety-oriented path planning for articulated robots

Robotica ◽  
2013 ◽  
Vol 31 (6) ◽  
pp. 861-874 ◽  
Author(s):  
Bakir Lacevic ◽  
Paolo Rocco
Keyword(s):  
Path Planning ◽  
Motion Planning ◽  
Case Studies ◽  
Configuration Space ◽  
Safety Margin ◽  
Robotic Manipulators ◽  
Heuristic Function ◽  
Oriented Path ◽  
Planning Algorithms ◽  
Articulated Robots

SUMMARYThis work presents an approach to motion planning for robotic manipulators that aims at improving path quality in terms of safety. Safety is explicitly assessed using the quantity called danger field. The measure of safety can easily be embedded into a heuristic function that guides the exploration of the free configuration space. As a result, the resulting path is likely to have substantially higher safety margin when compared to one obtained by regular planning algorithms. To this end, four planning algorithms have been proposed. The first planner is based on volume trees comprised of bubbles of free configuration space, while the remaining ones represent modifications of classical sampling-based algorithms. Several numerical case studies are carried out to validate and compare the performance of the presented algorithms with respect to classical planners. The results indicate significantly lower danger metric for paths obtained by safety-oriented planners even with some decrease in running time.

Tool path optimization for robotic surface machining by using sampling-based motion planning algorithms

2020 ◽  
pp. 1-28
Author(s):  
Lu Lei ◽  
Jiong Zhang ◽  
Xiaoqing Tian ◽  
Jiang Han ◽  
Hao Wang
Keyword(s):  
Motion Planning ◽  
Configuration Space ◽  
Tool Path ◽  
Path Optimization ◽  
Machining Process ◽  
Axis Orientation ◽  
Surface Machining ◽  
Tool Path Optimization ◽  
Tool Axis ◽  
Planning Algorithms

Abstract This paper develops a tool path optimization method for robot surface machining by sampling-based motion planning algorithms. In the surface machining process, the tool-tip position needs to strictly follow the tool path curve and the posture of the tool axis should be limited in a certain range. But the industrial robot has at least six degrees of freedom (Dof) and has redundant Dofs for surface machining. Therefore, the tool motion of surface machining can be optimized using the redundant Dofs considering the tool path constraints and limits of the tool axis orientation. Due to the complexity of the problem, the sampling-based motion planning method has been chosen to find the solution, which randomly explores the configuration space of the robot and generates a discrete path of valid robot state. During the solving process, the joint space of the robot is chosen as the configuration space of the problem and the constraints for the tool-tip following requirements are in the operation space. Combined with general collision checking, the limited region of the tool axis vector is used to verify the state's validity of the configuration space. In the optimization process, the sum of path length of each joint of the robot is set as the optimization objective. The algorithm is developed based on the open motion planning library (OMPL) which contains the state-of-the-art sampling-based motion planners. Finally, two examples are used to demonstrate the effectiveness and optimality of the method.

scholarly journals Path Planning Usage for Autonomous Agents

2015 ◽  
Vol 2 ◽  
pp. 40
Author(s):  
Edvards Valbahs ◽  
Peter Grabusts
Keyword(s):  
Path Planning ◽  
Motion Planning ◽  
Mobile Robots ◽  
Autonomous Agents ◽  
Optimal Path ◽  
Careful Analysis ◽  
Algorithm Analysis ◽  
Simulation Data ◽  
Wide Range ◽  
Planning Algorithms

In order to achieve the wide range of the robotic application it is necessary to provide iterative motions among points of the goals. For instance, in the industry mobile robots can replace any components between a storehouse and an assembly department. Ammunition replacement is widely used in military services. Working place is possible in ports, airports, waste site and etc. Mobile agents can be used for monitoring if it is necessary to observe control points in the secret place. The paper deals with path planning programme for mobile robots. The aim of the research paper is to analyse motion-planning algorithms that contain the design of modelling programme. The programme is needed as environment modelling to obtain the simulation data. The simulation data give the possibility to conduct the wide analyses for selected algorithm. Analysis means the simulation data interpretation and comparison with other data obtained using the motion-planning. 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.

An Efficient Path-Planning Algorithm for a Robotic Manipulator by Automatic Selection Search of Indispensable Regions in Its Configuration Space

1992 ◽  
Vol 4 (5) ◽  
pp. 378-385
Author(s):  
Hiroshi Noborio ◽  
◽  
Motohiko Watanabe ◽  
Takeshi Fujii
Keyword(s):  
Path Planning ◽  
Motion Planning ◽  
Configuration Space ◽  
Robotic Manipulator ◽  
Joint Space ◽  
Practical Applications ◽  
Continuous Sequence ◽  
Angle Difference ◽  
Planning Algorithm ◽  
Path Planning Algorithm

In this paper, we propose a feasible motion planning algorithm for a robotic manipulator and its obstacles. The algorithm quickly selects a feasible sequence of collision-free motions while adaptively expanding a graph in the implicit configuration joint-space. In the configuration graph, each arc represents an angle difference of the manipulator joint; therefore, an arc sequence represents a continuous sequence of robot motions. Thus, the algorithm can execute a continuous sequence of collision-free motions. Furthermore, the algorithm expands the configuration graph only in space which is to be cluttered in the implicit configuration joint-space and which is needed to select a collision-free sequence between the initial and target positions/orientations. The algorithm maintains the configuration graph in a small size and quickly selects a collision-free sequence from the configuration graph, whose shape is to be simple enough to move the manipulator in practical applications.

scholarly journals Survey of Robot 3D Path Planning Algorithms

2016 ◽  
Vol 2016 ◽  
pp. 1-22 ◽  
Author(s):  
Liang Yang ◽  
Juntong Qi ◽  
Dalei Song ◽  
Jizhong Xiao ◽  
Jianda Han ◽  
...  
Keyword(s):  
Path Planning ◽  
Motion Planning ◽  
Free Path ◽  
Optimal Path ◽  
Temporal Constraints ◽  
Three Dimension ◽  
Underwater Robots ◽  
Kinematic Constraints ◽  
Aerial Robots ◽  
Planning Algorithms

Robot 3D (three-dimension) path planning targets for finding an optimal and collision-free path in a 3D workspace while taking into account kinematic constraints (including geometric, physical, and temporal constraints). The purpose of path planning, unlike motion planning which must be taken into consideration of dynamics, is to find a kinematically optimal path with the least time as well as model the environment completely. We discuss the fundamentals of these most successful robot 3D path planning algorithms which have been developed in recent years and concentrate on universally applicable algorithms which can be implemented in aerial robots, ground robots, and underwater robots. This paper classifies all the methods into five categories based on their exploring mechanisms and proposes a category, called multifusion based algorithms. For all these algorithms, they are analyzed from a time efficiency and implementable area perspective. Furthermore a comprehensive applicable analysis for each kind of method is presented after considering their merits and weaknesses.

Adaptive rapidly-exploring random tree for efficient path planning of high-degree-of-freedom articulated robots

2015 ◽  
Vol 229 (18) ◽  
pp. 3361-3367 ◽  
Author(s):  
Dong-Hyung Kim ◽  
Youn-Sung Choi ◽  
Sang-Ho Kim ◽  
Jing Wu ◽  
Chao Yuan ◽  
...  
Keyword(s):  
Path Planning ◽  
Configuration Space ◽  
Planning Process ◽  
Degree Of Freedom ◽  
Random Tree ◽  
High Dimensional ◽  
Simulation Results ◽  
Articulated Robots ◽  
Path Planner ◽  
High Degree

This article proposes a method for the path planning of high-degree-of-freedom articulated robots with adaptive dimensionality. For efficient path planning in a high-dimensional configuration space, we first describe an adaptive body selection that selects the robot bodies depending on the complexity of the path planning. Then, the involved joints of the selected body are included in the planning process. That is, it builds the C-space (configuration space) with adaptive dimensionality for sampling-based path planner. Next, by using adaptive body selection, the adaptive rapidly-exploring random tree (RRT) algorithm is introduced, which incrementally grows RRTs in the adaptive dimensional C-space. We show through several simulation results that the proposed method is more efficient than the basic RRT-based path planner, which requires full-dimensional planning.

scholarly journals Adaptation Algorithm of Geometric Graphs for Robot Motion Planning in Dynamic Environments

2016 ◽  
Vol 2016 ◽  
pp. 1-19 ◽  
Author(s):  
Jae-Han Park ◽  
Ji-Hun Bae ◽  
Moon-Hong Baeg
Keyword(s):  
Motion Planning ◽  
Configuration Space ◽  
Distributed Processing ◽  
Graph Algorithm ◽  
Dynamic Environments ◽  
Robot Motion ◽  
Geometric Graphs ◽  
Adaptation Algorithm ◽  
Adaptation Mechanism ◽  
Articulated Robots

This study proposes an adaptive graph algorithm for collision-free motion planning of articulated robots in dynamic environments. For this purpose, deformations of the configuration space were analyzed according to the changes of the workspace using various simulations. Subsequently, we adopted the principles of gas motion dynamics in our adaptation algorithm to address the issue of the deformation of the configuration space. The proposed algorithm has an adaptation mechanism based on expansive repulsion and sensory repulsion, and it can be performed to provide the entire adaptation using distributed processing. The simulation results confirmed that the proposed method allows the adaptation of the roadmap graph to changes of the configuration space.

scholarly journals Developing a Realistic Simulation Environment for Robotics Harvesting Operations in a Vegetable Greenhouse

Agronomy ◽  
2021 ◽  
Vol 11 (9) ◽  
pp. 1848
Author(s):  
Brent Van De Walker ◽  
Brendan Byrne ◽  
Joshua Near ◽  
Blake Purdie ◽  
Matthew Whatman ◽  
...  
Keyword(s):  
Path Planning ◽  
Motion Planning ◽  
Field Testing ◽  
Growing Season ◽  
Simulation Environment ◽  
3D Images ◽  
Profit Margins ◽  
Realistic Simulation ◽  
Complex Operation ◽  
Planning Algorithms

Vegetable greenhouse operations are labour intensive. Automating some of these operations can save growers significant costs in an industry with low-profit margins. One of the most demanding operations is harvesting. Harvesting a tomato is a complex operation due to the significant clutter inherent to a greenhouse and the fragility of the object being grasped. Improving grasp and motion planning requires setting up a realistic testbed or testing on-site, which is expensive and time-limited to the growing season and specific environment. As such, it is important to develop a simulation environment to model this operation to help test various strategies before field testing can be conducted. Using the method presented in this work, 3D images are taken from a commercial greenhouse and used to develop a physics-based realistic simulation environment. The environment is then used to simulate a picking operation using various path planning algorithms to investigate the best algorithm to use in this case. The results show that this environment can be used to explore the best approaches to automate harvesting solutions in a vegetable greenhouse environment.

Sign in / Sign up

Export Citation Format

Share Document