mpla.math.uoa.gr
Font size: Αα Αα Αα hide gadgets
You are here: Seminars » 2012-2013 » E. Kranakis, 2013-05-17 { prev, contents, next } Anonymously browsing from 54.162.241.40 at 07:33:02, 23-11-2017. login
download seminar details: { pdf }

Seminar

Speaker: Evangelos Kranakis (Professor, School of Computer Science, Carleton University, Ottawa)
Title: Monitoring the Plane with Rotating Radars
Date: Friday, 17 May 2013
Time: 18:30-19:30
Location: Univeristy of Athens, Department of Mathematics, University of Athens, room Γ33

Abstract

Consider an arbitrary set P of n points in the plane and suppose that a radar is located at each point in P. The radars are rotating perpetually (around their centre) with identical constant speeds, continuously emitting a half-infinite light ray. A radar can ``locate'' (detect) any object in the plane when its light ray is incident to the object. Motivated from the basic idea of radar radio echo-location we propose a new model suitable for monitoring the plane. For any initial orientation of the light rays and any point p in the plane, we define the idle time of p, as the maximum time that p is unattended by any of the radars. We are interested in studying the following monitoring problem: What should the initial orientation of the n radar rays be so as to minimize the maximum idle time of any point in the plane? We propose algorithms for specifying the initial orientations of the radar rays and prove various bounds on the idle time depending on the type of configuration of n points P in the plane. We study interesting time/beam-width tradeoffs involving arbitrary pointsets and deterministic and randomized algorithms.

Comments

You must be logged in to comment.

Reporter

Page updates

No recent updates.

Feeds RSS and Atom feeds

posts
all posts RSS
news RSS
announcements RSS
website news RSS
events
all events RSS
defenses RSS
exams RSS
seminars RSS
graduations RSS
Web standards: XHTML1.0, CSS3.
© 1996 – 2017 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.