Detection algorithms of intentional car following on smart networks: A primary methodology

Banihan Gunay

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    This paper explores the possibility of detecting certain movements of vehicles that might provide useful information for crime investigations. It is known that existing car following models are interested in microscopic interactions between vehicles in randomly formed pairs. The present work, however, introduces the concept of macroscopic analysis of vehicle positions on a network and the idea of seeking if these movements exhibit any meaningful relationships. First of all detection algorithms are produced for two possible types of detection: (a) was a particular vehicle followed by any vehicle? and (b) did a particular vehicle follow any vehicle? These algorithms assume that every link in the network is equipped with some sort of vehicle identification or tracking device and the identities of all vehicles, such as their number plates, are fed into the program. Then a simulation program is developed to implement the first algorithm (Type (a)), as an example, to visualise the concept. Since the present paper is a preliminary and basic approach to the problem, a number of issues and details requiring further research, together with the directions which could be taken, are also identified and discussed.
    LanguageEnglish
    Pages627-642
    JournalTransportation Planning and Technology
    Volume30
    Issue number6
    DOIs
    Publication statusPublished - Dec 2007

    Fingerprint

    Railroad cars
    Crime

    Cite this

    @article{0853f00a50ed47da965385efa11543bb,
    title = "Detection algorithms of intentional car following on smart networks: A primary methodology",
    abstract = "This paper explores the possibility of detecting certain movements of vehicles that might provide useful information for crime investigations. It is known that existing car following models are interested in microscopic interactions between vehicles in randomly formed pairs. The present work, however, introduces the concept of macroscopic analysis of vehicle positions on a network and the idea of seeking if these movements exhibit any meaningful relationships. First of all detection algorithms are produced for two possible types of detection: (a) was a particular vehicle followed by any vehicle? and (b) did a particular vehicle follow any vehicle? These algorithms assume that every link in the network is equipped with some sort of vehicle identification or tracking device and the identities of all vehicles, such as their number plates, are fed into the program. Then a simulation program is developed to implement the first algorithm (Type (a)), as an example, to visualise the concept. Since the present paper is a preliminary and basic approach to the problem, a number of issues and details requiring further research, together with the directions which could be taken, are also identified and discussed.",
    author = "Banihan Gunay",
    year = "2007",
    month = "12",
    doi = "10.1080/03081060701698268",
    language = "English",
    volume = "30",
    pages = "627--642",
    journal = "Transportation Planning and Technology",
    issn = "0308-1060",
    number = "6",

    }

    Detection algorithms of intentional car following on smart networks: A primary methodology. / Gunay, Banihan.

    In: Transportation Planning and Technology, Vol. 30, No. 6, 12.2007, p. 627-642.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Detection algorithms of intentional car following on smart networks: A primary methodology

    AU - Gunay, Banihan

    PY - 2007/12

    Y1 - 2007/12

    N2 - This paper explores the possibility of detecting certain movements of vehicles that might provide useful information for crime investigations. It is known that existing car following models are interested in microscopic interactions between vehicles in randomly formed pairs. The present work, however, introduces the concept of macroscopic analysis of vehicle positions on a network and the idea of seeking if these movements exhibit any meaningful relationships. First of all detection algorithms are produced for two possible types of detection: (a) was a particular vehicle followed by any vehicle? and (b) did a particular vehicle follow any vehicle? These algorithms assume that every link in the network is equipped with some sort of vehicle identification or tracking device and the identities of all vehicles, such as their number plates, are fed into the program. Then a simulation program is developed to implement the first algorithm (Type (a)), as an example, to visualise the concept. Since the present paper is a preliminary and basic approach to the problem, a number of issues and details requiring further research, together with the directions which could be taken, are also identified and discussed.

    AB - This paper explores the possibility of detecting certain movements of vehicles that might provide useful information for crime investigations. It is known that existing car following models are interested in microscopic interactions between vehicles in randomly formed pairs. The present work, however, introduces the concept of macroscopic analysis of vehicle positions on a network and the idea of seeking if these movements exhibit any meaningful relationships. First of all detection algorithms are produced for two possible types of detection: (a) was a particular vehicle followed by any vehicle? and (b) did a particular vehicle follow any vehicle? These algorithms assume that every link in the network is equipped with some sort of vehicle identification or tracking device and the identities of all vehicles, such as their number plates, are fed into the program. Then a simulation program is developed to implement the first algorithm (Type (a)), as an example, to visualise the concept. Since the present paper is a preliminary and basic approach to the problem, a number of issues and details requiring further research, together with the directions which could be taken, are also identified and discussed.

    U2 - 10.1080/03081060701698268

    DO - 10.1080/03081060701698268

    M3 - Article

    VL - 30

    SP - 627

    EP - 642

    JO - Transportation Planning and Technology

    T2 - Transportation Planning and Technology

    JF - Transportation Planning and Technology

    SN - 0308-1060

    IS - 6

    ER -