Search

Humanoid robots are expected to navigate in changing environments and perform a variety of tasks. Frequently, these tasks require the robot to make decisions online regarding the speed and precision of following a reference path. For example, a robot may want to decide to temporarily deviate from its path to overtake a slowly moving obstacle that shares the same path and is ahead. In this case, path following performance is compromised in favor of fast path traversal. Available global trajectory tracking approaches typically assume a given -- specified in advance -- time parametrization of the path and seek to minimize the norm of the Cartesian error. As a result, when the robot should be where on the path is fixed and temporary deviations from the path are strongly discouraged. Given a global path, this paper presents a Model Predictive Contouring Control (MPCC) approach to selecting footsteps that maximize path traversal while simultaneously allowing the robot to decide between faithful versus fast path following. The method is evaluated in high-fidelity simulations of the bipedal robot Digit in terms of tracking performance of curved paths under disturbances and is also applied to the case where Digit overtakes a moving obstacle., Comment: Accepted for publication in 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

This paper presents a modular approach to motion planning with provable stability guarantees for robots that move through changing environments via periodic locomotion behaviors. We focus on dynamic walkers as a paradigm for such systems, although the tools developed in this paper can be used to support general compositional approaches to robot motion planning with Dynamic Movement Primitives (DMPs). Our approach ensures a priori that the suggested plan can be stably executed. This is achieved by formulating the planning process as a Switching System with Multiple Equilibria (SSME) and proving that the system's evolution remains within explicitly characterized trapping regions in the state space under suitable constraints on the frequency of switching among the DMPs. These conditions effectively encapsulate the low-level stability limitations in a form that can be easily communicated to the planner to guarantee that the suggested plan is compatible with the robot's dynamics. Furthermore, we show how the available primitives can be safely composed online in a receding horizon manner to enable the robot to react to moving obstacles. The proposed framework is applied on 3D bipedal walking models under common modeling assumptions, and offers a modular approach towards stably integrating readily available low-level locomotion control and high-level planning methods., Comment: 20 pages, 11 figures

This paper presents a sequential Model Predictive Control (MPC) approach to reactive motion planning for bipedal robots in dynamic environments. The approach relies on a sequential polytopic decomposition of the free space, which provides an ordered collection of mutually intersecting obstacle free polytopes and waypoints. These are subsequently used to define a corresponding sequence of MPC programs that drive the system to a goal location avoiding static and moving obstacles. This way, the planner focuses on the free space in the vicinity of the robot, thus alleviating the need to consider all the obstacles simultaneously and reducing computational time. We verify the efficacy of our approach in high-fidelity simulations with the bipedal robot Digit, demonstrating robust reactive planning in the presence of static and moving obstacles., Comment: 10 pages, 7 figures

Bipedal walking is one of the most important hallmarks of human that robots have been trying to mimic for many decades. Although previous control methodologies have achieved robot walking on some terrains, there is a need for a framework allowing stable and robust locomotion over a wide range of compliant surfaces. This work proposes a novel biomechanics-inspired controller that adjusts the stiffness of the legs in support for robust and dynamic bipedal locomotion over compliant terrains. First, the 3D Dual-SLIP model is extended to support for the first time locomotion over compliant surfaces with variable stiffness and damping parameters. Then, the proposed controller is compared to a Linear-Quadratic Regulator (LQR) controller, in terms of robustness on stepping on soft terrain. The LQR controller is shown to be robust only up to a moderate ground stiffness level of 174 kN/m, while it fails in lower stiffness levels. On the contrary, the proposed controller can produce stable gait in stiffness levels as low as 30 kN/m, which results in a vertical ground penetration of the leg that is deeper than 10% of its rest length. The proposed framework could advance the field of bipedal walking, by generating stable walking trajectories for a wide range of compliant terrains useful for the control of bipeds and humanoids, as well as by improving controllers for prosthetic devices with tunable stiffness., Comment: This work was published in the 30th Mediterranean Conference on Control and Automation, MED'22

In this paper, we consider the problem of adapting a dynamically walking bipedal robot to follow a leading co-worker while engaging in tasks that require physical interaction. Our approach relies on switching among a family of Dynamic Movement Primitives (DMPs) as governed by a supervisor. We train the supervisor to orchestrate the switching among the DMPs in order to adapt to the leader's intentions, which are only implicitly available in the form of interaction forces. The primary contribution of our approach is its ability to furnish certificates of generalization to novel leader intentions for the trained supervisor. This is achieved by leveraging the Probably Approximately Correct (PAC)-Bayes bounds from generalization theory. We demonstrate the efficacy of our approach by training a neural-network supervisor to adapt the gait of a dynamically walking biped to a leading collaborator whose intended trajectory is not known explicitly.

