Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Trajectory clustering for motion prediction
This is not the latest version of this item. The latest version can be found here.

Trajectory clustering for motion prediction

Thumbnail Image
Download
Name

traj.pdf

Description
Accepted version
Size

741.6 KB

Format

Adobe PDF

Checksum (MD5)

e9d631ac881d98878189bc1684030405

sword-2019-07-16T17:04:01.original.xml (130 B)
Original SWORD entry document
Author(s)
Sung, Cynthia
•
Feldman, Dan
•
Rus, Daniela
Date Issued
October 2012
Publisher
IEEE
Citation
Sung, Cynthia, Feldman, Dan and Rus, Daniela. 2012. "Trajectory clustering for motion prediction."
Version
Author's final manuscript
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. © 2012 IEEE.
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/137185
DOI of Published Version
10.1109/iros.2012.6386017
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.