Cellular Decomposition for Nonrepetitive Coverage Task with Minimum Discontinuities
| Autor: | Qianen Lai, Jaime Valls Miro, Rong Xiong, Tong Yang, Yue Wang |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
0209 industrial biotechnology
Inverse kinematics Computer science 02 engineering and technology Kinematics Workspace Classification of discontinuities 0906 Electrical and Electronic Engineering 0910 Manufacturing Engineering 0913 Mechanical Engineering Robot end effector Computer Science Applications law.invention Computer Science::Robotics 020901 industrial engineering & automation Industrial Engineering & Automation Control and Systems Engineering law Path (graph theory) Point (geometry) Electrical and Electronic Engineering Cellular decomposition Algorithm |
| Popis: | A mechanism to derive nonrepetitive coverage path solutions with a proven minimal number of discontinuities is proposed in this work, with the aim to avoid unnecessary, costly end-effector lift-offs for manipulators. The problem is motivated by the automatic polishing of an object. Due to the nonbijective mapping between the workspace and the joint-space, a continuous coverage path in the workspace may easily be truncated in the joint-space, incurring undesirable end-effector lift-offs. Inversely, there may be multiple configuration choices to cover the same point of a coverage path through the solution of the inverse kinematics. The solution departs from the conventional local optimization of the coverage path shape in task space, or choosing appropriate but possibly disconnected configurations, to instead explicitly explore the least number of discontinuous motions through the analysis of the structure of valid configurations in joint-space. The two novel contributions of this article include proof that the least number of path discontinuities is predicated on the surrounding environment, independent from the choice of the actual coverage path; thus, has a minimum. In addition, an efficient finite cellular decomposition method to optimally divide the workspace into the minimum number of cells, each traversable without discontinuities by any arbitrary coverage path within. Extensive simulation examples and real-world results on a 5 DoF manipulator are presented to prove the validity of the proposed strategy in realistic settings. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|