skip to main content

Title: The Reachable Set of a Drone: Exploring the Position Isochrones for a Quadcopter
Quadcopters are increasingly popular for robotics applications. Being able to efficiently calculate the set of positions reachable by a quadcopter within a time budget enables collision avoidance and pursuit-evasion strategies.This paper examines the set of positions reachable by a quadcopter within a specified time limit using a simplified 2D model for quadcopter dynamics. This popular model is used to determine the set of candidate optimal control sequences to build the full 3D reachable set. We calculate the analytic equations that exactly bound the set of positions reachable in a given time horizon for all initial conditions. To further increase calculation speed, we use these equations to derive tight upper and lower spherical bounds on the reachable set.
Authors:
; ; ;
Award ID(s):
1553063 1849303
Publication Date:
NSF-PAR ID:
10318015
Journal Name:
2021 IEEE International Conference on Robotics and Automation (ICRA)
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract. Numerical simulations of ice sheets rely on the momentum balance to determine how ice velocities change as the geometry of the system evolves. Ice is generally assumed to follow a Stokes flow with a nonlinear viscosity. Several approximations have been proposed in order to lower the computational cost of a full-Stokes stress balance. A popular option is the Blatter–Pattyn or higher-order model (HO), which consists of a three-dimensional set of equations that solves the horizontal velocities only. However, it still remains computationally expensive for long transient simulations. Here we present a depth-integrated formulation of the HO model, which can be solved on a two-dimensional mesh in the horizontal plane. We employ a specific polynomial function to describe the vertical variation in the velocity, which allows us to integrate the vertical dimension using a semi-analytic integration. We assess the performance of this MOno-Layer Higher-Order (MOLHO) model to compute ice velocities and simulate grounding line dynamics on standard benchmarks (ISMIP-HOM and MISMIP3D). We compare MOLHO results to the ones obtained with the original three-dimensional HO model. We also compare the time performance of both models in time-dependent runs. Our results show that the ice velocities and grounding line positions obtained with MOLHO are inmore »very good agreement with the ones from HO. In terms of computing time, MOLHO requires less than 10 % of the computational time of a typical HO model, for the same simulations. These results suggest that the MOno-Layer Higher-Order formulation provides improved computational time performance and a comparable accuracy compared to the HO formulation, which opens the door to higher-order paleo simulations.« less
  2. The predictive monitoring problem asks whether a deployed system is likely to fail over the next T seconds under some environmental conditions. This problem is of the utmost importance for cyber-physical systems, and has inspired real-time architectures capable of adapting to such failures upon forewarning. In this paper, we present a linear model-predictive scheme for the real-time monitoring of linear systems governed by time-triggered controllers and time-varying disturbances. The scheme uses a combination of offline (advance) and online computations to decide if a given plant model has entered a state from which no matter what control is applied, the disturbance has a strategy to drive the system to an unsafe region. Our approach is independent of the control strategy used: this allows us to deal with plants that are controlled using model-predictive control techniques or even opaque machine-learning based control algorithms that are hard to reason with using existing reachable set estimation algorithms. Our online computation reuses the symbolic reachable sets computed offline. The real-time monitor instantiates the reachable set with a concrete state estimate, and repeatedly performs emptiness checks with respect to a safety property. We classify the various alarms raised by our approach in terms of what theymore »imply about the system as a whole. We implement our real-time monitoring approach over numerous linear system benchmarks and show that the computation can be performed rapidly in practice. Furthermore, we also examine the alarms reported by our approach and show how some of the alarms can be used to improve the controller.« less
  3. Abstract. Among the most important challenges faced by ice flow models is how to represent basal and rheological conditions, which are challenging to obtain from direct observations. A common practice is to use numerical inversions to calculate estimates for the unknown properties, but there are many possible methods and not one standardised approach. As such, every ice flow model has a unique initialisation procedure. Here we compare the outputs of inversions from three different ice flow models, each employing a variant of adjoint-based optimisation to calculate basal sliding coefficients and flow rate factors using the same observed surface velocities and ice thickness distribution. The region we focus on is the Amundsen Sea Embayment in West Antarctica, the subject of much investigation due to rapid changes in the area over recent decades. We find that our inversions produce similar distributions of basal sliding across all models, despite using different techniques, implying that the methods used are highly robust and represent the physical equations without much influence by individual model behaviours. Transferring the products of inversions between models results in time-dependent simulations displaying variability on the order of or lower than existing model intercomparisons. Focusing on contributions to sea level, the highestmore »variability we find in simulations run in the same model with different inversion products is 32 %, over a 40-year period, a difference of 3.67 mm. There is potential for this to be improved with further standardisation of modelling processes, and the lowest variability within a single model is 13 %, or 1.82 mm over 40 years. While the successful transfer of inversion outputs from one model to another requires some extra effort and technical knowledge of the particular models involved, it is certainly possible and could indeed be useful for future intercomparison projects.« less
  4. Quantum master equations (QMEs) provide a general framework for describing electronic dynamics within a complex molecular system. Off-diagonal QMEs (OD-QMEs) correspond to a family of QMEs that describe the electronic dynamics in the interaction picture based on treating the off-diagonal coupling terms between electronic states as a small perturbation within the framework of second-order perturbation theory. The fact that OD-QMEs are given in terms of the interaction picture makes it non-trivial to obtain Schrödinger picture electronic coherences from them. A key experimental quantity that relies on the ability to obtain accurate Schrödinger picture electronic coherences is the absorption spectrum. In this paper, we propose using a recently introduced procedure for extracting Schrödinger picture electronic coherences from interaction picture inputs to calculate electronic absorption spectra from the electronic dynamics generated by OD-QMEs. The accuracy of the absorption spectra obtained this way is studied in the context of a biexciton benchmark model, by comparing spectra calculated based on time-local and time-nonlocal OD-QMEs to spectra calculated based on a Redfield-type QME and the non-perturbative and quantum-mechanically exact hierarchical equations of motion method.
  5. Summary Latent space models are frequently used for modelling single-layer networks and include many popular special cases, such as the stochastic block model and the random dot product graph. However, they are not well developed for more complex network structures, which are becoming increasingly common in practice. In this article we propose a new latent space model for multiplex networks, i.e., multiple heterogeneous networks observed on a shared node set. Multiplex networks can represent a network sample with shared node labels, a network evolving over time, or a network with multiple types of edges. The key feature of the proposed model is that it learns from data how much of the network structure is shared between layers and pools information across layers as appropriate. We establish identifiability, develop a fitting procedure using convex optimization in combination with a nuclear-norm penalty, and prove a guarantee of recovery for the latent positions provided there is sufficient separation between the shared and the individual latent subspaces. We compare the model with competing methods in the literature on simulated networks and on a multiplex network describing the worldwide trade of agricultural products.