Complex motions for robots are frequently generated by switching among a collection of individual movement primitives. We use this approach to formulate robot motion plans as sequences of primitives to be executed one after the other. When dealing with dynamical movement primitives, besides accomplishing the high-level objective, planners must also reason about the effect of the plan's execution on the safety of the platform. This task becomes more daunting in the presence of disturbances, such as external forces. To alleviate this issue, we present a framework that builds on rigorous control-theoretic tools to generate safely-executable motion plans for externally excited robotic systems. Our framework is illustrated on a 3D limit-cycle gait bipedal robot that adapts its walking pattern to persistent external forcing.

In this paper, we investigate the robustness to external disturbances of switched discrete and continuous systems with multiple equilibria. It is shown that if each subsystem of the switched system is Input-to-State Stable (ISS), then under switching signals that satisfy an average dwell-time bound, the solutions are ultimately bounded within a compact set. Furthermore, the size of this set varies monotonically with the supremum norm of the disturbance signal. It is observed that when the subsystems share a common equilibrium, ISS is recovered for solutions of the corresponding switched system; hence, the results in this paper are a natural generalization of classical results in switched systems that exhibit a common equilibrium. Additionally, we provide a method to analytically compute the average dwell time if each subsystem possesses a quadratic ISS-Lyapunov function. Our motivation for studying this class of switched systems arises from certain motion planning problems in robotics, where primitive motions, each corresponding to an equilibrium point of a dynamical system, must be composed to realize a task. However, the results are relevant to a much broader class of applications, in which composition of different modes of behavior is required.

In this paper we investigate the relation between robustness of periodic orbits exhibited by systems with impulse effects and robustness of their corresponding Poincar\'e maps. In particular, we prove that input-to-state stability (ISS) of a periodic orbit under external excitation in both continuous and discrete time is equivalent to ISS of the corresponding 0-input fixed point of the associated \emph{forced} Poincar\'e map. This result extends the classical Poincar\'e analysis for asymptotic stability of periodic solutions to establish orbital input-to-state stability of such solutions under external excitation. In our proof, we define the forced Poincar\'e map, and use it to construct ISS estimates for the periodic orbit in terms of ISS estimates of this map under mild assumptions on the input signals. As a consequence of the availability of these estimates, the equivalence between exponential stability (ES) of the fixed point of the 0-input (unforced) Poincar\'e map and ES of the corresponding orbit is recovered. The results can be applied naturally to study the robustness of periodic orbits of continuous-time systems as well. Although our motivation for extending classical Poincar\'e analysis to address ISS stems from the need to design robust controllers for limit-cycle walking and running robots, the results are applicable to a much broader class of systems that exhibit periodic solutions.

In this paper we provide a method to generate a continuum of limit cycles using a single precomputed exponentially stable limit cycle designed within the Hybrid Zero Dynamics framework. Guarantees for existence and stability of these limit cycles are provided. We derive analytical constraints that ensure boundedness of the state under arbitrary switching among a finite set of limit cycles extracted from the continuum. These limit cycles are used for changing the speeds of an underactuated planar bipedal model while satisfying all modeling constraints such as saturation torque and coefficient of friction in a provably correct manner. A strongly connected directed graph of allowable limit cycle switches is built to obtain valid limit cycle transitions for speed changes within 0.42-0.81 m/s., Comment: The old name for this paper was "Generation of a Continuum of Limit Cycles and Switching between them for Hybrid Zero Dynamics based Bipedal Robots."

This paper considers a network of stochastic evidence accumulators, each represented by a drift-diffusion model accruing evidence towards a decision in continuous time by observing a noisy signal and by exchanging information with other units according to a fixed communication graph. We bring into focus the relationship between the location of each unit in the communication graph and its certainty as measured by the inverse of the variance of its state. We show that node classification according to degree distributions or geodesic distances cannot faithfully capture node ranking in terms of certainty. Instead, all possible paths connecting each unit with the rest in the network must be incorporated. We make this precise by proving that node classification according to information centrality provides a rank ordering with respect to node certainty, thereby affording a direct interpretation of the certainty level of each unit in terms of the structural properties of the underlying communication graph., Comment: 32 pages

This paper addresses a detection problem where several spatially distributed sensors independently observe a time-inhomogeneous stochastic process. The task is to decide between two hypotheses regarding the statistics of the observed process at the end of a fixed time interval. In the proposed method, each of the sensors transmits once to a fusion center a locally processed summary of its information in the form of a likelihood ratio. The fusion center then combines these messages to arrive at an optimal decision in the Neyman-Pearson framework. The approach is motivated by applications arising in the detection of mobile radioactive sources, and offers a pathway toward the development of novel fixed- interval detection algorithms that combine decentralized processing with optimal centralized decision making.