Distributed Area Coverage Control with Imprecise Robot Localization
This article examines the problem of area coverage for a network of mobile robots with imprecise agent localization. Each robot has uniform radial sensing ability, governed by first order kinodynamics. The convex-space is partitioned based on the Guaranteed Voronoi (GV) principle and each robot's area of responsibility corresponds to its GV-cell, bounded by hyperbolic arcs. The proposed control law is distributed, demands the positioning information about its GV-Delaunay neighbors and has an inherent collision avoidance property.
Code (0)
등록된 구현이 없습니다.
Tasks
Collision AvoidanceSimilar Papers 제목 키워드 기반
Distributed Coverage Control of Constrained Constant-Speed Unicycle Multi-Agent Systems
This paper proposes a novel distributed coverage controller for a multi-agent system with constant-speed unicycle robots (CSUR). The work is motivated by the limitation of the conventional method that does not ensure the…
MDCPP: Multi-robot Dynamic Coverage Path Planning for Workload Adaptation
Multi-robot Coverage Path Planning (MCPP) addresses the problem of computing paths for multiple robots to effectively cover a large area of interest. Conventional approaches to MCPP typically assume that robots move at f…
Distributed Coverage Hole Prevention for Visual Environmental Monitoring with Quadcopters via Nonsmooth Control Barrier Functions
This paper proposes a distributed coverage control strategy for quadcopters equipped with downward-facing cameras that prevents the appearance of unmonitored areas in between the quadcopters' fields of view (FOVs). We de…
Distributed Area Coverage with High Altitude Balloons Using Multi-Agent Reinforcement Learning
High Altitude Balloons (HABs) can leverage stratospheric wind layers for limited horizontal control, enabling applications in reconnaissance, environmental monitoring, and communications networks. Existing multi-agent HA…
Multi-agent Reinforcement LearningEfficient Multi-Robot Coverage of a Known Environment
This paper addresses the complete area coverage problem of a known environment by multiple-robots. Complete area coverage is the problem of moving an end-effector over all available space while avoiding existing obstacle…