alexa Decentralized sweep coverage algorithm for multi-agent systems with workload uncertainties


Advances in Robotics & Automation

Author(s): Zhai C Hong Y

Abstract Share this page

This paper proposes a sweep coverage formulation for a multi-agent system to cover a region with uncertain workload density, and provides a decentralized coverage algorithm based on the formulation. To achieve the coverage, the covered region is divided into a finite number of stripes, and an algorithm is proposed by incorporating two operations on stripes: workload partition and sweeping. Theoretical analysis is given to estimate the error between the actual coverage time and the optimal time, and numerical analysis is provided to illustrate the proposed algorithm. This article was published in Automatica and referenced in Advances in Robotics & Automation

Relevant Expert PPTs

Recommended Conferences

Relevant Topics

Peer Reviewed Journals
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version