This paper presents decentralized algorithms for coverage with mobile robots on a graph. Coverage is an important capability of multi-robot systems engaged in a number of different applications, including placement for environmental modeling, deployment for maximal quality surveillance, and even coordinated construction. We use distributed vertex substitution for locational optimization and equal mass partitioning, and the controllers minimize the corresponding cost functions. We prove that the proposed controller with two-hop communication guarantees convergence to the locally optimal configuration. We evaluate the algorithms in simulations and also using four mobile robots.

Homeless men are frequently unsheltered and isolated, disconnected from supportive organizations and individuals. However, little research has investigated these men's social networks. We investigate the structure and composition of homeless men's social networks, vis-a-vis short- and long-term homelessness with a sample of men drawn randomly from meal lines on Skid Row in Los Angeles. Men continuously homeless for the past six months display networks composed of riskier members when compared to men intermittently homeless during that time. Men who report chronic, long-term homelessness display greater social network fragmentation when compared to non-chronically homeless men. While intermittent homelessness affects network composition in ways that may be addressable with existing interventions, chronic homelessness fragments networks, which may be more difficult to address with those interventions. These findings have implications for access to social support from network members which, in turn, impacts the resources homeless men require from other sources such as the government or non-governmental organizations.

We introduce novel mathematical models and algorithms to generate (shortest or k different) explanations for biomedical queries, using answer set programming. We implement these algorithms and integrate them in BioQuery-ASP. We illustrate the usefulness of these methods with some complex biomedical queries related to drug discovery, over the biomedical knowledge resources PharmGKB, DrugBank, BioGRID, CTD, SIDER, Disease Ontology, and Orphadata.

The tip of a flexible needle with a bevel tip approximately follows a planar arc when it is inserted into soft tissue only with the force applied to the needle along the needle axis. The direction of the arc can be controlled by the rotation input around the needle axis. This flexible and steerable needle has been shown to have a considerable potential in clinical applications due to its maneuverability and steerability. Beyond the needle insertion to a single destination, this paper concerns obtaining needle trajectories that reach multiple targets. Specifically, we propose an algorithm for the insertion of a flexible needle to travel from a single insertion point (i.e. port) to multiple targets. The insertion is motivated by the observation that multiple targets can be reached by the flexible needle through a combination of insertion, partial retraction, turning, and reinsertion of the flexible needle. In this paper we develop an insertion algorithm that minimizes tissue damage during the needle insertion to multiple targets. To this end, a cost function which computes the length of needle trajectory that can be thought of as the tissue damage is defined, and is minimized. Through the minimization, we find the optimal insertion parameters such as the port location, the insertion direction at the port, the targeting order, the turning angles, and the lengths of forward insertions and retractions. To reduce the computation time, we perform workspace analysis for this approach to filter out the no-solution cases. We present numerical examples of the simulated needle insertion for multiple targets with and without obstacles and show the benefit of the proposed method in terms of the tissue damage and the number of skin punctures. Extensions of the proposed approach to more complex cases such as more than three target points and maneuvering around spherical obstacles are also discussed.

This paper focuses on the mechanism design of a slide-block structure and its application on a biomimetic modular robotic fish for three-dimensional swimming. First, as a barycenter-adjustor, the slide-block structure is integrated into a mechanical design of a robotic fish, which is constructed by a control module, a driving module, and a fan-shaped caudal fin. The three-dimensional locomotion of robotic fish is decomposed into two-dimensional locomotion in horizontal plane and ascent–descent locomotion in vertical plane. Both the kinematics of the horizontal swim and the dynamics of the ascent–descent swim are analyzed by the curve fitting method. Finally, experimental results validate the three-dimensional swimming capability of the robotic fish. Furthermore, the impact of two design parameters on the swimming capability of the robotic fish is discussed by the experimental method. The experimental results confirm that the robotic fish with one driving module and a fan-shaped low-aspect-ratio caudal foil can produce higher propulsive speed than other parameter combinations.

Three-DOF manipulators were employed for juggling of polygonal objects in order to have full control over object's configuration. Dynamic grasp condition is obtained for the instances that the manipulators carry the object on their palms. Manipulation problem is modeled as a nonlinear optimal control problem. In this optimal control problem, time of free flight is used as a free parameter to determine throw and catch times. Cost function is selected to get maximum covered horizontal distance using minimum energy. By selecting third-order polynomials for joint motions, the problem is changed to a constrained parameter selection problem. Adaptive particle swarm optimization method is consequently employed to solve the optimization problem. Effectiveness of the optimization algorithm is verified by a set of simulations in MSC. ADAMS.