Search

This work develops a novel trajectory planner for human-robot handovers. The handover requirements can naturally be handled by a path-following-based model predictive controller, where the path progress serves as a progress measure of the handover. Moreover, the deviations from the path are used to follow human motion by adapting the path deviation bounds with a handover location prediction. A Gaussian process regression model, which is trained on known handover trajectories, is employed for this prediction. Experiments with a collaborative 7-DoF robotic manipulator show the effectiveness and versatility of the proposed approach., Comment: 8 pages, 6 figures, Proceedings available under https://www.vdi-mechatroniktagung.rwth-aachen.de/global/show_document.asp?id=aaaaaaaacjcayqj&download=1

Given a discounted cost, we study deterministic discrete-time systems whose inputs are generated by policy iteration (PI). We provide novel near-optimality and stability properties, while allowing for non stabilizing initial policies. That is, we first give novel bounds on the mismatch between the value function generated by PI and the optimal value function, which are less conservative in general than those encountered in the dynamic programming literature for the considered class of systems. Then, we show that the system in closed-loop with policies generated by PI are stabilizing under mild conditions, after a finite (and known) number of iterations.

The state of charge (SOC) of lithium-ion batteries needs to be accurately estimated for safety and reliability purposes. For battery packs made of a large number of cells, it is not always feasible to design one SOC estimator per cell due to limited computational resources. Instead, only the minimum and the maximum SOC need to be estimated. The challenge is that the cells having minimum and maximum SOC typically change over time. In this context, we present a low-dimensional hybrid estimator of the minimum (maximum) SOC, whose convergence is analytically guaranteed. We consider for this purpose a battery consisting of cells interconnected in series, which we model by electric equivalent circuit models. We then present the hybrid estimator, which runs an observer designed for a single cell at any time instant, selected by a switching-like logic mechanism. We establish a practical exponential stability property for the estimation error on the minimum (maximum) SOC thereby guaranteeing the ability of the hybrid scheme to generate accurate estimates of the minimum (maximum) SOC. The analysis relies on non-smooth hybrid Lyapunov techniques. A numerical illustration is provided to showcase the relevance of the proposed approach.

Systematically including dynamically changing waypoints as desired discrete actions, for instance, resulting from superordinate task planning, has been challenging for online model predictive trajectory optimization with short planning horizons. This paper presents a novel waypoint model predictive control (wMPC) concept for online replanning tasks. The main idea is to split the planning horizon at the waypoint when it becomes reachable within the current planning horizon and reduce the horizon length towards the waypoints and goal points. This approach keeps the computational load low and provides flexibility in adapting to changing conditions in real time. The presented approach achieves competitive path lengths and trajectory durations compared to (global) offline RRT-type planners in a multi-waypoint scenario. Moreover, the ability of wMPC to dynamically replan tasks online is experimentally demonstrated on a KUKA LBR iiwa 14 R820 robot in a dynamic pick-and-place scenario., Comment: 8 pages, 6 figures

This paper studies the stabilization problem of networked control systems (NCSs) with random packet dropouts caused by stochastic channels. To describe the effects of stochastic channels on the information transmission, the transmission times are assumed to be deterministic, whereas the packet transmission is assumed to be random. We first propose a stochastic scheduling protocol to model random packet dropouts, and address the properties of the proposed stochastic scheduling protocol. The proposed scheduling protocol provides a unified modelling framework for a general class of random packet dropouts due to different stochastic channels. Next, the proposed scheduling protocol is embedded into the closed-loop system, which leads to a stochastic hybrid model for NCSs with random packet dropouts. Based on this stochastic hybrid model, we follow the emulation approach to establish sufficient conditions to guarantee uniform global asymptotical stability in probability. In particular, an upper bound on the maximally allowable transmission interval is derived explicitly for all stochastic protocols satisfying Lyapunov conditions that guarantee uniform global asymptotic stability in probability. Finally, two numerical examples are presented to demonstrate the derived results., Comment: 12 pages, 4 figures, accepted

