38 research outputs found

    Algorithms for the Analysis of Spatio-Temporal Data from Team Sports

    Get PDF
    Modern object tracking systems are able to simultaneously record trajectories—sequences of time-stamped location points—for large numbers of objects with high frequency and accuracy. The availability of trajectory datasets has resulted in a consequent demand for algorithms and tools to extract information from these data. In this thesis, we present several contributions intended to do this, and in particular, to extract information from trajectories tracking football (soccer) players during matches. Football player trajectories have particular properties that both facilitate and present challenges for the algorithmic approaches to information extraction. The key property that we look to exploit is that the movement of the players reveals information about their objectives through cooperative and adversarial coordinated behaviour, and this, in turn, reveals the tactics and strategies employed to achieve the objectives. While the approaches presented here naturally deal with the application-specific properties of football player trajectories, they also apply to other domains where objects are tracked, for example behavioural ecology, traffic and urban planning

    MINIMAL BASIS REPRESENTATION FOR GENERAL MOTION SEGMENTATION

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Optimization of Air Defense System Deployment Against Reconnaissance Drone Swarms

    Get PDF
    Due to their advantages in flexibility, scalability, survivability, and cost-effectiveness, drone swarms have been increasingly used for reconnaissance tasks and have posed great challenges to their opponents on modern battlefields. This paper studies an optimization problem for deploying air defense systems against reconnaissance drone swarms. Given a set of available air defense systems, the problem determines the location of each air defense system in a predetermined region, such that the cost for enemy drones to pass through the region would be maximized. The cost is calculated based on a counterpart drone path planning problem. To solve this adversarial problem, we first propose an exact iterative search algorithm for small-size problem instances, and then propose an evolutionary framework that uses a specific encoding-decoding scheme for large-size problem instances. We implement the evolutionary framework with six popular evolutionary algorithms. Computational experiments on a set of different test instances validate the effectiveness of our approach for defending against reconnaissance drone swarms

    Study on identification of nonlinear systems using Quasi-ARX models

    Get PDF
    制度:新 ; 報告番号:甲3660号 ; 学位の種類:博士(工学) ; 授与年月日:2012/9/15 ; 早大学位記番号:新6026Waseda Universit

    Scalable Algorithms for Community Detection in Very Large Graphs

    Get PDF
    corecore