Alexandre Amice
  • Projects
  • Publication List
  • Teaching
  • CV
  • Publications
    • Mixed discrete and continuous planning using shortest walks in graphs of convex sets
    • Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
    • Certifying Bimanual RRT Motion Plans in a Second
    • Multi-Query Shortest-Path Problem in Graphs of Convex Sets
    • Towards Tight Convex Relaxations for Contact-Rich Manipulation
    • Approximate Optimal Controller Synthesis for Cart-Poles and Quadrotors via Sums-of-Squares
    • Certified Polyhedral Decompositions of Collision-Free Configuration Space
    • Discrete Approximate Information States in Partially Observable Environments
    • Finding and Optimizing Certified, Collision-Free Regions in Configuration Space for Robot Manipulators
    • Solving Least Squares Problems on Partially Ordered Sets
    • Approximately supermodular scheduling subject to matroid constraints
    • Resilient control: Compromising to adapt
    • Matroid-constrained approximately supermodular optimization for near-optimal actuator scheduling
  • Experience
  • Projects
    • Certifying Trajectories in Seconds
    • Certified Polyhedral Descriptions of Configuration Space
    • Structured Optimization
    • Resilient Behavior Through Optimization
    • Scheduling with Constraints
  • Teaching
    • 6.S098, IAP 2022 -- Applied Convex Optimization

Mixed discrete and continuous planning using shortest walks in graphs of convex sets

Jan 1, 2025·
Savva Morozov
,
Tobia Marcucci
,
Bernhard Paus Graesdal
,
Alexandre Amice
,
Pablo A Parrilo
,
Russ Tedrake
· 0 min read
publication
Last updated on Jan 1, 2025
Authors
Savva Morozov
Authors
Tobia Marcucci
Authors
Bernhard Paus Graesdal
Authors
Alexandre Amice
Authors
Pablo A Parrilo
Authors
Russ Tedrake

Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs Jan 1, 2024 →

© 2026 Alexandre Amice. This work is licensed under CC BY NC ND 4.0

Made with Hugo Blox. Create yours →