This work presents a novel online model-predictive trajectory planner for robotic manipulators called BoundMPC. This planner allows the collision-free following of Cartesian reference paths in the end-effector's position and orientation, including via-points, within desired asymmetric bounds of the orthogonal path error. The path parameter synchronizes the position and orientation reference paths. The decomposition of the path error into the tangential direction, describing the path progress, and the orthogonal direction, which represents the deviation from the path, is well known for the position from the path-following control in the literature. This paper extends this idea to the orientation by utilizing the Lie theory of rotations. Moreover, the orthogonal error plane is further decomposed into basis directions to define asymmetric Cartesian error bounds easily. Using piecewise linear position and orientation reference paths with via-points is computationally very efficient and allows replanning the pose trajectories during the robot's motion. This feature makes it possible to use this planner for dynamically changing environments and varying goals. The flexibility and performance of BoundMPC are experimentally demonstrated by two scenarios on a 7-DoF Kuka LBR iiwa 14 R820 robot. The first scenario shows the transfer of a larger object from a start to a goal pose through a confined space where the object must be tilted. The second scenario deals with grasping an object from a table where the grasping point changes during the robot's motion, and collisions with other obstacles in the scene must be avoided., Comment: 17 pages, 20 figures

Real-time applications for autonomous operations depend largely on fast and robust vision-based localization systems. Since image processing tasks require processing large amounts of data, the computational resources often limit the performance of other processes. To overcome this limitation, traditional marker-based localization systems are widely used since they are easy to integrate and achieve reliable accuracy. However, classical marker-based localization systems significantly depend on standard cameras with low frame rates, which often lack accuracy due to motion blur. In contrast, event-based cameras provide high temporal resolution and a high dynamic range, which can be utilized for fast localization tasks, even under challenging visual conditions. This paper proposes a simple but effective event-based pose estimation system using active LED markers (ALM) for fast and accurate pose estimation. The proposed algorithm is able to operate in real time with a latency below \SI{0.5}{\milli\second} while maintaining output rates of \SI{3}{\kilo \hertz}. Experimental results in static and dynamic scenarios are presented to demonstrate the performance of the proposed approach in terms of computational speed and absolute accuracy, using the OptiTrack system as the basis for measurement., Comment: 14 pages, 12 figures, this paper has been accepted to WACV 2024

In modern data-driven science, reproducibility and reusability are key challenges. Scientists are well skilled in the process from data to publication. Although some publication channels require source code and data to be made accessible, rerunning and verifying experiments is usually hard due to a lack of standards. Therefore, reusing existing scientific data processing code from state-of-the-art research is hard as well. This is why we introduce CLAIMED, which has a proven track record in scientific research for addressing the repeatability and reusability issues in modern data-driven science. CLAIMED is a framework to build reusable operators and scalable scientific workflows by supporting the scientist to draw from previous work by re-composing workflows from existing libraries of coarse-grained scientific operators. Although various implementations exist, CLAIMED is programming language, scientific library, and execution environment agnostic., Comment: Received IEEE OSS Award 2023 - https://conferences.computer.org/services/2023/symposia/oss.html

By sharing local sensor information via Vehicle-to-Vehicle (V2V) wireless communication networks, Cooperative Adaptive Cruise Control (CACC) is a technology that enables Connected and Automated Vehicles (CAVs) to drive autonomously on the highway in closely-coupled platoons. The use of CACC technologies increases safety and the traffic throughput, and decreases fuel consumption and CO2 emissions. However, CAVs heavily rely on embedded software, hardware, and communication networks that make them vulnerable to a range of cyberattacks. Cyberattacks to a particular CAV compromise the entire platoon as CACC schemes propagate corrupted data to neighboring vehicles potentially leading to traffic delays and collisions. Physics-based monitors can be used to detect the presence of False Data Injection (FDI) attacks to CAV sensors; however, unavoidable system disturbances and modelling uncertainty often translates to conservative detection results. Given enough system knowledge, adversaries are still able to launch a range of attacks that can surpass the detection scheme by hiding within the system disturbances and uncertainty -- we refer to this class of attacks as \textit{stealthy FDI attacks}. Stealthy attacks are hard to deal with as they affect the platoon dynamics without being noticed. In this manuscript, we propose a co-design methodology (built around a series convex programs) to synthesize distributed attack monitors and $H_{\infty}$ CACC controllers that minimize the joint effect of stealthy FDI attacks and system disturbances on the platoon dynamics while guaranteeing a prescribed platooning performance (in terms of tracking and string stability). Computer simulations are provided to illustrate the performance of out tools., Comment: arXiv admin note: text overlap with arXiv:2109.01553

