Ahmad Bilal Asghar

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
— In this paper we consider a robot patrolling problem in which events arrive randomly over time at the vertices of a graph. When an event arrives it remains active for a random amount of time. If that time active exceeds a certain threshold, then we say that the event is a true event; otherwise it is a false event. The robot(s) can traverse the graph to(More)
  • 1