Gradient algorithms for polygonal approximation of convex contours

DOI10.1016/j.automatica.2008.08.020zbMath1158.93373OpenAlexW2126730326MaRDI QIDQ1012881

Sonia Martínez, Sara Susca, Bullo, Francesco

Publication date: 23 April 2009

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2008.08.020

zbMATH Keywords

interpolationgradient methodsmotion coordinationpolygonal approximationconvex body approximation

Mathematics Subject Classification ID

Geometric methods (93B27) Automated systems (robots, etc.) in control theory (93C85)

Related Items (1)

Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints

Cites Work

• Synchronization and balancing on the \(N\)-torus
• A Geometric Method for Approximating Convex Arcs
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• Cooperative forest fire surveillance using a team of small unmanned air vehicles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gradient algorithms for polygonal approximation of convex contours