Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...
Mathieu Couture, Michel Barbeau, Prosenjit Bose, E...
Area coverage is a well-known problem in robotics. Extensive research has been conducted for the single robot coverage problem in the past decades. More recently, the research comm...
Andrea Gasparri, Bhaskar Krishnamachari, Gaurav S....