Next:
Problem formulation
Up:
Shadow Information Spaces: Combinatorial
Previous:
Filters
Nondeterministically Moving Targets and Combinatorial Filters
Subsections
Problem formulation
Relation to integer linear programming and polynomial time solvability
Bipartite information space
Tracking targets as a max-flow problem
Incorporating FOV events
Solving a variety of other tasks
Refining initial bounds
Counting
Pursuit-evasion
Incorporating distinguishability
Jingjin Yu 2011-01-18
