BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:3be45102-48a4-4bf5-a3a7-47b85961364d
X-WR-CALNAME:[M2F] François Schwarzentruber (IRISA\, Rennes)
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20241027T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20220327T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20230326T020000
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:3be45102-48a4-4bf5-a3a7-47b85961364d
DTSTAMP:20260914T191813Z
CLASS:PUBLIC
DESCRIPTION:** Overview on Connected Multi-agent path finding **\n\nMotivat
 ed by the increasing appeal of robots in information-gathering missions\, 
 we study multi-agent path planning problems in which the agents must remai
 n interconnected. We model an area by a topological graph specifying the m
 ovement and the connectivity constraints of the agents. In the first part 
 of the talk\, we study the theoretical complexity of the reachability and 
 the coverage problems of a fleet of connected agents. We also introduce a 
 new class called sight-moveable graphs which admit efficient algorithms. I
 n the second part\, we discuss several algorithms to solve connected multi
 -agent path finding.
DTSTART;TZID=Europe/Paris:20230321T140000
DTEND;TZID=Europe/Paris:20230321T150000
LOCATION:LaBRI
SEQUENCE:0
SUMMARY:[M2F] François Schwarzentruber (IRISA\, Rennes)
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR