This article addresses the problem of achieving relative position-based formation control for leader-follower multiagent systems in a distributed manner using a prescribed performance strategy. Both ...the first- and second-order cases are treated and a leader-follower framework is introduced in the sense that a group of agents with external inputs is selected as leaders in order to drive the group of followers in a way that the entire system achieves a target formation within certain prescribed performance transient bounds. Under the assumption of tree graphs, a distributed control law is proposed for the first-order case when the decay rate of the performance functions is within a sufficient bound. Then, two classes of tree graphs that can have additional followers are investigated. For the second-order case, we propose a distributed control law based on a backstepping approach for the group of leaders to steer the entire system achieving the target formation within the prescribed performance bounds. Finally, several simulation examples are given to illustrate the results.
The need for computationally-efficient control methods of dynamical systems under temporal logic tasks has recently become more apparent. Existing methods are computationally demanding and hence ...often not applicable in practice. Especially with respect to multi-robot systems, these methods do not scale computationally. In this letter, we propose a framework that is based on control barrier functions and signal temporal logic. In particular, timevarying control barrier functions are considered where the temporal properties are used to satisfy signal temporal logic tasks. The resulting controller is given by a switching strategy between a computationally-efficient convex quadratic program and a local feedback control law.
This article studies the tracking control problem of networked multiagent systems under both multiple networks and event-triggered mechanisms. Multiple networks are to connect multiple agents and ...reference systems with decentralized controllers to guarantee their information transmission, whereas the event-triggered mechanisms are to reduce the information transmission via the networks. In this article, each agent has a network to communicate with its controller and reference system, and all networks are independent and asynchronous and have local event-triggered mechanisms, which are based on local measurements and determine whether the local measurements need to be transmitted via the corresponding network. To address this scenario, we first implement the emulation-based approach to develop a novel hybrid model for the tracking control of networked multiagent systems. Next, sufficient conditions are derived and decentralized event-triggered mechanisms are designed to guarantee the desired tracking performance. Furthermore, the proposed approach is applied to derive novel results for the event-triggered observer design problem of networked multiagent systems. Finally, two numerical examples are presented to illustrate the validity of the developed results.
We study the problem of plan synthesis for multi-agent systems, to achieve complex, high-level, long-term goals that are assigned to each agent individually. As the agents might not be capable of ...satisfying their respective goals by themselves, requests for other agents’ collaborations are a part of the task descriptions. We consider that each agent is modeled as a discrete state-transition system and its task specification takes a form of a linear temporal logic formula. A traditional automata-based approach to multi-agent plan synthesis from such specifications builds on centralized team planning and full team synchronization after each agents’ discrete step, and thus suffers from extreme computational demands. We aim at reducing the computational complexity by decomposing the plan synthesis problem into finite horizon planning problems that are solved iteratively, upon the run of the agents. We introduce an event-based synchronization that allows our approach to efficiently adapt to different time durations of different agents’ discrete steps. We discuss the correctness of the solution and find assumptions, under which the proposed iterative algorithm leads to provable eventual satisfaction of the desired specifications.
Control systems that satisfy temporal logic specifications have become increasingly popular due to their applicability to robotic systems. Existing control methods, however, are computationally ...demanding, especially when the problem size becomes too large. In this paper, a robust and computationally efficient model predictive control framework for signal temporal logic specifications is proposed. We introduce discrete average space robustness, a novel quantitative semantic for signal temporal logic, that is directly incorporated into the cost function of the model predictive controller. The optimization problem entailed in this framework can be written as a convex quadratic program when no disjunctions are considered and results in a robust satisfaction of the specification. Furthermore, we define the predicate robustness degree as a new robustness notion. Simulations of a multi-agent system subject to complex specifications demonstrate the efficacy of the proposed method.
A novel control strategy for multi-agent coordination with event-based broadcasting is presented. In particular, each agent decides itself when to transmit its current state to its neighbors and the ...local control laws are based on these sampled state measurements. Three scenarios are analyzed: Networks of single-integrator agents with and without communication delays, and networks of double-integrator agents. The novel event-based scheduling strategy bounds each agent’s measurement error by a time-dependent threshold. For each scenario it is shown that the proposed control strategy guarantees either asymptotic convergence to average consensus or convergence to a ball centered at the average consensus. Moreover, it is shown that the inter-event intervals are lower-bounded by a positive constant. Numerical simulations show the effectiveness of the novel event-based control strategy and how it compares to time-scheduled control.
Event-driven strategies for multi-agent systems are motivated by the future use of embedded microprocessors with limited resources that will gather information and actuate the individual agent ...controller updates. The controller updates considered here are event-driven, depending on the ratio of a certain measurement error with respect to the norm of a function of the state, and are applied to a first order agreement problem. A centralized formulation is considered first and then its distributed counterpart, in which agents require knowledge only of their neighbors' states for the controller implementation. The results are then extended to a self-triggered setup, where each agent computes its next update time at the previous one, without having to keep track of the state error that triggers the actuation between two consecutive update instants. The results are illustrated through simulation examples.
This paper proposes a robust self-triggered model predictive control (MPC) with an adaptive prediction horizon scheme for constrained nonlinear discrete-time systems subject to additive disturbances. ...At each triggering instant, the controller provides an optimal control sequence by solving an optimal control problem (OCP), and at the same time, determines the next triggering time and prediction horizon. By implementing the algorithm, the average sampling frequency is reduced and the prediction horizon is adaptively decreased as the system state approaches a terminal region. Meanwhile, an upper bound of performance loss is guaranteed when compared with a nominal periodic sampling MPC. Feasibility of the OCP and stability of the closed-loop system are established. Simulation results verify the effectiveness of the scheme.
This paper analyzes distributed control protocols for first- and second-order networked dynamical systems. We propose a class of nonlinear consensus controllers where the input of each agent can be ...written as a product of a nonlinear gain, and a sum of nonlinear interaction functions. By using integral Lyapunov functions, we prove the stability of the proposed control protocols, and explicitly characterize the equilibrium set. We also propose a distributed proportional-integral (PI) controller for networked dynamical systems. The PI controllers successfully attenuate constant disturbances in the network. We prove that agents with single-integrator dynamics are stable for any integral gain, and give an explicit tight upper bound on the integral gain for when the system is stable for agents with double-integrator dynamics. Throughout the paper we highlight some possible applications of the proposed controllers by realistic simulations of autonomous satellites, power systems and building temperature control.
This paper describes a framework for automatically generating optimal action-level behavior for a team of robots based on temporal logic mission specifications under resource constraints. The ...proposed approach optimally allocates separable tasks to available robots, without requiring a priori an explicit representation of the tasks or the computation of all task execution costs. Instead, we propose an approach for identifying sub-tasks in an automaton representation of the mission specification and for simultaneously allocating the tasks and planning their execution. The proposed framework avoids the need to compute a combinatorial number of possible assignment costs, where each computation itself requires solving a complex planning problem. This can improve computational efficiency compared with classical assignment solutions, in particular for on-demand missions where task costs are unknown in advance. We demonstrate the applicability of the approach with multiple robots in an existing office environment and evaluate its performance in several case study scenarios.
PDF