Effective management and just-in-time maintenance of lithium-ion batteries require the knowledge of unmeasured (internal) variables that need to be estimated. Observers are thus designed for this purpose using a mathematical model of the battery internal dynamics. It appears that it is often difficult to tune the observers to obtain good estimation performances both in terms of convergence speed and accuracy, while these are essential in practice. In this context, we demonstrate how a recently developed hybrid multi-observer can be used to improve the performance of a given observer designed for an electrochemical model of a lihium-ion battery. Simulation results, obtained with standard parameters values, show the estimation performance improvement using the proposed method.

We consider the problem of adaptive stabilization for discrete-time, multi-dimensional linear systems with bounded control input constraints and unbounded stochastic disturbances, where the parameters of the true system are unknown. To address this challenge, we propose a certainty-equivalent control scheme which combines online parameter estimation with saturated linear control. We establish the existence of a high probability stability bound on the closed-loop system, under additional assumptions on the system and noise processes. Finally, numerical examples are presented to illustrate our results., Comment: 21 pages, 1 figure, submitted to 62nd IEEE Conference on Decision and Control

Various methods are nowadays available to design observers for broad classes of systems, where the primary focus is on establishing the convergence of the estimated states. Nevertheless, the question of the tuning of the observer to achieve satisfactory estimation performance remains largely open. In this context, we present a general design framework for the online tuning of the observer gains. Our starting point is a robust nominal observer designed for a general nonlinear system, for which an input-to-state stability property can be established. Our goal is then to improve the performance of this nominal observer. We present for this purpose a new hybrid multi-observer scheme, whose great flexibility can be exploited to enforce various desirable properties, e.g., fast convergence and good sensitivity to measurement noise. We prove that an input-to-state stability property also holds for the proposed scheme and, importantly, we ensure that the estimation performance in terms of a quadratic cost is (strictly) improved. We illustrate the efficiency of the approach in improving the performance of given nominal observers in two numerical examples (Van der Pol oscillator and Lithium-Ion (Li-Ion) battery model)., Comment: arXiv admin note: text overlap with arXiv:2209.10130

Transmit power control is one of the most important issues in wireless networks, where nodes typically operate on limited battery power. Reducing communicating power consumption is essential for both economic and ecologic reasons. In fact, transmitting at unnecessarily high power not only reduces node lifetime, but also introduces excessive interference and electromagnetic pollution. Existing work in the wireless community mostly focus on designing transmit power policies by taking into account communication aspects like quality of service or network capacity. Wireless networked control systems (WNCSs), on the other hand, have different and specific needs such as stability, which require transmit power policies adapted to the control context. Transmit power design in the control community has recently attracted much attention, and available works mostly consider linear systems or specific classes of non-linear systems with a single-link view of the system. In this paper, we propose a framework for the design of stabilising transmit power levels that applies to much larger classes of non-linear plants, controllers, and multi-link setting. By exploiting the fact that channel success probabilities are related to transmit power in a non-linear fashion, we first derive closed-loop stability conditions that relate channel probabilities with transmission rate. Next, we combine these results together with well-known and realistic interference models to provide a design methodology for stabilising transmit power in non-linear and multi-link WNCSs., Comment: 18 pages, 3 figures

