Search and Rendezvous by Mobile Robots in Continuous Domains

It appears your Web browser is not configured to display PDF files. Download adobe Acrobat or click here to download the PDF file.

Click here to download the PDF file.

Creator: 

Killick, Ryan Scott

Date: 

2021

Abstract: 

A collection of $n \geq 1$ mobile robots/agents are located within a continuous domain $\mathcal{D}$. In the search problem the agents are tasked with finding a stationary target located at an unknown position within $\mathcal{D}$. In the rendezvous problem the agents are required to all converge to any single location within $\mathcal{D}$. In either problem the capabilities of the agents are described by a robot model $\mathcal{M}$ (describing, for example, speed constraints, the fault model, knowledge available to the agents, memory capacity), and the cost of a solution algorithm $S$ is described by a cost function $\mathcal{C}$ which assigns a real number $\mathcal{C}(S)$ to each $S$. The ultimate goal of either problem is for the agents to complete the desired task whilst minimizing $\mathcal{C}$ subject to $\mathcal{M}$. This thesis will be of the integrated form and will be composed of several published results concerning the problems of search and rendezvous by mobile agents in continuous domains.

Subject: 

Computer Science

Language: 

English

Publisher: 

Carleton University

Contributor: 

Supervisor/co-author: 
Evangelos Kranakis
co-author: 
Danny Krizanc
co-author: 
Grzegorz Stachowiak
co-author: 
Jaroslav Opatrny
co-author: 
Georgiou Konstantinos
co-author: 
Jurek Czyzowicz
co-author: 
Lata Narayanan
co-author: 
Leszek Gasieniec
co-author: 
Manuel Lafond
co-author: 
Masafumi Yamashita
co-author: 
Nicola Santoro
co-author: 
Oscar Morales Ponce
co-author: 
Paola Flocchini
co-author: 
Sunil Shende

Thesis Degree Name: 

Doctor of Philosophy: 
Ph.D.

Thesis Degree Level: 

Doctoral

Thesis Degree Discipline: 

Computer Science

Parent Collection: 

Theses and Dissertations

Items in CURVE are protected by copyright, with all rights reserved, unless otherwise indicated. They are made available with permission from the author(s).