Date & Time: 

   2023 / 11 / 03 (Fri) 14:20 - 16:20

Location: 

   Delta Building R216, NTHU

Speaker: 

   楊晧琮 教授

   國立中央大學 資訊工程學系

Topic: 

   Scheduling Algorithms for Mobility and Coverage in Security Scenario and Adversarial Setting

Abstract: 

   As sensors and robots become ubiquitous for security or surveillance missions, efficiently assigning resources to ensure security becomes crucial. However, patrol/ surveillance scheduling has different characteristics compared to other resource-constrained problems. First, the agents are required to visit/ re-visit targets and the feedback may not be obtained in the short run. Secondly, it naturally consists of the adversary in the model and the problem are varied based on different assumptions of the adversary behaviors.  In this talk, I will show how we tackle the patrolling problems from both game-theoretic and geometric views. The problem is formulated into a generalization of the patrol security game. We show that there are two simple objective functions, latency, and entropy, that affect the utility of the adversary greatly. I will first introduce heuristic algorithms specifically for the game-theoretic setting and then provide designs that for each of the objectives. At the end of this talk, I will also briefly introduce some new topics our lab currently focus on. These regard the fairness and privacy in the crowdsourcing and machine learning field.