Visibility optimization using variational approaches

DOI10.4310/CMS.2005.V3.N3.A8MaRDI QIDQ2493367zbMATH OpenOpenAlexFDO

Authors Li-Tien Cheng, Richard Tsai

Publication date 12 June 2006

Published in Communications in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/cms.2005.v3.n3.a8

zbMATH Keywords

algorithmslevel set methodnumerical examplesoptimal locationpath planningvisibility

Mathematics Subject Classification ID

Existence theories for optimal control problems involving partial differential equations (49J20) Optimization of shapes other than minimal surfaces (49Q10) Numerical optimization and variational techniques (65K10)

Review text

Regions visible to a given observer are determined when obstacles to sight are present. Algorithms to maximize the volume of the visible regions in a compact subset of the space are presented. Three different problems are investigated: The optimal location for one observer, the optimal location for a collection of observers and the optimal path of an observer travelling from a position A to a position B. Two basic strategies are considered. In one strategy level set functions defined earlier are used for the determination of local maxima. The second strategy involves the construction of an energy whose minimum achieves the desired effect. Different extensions of the visibility optimization problem are presented and illustrated by examples.

Recommendations

• Approximate solutions to several visibility optimization problems
• Optimal path planning based on visibility
• Two methods of characterizing the visibility of a moving point
• scientific article; zbMATH DE number 2112895
• Object and observer: a tracking problem

Cited in

(19)

• Visibility of point clouds and exploratory path planning in unkown environments
• Optimal path planning based on visibility
• Visibility and its dynamics in a PDE based implicit framework
• A partial differential equation obstacle problem for the level set approach to visibility
• Visibility-based optimal path and motion planning
• Redistancing by flow of time dependent eikonal equation
• A variational approach to path planning in three dimensions using level set methods
• Multiview visibility estimation for image-based modeling
• Solving visibility problems on MCCs of smaller size
• Maximizing Visibility in Nonconvex Polygons: Nonsmooth Analysis and Gradient Algorithm Design
• Variants of Visibility and their Complexity
• scientific article; zbMATH DE number 2112895 (Why is no real title available?)
• Optimal sensor positioning; a probability perspective study
• Approximate solutions to several visibility optimization problems
• Computer Vision - ECCV 2004
• VISOR: Vast independence system optimization routine
• The visible-volume function of a set of cameras is continuous, piecewise rational, locally Lipschitz, and semi-algebraic in all dimensions
• Properties of a level set algorithm for the visibility problems
• Path optimization with limited sensing ability

This page was built for publication: Visibility optimization using variational approaches

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