Maximizing Visibility in Nonconvex Polygons: Nonsmooth Analysis and Gradient Algorithm Design

DOI10.1137/050621918MaRDI QIDQ3593010zbMATH OpenOpenAlexFDO

Authors Anurag Ganguli, J. Cortés, Francesco Bullo

Publication date 24 September 2007

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/050621918

zbMATH Keywords

dynamical systemsnonsmooth analysisgeometric optimizationstability theoryrobotics

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Stability of solutions to ordinary differential equations (34D20) Dynamical systems in control (37N35) Artificial intelligence for robotics (68T40) Optimization problems in optics and electromagnetic theory (78M50)

Recommendations

• scientific article; zbMATH DE number 2112895
• Optimal path planning based on visibility
• Gradient algorithms for polygonal approximation of convex contours
• Visibility optimization using variational approaches
• Visibility-based optimal path and motion planning

Cited in

(4)

• scientific article; zbMATH DE number 2112895 (Why is no real title available?)
• Distributed coverage control for concave areas by a heterogeneous Robot-Swarm with visibility sensing constraints
• Information-seeking control under visibility-based uncertainty
• The visible-volume function of a set of cameras is continuous, piecewise rational, locally Lipschitz, and semi-algebraic in all dimensions

This page was built for publication: Maximizing Visibility in Nonconvex Polygons: Nonsmooth Analysis and Gradient Algorithm Design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593010)