• DocumentCode
    2594555
  • Title

    Trajectory clustering for motion prediction

  • Author

    Sung, Cynthia ; Feldman, Dan ; Rus, Daniela

  • Author_Institution
    Comput. Sci. & Artificial Intell. Lab., Massachusetts Inst. of Technol., Cambridge, MA, USA
  • fYear
    2012
  • fDate
    7-12 Oct. 2012
  • Firstpage
    1547
  • Lastpage
    1552
  • Abstract
    We investigate a data-driven approach to robotic path planning and analyze its performance in the context of interception tasks. Trajectories of moving objects often contain repeated patterns of motion, and learning those patterns can yield interception paths that succeed more often. We therefore propose an original trajectory clustering algorithm for extracting motion patterns from trajectory data and demonstrate its effectiveness over the more common clustering approach of using k-means. We use the results to build a Hidden Markov Model of a target´s motion and predict movement. Our simulations show that these predictions lead to more effective interception. The results of this work have potential applications in coordination of multi-robot systems, tracking and surveillance tasks, and dynamic obstacle avoidance.
  • Keywords
    collision avoidance; hidden Markov models; learning (artificial intelligence); mobile robots; multi-robot systems; pattern clustering; trajectory control; data-driven approach; dynamic obstacle avoidance; hidden Markov model; interception paths; interception tasks; k-means clustering approach; motion pattern extraction; motion prediction; moving object trajectory; multirobot systems; pattern learning; robotic path planning; surveillance tasks; tracking tasks; trajectory clustering algorithm; Approximation algorithms; Approximation methods; Clustering algorithms; Hidden Markov models; Motion segmentation; Trajectory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Robots and Systems (IROS), 2012 IEEE/RSJ International Conference on
  • Conference_Location
    Vilamoura
  • ISSN
    2153-0858
  • Print_ISBN
    978-1-4673-1737-5
  • Type

    conf

  • DOI
    10.1109/IROS.2012.6386017
  • Filename
    6386017