Grant: Discovery Grants Program - Individual
Carleton University
$24,000.00
Algorithms design for motion problems: theory & practice
FY 2011-12
Summary
Movement problems are among the fundamental problems studied in computational geometry and arise in a variety of applications areas. These areas include: morphing, topology matching, creation of a virtual tape measure to measure distances along surfaces of heritage objects, flight planning avoiding hazardous weather, methods for generating road plans, and modeling optimal beam treatment for bio-medical applications. We propose to provide the theoretical and practical foundations for algorithms that solve problems related to computing shortest paths in scenarios where the paths travel through non-homogeneous media. We will address in particular problems where the domain is dynamically changing, as is the case in many applications. We plan to make our methods accessible to other researchers by providing a tool-box of implemented algorithms. We also propose to study problems involving distances between paths which could e.g., be useful to see if an Alzheimer's patient is deviating significantly from a route that he/she is typically taking. In that case, a cellphone could trigger an alarm.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
332-2011
Name nom
Sack, JËrgRüdiger
Department département
Computer Science, School of
Organization id
23
Institution établissement
Carleton University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2011
Award amount
24000
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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
1
Nb partie
5
Application title
Algorithms design for motion problems: theory & practice
Keyword
NSERC
Application summary
Movement problems are among the fundamental problems studied in computational geometry and arise in a variety of applications areas. These areas include: morphing, topology matching, creation of a virtual tape measure to measure distances along surfaces of heritage objects, flight planning avoiding hazardous weather, methods for generating road plans, and modeling optimal beam treatment for bio-medical applications. We propose to provide the theoretical and practical foundations for algorithms that solve problems related to computing shortest paths in scenarios where the paths travel through non-homogeneous media. We will address in particular problems where the domain is dynamically changing, as is the case in many applications. We plan to make our methods accessible to other researchers by providing a tool-box of implemented algorithms. We also propose to study problems involving distances between paths which could e.g., be useful to see if an Alzheimer's patient is deviating significantly from a route that he/she is typically taking. In that case, a cellphone could trigger an alarm.