arXiv subjects

Kira Barton

Publications and source records attributed to Kira Barton.

25 records · Page 2Linked to original sources

arXiv2022

Simultaneous Human-robot Matching and Routing for Multi-robot Tour Guiding under Time Uncertainty

This work presents a framework for multi-robot tour guidance in a partially known environment with uncertainty, such as a museum. In the proposed centralized multi-robot planner, a simultaneous matching and routing problem (SMRP) is formulated to match the humans with robot guides according to their selected places of interest (POIs) and generate the routes and schedules for the robots according to uncertain spatial and time estimation. A large neighborhood search algorithm is developed to efficiently find sub-optimal low-cost solutions for the SMRP. The scalability and optimality of the multi-robot planner are evaluated computationally under different numbers of humans, robots, and POIs. The largest case tested involves 50 robots, 250 humans, and 50 POIs. Then, a photo-realistic multi-robot simulation platform was developed based on Habitat-AI to verify the tour guiding performance in an uncertain indoor environment. Results demonstrate that the proposed centralized tour planner is scalable, makes a smooth trade-off in the plans under different environmental constraints, and can lead to robust performance with inaccurate uncertainty estimations (within a certain margin).

cs.RO↗

arXiv2021

Merging Subject Matter Expertise and Deep Convolutional Neural Network for State-Based Online Machine-Part Interaction Classification

Machine-part interaction classification is a key capability required by Cyber-Physical Systems (CPS), a pivotal enabler of Smart Manufacturing (SM). While previous relevant studies on the subject have primarily focused on time series classification, change point detection is equally important because it provides temporal information on changes in behavior of the machine. In this work, we address point detection and time series classification for machine-part interactions with a deep Convolutional Neural Network (CNN) based framework. The CNN in this framework utilizes a two-stage encoder-classifier structure for efficient feature representation and convenient deployment customization for CPS. Though data-driven, the design and optimization of the framework are Subject Matter Expertise (SME) guided. An SME defined Finite State Machine (FSM) is incorporated into the framework to prohibit intermittent misclassifications. In the case study, we implement the framework to perform machine-part interaction classification on a milling machine, and the performance is evaluated using a testing dataset and deployment simulations. The implementation achieved an average F1-Score of 0.946 across classes on the testing dataset and an average delay of 0.24 seconds on the deployment simulations.

cs.LG↗

arXiv2021

Learning-Based Repetitive Precision Motion Control with Mismatch Compensation

Learning-based control methods utilize run-time data from the underlying process to improve the controller performance under model mismatch and unmodeled disturbances. This is beneficial for optimizing industrial processes, where the dynamics are difficult to model, and the repetitive nature of the process can be exploited. In this work, we develop an iterative approach for repetitive precision motion control problems where the objective is to follow a reference geometry with minimal tracking error. Our method utilizes a nominal model of the process and learns the mismatch using Gaussian Process Regression (GPR). The control input and the GPR data are updated after each iteration to improve the performance in a run-to-run fashion. We provide a preliminary convergence analysis, implementation details of the proposed controller for minimizing different error types, and a case study where we demonstrate improved tracking performance with simulation and experimental results.

eess.SY↗

arXiv2021

Receding Horizon Iterative Learning Control for Continuously Operated Systems

This paper presents an iterative learning control (ILC) scheme for continuously operated repetitive systems for which no initial condition reset exists. To accomplish this, we develop a lifted system representation that accounts for the effect of the initial conditions on dynamics and projects the dynamics over multiple future iterations. Additionally, we develop an economic cost function and update law that considers the performance over multiple iterations in the future, thus allowing for the prediction horizon to be larger than just the next iteration. Convergence of the iteration varying initial condition and applied input are proven and demonstrated using a simulated servo-positioning system test case.

eess.SY↗

arXiv2021

Iterative learning control with discrete-time nonlinear nonminimum phase models via stable inversion

Output reference tracking can be improved by iteratively learning from past data to inform the design of feedforward control inputs for subsequent tracking attempts. This process is called iterative learning control (ILC). This article develops a method to apply ILC to systems with nonlinear discrete-time dynamical models with unstable inverses (i.e. discrete-time nonlinear non-minimum phase models). This class of systems includes piezoactuators, electric power converters, and manipulators with flexible links, which may be found in nanopositioning stages, rolling mills, and robotic arms, respectively. As these devices may be required to execute fine transient reference tracking tasks repetitively in contexts such as manufacturing, they may benefit from ILC. Specifically, this article facilitates ILC of such systems by presenting a new ILC synthesis framework that allows combination of the principles of Newton's root finding algorithm with stable inversion, a technique for generating stable trajectories from unstable models. The new framework, called Invert-Linearize ILC (ILILC), is validated in simulation on a cart-and-pendulum system with model error, process noise, and measurement noise. Where preexisting Newton-based ILC diverges, ILILC with stable inversion converges, and does so in less than one third the number of trials necessary for the convergence of a gradient-descent-based ILC technique used as a benchmark.

eess.SY↗

arXiv2020

Heterogeneous Vehicle Routing and Teaming with Gaussian Distributed Energy Uncertainty

For robot swarms operating on complex missions in an uncertain environment, it is important that the decision-making algorithm considers both heterogeneity and uncertainty. This paper presents a stochastic programming framework for the vehicle routing problem with stochastic travel energy costs and heterogeneous vehicles and tasks. We represent the heterogeneity as linear constraints, estimate the uncertain energy cost through Gaussian process regression, formulate this stochasticity as chance constraints or stochastic recourse costs, and then solve the stochastic programs using branch and cut algorithms to minimize the expected energy cost. The performance and practicality are demonstrated through extensive computational experiments and a practical test case.

cs.RO↗

arXiv2017

Exponential Stability of Nonlinear Differential Repetitive Processes with Applications to Iterative Learning Control

This paper studies exponential stability properties of a class of two-dimensional (2D) systems called differential repetitive processes (DRPs). Since a distinguishing feature of DRPs is that the problem domain is bounded in the "time" direction, the notion of stability to be evaluated does not require the nonlinear system defining a DRP to be stable in the typical sense. In particular, we study a notion of exponential stability along the discrete iteration dimension of the 2D dynamics, which requires the boundary data for the differential pass dynamics to converge to zero as the iterations evolve. Our main contribution is to show, under standard regularity assumptions, that exponential stability of a DRP is equivalent to that of its linearized dynamics. In turn, exponential stability of this linearization can be readily verified by a spectral radius condition. The application of this result to Picard iterations and iterative learning control (ILC) is discussed. Theoretical findings are supported by a numerical simulation of an ILC algorithm.

math.DS↗