Tracking problem: differentiation of the visibility function
Assume that the positions of an observer and an object are known to be in certain closed balls (possibly moving in time \(t\)). Given an obstacle represented by a closed set the object is visible to the observer if the convex hull of the union of the balls does not intersect with the obstacle (for all \(t\)). The visibility function assigning (for every \(t\)) the largest radius of the ball around the object preserving visibility is defined. Certain differentiability properties are proven for this assignment. If the object moves from one position to another it has to do this on certain trajectories avoiding collision with the obstacle. If in addition it tries to minimize the radius which is observable around it at all positions on the trajectory, this is related to the visibility function. It is proven in a algorithmic manner that such a trajectory exists and is smooth.
- Object and observer: a tracking problem
- Two methods of characterizing the visibility of a moving point
- Trajectory of an observer tracking object motion around convex obstacles in \({{\mathbb{R}}^2}\) and \({{\mathbb{R}}^3} \)
- Object visibility for a group of observers with inaccurately given coordinates
- Moving object in \(\mathbb{R}^2\) and a group of observers
- Visibility characteristic of a moving point
- Two methods of characterizing the visibility of a moving point
- Concealment of a moving object from an observer
- Object visibility for an observer with inaccurately given coordinates
- Object visibility for a group of observers with inaccurately given coordinates
- An object and a group of observers in a normed space
- Object and observer: a tracking problem
This page was built for publication: Tracking problem: differentiation of the visibility function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q416968)
