Development of Obstacle Avoidance Control for Robotic Products Using Potential Method

Similar documents
AUV Cruise Path Planning Based on Energy Priority and Current Model

Fundamental Technologies Driving the Evolution of Autonomous Driving

Optimizing Simulation of Movement in Buildings by Using People Flow Analysis Technology

HOG-Based Person Following and Autonomous Returning Using Generated Map by Mobile Robot Equipped with Camera and Laser Range Finder

Unit 3, Lesson 3.1 Creating and Graphing Equations Using Standard Form

Unit 5: Part 1 Planning

Jo-Car2 Autonomous Mode. Path Planning (Cost Matrix Algorithm)

A motion planning method for mobile robot considering rotational motion in area coverage task

Path Planning by Using Generalized Voronoi Diagrams and Dijkstra Algorithm. Lai Hon Lin. Project Proposal. Computational Geometry

MHI Announces Changes in Executive-level Personnel

Redundancy Resolution by Minimization of Joint Disturbance Torque for Independent Joint Controlled Kinematically Redundant Manipulators

DETERMINATION OF THE OPTIMUM PATH ON THE EARTH S SURFACE. (extended abstract) Abstract

Modeling and Simulation of the Seismic TETwalker Concept

Development of Real Time Wave Simulation Technique

UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE

Advancing the MRJ project

4.5 Conservative Forces

Splines, or: Connecting the Dots. Jens Ogniewski Information Coding Group

SVG GRAPHICS LANGUAGE AS A DESCRIPTION OF A 2D PATH IN ROBOT PROGRAMMING TASKS

RobotEye RE08 3D LIDAR 3D Laser Scanning System. Product Datasheet

Let us start with a quick revision of algebra and how to work with variables. Now let us look at the simpler topic, namely Substitution.

1724. Mobile manipulators collision-free trajectory planning with regard to end-effector vibrations elimination

Neural Networks for Obstacle Avoidance

1498. End-effector vibrations reduction in trajectory tracking for mobile manipulator

Construction Progress Management and Interior Work Analysis Using Kinect 3D Image Sensors

SPECIAL TECHNIQUES-II

Adaptive Cruise Control

An Iterative Greedy Approach Using Geographical Destination Routing In WSN

Planning: Part 1 Classical Planning

6. NEURAL NETWORK BASED PATH PLANNING ALGORITHM 6.1 INTRODUCTION

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

A Fundamental Study for Creating 3D CG Animation of an Assembly Work

College Algebra. Fifth Edition. James Stewart Lothar Redlin Saleem Watson

3D Terrain Sensing System using Laser Range Finder with Arm-Type Movable Unit

FOR IMMEDIATE RELEASE

Robot Path Planning Method Based on Improved Genetic Algorithm

A Game Map Complexity Measure Based on Hamming Distance Yan Li, Pan Su, and Wenliang Li

The Fly & Anti-Fly Missile

Coupling of STAR-CCM+ to Other Theoretical or Numerical Solutions. Milovan Perić

Stable Grasp and Manipulation in 3D Space with 2-Soft-Fingered Robot Hand

Two-Dimensional Waves

MOTION TRAJECTORY PLANNING AND SIMULATION OF 6- DOF MANIPULATOR ARM ROBOT

Motion Planning of Multiple Mobile Robots for Cooperative Manipulation and Transportation

AUTOMATED 4 AXIS ADAYfIVE SCANNING WITH THE DIGIBOTICS LASER DIGITIZER

Chapter 6: Average Waiting Time (AWT), the misleading parameter. The Average Waiting Time (AWT) calculation method

Development of an autonomous driving ECU platform for streamlining the development of autonomous driving vehicle applications

ACTA TECHNICA CORVINIENSIS Bulletin of Engineering Tome X [2017] Fascicule 2 [April June] ISSN:

NEWS RELEASE MITSUBISHI HITACHI POWER SYSTEMS AFRICA EXECUTIVES ANNOUNCED

Lecture Outlines Chapter 26

PATH PLANNING USING THE NEWTONIAN POTENTIAL

5. Consider the tree solution for a minimum cost network flow problem shown in Figure 5.

Wave front Method Based Path Planning Algorithm for Mobile Robots

Range Imaging Through Triangulation. Range Imaging Through Triangulation. Range Imaging Through Triangulation. Range Imaging Through Triangulation

II. NETWORK MODEL The network consists of two types of nodes:

Safe Prediction-Based Local Path Planning using Obstacle Probability Sections

A Simple Interface for Mobile Robot Equipped with Single Camera using Motion Stereo Vision

