We consider the problem of collectively delivering a package from specified source to designated target location in graph, using multiple mobile agents. Each agent starts some vertex graph; it can move along edges graph and pick up drop another during course its movement. However, each has limited energy budget allowing traverse path bounded length B; thus, agents need collaborate destination. ...