Multi-agent deep reinforcement learning for multi-robot applications: A survey

J Orr, A Dutta - Sensors, 2023 - mdpi.com
Deep reinforcement learning has produced many success stories in recent years. Some
example fields in which these successes have taken place include mathematics, games …

CPS-based smart warehouse for industry 4.0: A survey of the underlying technologies

X Liu, J Cao, Y Yang, S Jiang - Computers, 2018 - mdpi.com
This paper discusses how the state-of-the-art techniques in cyber-physical systems facilitate
building smart warehouses to achieve the promising vision of industry 4.0. We focus on four …

[HTML][HTML] Mutual visibility by luminous robots without collisions

GA Di Luna, P Flocchini, SG Chaudhuri, F Poloni… - Information and …, 2017 - Elsevier
Abstract We consider the Mutual Visibility problem for anonymous dimensionless robots with
obstructed visibility moving in a plane: starting from distinct locations, the robots must reach …

Robots with lights: Overcoming obstructed visibility without colliding

GA Di Luna, P Flocchini, S Gan Chaudhuri… - Stabilization, Safety, and …, 2014 - Springer
Robots with lights is a model of autonomous mobile computational entties operating in the
plane in Look-Compute-Move cycles: each agent has an externally visible light which can …

Uniform circle formation for swarms of opaque robots with lights

C Feletti, C Mereghetti, B Palano - … , SSS 2018, Tokyo, Japan, November 4 …, 2018 - Springer
Abstract The Uniform Circle Formation problem requires a swarm of mobile agents,
arbitrarily positioned onto the plane, to move on the vertices of a regular polygon. Each …

𝒪 (log {n})-Time Uniform Circle Formation for Asynchronous Opaque Luminous Robots

C Feletti, C Mereghetti, B Palano - 27th International Conference …, 2024 - drops.dagstuhl.de
Abstract We study the Uniform Circle Formation (UCF) problem for a distributed system of n
robots which are required to displace on the vertices of a regular n-gon. We consider a well …

Uniform circle formation for fully, semi-, and asynchronous opaque robots with lights

C Feletti, C Mereghetti, B Palano - Applied Sciences, 2023 - mdpi.com
In the field of robotics, a lot of theoretical models have been settled to formalize multi-agent
systems and design distributed algorithms for autonomous robots. Among the most …

k-Circle Formation and k-epf by Asynchronous Robots

S Bhagat, B Das, A Chakraborty, K Mukhopadhyaya - Algorithms, 2021 - mdpi.com
For a given positive integer k, the k-circle formation problem asks a set of autonomous,
asynchronous robots to form disjoint circles having k robots each at distinct locations …

Distributed algorithms for barrier coverage using relocatable sensors

M Eftekhari, E Kranakis, D Krizanc… - Proceedings of the …, 2013 - dl.acm.org
We study the barrier coverage problem using relocatable sensor nodes. We assume each
sensor can sense an intruder or event inside its sensing range. Sensors are initially located …

Time-color tradeoff on uniform circle formation by asynchronous robots

D Pattanayak, G Sharma - 2024 IEEE International Parallel and …, 2024 - ieeexplore.ieee.org
We consider the distributed setting of n autonomous mobile robots operating in Look-
Compute-Move (LCM) cycles on a plane. Robots are equipped with lights (ie, the robots with …