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

Download full-text


Available from: David K Y Chiu, Mar 26, 2015
12 Reads
  • 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; 29(3-29):241-288. DOI:10.1016/0004-3702(86)90072-X · 3.37 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: ly inferring human activity. There are three research hypotheses that drive Guide's development: . A computer can detect the performance of high-level, complex activities by directly sensing user's manipulation of objects involved in those activities . Rich and comprehensive libraries of activities can be created by datamining unstructured text. . Modern stochastic inference algorithms can effectively handle complex, high-dimensional models of human behavior. Copyright c # 2004, American Association for Artificial Intelligence ( All rights reserved. Guide is designed to be scalable to many thousands of activities, to be robust, and to be adaptive to new behaviors, and would be valuable simply for its ability to record diaries of daily activities. This would, for example, greatly assist the monitoring of Activities of Daily Living (ADLs) (Lawton 1990; 1983); a task that currently burdens medical caregivers of the elderly. Eventually such a system would be usefu
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Geographical Information Systems were originally intended to deal with snapshots representing a single state of some reality but there are more and more applications requiring the representation and querying of time-varying information. This work addresses the representation of moving objects on GIS.The continuous nature of movement raises problems for representation in information systems due to the limited capacity of storage systems and the inherently discrete nature of measurement instruments. The stored information has therefore to be partial and does not allow an exact inference of the real-world object's behavior. To cope with this, query operations must take uncertainty into consideration in their semantics in order to give accurate answers to the users.The paper proposes a set of operations to be included in a GIS or a spatial database to make it able to answer queries on the spatio-temporal behavior of moving objects. The operations have been selected according to the requirements of real applications and their semantics with respect to uncertainty is specified. A collection of examples from a case study is included to illustrate the expressiveness of the proposed operations.
    ACM-GIS 2000, Proceedings of the Eighth ACM Symposium on Advances in Geographic Information Systems, November 10-11, 2000, Washington D.C., USA; 01/2000