Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Fast-Reactive Probabilistic Motion Planning for High-Dimensional Robots

Fast-Reactive Probabilistic Motion Planning for High-Dimensional Robots

Thumbnail Image
Download
Name

42979_2021_878_ReferencePDF.pdf

Size

4.27 MB

Format

Adobe PDF

Checksum (MD5)

75064cd4a96ca5118a917f55a49f4a5b

Download all files submitted through automated deposit
art_6784368265530911799.zip (3.6 MB)
Author(s)
Dai, Siyu
•
Hofmann, Andreas
•
Williams, Brian
Date Issued
October 15, 2021
Publisher
Springer Singapore
Citation
SN Computer Science. 2021 Oct 15;2(6):484
Version
Author's final manuscript
Abstract
Abstract Many real-world robotic operations that involve high-dimensional humanoid robots require fast reaction to plan disturbances and probabilistic guarantees over collision risks, whereas most probabilistic motion planning approaches developed for car-like robots cannot be directly applied to high-dimensional robots. In this paper, we present probabilistic Chekov (p-Chekov), a fast-reactive motion planning system that can provide safety guarantees for high-dimensional robots suffering from process noises and observation noises. Leveraging recent advances in machine learning as well as our previous work in deterministic motion planning that integrated trajectory optimization into a sparse roadmap framework, p-Chekov demonstrates its superiority in terms of collision avoidance ability and planning speed in high-dimensional robotic motion planning tasks in complex environments without the convexification of obstacles. Comprehensive theoretical and empirical analysis provided in this paper shows that p-Chekov can effectively satisfy user-specified chance constraints over collision risk in practical robotic manipulation tasks.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
https://hdl.handle.net/1721.1/136734
DOI of Published Version
https://doi.org/10.1007/s42979-021-00878-0
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.