5 accepted papers
In this letter, we present a distributed algorithm for flocking in complex environments that operates at constant altitude, without explicit communication, no a priori information about the environment, and by using only on-board sensing and computation capabilities. We provide sufficient conditions
This letter proposes a distributed strategy to achieve both persistent monitoring and target detection in a rectangular and obstacle-free environment. Each robot has to repeatedly follow a smooth trajectory and avoid collisions with other robots. To achieve this goal, we rely on the time-inverted Ku
Given a team composed of groups of robots with different abilities and different tasks, we propose a control solution that allows maintaining the connectivity between the agents whilst securing the execution of the different tasks assigned to the team. The specific notion of connectivity adopted her
We present a Lloyd-based navigation solution for robots that are required to move in a dynamic environment, where static obstacles (e.g, furnitures, parked cars) and unpredicted moving obstacles (e.g., humans, other robots) have to be detected and avoided on the fly. The algorithm can be computed in…
The letter proposes a combination of ideas to support navigation for a mobile robot across dynamic environments, cluttered with obstacles and populated by human beings. The combination of the classical potential field methods and limit cycle based approach with an innovative shape for the limit cycl