Motion Planning Networks
원문 초록
Fast and efficient motion planning algorithms are crucial for many state-of-the-art robotics applications such as self-driving cars. Existing motion planning methods become ineffective as their computational complexity increases exponentially with the dimensionality of the motion planning problem. To address this issue, we present Motion Planning Networks (MPNet), a neural network-based novel planning algorithm. The proposed method encodes the given workspaces directly from a point cloud measurement and generates the end-to-end collision-free paths for the given start and goal configurations. We evaluate MPNet on various 2D and 3D environments including the planning of a 7 DOF Baxter robot manipulator. The results show that MPNet is not only consistently computationally efficient in all environments but also generalizes to completely unseen environments. The results also show that the computation time of MPNet consistently remains less than 1 second in all presented experiments, which is significantly lower than existing state-of-the-art motion planning algorithms.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
RaMen: Multi-Strategy Multi-Modal Learning for Bundle Construction
Best Practices for Large-Scale, Pixel-Wise Crop Mapping and Transfer Learning Workflows
Robust-Multi-Task Gradient Boosting
PSAT: Pediatric Segmentation Approaches via Adult Augmentations and Transfer Learning
A Survey on Prompt Tuning
DS@GT at CheckThat! 2025: Detecting Subjectivity via Transfer-Learning and Corrective Data Augmentation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.