— In this paper we demonstrate path planning for our formation space that represents permutation-invariant multirobot formations. Earlier methods generally pre-assign roles for e...
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
This paper describes a methodology that could be used by a utility to estimate the actual cost of congestion on its transmission system using limited, non-state estimator data. Th...
Abstract— In this paper, we address the problem of providing traffic quality of service and energy efficiency in ad hoc wireless networks. We consider a network that is shared ...