Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Carleton University

$31,000.00

Mobility, Search and Communication

FY 2020-21

Summary
Some of the most striking developments in mobile agent computing today are occurring due to the synergy between communication, search and mobility. Equipped with locomotion mechanisms and outfitted with hardware and software for perception, mobile robots can move and perceive the world. A mobile robot is required to navigate through a well-defined domain by controlling its motion and applying its perception capabilities in the most effective and efficient manner, while at the same time communicating its findings to the rest of the robots so as to facilitate the solution of well-defined network tasks. Current research on cooperative mobile agent (robot, sensor) systems suffers from a lack of understanding of the impact of mobility in performing fundamental communication and search tasks. More specifically, we are interested in understanding the following questions. How can a swarm of mobile agents navigate efficiently through a distributed interconnected environment to complete its computing tasks? Which agent capabilities and what knowledge can be leveraged? What is special about a particular problem that makes it solvable efficiently as opposed to alternatives? This proposal will pursue three complementary research themes within the context of mobile agent computing. 1) How do critical regimes arise when agent mobility is employed to optimize various network tasks? 2) What is the cost of optimal co-operative search in graphs and geometric domains when all tasks are finished by all agents? 3) How do interactive graphs affect the stability and convergence of population protocols in networks? This project aims to advance our knowledge by pursuing these three research directions. Topics proposed are expected to play a significant role in the development of theoretical computer science and distributed computing. Our approach will employ algorithmic design methodologies as well as probabilistic and deterministic techniques in the context of distributed computing. The general guiding principles of our approach are the following. 1) Provide a deeper understanding of the behavior of interacting communicating entities within a dynamic network based on the methodologies of algorithmic distributed computing. 2) Develop research techniques using rigorous mathematical models that satisfy strict and well-defined requirements and are motivated from practical considerations in the established research space of wireless ad hoc & sensor networks, robot search & mobility, biological distributed computing, and social networks. 3) Train Highly Qualifies Personnel at the PDF, PhD and Master's level as well as gifted undergraduates in these emerging research fields.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2016-06213
Name nom
Kranakis, Evangelos
Department département
School of Computer Science
Organization id
23
Institution établissement
Carleton University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2020
Competition year année de concours
2016
Award amount
31000
Program id
RGPIN
Program name 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
803
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 communications
Area of application fr
Téléinformatique
Research subject code
2704
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Distributed and parallel processing
Research subject fr
Traitement réparti et simultané
Installment
inst:5-6
Partie
2
Nb partie
6
Application title
Mobility, Search and Communication
Keyword
NSERC
Application summary
Some of the most striking developments in mobile agent computing today are occurring due to the synergy between communication, search and mobility. Equipped with locomotion mechanisms and outfitted with hardware and software for perception, mobile robots can move and perceive the world. A mobile robot is required to navigate through a well-defined domain by controlling its motion and applying its perception capabilities in the most effective and efficient manner, while at the same time communicating its findings to the rest of the robots so as to facilitate the solution of well-defined network tasks. Current research on cooperative mobile agent (robot, sensor) systems suffers from a lack of understanding of the impact of mobility in performing fundamental communication and search tasks. More specifically, we are interested in understanding the following questions. How can a swarm of mobile agents navigate efficiently through a distributed interconnected environment to complete its computing tasks? Which agent capabilities and what knowledge can be leveraged? What is special about a particular problem that makes it solvable efficiently as opposed to alternatives? This proposal will pursue three complementary research themes within the context of mobile agent computing. 1) How do critical regimes arise when agent mobility is employed to optimize various network tasks? 2) What is the cost of optimal co-operative search in graphs and geometric domains when all tasks are finished by all agents? 3) How do interactive graphs affect the stability and convergence of population protocols in networks? This project aims to advance our knowledge by pursuing these three research directions. Topics proposed are expected to play a significant role in the development of theoretical computer science and distributed computing. Our approach will employ algorithmic design methodologies as well as probabilistic and deterministic techniques in the context of distributed computing. The general guiding principles of our approach are the following. 1) Provide a deeper understanding of the behavior of interacting communicating entities within a dynamic network based on the methodologies of algorithmic distributed computing. 2) Develop research techniques using rigorous mathematical models that satisfy strict and well-defined requirements and are motivated from practical considerations in the established research space of wireless ad hoc & sensor networks, robot search & mobility, biological distributed computing, and social networks. 3) Train Highly Qualifies Personnel at the PDF, PhD and Master's level as well as gifted undergraduates in these emerging research fields.
Carleton University - $31,000 Grant (2020-21) | Canada Spends