Search

Addressing a collision-aware multi-robot mission planning problem, which involves task allocation and path-finding, poses a significant difficulty due to the necessity for real-time computational efficiency, scalability, and the ability to manage both static and dynamic obstacles and tasks within a complex environment. This paper introduces a parallel real-time algorithm aimed at overcoming these challenges. The proposed algorithm employs an approximation-based partitioning mechanism to partition the entire unassigned task set into several subsets. This approach decomposes the original problem into a series of single-robot mission planning problems. To validate the effectiveness of the proposed method, both numerical and hardware experiments are conducted, involving dynamic obstacles and tasks. Additionally, comparisons in terms of optimality and scalability against an existing method are provided, showcasing its superior performance across both metrics. Furthermore, a computational burden analysis is conducted to demonstrate the consistency of our method with the observations derived from these comparisons. Finally, the optimality gap between the proposed method and the global optima in small-size problems is demonstrated. [ABSTRACT FROM AUTHOR]

This article develops a methodology that enables learning an objective function of an optimal control system from incomplete trajectory observations. The objective function is assumed to be a weighted sum of features (or basis functions) with unknown weights, and the observed data is a segment of a trajectory of system states and inputs. The proposed technique introduces the concept of the recovery matrix to establish the relationship between any available segment of the trajectory and the weights of given candidate features. The rank of the recovery matrix indicates whether a subset of relevant features can be found among the candidate features and the corresponding weights can be learned from the segment data. The recovery matrix can be obtained iteratively and its rank non-decreasing property shows that additional observations may contribute to the objective learning. Based on the recovery matrix, a method for using incomplete trajectory observations to learn the weights of selected features is established, and an incremental inverse optimal control algorithm is developed by automatically finding the minimal required observation. The effectiveness of the proposed method is demonstrated on a linear quadratic regulator system and a simulated robot manipulator. [ABSTRACT FROM AUTHOR]

In this paper, we consider a dynamical system whose trajectory is a result of minimizing a multiphase cost function. The multiphase cost function is assumed to be a weighted sum of specified features (or basis functions) with phase-dependent weights that switch at some unknown phase transition points. A new inverse optimal control approach for recovering the cost weights of each phase and estimating the phase transition points is proposed. The key idea is to use a length-adapted window moving along the observed trajectory, where the window length is determined by finding the minimal observation length that suffices for a successful cost weight recovery. The effectiveness of the proposed method is first evaluated on a simulated robot arm, and then, demonstrated on a dataset of human participants performing a series of squatting tasks. The results demonstrate that the proposed method reliably retrieves the cost function of each phase and segments each phase of motion from the trajectory with a segmentation accuracy above 90%. [ABSTRACT FROM AUTHOR]

The problem of adaptive fuzzy control is investigated for a class of nontriangular structural stochastic switched nonlinear systems with full state constraints in this paper. A remarkable feature of the nontriangular structural nonlinear system is the so-called algebraic loop problem in the existing backstepping-based analysis and design. Properties of fuzzy basis functions are utilized to circumvent this algebraic loop problem. Based on the Barrier Lyapunov function, an adaptive fuzzy stochastic switched control scheme is designed. It is proven that all the signals in the closed-loop system are semiglobally uniformly ultimately bounded with full state constraints. The effectiveness of the proposed control scheme is verified via simulation studies. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive fault estimation approach is proposed for a class of switched nonlinear systems. The considered system is assumed to possess unknown nonlinearities, unmeasured states, and simultaneous sensor and actuator faults. Fuzzy logic systems are applied to approximate the unknown nonlinear terms. Two new adaptive fuzzy observers are designed where the sensor and actuator faults can be estimated separately. On the basis of average dwell time approach and Lyapunov stability theory, the resulting error system is proven to be bounded stable with designed parameters. Finally, a simulation example is presented to illustrate the effectiveness of the designed observers. [ABSTRACT FROM AUTHOR]

In Fauré et al. (2006), the dynamics of the core network regulating the mammalian cell cycle is formulated as a Boolean control network (BCN) model consisting of nine proteins as state nodes and a tenth protein (protein CycD) as the control input node. In this model, one of the state nodes, protein Cdc20, plays a central role in the separation of sister chromatids. Hence, if any Cdc20 sequence can be obtained, fully controlling the mammalian cell cycle is feasible. Motivated by this fact, we study whether any Cdc20 sequence can be obtained theoretically. We formulate the foregoing problem as the invertibility of BCNs, that is, whether one can obtain any Cdc20 sequence by designing input (i.e., protein CycD) sequences. We give an algorithm to verify the invertibility of any BCN, and find that the BCN model for the core network regulating the mammalian cell cycle is not invertible, that is, one cannot obtain any Cdc20 sequence. We further present another algorithm to test whether a finite Cdc20 sequence can be generated by the BCN model, which leads to a series of periodic infinite Cdc20 sequences with alternately active and inactive Cdc20 segments. States of these sequences are alternated between the two attractors in the proposed model, which reproduces correctly how a cell exits the cell cycle to enter the quiescent state, or the opposite. [ABSTRACT FROM PUBLISHER]

Applications of sensor networks usually require events at all nodes to be synchronized. To meet such requirement, this work proposes two multi-timer model based event synchronization schemes which are fully distributed. The proposed model consists of multiple timers with each timer characterizing a sensor node whose events are triggered by timer interrupts. Each timer updates its preset values by only using values from its nearby neighbors. Event synchronization is achieved when all timers reach their preset values simultaneously. One key feature of this work is by unifying the time synchronization part and the embedded system part of the sensor networks to reach the strict event synchronization. The effectiveness of the proposed schemes is demonstrated by simulation examples and a case study in a microgrid. [ABSTRACT FROM AUTHOR]

Most of the existing results on distributed distance-constrained rigid formation control establish asymptotic or exponential convergence. To further improve the convergence rate, we explain in this paper how to modify existing gradient controllers to obtain finite time stability. For point agents modeled by single integrators, the controllers proposed in this paper drive the whole formation to locally converge to a desired shape with finite settling time. We also show for undirected triangular formation shape control, if all the agents start with non-collinear positions, then the formation will converge to the desired shape in finite time. For agents modeled by double integrators, the proposed controllers allow all agents to both achieve the same velocity and reach a desired shape in finite time. All controllers are totally distributed. Simulations are also provided to validate the proposed control strategies. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This article investigates the problem of communication-efficient and resilient multiagent reinforcement learning (MARL). Specifically, we consider a setting where a set of agents are interconnected over a given network, and can only exchange information with their neighbors. Each agent observes a common Markov Decision Process and has a local cost which is a function of the current system state and the applied control action. The goal of MARL is for all agents to learn a policy that optimizes the infinite horizon discounted average of all their costs. Within this general setting, we consider two extensions to existing MARL algorithms. First, we provide an event-triggered learning rule where agents only exchange information with their neighbors if a certain triggering condition is satisfied. We show that this enables learning while reducing the amount of communication. Next, we consider the scenario where some of the agents can be adversarial (as captured by the Byzantine attack model), and arbitrarily deviate from the prescribed learning algorithm. We establish a fundamental trade-off between optimality and resilience when Byzantine agents are present. We then create a resilient algorithm and show almost sure convergence of all reliable agents' value functions to the neighborhood of the optimal value function of all reliable agents, under certain conditions on the network topology. When the optimal Q -values are sufficiently separated for different actions, we show that all reliable agents can learn the optimal policy under our algorithm.