Electrical Engineering And Systems Science

This paper provides a new solution approach to a multi-player perimeter defense game, in which the intruders' team tries to enter the territory, and a team of defenders protects the territory by capturing intruders on the perimeter of the territory. The objective of the defenders is to detect and capture the intruders before the intruders enter the territory. Each defender independently senses the intruder and computes his trajectory to capture the assigned intruders in a cooperative fashion. The intruder is estimated to reach a specific location on the perimeter at a specific time. Each intruder is viewed as a spatio-temporal task, and the defenders are assigned to execute these spatio-temporal tasks. At any given time, the perimeter defense problem is converted into a Decentralized Multi-UAV Spatio-Temporal Multi-Task Allocation (DMUST-MTA) problem. The cost of executing a task for a trajectory is defined by a composite cost function of both the spatial and temporal components. In this paper, a decentralized consensus-based bundle algorithm has been modified to solve the spatio-temporal multi-task allocation problem, and the performance evaluation of the proposed approach is carried out based on Monte-Carlo simulations. The simulation results show the effectiveness of the proposed approach to solve the perimeter defense game under different scenarios. Performance comparison with a state-of-the-art centralized approach with full observability, clearly indicates that DMUST-MTA achieves similar performance in a decentralized way with partial observability conditions with a lesser computational time and easy scaling up.

Connected and Automated Vehicles (CAVs), in particular those with multiple power sources, have the potential to significantly reduce fuel consumption and travel time in real-world driving conditions. In particular, the Eco-driving problem seeks to design optimal speed and power usage profiles based upon look-ahead information from connectivity and advanced mapping features, to minimize the fuel consumption over a given itinerary. Due to the complexity of the problem and the limited on-board computational capability, the real-time implementation of many existing methods that rely on online trajectory optimization becomes infeasible. In this work, the Eco-driving problem is formulated as a Partially Observable Markov Decision Process (POMDP), which is then solved with a state-of-art Deep Reinforcement Learning (DRL) Actor Critic algorithm, Proximal Policy Optimization. An Eco-driving simulation environment is developed for training and testing purposes. To benchmark the performance of the DRL controller, a baseline controller representing the human driver and the wait-and-see deterministic optimal solution are presented. With minimal on-board computational requirement and comparable travel time, the DRL controller reduces the fuel consumption by more than 17% by modulating the vehicle velocity over the route and performing energy-efficient approach and departure at signalized intersections when compared against a baseline controller.

Algorithms for multi-agent systems to locate a source or to follow a desired level curve of spatially distributed scalar fields generally require sharing field measurements among the agents for gradient estimation. Yet, in this paper, we propose a distributed active perception strategy that enables swarms of various sizes and graph structures to perform source seeking and level curve tracking without the need to explicitly estimate the field gradient or explicitly share measurements. The proposed method utilizes a consensus-like Principal Component Analysis perception algorithm that does not require explicit communication in order to compute a local body frame. This body frame is used to design a distributed control law where each agent modulates its motion based only on its instantaneous field measurement. Several stability results are obtained within a singular perturbation framework which justifies the convergence and robustness of the strategy. Additionally, efficiency is validated through various computer simulations and robots implementation in 2 -D scalar fields. The active perception strategy leverages the available local information and has the potential to be used in various applications such as modeling information propagation in biological and robotic swarms.

This paper studies the distributed state estimation in sensor network, where m sensors are deployed to infer the n -dimensional state of a linear time-invariant (LTI) Gaussian system. By a lossless decomposition of optimal steady-state Kalman filter, we show that the problem of distributed estimation can be reformulated as synchronization of homogeneous linear systems. Based on such decomposition, a distributed estimator is proposed, where each sensor node runs a local filter using only its own measurement and fuses the local estimate of each node with a consensus algorithm. We show that the average of the estimate from all sensors coincides with the optimal Kalman estimate. Numerical examples are provided in the end to illustrate the performance of the proposed scheme.

Motivated by recent works addressing adversarial attacks on deep reinforcement learning, a deception attack on linear quadratic Gaussian control is studied in this paper. In the considered attack model, the adversary can manipulate the observation of the agent subject to a mutual information constraint. The adversarial problem is formulated as a novel dynamic cheap talk game to capture the strategic interaction between the adversary and the agent, the asymmetry of information availability, and the system dynamics. Necessary and sufficient conditions are provided for subgame perfect equilibria to exist in pure strategies and in behavioral strategies; and characteristics of the equilibria and the resulting control rewards are given. The results show that pure strategy equilibria are informative, while only babbling equilibria exist in behavioral strategies. Numerical results are shown to illustrate the impact of strategic adversarial interaction.

