Controlling stochastic switching

Using control to shape stochastic escape and switching dynamics

Dhanushka Kularatne, Eric Forgoston, and M. Ani Hsieh

Abstract: We present a strategy to control the mean stochastic switching times of general dynamical systems with multiple equilibrium states subject to Gaussian white noise. The control can either enhance or abate the probability of escape from the deterministic region of attraction of a stable equilibrium in the presence of external noise. We synthesize a feedback control strategy that actively changes the system’s mean stochastic switching behavior based on the system’s distance to the boundary of the attracting region. With the proposed controller, we are able to achieve a desired mean switching time, even when the strength of noise in the system is not known. The control method is analytically validated using a one-dimensional system, and its effectiveness is numerically demonstrated for a set of dynamical systems of practical importance.

Status: Published online. doi: 10.1063/1.5090113

Coordinating AGVs for Automated Warehouses

Coordination of multiple AGVs: a quadratic optimization method

Valerio Digani, M. Ani Hsieh, Lorenzo Sabattini, and Cristian Secchi

Abstract: This paper presents an optimization strategy to coordinate a fleet of Automated Guided Vehicles (AGVs) traveling on ad-hoc pre-defined roadmaps. Specifically, the objective is to maximize traffic throughput of AGVs navigating in an automated warehouse by minimizing the time AGVs spend negotiating complex traffic patterns to avoid collisions with other AGVs. In this work, the coordination problem is posed as a Quadratic Program where the optimization is performed in a centralized manner. The proposed method is validated by means of simulations and experiments for different industrial warehouse scenarios. The performance of the proposed strategy is then compared with a recently proposed decentralized coordination strategy that relies on local negotiations for shared resources. The results show that the proposed coordination strategy successfully maximizes vehicle throughput and significantly minimizes the time vehicles spend negotiating traffic under different scenarios.

Status: Published in Autonomous Robots.  Preprint to come.

Planning Optimal Paths in General Flows

Going With The Flow: A Graph Based Approach to Optimal Path Planning in General Flows

Dhanushka Kularatne, Subhrajit Bhattacharya, and M. Ani Hsieh

Abstract: Autonomous surface and underwater vehicles (ASVs and AUVs) used for ocean monitoring are typically deployed for long periods of time and must operate with limited energy budgets. Coupled with the increased accessibility to ocean flow data, there has been a significant interest in developing energy efficient motion plans for these vehicles that leverage the dynamics of the surrounding flow. In this paper, we present a graph search based method to plan time and energy optimal paths in static and time-varying flow fields. We also use tools from topological path planning to generate optimal paths in different homotopy classes to facilitate simultaneous exploration of the environment by multi-robot teams. The proposed strategy is validated using analytical flow models, actual ocean data, and in experiments using an indoor laboratory testbed capable of creating flows with ocean-like features. We also present an alternative approach using a Riemannian metric based approximation for the cost functions in the static flow case for computing time and energy optimal paths. The Riemannian approximation results in smoother trajectories in contrast to the graph based strategy while requiring less computational time.

Status: Accepted and to appear in Autonomous Robots. Preprint to come.