Log In Sign Up

Probing a Set of Trajectories to Maximize Captured Information

by   Sandor P. Fekete, et al.

We study a trajectory analysis problem we call the Trajectory Capture Problem (TCP), in which, for a given input set T of trajectories in the plane, and an integer k≥ 2, we seek to compute a set of k points (“portals”) to maximize the total weight of all subtrajectories of T between pairs of portals. This problem naturally arises in trajectory analysis and summarization. We show that the TCP is NP-hard (even in very special cases) and give some first approximation results. Our main focus is on attacking the TCP with practical algorithm-engineering approaches, including integer linear programming (to solve instances to provable optimality) and local search methods. We study the integrality gap arising from such approaches. We analyze our methods on different classes of data, including benchmark instances that we generate. Our goal is to understand the best performing heuristics, based on both solution time and solution quality. We demonstrate that we are able to compute provably optimal solutions for real-world instances.


page 2

page 12


Solving Large-Scale Minimum-Weight Triangulation Instances to Provable Optimality

We consider practical methods for the problem of finding a minimum-weigh...

Computing Area-Optimal Simple Polygonizations

We consider methods for finding a simple polygon of minimum (Min-Area) o...

Algorithms for Floor Planning with Proximity Requirements

Floor planning is an important and difficult task in architecture. When ...

Implementation of iterative local search (ILS) for the quadratic assignment problem

The quadratic assignment problem (QAP) is one of the hardest NP-hard pro...

Computing Consensus Curves

We consider the problem of extracting accurate average ant trajectories ...

Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches

Even though it is well known that for most relevant computational proble...

Finding First and Most-Beautiful Queens by Integer Programming

The n-queens puzzle is a well-known combinatorial problem that requires ...