On the public citation graph

Competitive Perimeter Defense in Linear Environments

https://doi.org/10.2139/ssrn.4145446
0 signed · 48 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-68530-8_38openalex-extracted
Moving-Target TSP and Related Problems
inferredcites →https://doi.org/10.1007/978-3-030-64793-3_26openalex-extracted
A Review of Multi Agent Perimeter Defense Games
inferredcites →https://doi.org/10.1007/s004530010071openalex-extracted
Algorithms for the On-Line Travelling Salesman1
inferredcites →https://doi.org/10.1007/s10479-019-03412-xopenalex-extracted
The single line moving target traveling salesman problem with release times
inferredcites →https://doi.org/10.1007/s11590-014-0835-6openalex-extracted
The multiple traveling salesmen problem with moving targets
inferredcites →https://doi.org/10.1016/j.cor.2011.12.019openalex-extracted
Algorithms for on-line order batching in an order picking warehouse
inferredcites →https://doi.org/10.1016/j.tcs.2006.05.017openalex-extracted
How to whack moles
inferredcites →https://doi.org/10.1016/j.tcs.2015.11.017openalex-extracted
Lower and upper competitive bounds for online directed graph exploration
inferredcites →https://doi.org/10.1016/s0304-3975(00)00261-9openalex-extracted
On-line single-server dial-a-ride problems
inferredcites →https://doi.org/10.1016/s0304-3975(98)00116-9openalex-extracted
Competitive analysis of randomized paging algorithms
inferredcites →https://doi.org/10.1109/acc.2014.6859219openalex-extracted
Multiplayer reach-avoid games via low dimensional solutions and maximum matching
inferredcites →https://doi.org/10.1109/cdc.2018.8618879openalex-extracted
Local-game Decomposition for Multiplayer Perimeter-defense Problem
inferredcites →https://doi.org/10.1109/cdc40024.2019.9028868openalex-extracted
Dynamic Boundary Guarding Against Radially Incoming Targets
inferredcites →https://doi.org/10.1109/cdc40024.2019.9029340openalex-extracted
Strategies for Defending a Coastline Against Multiple Attackers
inferredcites →https://doi.org/10.1109/jproc.2011.2158181openalex-extracted
Dynamic Vehicle Routing for Robotic Systems
inferredcites →https://doi.org/10.1109/robot.2003.1241874openalex-extracted
Local exploration: online algorithms and a probabilistic framework
inferredcites →https://doi.org/10.1109/tac.2011.2105730openalex-extracted
Hamilton–Jacobi Formulation for Reach–Avoid Differential Games
inferredcites →https://doi.org/10.1109/tac.2016.2577619openalex-extracted
Multiplayer Reach-Avoid Games via Pairwise Outcomes
inferredcites →https://doi.org/10.1109/tro.2015.2432612openalex-extracted
Algorithms for Cooperative Active Localization of Static Targets With Mobile Bearing Sensors Under Communication Constraints
inferredcites →https://doi.org/10.1109/tro.2019.2935345openalex-extracted
Task Assignment for Multiplayer Reach–Avoid Games in Convex Domains via Analytical Barriers
inferredcites →https://doi.org/10.1137/141000087openalex-extracted
Vehicle Routing Algorithms for Radially Escaping Targets
inferredcites →https://doi.org/10.1145/2786.2793openalex-extracted
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1287/ijoc.13.2.138.10517openalex-extracted
The Online TSP Against Fair Adversaries
inferredcites →https://doi.org/10.1287/opre.39.4.601openalex-extracted
A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
inferredcites →https://doi.org/10.1287/opre.41.1.60openalex-extracted
Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
inferredcites →https://doi.org/10.1287/trsc.34.4.426.12325openalex-extracted
Diversion Issues in Real-Time Vehicle Dispatching
inferredcites →https://doi.org/10.23919/acc.2019.8814294openalex-extracted
Cooperative Two-Pursuer One-Evader Blocking Differential Game
inferredcites →https://doi.org/10.48550/arxiv.1909.11881openalex-extracted
inferredcites →https://doi.org/10.1007/978-3-319-47413-7_8openalex-snapshot
Patrolling a Pipeline
inferredcites →https://doi.org/10.1007/s10846-016-0379-3openalex-snapshot
Pursuit-Evasion Games of High Speed Evader
inferredcites →https://doi.org/10.1007/s10846-018-0963-9openalex-snapshot
The Multi-pursuer Single-Evader Game
inferredcites →https://doi.org/10.1016/j.automatica.2016.05.007openalex-snapshot
Cooperative pursuit with Voronoi partitions
inferredcites →https://doi.org/10.1016/j.automatica.2018.04.008openalex-snapshot
Optimal evasive strategies for multiple interacting agents with motion constraints
inferredcites →https://doi.org/10.1016/j.automatica.2022.110207openalex-snapshot
Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games
inferredcites →https://doi.org/10.1016/j.ejor.2023.06.011openalex-snapshot
A stochastic game framework for patrolling a border
inferredcites →https://doi.org/10.1016/j.tcs.2010.07.003openalex-snapshot
Cops and Robbers from a distance
inferredcites →https://doi.org/10.1016/s0012-365x(97)00165-9openalex-snapshot
A game of cops and robbers played on products of graphs
inferredcites →https://doi.org/10.1090/stml/061openalex-snapshot
The Game of Cops and Robbers on Graphs
inferredcites →https://doi.org/10.1109/cdc.2009.5400538openalex-snapshot
A dynamic boundary guarding problem with translating targets
inferredcites →https://doi.org/10.1109/iros.2004.1389597openalex-snapshot
Hybrid control for visibility-based pursuit-evasion games
inferredcites →https://doi.org/10.1137/100812963openalex-snapshot
A Bound for the Cops and Robbers Problem
inferredcites →https://doi.org/10.1287/opre.1110.0983openalex-snapshot
Patrolling Games
inferredcites →https://doi.org/10.1287/opre.2016.1511openalex-snapshot
Patrolling a Border
inferredcites →https://doi.org/10.1287/opre.2022.2346openalex-snapshot
Continuous Patrolling Games
inferredcites →https://doi.org/10.23919/acc50511.2021.9483308openalex-snapshot
Competitive Perimeter Defense on a Line
inferredcites →https://doi.org/10.2514/1.g000584openalex-snapshot
Pursuit Strategy to Capture High-Speed Evaders Using Multiple Pursuers
inferredcites →https://doi.org/10.2514/1.i010739openalex-snapshot
Cooperative Pursuit by Multiple Pursuers of a Single Evader

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-032-08067-7_1openalex-snapshot
Worst Case Assurance Guarantees for Black-Box Perimeter Defense Policies
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.