A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment (Q3449119): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1401.2960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Lion and Man”: Upper and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of David Gale's lion and man problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for pursuit evasion games in / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Pursuit-Evasion with Local Visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding shortest routes from all source nodes to a given destination in general networks / rank
 
Normal rank

Latest revision as of 23:57, 10 July 2024

scientific article
Language Label Description Also known as
English
A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment
scientific article

    Statements

    Identifiers