4 papers
Solving a Stackelberg Game on Transportation Networks in a Dynamic Crime Scenario: A Mixed Approach on Multi-Layer Networks
Sukanya Samanta, Kei Kimura, Makoto Yokoo +1
Interdicting a criminal with limited police resources is a challenging task as the criminal changes location over time. The size of the large transportation network further adds to…
A Dynamic Programming Approach to Evader Pathfinding in Static Pursuit Scenarios
Sukanya Samanta, Manohar Reddy
The interdiction of escaping adversaries in urban networks is a critical security challenge. State-of-the-art game-theoretic models, such as the Escape Interdiction Game (EIG), pro…
Maximal Covering Location Problem: A Set Coverage Approach Using Dynamic Programming
Sukanya Samanta, Abhi Rohit Kalathoti, Siva Jayanth Gonchi +2
The Maximal Covering Location Problem (MCLP) represents a fundamental optimization challenge in facility location theory, where the objective is to maximize demand coverage while o…
Design of A* based heuristic algorithm for efficient interdiction in multi-Layer networks
Sukanya Samanta
Intercepting a criminal using limited police resources presents a significant challenge in dynamic crime environments, where the criminal's location continuously changes over time.…