Solving the analytical inverse kinematics (IK) of redundant manipulators in real time is a difficult problem in robotics since its solution for a given target pose is not unique. Moreover, choosing the optimal IK solution with respect to application-specific demands helps to improve the robustness and to increase the success rate when driving the manipulator from its current configuration towards a desired pose. This is necessary, especially in high-dynamic tasks like catching objects in mid-flights. To compute a suitable target configuration in the joint space for a given target pose in the trajectory planning context, various factors such as travel time or manipulability must be considered. However, these factors increase the complexity of the overall problem which impedes real-time implementation. In this paper, a real-time framework to compute the analytical inverse kinematics of a redundant robot is presented. To this end, the analytical IK of the redundant manipulator is parameterized by so-called redundancy parameters, which are combined with a target pose to yield a unique IK solution. Most existing works in the literature either try to approximate the direct mapping from the desired pose of the manipulator to the solution of the IK or cluster the entire workspace to find IK solutions. In contrast, the proposed framework directly learns these redundancy parameters by using a neural network (NN) that provides the optimal IK solution with respect to the manipulability and the closeness to the current robot configuration. Monte Carlo simulations show the effectiveness of the proposed approach which is accurate and real-time capable ($\approx$ \SI{32}{\micro\second}) on the KUKA LBR iiwa 14 R820., Comment: Published in Mechatronics Journal

This work proposes a novel singularity avoidance approach for real-time trajectory optimization based on known singular configurations. The focus of this work lies on analyzing kinematically singular configurations for three robots with different kinematic structures, i.e., the Comau Racer 7-1.4, the KUKA LBR iiwa R820, and the Franka Emika Panda, and exploiting these configurations in form of tailored potential functions for singularity avoidance. Monte Carlo simulations of the proposed method and the commonly used manipulability maximization approach are performed for comparison. The numerical results show that the average computing time can be reduced and shorter trajectories in both time and path length are obtained with the proposed approach, Comment: 8 pages, 2 figures, Accepted for publication at IFAC World Congress 2023

In this paper, the possibility of determining the thermal, elastic and geometric characteristics of a thin TiO2 film deposited on a silicon substrate, thickness 30 mikrons, in the frequency range of 20 to 20 kHz with neural networks was analyzed. For this purpose, the substrate parameters remained the known and constant in the two-layer model and nano layer thin-film parameters were changed: thickness, expansion and thermal diffusivity. Prediction of these three parameters was analyzed separately with three neural networks and all of these together by fourth neural network. It was shown that neural network, which analyzed all three parameters at the same time, achieved the highest accuracy, so the use of networks that provide predictions for only one parameter is less reliable., Comment: 21 pages, 5 figures

This paper investigates recursive feasibility, recursive robust stability and near-optimality properties of policy iteration (PI). For this purpose, we consider deterministic nonlinear discrete-time systems whose inputs are generated by PI for undiscounted cost functions. We first assume that PI is recursively feasible, in the sense that the optimization problems solved at each iteration admit a solution. In this case, we provide novel conditions to establish recursive robust stability properties for a general attractor, meaning that the policies generated at each iteration ensure a robust \KL-stability property with respect to a general state measure. We then derive novel explicit bounds on the mismatch between the (suboptimal) value function returned by PI at each iteration and the optimal one. Afterwards, motivated by a counter-example that shows that PI may fail to be recursively feasible, we modify PI so that recursive feasibility is guaranteed a priori under mild conditions. This modified algorithm, called PI+, is shown to preserve the recursive robust stability when the attractor is compact. Additionally, PI+ enjoys the same near-optimality properties as its PI counterpart under the same assumptions. Therefore, PI+ is an attractive tool for generating near-optimal stabilizing control of deterministic discrete-time nonlinear systems., Comment: Submitted for review

We present stability conditions for deterministic time-varying nonlinear discrete-time systems whose inputs aim to minimize an infinite-horizon time-dependent cost. Global asymptotic and exponential stability properties for general attractors are established. This work covers and generalizes the related results on discounted optimal control problems to more general systems and cost functions.

