BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260922T191602Z
UID:Seminar-dept-383@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20150623T130000
DTEND:20150623T140000
SUMMARY:School Seminar Series
DESCRIPTION:Prof Jurek Czyzowicz: Patrolling by faulty robots\n\nMobile robots collaborate in order to solve efficiently the central problems in algorithmics of distributed computing like searching/exploration, rendez-vous or pattern formation. Patrolling is a perpetual traversal of an environment by a collection of mobile robots. The standard measure of efficiency of a patrolling algorithm is defined by its idleness – the minimal time interval during which every point of the environment is always visited by at least one robot. Boundary patrolling and fence patrolling were fundamental problems investigated by the robotics community in the last decade.\n\n\n\nWe sketch briefly previous results concerning the algorithms for the boundary and fence-patrolling problem. When some (unknown) robots of the collection cannot perform their duties, the fence patrolling algorithms become surprisingly unnatural. In more details we discuss a new algorithm for patrolling by unreliable robots. We show that the presented algorithm achieves the idleness, which is the best possible.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=383
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR