PINSAT: Parallelized Interleaving of Graph Search and Trajectory Optimization for Kinodynamic...

[PDF] arxiv.org

Implicit graph search for planning on graphs of convex sets

R Natarajan, C Liu, H Choset, M Likhachev - arXiv preprint arXiv …, 2024 - arxiv.org
Graphs of Convex Sets (GCS) is a recent method for synthesizing smooth trajectories by
decomposing the planning space into convex sets, forming a graph to encode the adjacency …
被引用次数：2 相关文章 所有 2 个版本
[PDF] arxiv.org

iDb-RRT: Sampling-based Kinodynamic Motion Planning with Motion Primitives and Trajectory Optimization

J Ortiz-Haro, W Hönig, VN Hartmann… - arXiv preprint arXiv …, 2024 - arxiv.org
Rapidly-exploring Random Trees (RRT) and its variations have emerged as a robust and
efficient tool for finding collision-free paths in robotic systems. However, adding dynamic …
被引用次数：1 相关文章 所有 2 个版本
[PDF] arxiv.org

Diffusion-Informed Probabilistic Contact Search for Multi-Finger Manipulation

A Kumar, T Power, F Yang, SA Marinovic, S Iba… - arXiv preprint arXiv …, 2024 - arxiv.org
Planning contact-rich interactions for multi-finger manipulation is challenging due to the high-
dimensionality and hybrid nature of dynamics. Recent advances in data-driven methods …
相关文章 所有 2 个版本
[PDF] openreview.net

Probabilistic Contact Mode Planning for Multi-Finger Manipulation using Diffusion Models

T Power, A Kumar, F Yang, SFA Marinovic, S Iba… - CoRL Workshop on … - openreview.net
Planning contact-rich interactions for multi-finger manipulation is challenging due to the high-
dimensionality and hybrid nature of dynamics. Recent advances in data-driven methods …
相关文章