This paper deals with the discrete-time connected coverage problem with the constraint that only local information can be utilized for each robot. In such distributed framework, global connectivity characterized by th...This paper deals with the discrete-time connected coverage problem with the constraint that only local information can be utilized for each robot. In such distributed framework, global connectivity characterized by the second smallest eigenvalue of topology Laplacian is estimated through introducing distributed minimal-time consensus algorithm and power iteration algorithm. A self-deployment algorithm is developed to disperse the robots with the precondition that the estimated second smallest eigenvalue is positive at each time-step. Since thus connectivity constraint does not impose to preserve some certain edges, the self-deployment strategy developed in this paper reserves a sufficient degree of freedom for the motion of robots. Theoretical analysis demonstrates that each pair of neighbor robots can finally reach the largest objective distance from each other while the group keeps connected all the time, which is also shown by simulations.展开更多
基金the National Natural Science Foundation of China(Nos.61203073 and 61271114)the Specialized Research Fund for the Doctoral Program of Higher Education of China(No.20120075120008)the Foundation of Key Laboratory of System Control and Information Processing,Ministry of Education,China(No.SCIP2012002)
文摘This paper deals with the discrete-time connected coverage problem with the constraint that only local information can be utilized for each robot. In such distributed framework, global connectivity characterized by the second smallest eigenvalue of topology Laplacian is estimated through introducing distributed minimal-time consensus algorithm and power iteration algorithm. A self-deployment algorithm is developed to disperse the robots with the precondition that the estimated second smallest eigenvalue is positive at each time-step. Since thus connectivity constraint does not impose to preserve some certain edges, the self-deployment strategy developed in this paper reserves a sufficient degree of freedom for the motion of robots. Theoretical analysis demonstrates that each pair of neighbor robots can finally reach the largest objective distance from each other while the group keeps connected all the time, which is also shown by simulations.
