Search Results

Documents authored by Jansen, Arthur

Document
DOI: 10.4230/LIPIcs.TIME.2025.12
On the Complexity of the Realisability Problem for Visit Events in Trajectory Sample Databases

Authors: Arthur Jansen and Bart Kuijpers

Published in: LIPIcs, Volume 355, 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025)

Abstract
Trajectory sample databases store finite sequences of measured space-time locations of moving objects, along with a speed bound for each object. These databases can be seen as uncertain databases. We propose a language that allows the formulation of queries about the uncertainty in trajectory sample databases. As part of that language, we introduce the notion of visit events, which are used to describe certain constraints on the movement of an object. In our language, an atomic query asks whether a moving object can, given its limitations, realise such an event. We give complexity results for this realisability problem, in various settings.
Cite as

Arthur Jansen and Bart Kuijpers. On the Complexity of the Realisability Problem for Visit Events in Trajectory Sample Databases. In 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 355, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{jansen_et_al:LIPIcs.TIME.2025.12,
  author =	{Jansen, Arthur and Kuijpers, Bart},
  title =	{{On the Complexity of the Realisability Problem for Visit Events in Trajectory Sample Databases}},
  booktitle =	{32nd International Symposium on Temporal Representation and Reasoning (TIME 2025)},
  pages =	{12:1--12:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-401-7},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{355},
  editor =	{Vidal, Thierry and Wa{\l}\k{e}ga, Przemys{\l}aw Andrzej},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2025.12},
  URN =		{urn:nbn:de:0030-drops-244586},
  doi =		{10.4230/LIPIcs.TIME.2025.12},
  annote =	{Keywords: Trajectory sample databases, uncertain databases, query languages, complexity}
}
Document
Short Paper
DOI: 10.4230/LIPIcs.TIME.2025.16
Solutions to the Generalised Alibi Query in Moving Object Databases (Short Paper)

Authors: Arthur Jansen and Bart Kuijpers

Published in: LIPIcs, Volume 355, 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025)

Abstract
Space-time prisms provide a framework to model the uncertainty on the space-time points that a moving object may have visited between measured space-time locations, provided that a bound on the speed of the moving object is given. In this model, the alibi query asks whether two moving objects, given by their respective measured space-time locations and speed bound, may have met. An analytical solution to this problem was first given by Othman [Kuijpers et al., 2011]. In this paper, we address the generalised alibi query that asks the same question for an arbitrary number 𝗇 ≥ 2 of moving objects. We provide several solutions (mainly via the spatial and temporal projection) to this query with varying time complexities. These algorithmic solutions rely on techniques from convex and semi-algebraic geometry. We also address variants of the generalised alibi query where the question is asked for a given spatial location or a given moment in time.
Cite as

Arthur Jansen and Bart Kuijpers. Solutions to the Generalised Alibi Query in Moving Object Databases (Short Paper). In 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 355, pp. 16:1-16:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{jansen_et_al:LIPIcs.TIME.2025.16,
  author =	{Jansen, Arthur and Kuijpers, Bart},
  title =	{{Solutions to the Generalised Alibi Query in Moving Object Databases}},
  booktitle =	{32nd International Symposium on Temporal Representation and Reasoning (TIME 2025)},
  pages =	{16:1--16:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-401-7},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{355},
  editor =	{Vidal, Thierry and Wa{\l}\k{e}ga, Przemys{\l}aw Andrzej},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2025.16},
  URN =		{urn:nbn:de:0030-drops-244622},
  doi =		{10.4230/LIPIcs.TIME.2025.16},
  annote =	{Keywords: Convex geometry, Semi-algebraic geometry, Space-time prism, Geographic information systems, Quantifier elimination}
}
Document
Short Paper
DOI: 10.4230/LIPIcs.TIME.2025.17
Visit Probability in Space-Time Prisms for Moving Object Data (Short Paper)

Authors: Arthur Jansen and Bart Kuijpers

Published in: LIPIcs, Volume 355, 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025)

Abstract
Space-time prisms have been extensively studied as a model to describe the uncertainty of the spatio-temporal location of a moving object in between measured space-time locations. In many applications, the desire has been expressed to provide an internal structure to these prisms, that includes what has been called "visit probability". Although several proposals have been studied in the past decades, a precise definition of this concept has been missing. The contribution of this paper is to provide such a specification by means of a formal framework for visit probability. Once this concept is established, we are able to derive on which parts of a prism, visit probability can be seen to give rise to a probability space.
Cite as

Arthur Jansen and Bart Kuijpers. Visit Probability in Space-Time Prisms for Moving Object Data (Short Paper). In 32nd International Symposium on Temporal Representation and Reasoning (TIME 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 355, pp. 17:1-17:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{jansen_et_al:LIPIcs.TIME.2025.17,
  author =	{Jansen, Arthur and Kuijpers, Bart},
  title =	{{Visit Probability in Space-Time Prisms for Moving Object Data}},
  booktitle =	{32nd International Symposium on Temporal Representation and Reasoning (TIME 2025)},
  pages =	{17:1--17:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-401-7},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{355},
  editor =	{Vidal, Thierry and Wa{\l}\k{e}ga, Przemys{\l}aw Andrzej},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2025.17},
  URN =		{urn:nbn:de:0030-drops-244633},
  doi =		{10.4230/LIPIcs.TIME.2025.17},
  annote =	{Keywords: Spatio-temporal databases, moving object databases, space-time prisms, probability spaces}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact