Moving Object Modelling Approach for Lowering Uncertainty in Location Tracking Systems

DOI: 10.1007/978-3-642-21043-3_3
Source: DBLP

ABSTRACT This paper introduces the concept of Moving Object (MO) modelling as a means of managing the uncertainty in the location tracking of human moving objects travelling on a network.
For previous movements of the MOs, the uncertainty stems from the discrete nature of location tracking systems, where gaps
are created among the location reports. Future locations of MOs are, by definition, uncertain. The objective is to maximize
the estimation accuracy while minimizing the operating costs.

KeywordsMoving object modelling–Managing uncertainty–Location tracking Systems

  • [Show abstract] [Hide abstract]
    ABSTRACT: Publisher’s description: A thorough introduction to the formal foundations and practical applications of Bayesian networks is given, and an extensive discussion of techniques for building Bayesian networks that model real-world situations, including techniques for synthesizing models from design, learning models from data, and debugging models using sensitivity analysis, is provided. Exact and approximate inference algorithms at both theoretical and practical levels are treated. The treatment of the exact algorithms covers the main inference paradigms based on elimination and conditioning and includes advanced methods for compiling Bayesian networks, time-space tradeoffs and exploiting local structure of massively connected networks. The treatment of the approximate algorithms covers the main inference paradigms based on sampling and optimization and includes influential algorithms such as importance sampling, MCMC and belief propagation. The author assumes very little background on the covered subjects, supplying in-depth discussions for theoretically inclined readers and enough practical details to provide an algorithmic cookbook for system developers.
    01/2009; Cambridge University Press., ISBN: 978-0-521-88438-9
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to represent the generic knowledge of a domain expert, and it turns into a computational architecture if the links are used not merely for storing factual knowledge but also for directing and activating the data flow in the computations which manipulate this knowledge.The first part of the paper deals with the task of fusing and propagating the impacts of new information through the networks in such a way that, when equilibrium is reached, each proposition will be assigned a measure of belief consistent with the axioms of probability theory. It is shown that if the network is singly connected (e.g. tree-structured), then probabilities can be updated by local propagation in an isomorphic network of parallel and autonomous processors and that the impact of new information can be imparted to all propositions in time proportional to the longest path in the network.The second part of the paper deals with the problem of finding a tree-structured representation for a collection of probabilistically coupled propositions using auxiliary (dummy) variables, colloquially called “hidden causes.” It is shown that if such a tree-structured representation exists, then it is possible to uniquely uncover the topology of the tree by observing pairwise dependencies among the available propositions (i.e., the leaves of the tree). The entire tree structure, including the strengths of all internal relationships, can be reconstructed in time proportional to n log n, where n is the number of leaves.
    Artificial Intelligence 09/1986; · 2.19 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we propose a data model for representing moving objects with uncertain positions in database systems. It is called the Moving Objects Spatio-Temporal (MOST) data model. We also propose Future Temporal Logic (FTL) as the query language for the MOST model, and devise an algorithm for processing FTL queries in MOST. 1 Introduction Existing database management systems (DBMS's) are not well equipped to handle continuously changing data, such as the position of moving objects. The reason for this is that in databases, data is assumed to be constant unless it is explicitly modified. For example, if the salary field is 30K, then this salary is assumed to hold (i.e. 30K is returned in response to queries) until explicitly updated. Thus, in order to represent moving objects (e.g. cars) in a database, and answer queries about their position (e.g., How far is the car with license plate RWW860 from the nearest hospital?) the car's position has to be continuously updated. This is unsa...