A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment
Authors:
- 1 June 2015
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Geometry & Applications
- Vol. 25 (02) , 77-100
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Capturing an evader in polygonal environments with obstacles: The full visibility caseThe International Journal of Robotics Research, 2012
- Search and pursuit-evasion in mobile roboticsAutonomous Robots, 2011
- Randomized Pursuit-Evasion with Local VisibilitySIAM Journal on Discrete Mathematics, 2006
- GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRAInternational Journal of Computational Geometry & Applications, 2005
- A framework for pursuit evasion games inInformation Processing Letters, 2005
- Solution of David Gale's lion and man problemTheoretical Computer Science, 2001
- A VISIBILITY-BASED PURSUIT-EVASION PROBLEMInternational Journal of Computational Geometry & Applications, 1999
- “Lion and Man”: Upper and Lower BoundsINFORMS Journal on Computing, 1992
- A game of cops and robbersDiscrete Applied Mathematics, 1984
- An algorithm for finding shortest routes from all source nodes to a given destination in general networksQuarterly of Applied Mathematics, 1970