Skip to content

Commit

Permalink
add icra video and some text to path certifier
Browse files Browse the repository at this point in the history
  • Loading branch information
AlexandreAmice committed Oct 3, 2023
1 parent ad22857 commit b80f6d2
Show file tree
Hide file tree
Showing 4 changed files with 25 additions and 3 deletions.
Binary file added content/project/C-IRIS-Path/IcraFinalVideo.mp4
Binary file not shown.
Binary file added content/project/C-IRIS-Path/featured.png
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
26 changes: 24 additions & 2 deletions content/project/C-IRIS-Path/index.md
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
---
title: Certifying Trajectories in Seconds
summary: TODO
summary: Formally verifying the safety of complicated trajectories at scale.
tags:
- Geometry
date: '2023-10-02T00:00:00Z'
Expand All @@ -10,6 +10,7 @@ external_link: ''

image:
focal_point: Smart
caption: A pair of manipulators reach into a shelf. The red hyperplane certifies that the grippers do not collide at any point during the motion plan.

# links:
# - icon: deepnote
Expand All @@ -30,7 +31,28 @@ bilbiography: references.bib
# Otherwise, set `slides = ""`.
# PDF: example
---
# THIS PAGE IS UNDER CONSTRUCTION
# Video Summary
<video width="320" height="240" controls>
<source src="IcraFinalVideo.mp4" type="video/mp4">
</video>

# Motivation

Collision-free motion planning is a fundamental problem in the safe and efficient operation of any robotic system. One of the most important subroutines in collision-free motion planning is collision detection, which has been studied extensively. Algorithms for checking whether a single configuration is collision free are quite mature and can be performed in microseconds on modern hardware.

By contrast, algorithms which are capable of certifying non-collision for the infinite family of configurations along a motion plan are less common. Known as dynamic collision checking, this subroutine is performed hundreds to thousands of times in randomized motion planning methods, and so the speed as well as the correctness of these algorithms is central to their adoption. Due to the speed requirement, it is common practice to heuristically perform dynamic collision checking by sampling a finite number of static configurations along the motion plan. Nevertheless, it is widely recognized that this is insufficient for safety critical robots.

Current methods for formally checking the safety of robots frequently only apply to piecewise linear motion plans and are either too slow for practical deployment, rely on difficult to acquire parameters, or are too conservative for certifying motion plans in tight spaces.
<!-- put the video of the two iiwas with different levels of safety -->


# Contribution
In this work, we provide a method for certifying that a robot trajectory contains no collisions. The method provides rigorous proofs of non-collision using Sums-of-Squares optimization, can certify piecewise-polyonmial paths of arbitrary degree, and is efficient enough to certify the safety of a bimanual manipulator motion plan in just over a second. Moreover, it is efficient enough to discriminate the safety of two motion plans which differ by only millimeters.


# Visualizing the Certificates
The certificates of non-collision can be visualized as hyperplanes in the task space. Click "Open Controls" to turn different hyperplanes on and off, replay the animation, and more.
<iframe
width="100%"
height="500"
Expand All @@ -40,4 +62,4 @@ bilbiography: references.bib
allowfullscreen>
name="14dof_hyperplanes"
</iframe>
<p><center><a href="14dof_hyperplanes.html" target="14dof_hyperplanes">View and interact with this animation in full screen</a></center></p>
<p><center><a href="14dof_hyperplanes.html" target="14dof_hyperplanes">View and interact with this animation in full screen</a></center></p>
2 changes: 1 addition & 1 deletion content/project/Matroid/index.md
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
---
title: Scheduling with Constraints
summary: Guaranteed performance for heuristic strategies for a known, hard problem.
summary: Guaranteed performance of heuristic strategies for a known, hard problem.
tags:
- Matroid
date: '2019-12-29T00:00:00Z'
Expand Down

0 comments on commit b80f6d2

Please sign in to comment.