A Configuration-Space Decomposition Scheme for Learning-based Collision Checking
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.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningMotion PlanningPlant PhenotypingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Fast Collision Checking: From Single Robots to Multi-Robot Teams
We examine three different algorithms that enable the collision certificate method from [Bialkowski, et al.] to handle the case of a centralized multi-robot team. By taking advantage of symmetries in the configuration sp…
Autonomous Navigation in Unknown Environments using Sparse Kernel-based Occupancy Mapping
This paper focuses on real-time occupancy mapping and collision checking onboard an autonomous robot navigating in an unknown environment. We propose a new map representation, in which occupied and free space are separat…
Autonomous NavigationViIK: Flow-based Vision Inverse Kinematics Solver with Fusing Collision Checking
Inverse Kinematics (IK) is to find the robot's configurations that satisfy the target pose of the end effector. In motion planning, diverse configurations were required in case a feasible trajectory was not found. Meanwh…
Motion PlanningReducing Collision Checking for Sampling-Based Motion Planning Using Graph Neural Networks
Sampling-based motion planning is a popular approach in robotics for finding paths in continuous configuration spaces. Checking collision with obstacles is the major computational bottleneck in this process. We propose n…
Motion PlanningNeural Collision Clearance Estimator for Batched Motion Planning
We present a neural network collision checking heuristic, ClearanceNet, and a planning algorithm, CN-RRT. ClearanceNet learns to predict separation distance (minimum distance between robot and workspace) with respect to …
Motion Planning