PATH PLANNING FOR AUTOMATED ROBOT PAINTING

ABSTRACT This paper describes the analysis work underlying the pathplanning algorithm for a robotic painting system. The system requires no bespoke production tooling and fills an automation gap in rapid prototyping and manufacturing technology that is currently occupied by hand painting. The system creates images by exposing individual pixels of a photographic coating with a robot-mounted laser. The painting process requires no physical contact so potentially images could be developed on any shape regardless of its complexity: As objects can only be "painted" when their surface can be "hit" (i.e. exposed) by the light beam the system requires six degrees of freedom to ensure all overhanging or reentrant areas can be exposed. The accuracy of serial robots degrades with the length of the kinematic chain (in other words six axis robots cannot position themselves with the same accuracy as four axis ones). Consequently to ensure high precision in the location and orientation of the light source, the object being exposed is mounted on a rotary tilt table within the workspace of a fouraxis robot. This gives a six-degree of freedom positioning system composed of two separate kinematic chains. Although the resulting system is accurate the problems of constructing a coordinated path that allows the light beam to efficiently sweep (i.e. cover) the surface regardless of its geometry are challenging. This paper describes the difficulties and, after reviewing existing path planning algorithms, a new algorithm is introduced firstly by describing the nature of the system's configuration space and then further developing this concept as an alternative to a previously described planning algorithm. Having outlined the approach the paper presents a kinematic model for the system and compares the configuration space approach to a purely Cartesian planning approach

A configuration space toolkit for automated spatial reasoning: Technical results and LDRD project final report

A robot`s configuration space (c-space) is the space of its kinematic degrees of freedom, e.g., the joint-space of an arm. Sets in c-space can be defined that characterize a variety of spatial relationships, such as contact between the robot and its environment. C-space techniques have been fundamental to research progress in areas such as motion planning and physically-based reasoning. However, practical progress has been slowed by the difficulty of implementing the c-space abstraction inside each application. For this reason, we proposed a Configuration Space Toolkit of high-performance algorithms and data structures meeting these needs. Our intent was to develop this robotics software to provide enabling technology to emerging applications that apply the c-space abstraction, such as advanced motion planning, teleoperation supervision, mechanism functional analysis, and design tools. This final report presents the research results and technical achievements of this LDRD project. Key results and achievements included (1) a hybrid Common LISP/C prototype that implements the basic C-Space abstraction, (2) a new, generic, algorithm for constructing hierarchical geometric representations, and (3) a C++ implementation of an algorithm for fast distance computation, interference detection, and c-space point-classification. Since the project conclusion, motion planning researchers in Sandia`s Intelligent Systems and Robotics Center have been using the CSTk libcstk.so C++ library. The code continues to be used, supported, and improved by projects in the ISRC

Planeamento cooperativo de tarefas e trajectórias em múltiplos robôs

Tese de doutoramento. Engenharia Electrotécnica e de Computadores. Universidade do Porto. Faculdade de Engenharia. 201

Computing global configuration-space maps using multidimensional set-theoretic modelling

Available from British Library Document Supply Centre-DSC:DXN032880 / BLDSC - British Library Document Supply CentreSIGLEGBUnited Kingdo