Ramp merging is considered as one of the major causes of traffic congestion and accidents because of its chaotic nature. With the development of connected and automated vehicle (CAV) technology, cooperative ramp merging has become one of the popular solutions to this problem. In a mixed traffic situation, CAVs will not only interact with each other, but also handle complicated situations with human-driven vehicles involved. In this paper, a game theory-based ramp merging strategy has been developed for the optimal merging coordination of CAVs in the mixed traffic, which determines dynamic merging sequence and corresponding longitudinal/lateral control. This strategy improves the safety and efficiency of the merging process by ensuring a safe inter-vehicle distance among the involved vehicles and harmonizing the speed of CAVs in the traffic stream. To verify the proposed strategy, mixed traffic simulations under different penetration rates and different congestion levels have been carried out on an innovative Unity-SUMO integrated platform, which connects a game engine-based driving simulator with a traffic simulator. This platform allows the human driver to participate in the simulation, and also equip CAVs with more realistic sensing systems. In the traffic flow level simulation test, Unity takes over the sensing and control of all CAVs in the simulation, while SUMO handles the behavior of all legacy vehicles. The results show that the average speed of traffic flow can be increased up to 110%, and the fuel consumption can be reduced up to 77%, respectively.

Cyber-Physical Systems (CPSs) play an increasingly significant role in many critical applications. These valuable applications attract various sophisticated attacks. This paper considers a stealthy estimation attack, which aims to modify the state estimation of the CPSs. The intelligent attackers can learn defense strategies and use clandestine attack strategies to avoid detection. To address the issue, we design a Chi-square detector in a Digital Twin (DT), which is an online digital model of the physical system. We use a Signaling Game with Evidence (SGE) to find the optimal attack and defense strategies. Our analytical results show that the proposed defense strategies can mitigate the impact of the attack on the physical estimation and guarantee the stability of the CPSs. Finally, we use an illustrative application to evaluate the performance of the proposed framework.

Simultaneous Localization and Mapping (SLAM) is one of the key robotics tasks as it tackles simultaneous mapping of the unknown environment defined by multiple landmark positions and localization of the unknown pose (i.e., attitude and position) of the robot in three-dimensional (3D) space. The true SLAM problem is modeled on the Lie group of SLAM n (3) , and its true dynamics rely on angular and translational velocities. This paper proposes a novel geometric nonlinear stochastic estimator algorithm for SLAM on SLAM n (3) that precisely mimics the nonlinear motion dynamics of the true SLAM problem. Unlike existing solutions, the proposed stochastic filter takes into account unknown constant bias and noise attached to the velocity measurements. The proposed nonlinear stochastic estimator on manifold is guaranteed to produce good results provided with the measurements of angular velocities, translational velocities, landmarks, and inertial measurement unit (IMU). Simulation and experimental results reflect the ability of the proposed filter to successfully estimate the six-degrees-of-freedom (6 DoF) robot's pose and landmark positions. Keywords: Simultaneous Localization and Mapping, nonlinear stochastic observer for SLAM, stochastic differential equations, pose estimator, position, attitude, Brownian motion process, inertial measurement unit, landmarks, features, SDE, SO(3), SE(3), SLAM.

This paper analyses and synthesises the Disturbance Observer (DOb) based motion control systems in the discrete-time domain. By employing Bode Integral Theorem, it is shown that continuous-time analysis methods fall-short in explaining the dynamic behaviours of the DOb-based robust motion controllers implemented by computers and microcontrollers. For example, continuous-time analysis methods cannot explain why the robust stability and performance of the digital motion controller deteriorate as the bandwidth of the DOb increases. Therefore, unexpected dynamic responses (e.g., poor stability and performance, and high-sensitivity to disturbances and noise) may be observed when the parameters of the digital robust motion controller are tuned by using continuous-time synthesis methods in practice. This paper also analytically derives the robust stability and performance constraints of the DOb-based motion controllers in the discrete-time domain. The proposed design constraints allow one to systematically synthesise a high-performance digital robust motion controller. The validity of the proposed analysis and synthesis methods are verified by simulations.

Recently, many enterprises are facing the difficulties brought out by the limitation of warehouse land and the increase of loan cost. As a promising approach to improve space utilization rate, puzzle-based storage systems (PBSSs) are drawing more attention from logistics researchers. In previous research about PBSS, concentration has been paid to single target item problems. However, there are no consensus algorithms to solve load retrievals route programming in PBSSs with multiple target items. In this paper, a heuristic algorithm is proposed to solve load retrievals route programming in PBSSs with multiple target items, multiple escorts and multiple IOs. In this paper, new concepts about the proposed algorithm are defined, including target IOs, target position of escorts, number of escorts required, et al. Then, the decision procedures are designed according to these concepts. Based on Markov decision process, the proposed algorithm makes the decision of the next action by analyzing the current status, until all the target items arrive at the IOs. The case study results have shown the effectiveness and efficiency of the proposed heuristic algorithm.