Category: Uncategorized

This paper addresses the coordinated navigation of multiple independently actuated disk-shaped robots-all placed within the same disk-shaped workspace. Assuming perfect sensing, shared-centralized communications and computation, as well as perfect actuation, we encode complete information about the goal, obstacles, and workspace boundary using an artificial potential function over the configuration space of the robots’ simultaneous nonoverlapping positions. The closed-loop dynamics governing the motion of each (velocity-controlled) robot take the form of the appropriate projection of the gradient of this function. We impose (conservative) restrictions on the allowable goal positions that yield sufficient conditions for convergence: We prove that this construction is an essential navigation function that guarantees collision-free motion of each robot to its destination from almost all initial free placements. The results of an extensive simulation study investigate practical issues such as average resulting trajectory length and robustness against simulated sensor noise.

For more information: Kod*Lab

Researchers in a variety of fields, including aeolian science, biology, and environmental science, have already made use of stationary and mobile remote sensing equipment to increase their variety of data collection opportunities. However, due to mobility challenges, remote sensing opportunities relevant to desert environments and in particular dune fields have been limited to stationary equipment. We describe here an investigative trip to two well-studied experimental deserts in New Mexico with D-RHex, a mobile remote sensing platform oriented towards desert research. D-RHex is the latest iteration of the RHex family of robots, which are six-legged, biologically inspired, small (10kg) platforms with good mobility in a variety of rough terrains, including on inclines and over obstacles of higher than robot hip height.

For more information: Kod*Lab

Desertification is a long-standing issue in China, but research on the processes of desertification is limited by availability of personnel and technical equipment. This suggests a perfect application and further testing ground for the mobile desert sensing technology described in a previous technical report. We describe here the first of two trips to the Tengger Desert as part of a collaborative effort to bring Desert RHexes to China, with the goal of this trip being to discover and address potential locomotor challenges. Our robots were able to ascend 20-degree slopes with an 8.5kg payload, indicating that they could indeed be used for this novel mobile desert sensor application. We achieved locomotion on up to 30-degree slopes unreliably and on up to 27-degree slopes using morphological and behavioral adaptations inspired by our last desert trip.

We present a centralized online (completely reactive) hybrid navigation algorithm for bringing a swarm of n perfectly sensed and actuated point particles in Euclidean d space (for arbitrary n and d) to an arbitrary goal configuration with the guarantee of no collisions along the way. Our construction entails a discrete abstraction of configurations using cluster hierarchies, and relies upon two prior recent constructions: (i) a family of hierarchy-preserving control policies and (ii) an abstract discrete dynamical system for navigating through the space of cluster hierarchies. Here, we relate the (combinatorial) topology of hierarchical clusters to the (continuous) topology of configurations by constructing “portals” — open sets of configurations supporting two adjacent hierarchies. The resulting online sequential composition of hierarchy-invariant swarming followed by discrete selection of a hierarchy “closer” to that of the destination along with its continuous instantiation via an appropriate portal configuration yields a computationally effective construction for the desired navigation policy.

We introduce an agility measure enabling the comparison of two very different leaping-from-rest transitions by two comparably powered but morphologically different legged robots. We use the measure to show that a flexible spine outperforms a rigid back in the leaping- from-rest task. The agility measure also sheds light on the source of this benefit: core actuation through a sufficiently powerful parallel elastic actuated spine outperforms a similar power budget applied either only to preload the spine or only to actuate the spine during the leap, as well as a rigid backed configuration of the identical machine.

We consider the problem of visually servoing a legged vehicle with unicycle-like nonholonomic constraints subject to second-order fore-aft dynamics in its horizontal plane. We target applications to rugged environments characterized by complex terrain likely to perturb significantly the robot’s nominal dynamics. At the same time, it is crucial that the camera avoid “obstacle” poses where absolute localization would be compromised by even partial loss of landmark visibility. Hence, we seek a controller whose robustness against disturbances and obstacle avoidance capabilities can be assured by a strict global Lyapunov function. Since the nonholonomic constraints preclude smooth point stabilizability we introduce an extra degree of sensory freedom, affixing the camera to an actuated panning axis mounted on the robot’s back. Smooth stabilizability to the robot-orientation-indifferent goal cycle no longer precluded, we construct a controller and strict global Lyapunov function with the desired properties. We implement several versions of the scheme on a RHex robot maneuvering over slippery ground and document its successful empirical performance.

For more information: Kod*Lab

We propose a new anytime hierarchical clustering method that iteratively transforms an arbitrary initial hierarchy on the configuration of measurements along a sequence of trees we prove for a fixed data set must terminate in a chain of nested partitions that satisfies a natural homogeneity requirement. Each recursive step re-edits the tree so as to improve a local measure of cluster homogeneity that is compatible with a number of commonly used (e.g., single, average, complete) linkage functions. As an alternative to the standard batch algorithms, we present numerical evidence to suggest that appropriate adaptations of this method can yield decentralized, scalable algorithms suitable for distributed/parallel computation of clustering hierarchies and online tracking of clustering trees applicable to large, dynamically changing databases and anomaly detection.

Robots are often modeled as hybrid systems providing a consistent, formal account of the varied dynamics associated with the loss and gain of kinematic freedom as a machine impacts and breaks away from its environment.