Search for: All records

We present a heuristic method to construct an optimal communication network in an obstacle-dense environment. A set of immobile terminals must be connected by a network of straight-line edges by adding agents to serve as relays. Obstacles are represented by polygons, unaccessible by the agents of the network or by the edges. The problem with obstacles is reduced to a problem without obstacles by choosing the nodes of the optimal network among the obstacles’ vertices that are in mutual line of sight. A second heuristic method is developed to solve the bicriteria optimization problem with number of agents and length of the network as concurrent costs. 

We present strategies for realizing a swarm of mobile relays to provide a bi-directional wireless network that connects fixed terminals. Neither terminals or relays are permitted to transmit into disk-shaped no-transmission zones. We assume a planar environment and that each transmission area is a disk centered at the transmitter. We seek a strongly connected network between all terminals with minimal total cost, where the cost is the sum area of the transmission disks.Results for networks with increasing levels of complexity are provided. The solutions for local networks containing low numbers of relays and terminals are applied to larger networks. For more complex networks, algorithms for a minimum-spanning tree (MST) based procedure are implemented to reduce the solution cost. 

Given starting and ending positions and velocities, L2 bounds on the acceleration and velocity, and the restriction to no more than two constant control inputs, this paper provides routines to compute the minimal-time path. Closed form solutions are provided for reaching a position in minimum time with and without a velocity bound, and for stopping at the goal position. A numeric solver is used to reach a goal position and velocity with no more than two constant control inputs. If a cruising phase at the terminal velocity is needed, this requires solving a non-linear equation with a single parameter. Code is provided on GitHub 1 , extended paper version at [1]. [1] https://github.com/RoboticSwarmControl/MinTimeL2pathsConstraints/ 

Magnetic modular cubes are cube-shaped bodies with embedded permanent magnets. The cubes are uniformly controlled by a global time-varying magnetic field.A 2D physics simulator is used to simulate global control and the resulting continuous movement of magnetic modular cube structures. We develop local plans, closed-loop control algorithms for planning the connection of two structures at desired faces. The global planner generates a building instruction graph for a target structure that we traverse in a depth-first-search approach by repeatedly applying local plans.We analyze how structure size and shape affect planning time. The planner solves 80% of the randomly created instances with up to 12 cubes in an average time of about 200 seconds. 

We present an analytic solution to the 3D Dubins path problem for paths composed of an initial circular arc, a straight component, and a final circular arc. These are commonly called CSC paths. By modeling the start and goal configurations of the path as the base frame and final frame of an RRPRR manipulator, we treat this as an inverse kinematics problem. The kinematic features of the 3D Dubins path are built into the constraints of our manipulator model. Furthermore, we show that the number of solutions is not constant, with up to seven valid CSC path solutions even in non-singular regions. An implementation of solution is available at https: //github.com/aabecker/dubins3D. 

We present progress on the problem of reconfiguring a 2D arrangement of building material by a cooperative group of robots. These robots must avoid collisions, deadlocks, and are subjected to the constraint of maintaining connectivity of the structure. We develop two reconfiguration methods, one based on spatio-temporal planning, and one based on target swapping, to increase building efficiency. The first method can significantly reduce planning times compared to other multi-robot planners. The second method helps to reduce the amount of time robots spend waiting for paths to be cleared, and the overall distance traveled by the robots. 

Reconfigurable modular robots can dynamically assemble/disassemble to accomplish the desired task better. Magnetic modular cubes are scalable modular subunits with embedded permanent magnets in a 3D-printed cubic body and can be wirelessly controlled by an external, uniform, timevarying magnetic field. This paper considers the problem of self-assembling these modules into desired 2D polyomino shapes using such magnetic fields. Although the applied magnetic field is the same for each magnetic modular cube, we use collisions with workspace boundaries to rearrange the cubes. We present a closed-loop control method for self-assembling the magnetic modular cubes into polyomino shapes, using computer vision-based feedback with re-planning. Experimental results demonstrate that the proposed closed-loop control improves the success rate of forming 2D user-specified polyominoes compared to an open-loop baseline. We also demonstrate the validity of the approach over changes in length scales, testing with both 10mm edge length cubes and 2.8mm edge length cubes. 

This work presents an online trajectory generation algorithm using a sinusoidal jerk profile. The generator takes initial acceleration, velocity and position as input, and plans a multi-segment trajectory to a goal position under jerk, acceleration, and velocity limits. By analyzing the critical constraints and conditions, the corresponding closed-form solution for the time factors and trajectory profiles are derived. The proposed algorithm was first derived in Mathematica and then converted into a C++ implementation. Finally, the algorithm was utilized and demonstrated in ROS & Gazebo using a UR3 robot. Both the Mathematica and C++ implementations can be accessed at https://github.com/Haoran-Zhao/Jerk-continuous-online-trajectory-generator-with-constraints.git 

This paper investigates using a sampling-based approach, the RRT*, to reconfigure a 2D set of connected tiles in complex environments, where multiple obstacles might be present. Since the target application is automated building of discrete, cellular structures using mobile robots, there are constraints that determine what tiles can be picked up and where they can be dropped off during reconfiguration. We compare our approach to two algorithms as global and local planners, and show that we are able to find more efficient build sequences using a reasonable amount of samples, in environments with varying degrees of obstacle space. 

For biomedical applications in targeted therapy delivery and interventions, a large swarm of micro-scale particles (“agents”) has to be moved through a maze-like environment (“vascular system”) to a target region (“tumor”). Due to limited on-board capabilities, these agents cannot move autonomously; instead, they are controlled by an external global force that acts uniformly on all particles. In this work, we demonstrate how to use a time-varying magnetic field to gather particles to a desired location. We use reinforcement learning to train networks to efficiently gather particles. Methods to overcome the simulation-to-reality gap are explained, and the trained networks are deployed on a set of mazes and goal locations. The hardware experiments demonstrate fast convergence, and robustness to both sensor and actuation noise. To encourage extensions and to serve as a benchmark for the reinforcement learning community, the code is available at Github.