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

*(English)*Zbl 1364.93041Summary: 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.

##### MSC:

93A14 | Decentralized systems |

93C41 | Control/observation systems with incomplete information |

68T42 | Agent technology and artificial intelligence |

PDF
BibTeX
XML
Cite

\textit{C. Zhai} and \textit{Y. Hong}, Automatica 49, No. 7, 2154--2159 (2013; Zbl 1364.93041)

Full Text:
DOI

**OpenURL**

##### References:

[1] | Butler, Z., Rizzi, A., & Hollis, R. (2000). Complete distributed coverage of rectilinear environments. In Proc. of the workshop on the algorithmic foundations of robotics (pp. 51-62). Dartmouth, New Hampshire, USA. · Zbl 0995.68126 |

[2] | Cassandras, C. G.; Li, W., Sensor networks and cooperative control, European Journal of Control, 11, 4-5, 436-463, (2005) · Zbl 1293.93069 |

[3] | Chen, Z.; Zhang, H., No-beacon collective circular motion of jointly connected multi-agents, Automatica, 47, 9, 1929-1937, (2011) · Zbl 1227.93005 |

[4] | Cheng, T.; Andrey, V. Savkin, A distributed self-deployment algorithm for the coverage of mobile wireless sensor networks, IEEE Communications Letters, 13, 11, 877-879, (2009) |

[5] | Cheng, T., & Andrey, V. Savkin (2009b). Decentralized coordinated control of a vehicle network for deployment in sweep coverage. In Proc. of the IEEE conference on control and automation (pp. 275-279). Christchurch, New Zealand. |

[6] | Choset, H., Coverage of known spaces: the boustrophedon cellular decomposition, Autonomous Robots, 9, 3, 247-253, (2000) |

[7] | Choset, H., Coverage for robotics—a survey of recent results, Annals of Mathematics and Artificial Intelligence, 31, 1-4, 113-126, (2001) · Zbl 1314.68317 |

[8] | Demmel, J., Applied numerical linear algebra, (1997), SIAM Philadelphia, PA · Zbl 0879.65017 |

[9] | Gage, D. (1992). Command control for many-robot systems. In Proc. of annual AUVS technical symposium (pp. 22-24). Huntsville, Alabama, USA. |

[10] | Hong, Y.; Hu, J.; Gao, L., Tracking control for multi-agent consensus with an active leader and variable topology, Automatica, 42, 9, 1177-1182, (2006) · Zbl 1117.93300 |

[11] | Hussein, I. I.; Stipanović, D., Effective coverage control for mobile sensor networks with guaranteed collision avoidance, IEEE Transactions on Control Systems Technology, 15, 4, 642-657, (2007) |

[12] | Hussein, I.I., Stipanović, D., & Wang, Y. (2007). Reliable coverage control using heterogeneous vehicles. In Proc. of the IEEE conference on decision and control (pp. 6142-6147). New Orleans, LA. |

[13] | Min, T., & Yin, H. (1998). A decentralized approach for cooperative sweeping by multiple mobile robots. In Proc. of the IEEE/RSJ international conference on intelligent robots and systems (pp. 380-385). Victoria, BC, Canada. |

[14] | Nancy, A. Lynch, Distributed algorithms, (1997), Morgan Kaufmann · Zbl 0877.68061 |

[15] | Ren, W.; Cao, Y., Distributed coordination of multi-agent networks, (2011), Springer-Verlag London |

[16] | Wang, Y.; Hussein, I. I., Awareness coverage control over large-scale domains with intermittent communications, IEEE Transactions on Automatic Control, 55, 8, 1850-1859, (2010) · Zbl 1368.93439 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.