We investigate the scenario where a perturbed nonlinear system transmits its output measurements to a remote observer via a packet-based communication network. The sensors are grouped into N nodes and each of these nodes decides when its measured data is transmitted over the network independently. The objective is to design both the observer and the local transmission policies in order to obtain accurate state estimates, while only sporadically using the communication network. In particular, given a general nonlinear observer designed in continuous-time satisfying an input-to-state stability property, we explain how to systematically design a dynamic event-triggering rule for each sensor node that avoids the use of a copy of the observer, thereby keeping local calculation simple. We prove the practical convergence property of the estimation error to the origin and we show that there exists a uniform strictly positive minimum inter-event time for each local triggering rule under mild conditions on the plant. The efficiency of the proposed techniques is illustrated on a numerical case study of a flexible robotic arm.

Various methods are nowadays available to design observers for broad classes of systems. Nevertheless, the question of the tuning of the observer to achieve satisfactory estimation performance remains largely open. This paper presents a general supervisory design framework for online tuning of the observer gains with the aim of achieving various trade-offs between robustness and speed of convergence. We assume that a robust nominal observer has been designed for a general nonlinear system and the goal is to improve its performance. We present for this purpose a novel hybrid multi-observer, which consists of the nominal one and a bank of additional observer-like systems, that are collectively referred to as modes and that differ from the nominal observer only in their output injection gains. We then evaluate on-line the estimation cost of each mode of the multi-observer and, based on these costs, we select one of them at each time instant. Two different strategies are proposed. In the first one, initial conditions of the modes are reset each time the algorithm switches between different modes. In the second one, the initial conditions are not reset. We prove a convergence property for the hybrid estimation scheme and we illustrate the efficiency of the approach in improving the performance of a given nominal high-gain observer on a numerical example.

We propose a certainty-equivalence scheme for adaptive control of scalar linear systems subject to additive, i.i.d. Gaussian disturbances and bounded control input constraints, without requiring prior knowledge of the bounds of the system parameters, nor the control direction. Assuming that the system is at-worst marginally stable, mean square boundedness of the closed-loop system states is proven. Lastly, numerical examples are presented to illustrate our results., Comment: 16 pages, 2 figures, accepted at IEEE Control Systems Letters

In this paper, a sampling-based trajectory planning algorithm for a laboratory-scale 3D gantry crane in an environment with static obstacles and subject to bounds on the velocity and acceleration of the gantry crane system is presented. The focus is on developing a fast motion planning algorithm for differentially flat systems, where intermediate results can be stored and reused for further tasks, such as replanning. The proposed approach is based on the informed optimal rapidly exploring random tree algorithm (informed RRT*), which is utilized to build trajectory trees that are reused for replanning when the start and/or target states change. In contrast to state-of-the-art approaches, the proposed motion planning algorithm incorporates a linear quadratic minimum time (LQTM) local planner. Thus, dynamic properties such as time optimality and the smoothness of the trajectory are directly considered in the proposed algorithm. Moreover, by integrating the branch-and-bound method to perform the pruning process on the trajectory tree, the proposed algorithm can eliminate points in the tree that do not contribute to finding better solutions. This helps to curb memory consumption and reduce the computational complexity during motion (re)planning. Simulation results for a validated mathematical model of a 3D gantry crane show the feasibility of the proposed approach., Comment: Published at IFAC-PapersOnLine (13th IFAC Symposium on Robot Control)

This paper considers controlled scalar systems relying on a lossy wireless feedback channel. In contrast with the existing literature, the focus is not on the system controller but on the wireless transmit power controller that is implemented at the system side for reporting the state to the controller. Such a problem may be of interest, \emph{e.g.}, for the remote control of drones, where communication costs may have to be considered. Determining the power control policy that minimizes the combination of the dynamical system cost and the wireless transmission energy is shown to be a non-trivial optimization problem. It turns out that the recursive structure of the problem can be exploited to determine the optimal power control policy. As illustrated in the numerical performance analysis, in the scenario of a dynamics without perturbations, the optimal power control policy consists in decreasing the transmit power at the right pace. This allows a significant performance gain compared to conventional policies such as the full transmit power policy or the open-loop policy.