Back to Results
First PageMeta Content
Search algorithms / Pursuit-evasion / game theory / Shortest path problem / NP-complete / Planar graph / Breadth-first search / Binary tree / Depth-first search / Graph theory / Theoretical computer science / Mathematics


On the complexity of searching for an evader with a faster pursuer Florian Shkurti1 and Gregory Dudek1 Abstract— In this paper we examine pursuit-evasion games in which the pursuer has higher speed than the evader. Thi
Add to Reading List

Document Date: 2013-05-18 17:31:04

Open Document

File Size: 259,97 KB

Share Result on Facebook

City

Zurich / Montr´eal / /

Company

Capture Times / Multi-Agent Systems / /

Country

Switzerland / Canada / /

Currency

ZAR / /

/

Event

Product Issues / /

Facility

McGill University / /

IndustryTerm

search strategies / search party / lineartime algorithm / search plan / search paradigm / typical graph-searching algorithms / approximation algorithm / randomized search methods / node search / depth-first search / multirobot search / search number / guaranteed search / randomized and deterministic search strategies / pursuer search plans / oil spill / breadth-first search / deterministic and randomized search methods / linear-time algorithm / guaranteed search algorithm / deterministic and randomized search heuristics / search heuristics / /

Organization

Center for Intelligent Machines / School of Computer Science / Artifical Intelligence / Walter Sumner Foundation / Natural Sciences and Research Council of Canada / McGill University / /

Person

Nash Equilibrium / Sn / Pursuit / /

Position

purser / player / /

Product

waters / /

ProgrammingLanguage

RC / /

ProvinceOrState

Quebec / /

PublishedMedium

Journal of the ACM / The International Journal / Theoretical Computer Science / /

Technology

randomized algorithm / approximation algorithm / typical graph-searching algorithms / linear-time algorithm / guaranteed search algorithm / lineartime algorithm / /

SocialTag