Pith. sign in

REVIEW

A Configuration-Space Decomposition Scheme for Learning-based Collision Checking

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1911.08581 v1 pith:LUY6XVGC submitted 2019-11-17 cs.RO cs.LGstat.ML

classification cs.ROcs.LGstat.ML
keywords methodsclassifierdecompositionmotionplanningcollisioncompositeconfiguration
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Motion planning for robots of high degrees-of-freedom (DOFs) is an important problem in robotics with sampling-based methods in configuration space C as one popular solution. Recently, machine learning methods have been introduced into sampling-based motion planning methods, which train a classifier to distinguish collision free subspace from in-collision subspace in C. In this paper, we propose a novel configuration space decomposition method and show two nice properties resulted from this decomposition. Using these two properties, we build a composite classifier that works compatibly with previous machine learning methods by using them as the elementary classifiers. Experimental results are presented, showing that our composite classifier outperforms state-of-the-art single classifier methods by a large margin. A real application of motion planning in a multi-robot system in plant phenotyping using three UR5 robotic arms is also presented.

Discussion (0). Continue with ORCID to comment.

Pith tools