<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Paper-Conference | Alexandre Amice</title><link>https://alexandreamice.github.io/publication_types/paper-conference/</link><atom:link href="https://alexandreamice.github.io/publication_types/paper-conference/index.xml" rel="self" type="application/rss+xml"/><description>Paper-Conference</description><generator>HugoBlox Kit (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Mon, 01 Jan 2024 00:00:00 +0000</lastBuildDate><image><url>https://alexandreamice.github.io/media/icon_hu_12f30033bf7ec525.png</url><title>Paper-Conference</title><link>https://alexandreamice.github.io/publication_types/paper-conference/</link></image><item><title>Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs</title><link>https://alexandreamice.github.io/publication/werner-2024-approximate/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://alexandreamice.github.io/publication/werner-2024-approximate/</guid><description/></item><item><title>Certifying Bimanual RRT Motion Plans in a Second</title><link>https://alexandreamice.github.io/publication/amice-2024-certifying/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://alexandreamice.github.io/publication/amice-2024-certifying/</guid><description/></item><item><title>Multi-Query Shortest-Path Problem in Graphs of Convex Sets</title><link>https://alexandreamice.github.io/publication/morozov-2024/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://alexandreamice.github.io/publication/morozov-2024/</guid><description/></item><item><title>Towards Tight Convex Relaxations for Contact-Rich Manipulation</title><link>https://alexandreamice.github.io/publication/graesdal-2024-towards/</link><pubDate>Mon, 01 Jan 2024 00:00:00 +0000</pubDate><guid>https://alexandreamice.github.io/publication/graesdal-2024-towards/</guid><description/></item><item><title>Discrete Approximate Information States in Partially Observable Environments</title><link>https://alexandreamice.github.io/publication/yang-2022-discrete/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://alexandreamice.github.io/publication/yang-2022-discrete/</guid><description/></item><item><title>Finding and Optimizing Certified, Collision-Free Regions in Configuration Space for Robot Manipulators</title><link>https://alexandreamice.github.io/publication/amice-2022-finding/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://alexandreamice.github.io/publication/amice-2022-finding/</guid><description/></item><item><title>Solving Least Squares Problems on Partially Ordered Sets</title><link>https://alexandreamice.github.io/publication/amice-2022-poset/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://alexandreamice.github.io/publication/amice-2022-poset/</guid><description/></item><item><title>Resilient control: Compromising to adapt</title><link>https://alexandreamice.github.io/publication/chamon-2020-resilient/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://alexandreamice.github.io/publication/chamon-2020-resilient/</guid><description/></item><item><title>Matroid-constrained approximately supermodular optimization for near-optimal actuator scheduling</title><link>https://alexandreamice.github.io/publication/chamon-2019-matroid/</link><pubDate>Tue, 01 Jan 2019 00:00:00 +0000</pubDate><guid>https://alexandreamice.github.io/publication/chamon-2019-matroid/</guid><description/></item></channel></rss>