A Unifying Variational Framework for Gaussian Process Motion Planning
Paper i proceeding, 2024

To control how a robot moves, motion planning algorithms must compute paths in high-dimensional state spaces while accounting for physical constraints related to motors and joints, generating smooth and stable motions, avoiding obstacles, and preventing collisions. A motion planning algorithm must therefore balance competing demands, and should ideally incorporate uncertainty to handle noise, model errors, and facilitate deployment in complex environments. To address these issues, we introduce a framework for robot motion planning based on variational Gaussian Processes, which unifies and generalizes various probabilistic- inference-based motion planning algorithms. Our framework provides a principled and flexible way to incorporate equality-based, inequality-based, and soft motion- planning constraints during end-to-end training, is straightforward to implement, and provides both interval-based and Monte-Carlo-based uncertainty estimates. We conduct experiments using different environments and robots, comparing against baseline approaches based on the feasibility of the planned paths, and obstacle avoidance quality. Results show that our proposed approach yields a good balance between success rates and path quality.

Gaussian Processes

Motion Planning

Robotic manipulation

Författare

Lucas Cosier

University College London (UCL)

Rares Ioardan

University College London (UCL)

Sicelukwanda Zwane

University College London (UCL)

Giovanni Franzese

TU Delft

James T Wilson

Imperial College London

Marc Peter Deisenroth

University College London (UCL)

Alexander Terenin

Cornell University

Yasemin Bekiroglu

Chalmers, Elektroteknik, System- och reglerteknik

Proceedings of Machine Learning Research

26403498 (eISSN)

International Conference on Artificial Intelligence and Statistics (AISTATS)
Valencia , Spain,

Ämneskategorier

Beräkningsmatematik

Robotteknik och automation

Sannolikhetsteori och statistik

Mer information

Senast uppdaterat

2024-01-20