2013
DOI: 10.1155/2013/284904
|View full text |Cite
|
Sign up to set email alerts
|

Modelling Spatio-Temporal Relevancy in Urban Context-Aware Pervasive Systems Using Voronoi Continuous Range Query and Multi-Interval Algebra

Abstract: Abstract. Space and time are two dominant factors in context-aware pervasive systems which determine whether an entity is related to the moving user or not. This paper specifically addresses the use of spatio-temporal relations for detecting spatiotemporally relevant contexts to the user. The main contribution of this work is that the proposed model is sensitive to the velocity and direction of the user and applies customized Multi Interval Algebra (MIA) with Voronoi Continuous Range Query (VCRQ) to introduce … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 21 publications
0
1
0
Order By: Relevance
“…The objective is to optimize the collection path with the following constraints: (i) each cluster shall be visited only by one vehicle; (ii) when a customer is visited within a cluster, all other customers in that cluster must be visited before the vehicle leaves the cluster. The literature presents different clustering algorithms and routing solutions to find the shortest distance (Akhtar et al., 2017; Cosma et al., 2022; Neysani Samany, 2019; Neysani Samany et al., 2013b; Sariklis & Powell, 2000; Tavares et al., 2008) and minimum time (Mes et al., 2014; Neysani Samany et al., 2013a; Tavares et al., 2008). Another important goal of clustering is to balance the workload between vehicles (Gu et al., 2016; Hajibabai et al., 2014; Ouyang, 2007; Wang et al., 2022).…”
Section: Introductionmentioning
confidence: 99%
“…The objective is to optimize the collection path with the following constraints: (i) each cluster shall be visited only by one vehicle; (ii) when a customer is visited within a cluster, all other customers in that cluster must be visited before the vehicle leaves the cluster. The literature presents different clustering algorithms and routing solutions to find the shortest distance (Akhtar et al., 2017; Cosma et al., 2022; Neysani Samany, 2019; Neysani Samany et al., 2013b; Sariklis & Powell, 2000; Tavares et al., 2008) and minimum time (Mes et al., 2014; Neysani Samany et al., 2013a; Tavares et al., 2008). Another important goal of clustering is to balance the workload between vehicles (Gu et al., 2016; Hajibabai et al., 2014; Ouyang, 2007; Wang et al., 2022).…”
Section: Introductionmentioning
confidence: 99%