In this paper, we present an experimental study of strategies for maintaining end-to-end communication links for tasks such as surveillance, reconnaissance, and target search and identification, where team connectivity is required for situational awareness. Our main contributions are threefold: ͑a͒ We present the construction of a radio signal strength map that can be used to plan multi-robot tasks, and also serve as useful perceptual information. We show how a nominal model of an urban environment obtained by aerial surveillance, is used to generate strategies for exploration. ͑b͒ We present reactive controllers for communication link maintenance; and ͑c͒ we consider the differences between monitoring signal strength versus data throughput. Experimental results, obtained using our multi-robot testbed in three representative urban environments are presented with each of our main contributions.
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performance. In this paper, we examine the performance of such a sensor network for tracking multiple targets. We begin with geometric arguments that address the problem of counting the number of distinct targets, given a snapshot of the sensor readings. We provide necessary and sufficient criteria for an accurate target count in a one-dimensional setting, and provide a greedy algorithm that determines the minimum number of targets that is consistent with the sensor readings. While these combinatorial arguments bring out the difficulty of target counting based on sensor readings at a given time, they leave open the possibility of accurate counting and tracking by exploiting the evolution of the sensor readings across time. To this end, we develop a particle filtering algorithm based on a cost function that penalizes changes in velocity. An extensive set of simulations, as well as experiments with passive infrared sensors, are reported. We conclude that, despite the combinatorial complexity of target counting, probabilistic approaches based on fairly generic models for the trajectories yield respectable tracking performance.
SUMMARYIn this paper, we formulate a semi-implicit time-stepping model for multibody mechanical systems with frictional, distributed compliant contacts. Employing a polyhedral pyramid model for the friction law and a distributed, linear, viscoelastic model for the contact, we obtain mixed linear complementarity formulations for the discrete-time, compliant contact problem. We establish the existence and finite multiplicity of solutions, demonstrating that such solutions can be computed by Lemke's algorithm. In addition, we obtain limiting results of the model as the contact stiffness tends to infinity. The limit analysis elucidates the convergence of the dynamic models with compliance to the corresponding dynamic models with rigid contacts within the computational time-stepping framework. Finally, we report numerical simulation results with an example of a planar mechanical system with a frictional contact that is modelled using a distributed, linear viscoelastic model and Coulomb's frictional law, verifying empirically that the solution trajectories converge to those obtained by the more traditional rigid-body dynamic model.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.