Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning

DOI10.1016/J.TCS.2008.02.039zbMATH Open1146.68066OpenAlexW2028560778MaRDI QIDQ930894FDOQ930894

Adrian Dumitrescu, Paweł Żyliński, Ichiro Suzuki

Publication date: 24 June 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.039

Recommendations

• Maximum thick paths in static and dynamic environments
• Motion planning in the presence of moving obstacles
• Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
• Best laid plans of lions and men
• Solution of David Gale's lion and man problem

zbMATH Keywords

avoidance numberlion and man problemmeasuring crowdednesssafe path planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Vertex-to-vertex pursuit in a graph
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• An annotated bibliography on guaranteed graph searching
• Probability and Computing
• Fugitive-search games on graphs and related parameters
• Title not available (Why is that?)
• Motion planning in the presence of moving obstacles
• “Lion and Man”: Upper and Lower Bounds
• Solution of David Gale's lion and man problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Vision-Based Pursuit-Evasion in a Grid
• Title not available (Why is that?)
• “Lion and Man”: A Postscript
• Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem

Cited In (8)

• Title not available (Why is that?)
• Approximate capture in Gromov-Hausdorff close spaces
• Geometric firefighting in the half-plane
• Improved bounds for cops-and-robber pursuit
• Bounds for cops and robber pursuit
• Reversibility properties of the fire-fighting problem in graphs
• Lions and contamination, triangular grids, and Cheeger constants
• How many lions are needed to clear a grid?

This page was built for publication: Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930894)