Complexity bounds for obstacle avoidance within a zonotopic framework - CentraleSupélec Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2019

Complexity bounds for obstacle avoidance within a zonotopic framework

Résumé

This paper addresses the problem of collision avoidance in a multi-obstacle environment and focuses on its representation in optimization-based control problems. The design problem is commonly stated in the literature in terms of a constrained optimization problem over a non-convex domain. Describing this non-convex domain has computational and structural implications, generally leading to a trade-off between computational efficiency and control performance. Preliminary results make use of hyperplane arrangements to characterize these regions. The hyperplane arrangements build on generic polyhedral sets and a natural question is whether additional structure could bring a benefit. The current paper addresses this issue by the use of zonotopic over-approximation and highlights their benefits when introduced in the obstacle avoidance problem. Comparisons with classical sampled-based approaches are presented through simulations.
Fichier principal
Vignette du fichier
IoanACC.pdf (475.83 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01986337 , version 1 (18-01-2019)

Identifiants

  • HAL Id : hal-01986337 , version 1

Citer

Daniel Ioan, Ionela Prodan, Florin Stoican, Sorin Olaru, Silviu-Iulian Niculescu. Complexity bounds for obstacle avoidance within a zonotopic framework. [Research Report] L2S, CNRS, Supelec, Université Paris Sud. 2019. ⟨hal-01986337⟩
158 Consultations
291 Téléchargements

Partager

Gmail Facebook X LinkedIn More