EUVIMEDEUVIMED entdecken
Crossref

Motion planning around obstacles with convex optimization

Tobia Marcucci iD, Mark Petersen iD, David von Wrangel iD, Russ Tedrake iD

Science Robotics · 22.11.2023 · 8 (84)

DOI: 10.1126/scirobotics.adf7843 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Science Robotics, erschienen am 22.11.2023. Verfasst von Tobia Marcucci und 3 weiteren Autor:innen. Beteiligte Einrichtung: Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA. Die Arbeit wurde bisher 189-mal zitiert (Crossref) und nennt 57 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

From quadrotors delivering packages in urban areas to robot arms moving in confined warehouses, motion planning around obstacles is a core challenge in modern robotics. Planners based on optimization can design trajectories in high-dimensional spaces while satisfying the robot dynamics. However, in the presence of obstacles, these optimization problems become nonconvex and very hard to solve, even just locally. Thus, when facing cluttered environments, roboticists typically fall back to sampling-based planners that do not scale equally well to high dimensions and struggle with continuous differential constraints. Here, we present a framework that enables convex optimization to efficiently and reliably plan trajectories around obstacles. Specifically, we focus on collision-free motion planning with costs and constraints on the shape, the duration, and the velocity of the trajectory. Using recent techniques for finding shortest paths in Graphs of Convex Sets (GCS), we design a practical convex relaxation of the planning problem. We show that this relaxation is typically very tight, to the point that a cheap postprocessing of its solution is almost always sufficient to identify a collision-free trajectory that is globally optimal (within the parameterized class of curves). Through numerical and hardware experiments, we demonstrate that our planner, which we name GCS, can find better trajectories in less time than widely used sampling-based algorithms and can reliably design trajectories in high-dimensional complex environments.

Autor:innen und Institutionen

  • Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA.
  • School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA.

ORCID-Profile: Tobia Marcucci, Mark Petersen, David von Wrangel, Russ Tedrake

Zitieren

APA

Marcucci, T., Petersen, M., von Wrangel, D., & Tedrake, R. (2023). Motion planning around obstacles with convex optimization. Science Robotics, 8(84). https://doi.org/10.1126/scirobotics.adf7843

Vancouver

Marcucci T, Petersen M, von Wrangel D, Tedrake R. Motion planning around obstacles with convex optimization. Science Robotics. 2023;8(84). doi:10.1126/scirobotics.adf7843

BibTeX
@article{Marcucci2023,
  author = {Marcucci, Tobia and Petersen, Mark and von Wrangel, David and Tedrake, Russ},
  title = {Motion planning around obstacles with convex optimization},
  journal = {Science Robotics},
  year = {2023},
  volume = {8},
  number = {84},
  doi = {10.1126/scirobotics.adf7843}
}
Kostenlos starten →