m-RENDEZVOUS: Multi-Agent Asynchronous Rendezvous Search Technique

We study the problem of asynchronous rendezvous search with multiple mobile agents (robots) in the plane. The goal of the robots is to meet at a location in the environment which is not determined in advance as quickly as possible. They do not know the initial locations of each other or their own in...

Full description

Saved in:
Bibliographic Details
Published in:Future generation computer systems 2022-01, Vol.126, p.185-195
Main Authors: Ozsoyeller, Deniz, Özkasap, Öznur, Aloqaily, Moayad
Format: Article
Language:English
Subjects:
Asynchronous rendezvous
Multi-agent systems
Online planning
Rendezvous search
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the problem of asynchronous rendezvous search with multiple mobile agents (robots) in the plane. The goal of the robots is to meet at a location in the environment which is not determined in advance as quickly as possible. They do not know the initial locations of each other or their own initial locations. Moreover, the initial distance between any pair of robots is also unknown. Therefore, the problem must be solved using an online approach. We study a new variant of the rendezvous search problem which we call m-RP. The objective of m-RP is exactly m
ISSN:0167-739X
1872-7115
DOI:10.1016/j.future.2021.08.007