Complexity bounds for obstacle avoidance within a zonotopic framework

Abstract : 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.
Document type :
Reports
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal-centralesupelec.archives-ouvertes.fr/hal-01986337
Contributor : Daniel Ioan <>
Submitted on : Friday, January 18, 2019 - 4:56:56 PM
Last modification on : Thursday, December 5, 2019 - 5:18:51 PM

File

IoanACC.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01986337, version 1

Citation

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⟩

Share

Metrics

Record views

107

Files downloads

128