Minimizing query frequency to bound congestion potential for moving entities at a fixed target time

DOI10.1007/978-3-031-43587-4_12MaRDI QIDQ6546591zbMATH OpenFDO

Authors W. Evans, David Kirkpatrick

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43587-4_12

zbMATH Keywords

collision avoidancecompetitive analysisdata in motiononline algorithmsuncertain inputs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Competitive query strategies for minimising the ply of the potential locations of moving points
• Data Structures for Mobile Data
• Delaunay triangulation of imprecise points in linear time after preprocessing
• scientific article; zbMATH DE number 1501063 (Why is no real title available?)
• scientific article; zbMATH DE number 7075885 (Why is no real title available?)
• Kinetic 2-centers in the black-box model
• Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes
• Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model
• Minimizing co-location potential of moving entities
• Minimizing Interference Potential Among Moving Entities

Cited in

(1)

• Frequency-competitive query strategies to maintain low congestion potential among moving entities

This page was built for publication: Minimizing query frequency to bound congestion potential for moving entities at a fixed target time

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