Caging and Path Non-existence: A Deterministic Sampling-Based Verification Algorithm
| Autor: | Florian T. Pokorny, Danica Kragic, Anastasiia Varava, J. Frederico Carvalho |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
0209 industrial biotechnology
Computer science 02 engineering and technology Object (computer science) Simplicial complex 020901 industrial engineering & automation Position (vector) Bounded function Orientation (geometry) Path (graph theory) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Motion planning Configuration space Algorithm |
| Zdroj: | Springer Proceedings in Advanced Robotics ISBN: 9783030286187 ISRR |
| Popis: | Caging restricts the mobility of an object without necessarily immobilizing it completely. The object is caged if it cannot move arbitrarily far from its initial position. Apart from its common applications to grasping and manipulation, caging can also be considered as a problem dual to motion planning: an object is caged when it is isolated within a bounded connected component of its configuration space and is disconnected from the rest of the latter. In this paper, we address the problem of caging and path non-existence verification in 2D and 3D workspaces by representing a subset of the collision space as a simplicial complex and analyzing the connectivity of its complement. Since configuration spaces of 2D and 3D rigid objects are three-dimensional and six-dimensional respectively, it is computationally expensive to reconstruct them explicitly. Thus, we represent the object’s collision space as a union of a finite set of ‘slices’, corresponding to small intervals of the object’s orientation coordinates. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|