San Francisco / Qu´ebec / Mexico city / Montreal / New York / Paris / Brussels / /
Company
Google / Microsoft / /
Country
Germany / Canada / Singapore / / /
Facility
McGill University / /
IndustryTerm
street networks / large public transportation networks / distance optimal solution / road network / web application framework / road networks / real world applications / search problem / travel instructions / street network / slow and costly cellular networks / web-based application framework / energy / database server / real time delays / energy efficient rendezvous algorithm / on-line planning extension / on-line problem / hybrid algorithm / actual travel times / point algorithm / Typical practical solutions / Energy efficient robot rendezvous / search games / numerical solution / made using slow and costly cellular networks / using actual travel times / /
Organization
McGill University / Centre for Intelligent Machines / VLDB Endowment / Mobile Robotics Lab / Natural Sciences and Engineering Research Council / IEEE Computer Society / /
Person
Stephen L Smith / Erik Carlsson / Gabriel Svennerberg / Patrick Weber / Steven L Waslander / Robert Geisberger / Veselin Raychev / Chris Harrelson / Fabien Viger / Neil Mathew / Hannah Bast / Mordechai Haklay / Arno Eigenwillig / Daniel J Turco / Joe Schwartz / Malika Meghjani / /
Position
rendezvous planner / /
ProgrammingLanguage
TSP / /
Technology
API / smart phones / meeting point algorithm / ESA / GIS / rendezvous algorithm / hybrid algorithm / load balancing / proposed algorithm / http / rendezvous location Path execution Algorithm / using the hybrid algorithm in 10 / /
Multi-agent rendezvous on street networks Malika Meghjani and Gregory Dudek Abstract— In this paper we present an algorithm for finding a distance optimal rendezvous location with respect to both initial and target loc