A Three dimensional Path Planning algorithm

Cooperative Conveyance of an Object with Tethers by Two Mobile Robots

Surveyor Autocalibration Guide Objective Imaging Ltd.

Elastic Bands: Connecting Path Planning and Control

A Structural Optimization Method of Genetic Network Programming. for Enhancing Generalization Ability

Basic Concepts And Future Directions Of Road Network Reliability Analysis

Beams. Lesson Objectives:

New generation touch-sensitive CNC control compatible with Industry 4.0

A fast method for estimating railway passenger flow

Study on the Signboard Region Detection in Natural Image

Geodesics in heat: A new approach to computing distance

Economizing the stability of rubble-mound breakwaters using artificial neural network

Final Report: Dynamic Dubins-curve based RRT Motion Planning for Differential Constrain Robot

Motion Analysis. Motion analysis. Now we will talk about. Differential Motion Analysis. Motion analysis. Difference Pictures

Scara Robot Path Planning Through flood fill Algorithm

A Fuzzy Local Path Planning and Obstacle Avoidance for Mobile Robots

Selective Space Structures Manual

ICT in Natural Disasters

Motorized Linear Slides. EZS2 Series

Fast Local Planner for Autonomous Helicopter

Summer Packet 7 th into 8 th grade. Name. Integer Operations = 2. (-7)(6)(-4) = = = = 6.

Shape Memory Alloy (SMA) The Future Of Haptics

Robot Vision without Calibration

A Novel Image Transform Based on Potential field Source Reverse for Image Analysis

Advanced machine automation

Navigation Templates for PSA

Unit 1: Sections Skill Set

Motion Planning for Dynamic Knotting of a Flexible Rope with a High-speed Robot Arm

Physics for Scientists & Engineers 2

Manipulator Path Control : Path Planning, Dynamic Trajectory and Control Analysis

Keywords: Thresholding, Morphological operations, Image filtering, Adaptive histogram equalization, Ceramic tile.

Innovative Technologies Realizing Compact PRIMERGY TX120 Server

Combined Vision and Frontier-Based Exploration Strategies for Semantic Mapping

Optimal Path Finding for Direction, Location and Time Dependent Costs, with Application to Vessel Routing

IoT-ready Industrial Controller with Enhanced Data Processing Functions

5.1 Introduction to the Graphs of Polynomials

Leading the way in HMI Design 4.0

People- and Environment-friendly Urban Development Utilizing Geospatial Information

Stress Analysis of Cross Groove Type Constant Velocity Joint

Best Practices Guide for Perimeter Security Applications

Ice Force Modeling for DP Control Systems. Jim Millan, PhD., PEng. John Wang, PhD. MTS DP Conference, October 11-12, 2011

This was written by a designer of inertial guidance machines, & is correct. **********************************************************************

A Novel Field-source Reverse Transform for Image Structure Representation and Analysis

3D Object Model Acquisition from Silhouettes

Transcription:

Mitsubishi Heavy Industries Technical Review Vol. 51 No. 1 (March 2014) 34 Development of Obstacle Avoidance Control for Robotic Products Using Potential Method YUSUKE YASHIRO*1 KAZUKI EGUCHI*1 SATOSHI IWASAKI*2 YOSHIAKI YAMAUCHI*3 MASAHIRO NAKATA*4 In the field of robot development used in areas into which human beings have difficulty entering such as deep water, space and irradiated areas, the need for autonomous products that can operate without being remotely control by a human being has increased. Considering application to more general issues, it is important for autonomous operation to have the capability to avoid unknown obstacles in three dimensional space. Accordingly, Mitsubishi Heavy Industries, Ltd. (MHI) has used the potential method to establish control logic and verified the effectiveness of the logic through simulation. Specifically, the capability to improve the efficiency of avoidance operations in three dimensional space by finding obstacle avoidance paths in horizontal and vertical directions based only on the coordinates of the obstacle was confirmed. 1. Introduction In the past, MHI developed several robotic products used for operations in harsh environments into which human beings have difficulty entering such as deep water, space, nuclear power plants, etc. In recent years, due to improvements in the performance of computers and sensors, the development of autonomous products has been made possible. Technology for the autonomous operation of robots is also in demand in the market as a customer need because it allows the extension of the operational range of autonomous robots and the reduction of fatigue in human beings caused by many hours of control operation. In areas where robotic products are used, there may be obstacles that are not indicated by information on a prepared map because of unexpected events such as disasters, etc. In such cases, a robot with the capability to avoid obstacles switches its operational mode to obstacle avoidance. However, if the obstacle avoidance operation is based on a preset sequence, some obstacle shapes cause repeating and/or exaggerated operation, resulting in a loss of efficiency. Accordingly, to improve the efficiency of avoidance operation of robots, a method to find avoidance paths depending on the shape of obstacles is needed. Considering the application of robots to more general issues, it is favorable that the method is applicable to operations in three dimensional space. One of the methods to find avoidance paths is the potential method(1). This method defines potential functions on a destination position and obstacle positions and determines the moving direction based on the gradients of the functions in order to find a path for moving to the destination position while avoiding the obstacles. The calculation of potential functions can be extended three-dimensionally. This method can also deal with unknown obstacles because the route can be changed in real time based on observation data up to the point of time. *1 Nagasaki Research & Development Center, Technology & Innovation Headquarters *2 Chief Staff Manager, Nagasaki Research & Development Center, Technology & Innovation Headquarters *3 Ship & Ocean Engineering Department, Shipbuilding & Ocean Development Division, Commercial Aviation & Transportation Systems *4 Submarine Department, Naval Ship Division, Integrated Defense & Space Systems

Mitsubishi Heavy Industries Technical Review Vol. 51 No. 1 (March 2014) 35 This paper presents the use of the potential method for the establishment of control logic for finding an obstacle avoidance path of a robotic product and the results of its effectiveness verification through simulation. This control logic stores and updates a certain number of obstacle coordinates detected by the sensor, and calculates potential functions and the gradients based on the coordinates of the obstacles and the destination position to determine a moving direction. A weighting coefficient is used for the potential function and increased or decreased depending on conditions in order to improve the efficiency of avoidance paths and to resolve the issue where the robot stops at a certain position in some cases (deadlock) because a moving direction cannot be successfully determined. In the verification of the control logic through a simulation using different shapes of obstacles without changing the parameters, it was confirmed that an appropriate path could be derived based only on sensor detection results, and efficient obstacle avoidance was realized. 2. Potential method The potential method defines potential functions on a destination position and obstacle positions and determines the moving direction based on the gradients (partial differentiation of each coordinate component) of the functions. Figure 1 shows an image of a potential field (superposition of potential functions) designed on a two-dimensional plane. Smooth potential functions are defined so that those of the obstacles diverge in the direction of positive infinity and that of the destination position diverges in the direction of negative infinity. The gradient of the functions defined for obstacles are in a direction away from the obstacle. On the contrary, the gradient of the function defined for the destination position is in a direction approaching the destination position. The potential field is the superposition of these functions. The gradient (differentiation) of the potential field is in a direction away from obstacles and approaching the destination position. A robot can move to the destination position while avoiding obstacles, using this gradient as the moving direction at that time. The potential method has the following three features. Prior information such as a topographic map is unnecessary because the moving direction is derived according to the information available at that time. The moving path can be changed in real time because the potential field changes when an obstacle is found. Application to three-dimensional space is easy because gradients are derived separately for each of the coordinate components (x, y, ). Figure 1 Example of deriving path based on potential method (two-dimensional plane) This figure shows the derivation flow of the moving direction and path from the gradients of potential functions defined on a two-dimensional plane.

The following formulas (1) and (2) show potential functions, formula (3) shows the calculation of a potential field, and formula (4) shows the calculation of a gradient. 1 (,, ) = (1) ( ) 2 + ( ) 2 +( ) 2 36 (,, ) = 1 ( ) 2 + ( ) 2 +( ) 2 (2) (,, ) = + (3) grad (,, ) =,, (4) ( x, y, z) : Robot position ( x o, yo, z o ): Obstacle position ( x d yd, z d ) ( w o, w d ): Weighting coefficient 3. Establishment of control logic, : Destination position Figure 2 shows the control logic based on the potential method. The movement of the robot depends on the actuators controlled according to the direction derived by the logic. Figure 2 Obstacle avoidance logic based on potential method This figure shows the logic flow using the potential method and its positional relationship to the actual equipment and the actuator. The following capabilities are added to the logic in order to move the robot efficiently to the destination position while avoiding obstacles. - Capability to update the list storing obstacle coordinates - Capability to adjust the weighting coefficients of the potential field Updating the obstacle coordinate list allows the elimination of obstacles already avoided and the creation of a potential field that covers only considerable obstacles. Adjusting the weighting coefficients allows more rapid obstacle avoidance and the reduction of the influence of obstacles having lower avoidance priority on the determination of a path. Figure 3 shows the procedures for the prevention of deadlocks using capabilities to store obstacle coordinates and to adjust the weighting coefficients. In some cases, the potentials of the destination position and the obstacles reach equilibrium when the potential gradient is calculated from all potential functions. In such cases, a small value with the opposite sign in the moving direction is derived repeatedly, resulting in a path that makes the robot almost stop at that position. This is referred to as a deadlock, one of the issues with the use of the potential method. To resolve this issue, the reduction of the weighting coefficient of the destination position with the approaching obstacle kept stored allows the robot to move away from the obstacle temporarily. Then once again returning the weighting coefficient of the destination position to the original value makes the robot move to the destination position while avoiding the stored obstacle, resulting in a path that prevents deadlocks.

