Probing a set of trajectories to maximize captured information

DOI10.4230/LIPICS.SEA.2020.5MaRDI QIDQ6487600zbMATH OpenFDO

Authors Sándor P. Fekete, Dominik Krupke, Tyler Mayer, Joseph S. B. Mitchell, Ojas Parekh, Cynthia Phillips

Publication date 7 February 2023

zbMATH Keywords

optimizationtrajectoriescomplexityapproximationalgorithm engineering

Mathematics Subject Classification ID

Computational aspects of data analysis and big data (68T09) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Central trajectories
• FINDING POPULAR PLACES
• Computing a consensus trajectory in a vehicular network
• Trajectory clustering of points in \(\mathbb{R}\)
• Homotopy measures for representative trajectories

Cited in

(1)

• Observer path planning for maximum information

This page was built for publication: Probing a set of trajectories to maximize captured information

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