Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Simon Fraser University

$25,000.00

Polygon search and media on demand

EF 2008-09

Résumé
[Polygon search:] Robots can carry out intelligent tasks in an environment that is too hostile or boring to human beings, such as explosives disposal, undersea exploration and 24-hour surveillance. My research considers robots that search for moving objects ("intruders") in a polygonal room, by illuminating them with one or more flashlights. Given a polygon, you would want to know how many robots with how many flashlights are required for searching the polygon, and if the number is determined, you want to plan their motion in an efficient way. The problem becomes more complex if there are obstacles in the polygon. We assume that these obstacles are also of polygonal shape. [VOD broadcasting:] Video-on-demand delivers requested videos to many users. If a video is requested by a large number of users, then the server cannot keep with the demand. One way to cope with this problem is to broadcast popular videos, so that any number of users can download and view them without excessive delay. The amount of bandwidth required by video depends on the initial delay, sometimes called the play-out latency. We want to design broadcasting schemes that minimize this bandwidth, and yet are easy to implement.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
5240-2007
Name nom
Kameda, Tsunehiko(Tiko)
Department département
Computing Science
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2007
Award amount
25000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2600
Research subject group en
Robotics
Research subject group fr
Robotique
Research subject en
Robotics
Research subject fr
Robotique
Partie
2
Nb partie
3
Application title
Polygon search and media on demand
Keyword
NA
Application summary
[Polygon search:] Robots can carry out intelligent tasks in an environment that is too hostile or boring to human beings, such as explosives disposal, undersea exploration and 24-hour surveillance. My research considers robots that search for moving objects ("intruders") in a polygonal room, by illuminating them with one or more flashlights. Given a polygon, you would want to know how many robots with how many flashlights are required for searching the polygon, and if the number is determined, you want to plan their motion in an efficient way. The problem becomes more complex if there are obstacles in the polygon. We assume that these obstacles are also of polygonal shape. [VOD broadcasting:] Video-on-demand delivers requested videos to many users. If a video is requested by a large number of users, then the server cannot keep with the demand. One way to cope with this problem is to broadcast popular videos, so that any number of users can download and view them without excessive delay. The amount of bandwidth required by video depends on the initial delay, sometimes called the play-out latency. We want to design broadcasting schemes that minimize this bandwidth, and yet are easy to implement.