37 Figure 3 Deadlock avoidance logic This figure shows the flow of the logic that changes weighting coefficients to prevent deadlocks, the equilibrium of the potential gradients of the obstacle and the destination position. 4. Simulation The effectiveness of the control logic was confirmed using simulation. Figure 4 shows the results of the functional confirmation of the control logic in two-dimensional space. The obstacle and destination position were set so that a deadlock would result. Because this was the verification of only the control logic, the sensor was defined to be able to detect the obstacle in all directions and the robot was defined to have no dynamic characteristics and be able to move in the moving direction without delay. As a result, the robot moved to the destination position while avoiding obstacles and deadlocks, thereby confirming the validity of the control logic. Figure 4 Result of simulation on two-dimensional plane Next, simulation in three-dimensional space including vertical directional movement was performed. This simulation considers the dynamic characteristics of the robot and therefore the similar characteristics as an actual robot were reproduced. The sensor was defined as to be able to detect the obstacle only in three directions (to the front, and left and right obliquely downward). Figure 5 and Figure 6 show the results of horizontal and vertical directional obstacle avoidance simulation, respectively. The result of obstacle avoidance using sequential operation consisting of a change of direction, moving up, moving straight and moving down is shown together for a comparison of avoidance efficiency improvement. For both simulations, the design parameters of the control logic were the same. The obstacle positions were not given in advance and the robot could only acquire the obstacle positions that existed within the detection range of the sensor.

38 Figure 5 Result of vertical directional obstacle avoidance simulation in three-dimensional space (Red: Sequential operation, Blue: Operation according to potential method) Figure 6 Result of horizontal directional obstacle avoidance simulation in three-dimensional space (Red: Sequential operation, Blue: Operation according to potential method) In vertical directional obstacle avoidance using sequential operation, the robot moved up to avoid the obstacle and then moved down to the destination position. When the control logic based on the potential method was used, the robot moved up while turning to avoid the obstacle and then moved down to the destination position. In horizontal directional obstacle avoidance using sequential operation, the robot moved to the destination position through a path including unnecessary turning. This was because the acting time of each operation was tuned for vertical directional obstacle avoidance. This result indicates that sequential operation causes unnecessary avoidance for different obstacles. On the other hand, the avoidance path that was made according to the potential method included no unnecessary turning. This result indicates that the potential method can derive an appropriate avoidance path even with the same parameters because potential functions were made depending on the shape of obstacles. The undulating shape of the path that was made based on the potential method was caused by the fact that the robot could not change the moving direction instantaneously due to its dynamic characteristics. Figures 7 and 8 compare the efficiency of avoidance operation numerically. For both the vertical and horizontal directions, the control logic based on the potential method resulted in a shorter required time and the further reduction of the energy consumption index determined from the actuator travel. In this way, it can be said that the control logic based on the potential method improves the efficiency of obstacle avoidance operation. Figure 7 Comparison of time required for avoiding obstacles (Red: Sequential operation, Blue: Operation according to potential method) Figure 8 Comparison of energy consumption for avoiding obstacles (Red: Sequential operation, Blue: Operation according to potential method)

39 5. Conclusion MHI used the potential method to establish logic for the avoidance of obstacles applicable to three-dimensional space and verified its capability to find a path depending on the shape of an obstacle and to improve the efficiency of avoidance operations through simulation. This method enables the efficient avoidance of unknown obstacles, resulting in the autonomous movement of robots in areas with complicated geography. In the future, MHI will proceed with research of the elements necessary for application to actual equipment such as a weighting coefficients design method in consideration of the detection range of the sensor and the dynamic characteristics of the robot, and contribute to actual operation. References 1. Jen-Hui Chuang et al., An Analytically Tractable Potential Field Model of Free Space and Its Application in Obstacle Avoidance, IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS-PART B: CYBERNETICS, Vol. 28 No. 5 (1998) pp. 729-736