Search

A major challenge in autonomous flights is unknown disturbances, which can jeopardize safety and lead to collisions, especially in obstacle-rich environments. This paper presents a disturbance-aware motion planning and control framework designed for autonomous aerial flights. The framework is composed of two key components: a disturbance-aware motion planner and a tracking controller. The disturbance-aware motion planner consists of a predictive control scheme and a learned model of disturbances that is adapted online. The tracking controller is designed using contraction control methods to provide safety bounds on the quadrotor behaviour in the vicinity of the obstacles with respect to the disturbance-aware motion plan. Finally, the algorithm is tested in simulation scenarios with a quadrotor facing strong crosswind and ground-induced disturbances.

This paper addresses the problem of asymptotic stabilization for high-order control-affine MIMO nonlinear systems with unknown dynamic terms. We introduce Barrier Integral Control, a novel algorithm designed to confine the system's state within a predefined funnel, ensuring adherence to prescribed transient constraints, and asymptotically drive it to zero from any initial condition. The algorithm leverages the innovative integration of a reciprocal barrier function and an error-integral term, featuring smooth feedback control. Notably, it operates without relying on any information or approximation schemes for the (unknown) dynamic terms, which, unlike a large class of previous works, are not assumed to be bounded or to comply with globally Lipschitz/growth conditions. Additionally, the system's trajectory and asymptotic performance are decoupled from the uncertain model, control-gain selection, and initial conditions. Finally, comparative simulation studies validate the effectiveness of the proposed algorithm., Comment: First version

This article presents MAPS$^2$ : a distributed algorithm that allows multi-robot systems to deliver coupled tasks expressed as Signal Temporal Logic (STL) constraints. Classical control theoretical tools addressing STL constraints either adopt a limited fragment of the STL formula or require approximations of min/max operators, whereas works maximising robustness through optimisation-based methods often suffer from local minima, relaxing any completeness arguments due to the NP-hard nature of the problem. Endowed with probabilistic guarantees, MAPS$^2$ provides an anytime algorithm that iteratively improves the robots' trajectories. The algorithm selectively imposes spatial constraints by taking advantage of the temporal properties of the STL. The algorithm is distributed, in the sense that each robot calculates its trajectory by communicating only with its immediate neighbours as defined via a communication graph. We illustrate the efficiency of MAPS$^2$ by conducting extensive simulation and experimental studies, verifying the generation of STL satisfying trajectories.

We propose a framework for verifiable and compositional reinforcement learning (RL) in which a collection of RL subsystems, each of which learns to accomplish a separate subtask, are composed to achieve an overall task. The framework consists of a high-level model, represented as a parametric Markov decision process, which is used to plan and analyze compositions of subsystems, and of the collection of low-level subsystems themselves. The subsystems are implemented as deep RL agents operating under partial observability. By defining interfaces between the subsystems, the framework enables automatic decompositions of task specifications, e.g., reach a target set of states with a probability of at least 0.95, into individual subtask specifications, i.e. achieve the subsystem's exit conditions with at least some minimum probability, given that its entry conditions are met. This in turn allows for the independent training and testing of the subsystems. We present theoretical results guaranteeing that if each subsystem learns a policy satisfying its subtask specification, then their composition is guaranteed to satisfy the overall task specification. Conversely, if the subtask specifications cannot all be satisfied by the learned policies, we present a method, formulated as the problem of finding an optimal set of parameters in the high-level model, to automatically update the subtask specifications to account for the observed shortcomings. The result is an iterative procedure for defining subtask specifications, and for training the subsystems to meet them. Experimental results demonstrate the presented framework's novel capabilities in environments with both full and partial observability, discrete and continuous state and action spaces, as well as deterministic and stochastic dynamics., Comment: arXiv admin note: substantial text overlap with arXiv:2106.05864

We develop an algorithm to control an underactuated unmanned surface vehicle (USV) using kinodynamic motion planning with funnel control (KDF). KDF has two key components: motion planning used to generate trajectories with respect to kinodynamic constraints, and funnel control, also referred to as prescribed performance control, which enables trajectory tracking in the presence of uncertain dynamics and disturbances. We extend prescribed performance control to address the challenges posed by underactuation and control-input saturation present on the USV. The proposed scheme guarantees stability under user-defined prescribed performance functions where model parameters and exogenous disturbances are unknown. Furthermore, we present an optimization problem to obtain smooth, collision-free trajectories while respecting kinodynamic constraints. We deploy the algorithm on a USV and verify its efficiency in real-world open-water experiments., Comment: 12 pages, 10 figures, submitted to IEEE T-CST

In this paper we propose a novel distributed model predictive control (DMPC) based algorithm with a trajectory predictor for a scenario of landing of unmanned aerial vehicles (UAVs) on a moving unmanned surface vehicle (USV). The algorithm is executing DMPC with exchange of trajectories between the agents at a sufficient rate. In the case of loss of communication, and given the sensor setup, agents are predicting the trajectories of other agents based on the available measurements and prior information. The predictions are then used as the reference inputs to DMPC. During the landing, the followers are tasked with avoidance of USV-dependent obstacles and inter-agent collisions. In the proposed distributed algorithm, all agents solve their local optimization problem in parallel and we prove the convergence of the proposed algorithm. Finally, the simulation results support the theoretical findings., Comment: 8 pages, 5 figures, submitted to 62nd IEEE Conference on Decision and Control 2023

Control and planning of multi-agent systems is an active and increasingly studied topic of research, with many practical applications such as rescue missions, security, surveillance, and transportation. This thesis addresses the planning and control of multi-agent systems under temporal logic tasks. The considered systems concern complex, robotic, manipulator-endowed systems, which can coordinate in order to execute complicated tasks, including object manipulation/transportation. Motivated by real-life scenarios, we take into account high-order dynamics subject to model uncertainties and unknown disturbances. Our approach is based on the integration of tools from the areas of multi-agent systems, intelligent control theory, cooperative object manipulation, discrete abstraction design of multi-agent-object systems, and formal verification. The first part of the thesis is devoted to the design of continuous control protocols for cooperative object manipulation/transportation by multiple robotic agents, and the relation of rigid cooperative manipulation schemes to multi-agent formation. In the second part of the thesis, we develop control schemes for the continuous coordination of multi-agent complex systems with uncertain dynamics, focusing on multi-agent navigation with collision specifications in obstacle-cluttered environments. The third part of the thesis is focused on the planning and control of multi-agent and multi-agent-object systems subject to complex tasks expressed as temporal logic formulas. The fourth and final part of the thesis focuses on several extension schemes for single-agent setups, such as motion planning under timed temporal tasks and asymptotic reference tracking for unknown systems while respecting funnel constraints., Comment: PhD thesis; also available at http://kth.diva-portal.org/smash/get/diva2:1427745/FULLTEXT01.pdf

We develop a learning-based algorithm for the distributed formation control of networked multi-agent systems governed by unknown, nonlinear dynamics. Most existing algorithms either assume certain parametric forms for the unknown dynamic terms or resort to unnecessarily large control inputs in order to provide theoretical guarantees. The proposed algorithm avoids these drawbacks by integrating neural network-based learning with adaptive control in a two-step procedure. In the first step of the algorithm, each agent learns a controller, represented as a neural network, using training data that correspond to a collection of formation tasks and agent parameters. These parameters and tasks are derived by varying the nominal agent parameters and a user-defined formation task to be achieved, respectively. In the second step of the algorithm, each agent incorporates the trained neural network into an online and adaptive control policy in such a way that the behavior of the multi-agent closed-loop system satisfies the user-defined formation task. Both the learning phase and the adaptive control policy are distributed, in the sense that each agent computes its own actions using only local information from its neighboring agents. The proposed algorithm does not use any a priori information on the agents' unknown dynamic terms or any approximation schemes. We provide formal theoretical guarantees on the achievement of the formation task., Comment: 12 pages, 10 figures. Under review. arXiv admin note: substantial text overlap with arXiv:2110.05125

We propose a control protocol based on the prescribed performance control (PPC) methodology for a quadrotor unmanned aerial vehicle (UAV). Quadrotor systems belong to the class of underactuated systems for which the original PPC methodology cannot be directly applied. We introduce the necessary design modifications to stabilize the considered system with prescribed performance. The proposed control protocol does not use any information of dynamic model parameters or exogenous disturbances. Furthermore, the stability analysis guarantees that the tracking errors remain inside of designer-specified time-varying functions, achieving prescribed performance independent from the control gains' selection. Finally, simulation results verify the theoretical results., Comment: 8 pages, 6 figures, to appear at 61st IEEE Conference on Decision and Control 2022

We develop an algorithm for the motion and task planning of a system comprised of multiple robots and unactuated objects under tasks expressed as Linear Temporal Logic (LTL) constraints. The robots and objects evolve subject to uncertain dynamics in an obstacle-cluttered environment. The key part of the proposed solution is the intelligent construction of a coupled transition system that encodes the motion and tasks of the robots and the objects. We achieve such a construction by designing appropriate adaptive control protocols in the lower level, which guarantee the safe robot navigation/object transportation in the environment while compensating for the dynamic uncertainties. The transition system is efficiently interfaced with the temporal logic specification via a sampling-based algorithm to output a discrete path as a sequence of synchronized actions of the robots; such actions satisfy the robots' as well as the objects' specifications. The robots execute this discrete path by using the derived low level control protocol. Simulation results verify the proposed framework., Comment: arXiv admin note: text overlap with arXiv:1803.01579

We study the problem of reinforcement learning for a task encoded by a reward machine. The task is defined over a set of properties in the environment, called atomic propositions, and represented by Boolean variables. One unrealistic assumption commonly used in the literature is that the truth values of these propositions are accurately known. In real situations, however, these truth values are uncertain since they come from sensors that suffer from imperfections. At the same time, reward machines can be difficult to model explicitly, especially when they encode complicated tasks. We develop a reinforcement-learning algorithm that infers a reward machine that encodes the underlying task while learning how to execute it, despite the uncertainties of the propositions' truth values. In order to address such uncertainties, the algorithm maintains a probabilistic estimate about the truth value of the atomic propositions; it updates this estimate according to new sensory measurements that arrive from the exploration of the environment. Additionally, the algorithm maintains a hypothesis reward machine, which acts as an estimate of the reward machine that encodes the task to be learned. As the agent explores the environment, the algorithm updates the hypothesis reward machine according to the obtained rewards and the estimate of the atomic propositions' truth value. Finally, the algorithm uses a Q-learning procedure for the states of the hypothesis reward machine to determine the policy that accomplishes the task. We prove that the algorithm successfully infers the reward machine and asymptotically learns a policy that accomplishes the respective task.

We develop a learning-based algorithm for the distributed formation control of networked multi-agent systems governed by unknown, nonlinear dynamics. Most existing algorithms either assume certain parametric forms for the unknown dynamic terms or resort to unnecessarily large control inputs in order to provide theoretical guarantees. The proposed algorithm avoids these drawbacks by integrating neural network-based learning with adaptive control in a two-step procedure. In the first step of the algorithm, each agent learns a controller, represented as a neural network, using training data that correspond to a collection of formation tasks and agent parameters. These parameters and tasks are derived by varying the nominal agent parameters and the formation specifications of the task in hand, respectively. In the second step of the algorithm, each agent incorporates the trained neural network into an online and adaptive control policy in such a way that the behavior of the multi-agent closed-loop system satisfies a user-defined formation task. Both the learning phase and the adaptive control policy are distributed, in the sense that each agent computes its own actions using only local information from its neighboring agents. The proposed algorithm does not use any a priori information on the agents' unknown dynamic terms or any approximation schemes. We provide formal theoretical guarantees on the achievement of the formation task.

We study the design of autonomous agents that are capable of deceiving outside observers about their intentions while carrying out tasks in stochastic, complex environments. By modeling the agent's behavior as a Markov decision process, we consider a setting where the agent aims to reach one of multiple potential goals while deceiving outside observers about its true goal. We propose a novel approach to model observer predictions based on the principle of maximum entropy and to efficiently generate deceptive strategies via linear programming. The proposed approach enables the agent to exhibit a variety of tunable deceptive behaviors while ensuring the satisfaction of probabilistic constraints on the behavior. We evaluate the performance of the proposed approach via comparative user studies and present a case study on the streets of Manhattan, New York, using real travel time distributions.

We develop a learning-based algorithm for the control of autonomous systems governed by unknown, nonlinear dynamics to satisfy user-specified spatio-temporal tasks expressed as signal temporal logic specifications. Most existing algorithms either assume certain parametric forms for the unknown dynamic terms or resort to unnecessarily large control inputs in order to provide theoretical guarantees. The proposed algorithm addresses these drawbacks by integrating neural-network-based learning with adaptive control. More specifically, the algorithm learns a controller, represented as a neural network, using training data that correspond to a collection of system parameters and tasks. These parameters and tasks are derived by varying the nominal parameters and the spatio-temporal constraints of the user-specified task, respectively. It then incorporates this neural network into an online closed-form adaptive control policy in such a way that the resulting behavior satisfies the user-defined task. The proposed algorithm does not use any a priori information on the unknown dynamic terms or any approximation schemes. We provide formal theoretical guarantees on the satisfaction of the task. Numerical experiments on a robotic manipulator and a unicycle robot demonstrate that the proposed algorithm guarantees the satisfaction of 50 user-defined tasks, and outperforms control policies that do not employ online adaptation or the neural-network controller. Finally, we show that the proposed algorithm achieves greater performance than standard reinforcement-learning algorithms in the pendulum benchmarking environment.

We propose a framework for verifiable and compositional reinforcement learning (RL) in which a collection of RL subsystems, each of which learns to accomplish a separate subtask, are composed to achieve an overall task. The framework consists of a high-level model, represented as a parametric Markov decision process (pMDP) which is used to plan and to analyze compositions of subsystems, and of the collection of low-level subsystems themselves. By defining interfaces between the subsystems, the framework enables automatic decompositions of task specifications, e.g., reach a target set of states with a probability of at least 0.95, into individual subtask specifications, i.e. achieve the subsystem's exit conditions with at least some minimum probability, given that its entry conditions are met. This in turn allows for the independent training and testing of the subsystems; if they each learn a policy satisfying the appropriate subtask specification, then their composition is guaranteed to satisfy the overall task specification. Conversely, if the subtask specifications cannot all be satisfied by the learned policies, we present a method, formulated as the problem of finding an optimal set of parameters in the pMDP, to automatically update the subtask specifications to account for the observed shortcomings. The result is an iterative procedure for defining subtask specifications, and for training the subsystems to meet them. As an additional benefit, this procedure allows for particularly challenging or important components of an overall task to be determined automatically, and focused on, during training. Experimental results demonstrate the presented framework's novel capabilities., Comment: Accepted for publication at ICAPS 2022. Changes since v1: An additional example with continuous states and actions has been added. Additional discussion has been added to the section presenting the algorithm, and to the section presenting the numerical experiments. Wording and formatting has been edited for consistency with the version published by AAAI press

We develop a control algorithm that ensures the safety, in terms of confinement in a set, of a system with unknown, 2nd-order nonlinear dynamics. The algorithm establishes novel connections between data-driven and robust, nonlinear control. It is based on data obtained online from the current trajectory and the concept of reciprocal barriers. More specifically, it first uses the obtained data to calculate set-valued functions that over-approximate the unknown dynamic terms. For the second step of the algorithm, we design a robust control scheme that uses these functions as well as reciprocal barriers to render the system forward invariant with respect to the safe set. In addition, we provide an extension of the algorithm that tackles issues of controllability loss incurred by the nullspace of the control-direction matrix. The algorithm removes a series of standard, limiting assumptions considered in the related literature since it does not require global boundedness, growth conditions, or a priori approximations of the unknown dynamics' terms., Comment: Under Submission

We integrate sampling-based planning techniques with funnel-based feedback control to develop KDF, a new framework for solving the kinodynamic motion-planning problem via funnel control. The considered systems evolve subject to complex, nonlinear, and uncertain dynamics (aka differential constraints). Firstly, we use a geometric planner to obtain a high-level safe path in a user-defined extended free space. Secondly, we develop a low-level funnel control algorithm that guarantees safe tracking of the path by the system. Neither the planner nor the control algorithm use information on the underlying dynamics of the system, which makes the proposed scheme easily distributable to a large variety of different systems and scenarios. Intuitively, the funnel control module is able to implicitly accommodate the dynamics of the system, allowing hence the deployment of purely geometrical motion planners. Extensive computer simulations and experimental results with a 6-DOF robotic arm validate the proposed approach., Comment: Under submission

We study the synthesis of a policy in a Markov decision process (MDP) following which an agent reaches a target state in the MDP while minimizing its total discounted cost. The problem combines a reachability criterion with a discounted cost criterion and naturally expresses the completion of a task with probabilistic guarantees and optimal transient performance. We first establish that an optimal policy for the considered formulation may not exist but that there always exists a near-optimal stationary policy. We additionally provide a necessary and sufficient condition for the existence of an optimal policy. We then restrict our attention to stationary deterministic policies and show that the decision problem associated with the synthesis of an optimal stationary deterministic policy is NP-complete. Finally, we provide an exact algorithm based on mixed-integer linear programming and propose an efficient approximation algorithm based on linear programming for the synthesis of an optimal stationary deterministic policy., Comment: 8 pages, 2 figures

In this paper, we propose a novel safe, passive, and robust control law for mechanical systems. The proposed approach addresses safety from a physical human-robot interaction perspective, where a robot must not only stay inside a pre-defined region, but respect velocity constraints and ensure passivity with respect to external perturbations that may arise from a human or the environment. The proposed control is written in closed-form, behaves well even during singular configurations, and allows any nominal control law to be applied inside the operating region as long as the safety requirements (e.g., velocity) are adhered to. The proposed method is implemented on a 6-DOF robot to demonstrate its effectiveness during a physical human-robot interaction task.

This paper considers the problem of robot motion planning in a workspace with obstacles for systems with uncertain 2nd-order dynamics. In particular, we combine closed form potential-based feedback controllers with adaptive control techniques to guarantee the collision-free robot navigation to a predefined goal while compensating for the dynamic model uncertainties. We base our findings on sphere world-based configuration spaces, but extend our results to arbitrary star-shaped environments by using previous results on configuration space transformations. Moreover, we propose an algorithm for extending the control scheme to decentralized multi-robot systems. Finally, extensive simulation results verify the theoretical findings.

This paper considers the integration of rigid cooperative manipulation with rigidity theory. Motivated by rigid models of cooperative manipulation systems, i.e., where the grasping contacts are rigid, we introduce first the notion of bearing and distance rigidity for graph frameworks in SE(3). Next, we associate the nodes of these frameworks to the robotic agents of rigid cooperative manipulation schemes and we express the object-agent interaction forces by using the graph rigidity matrix, which encodes the infinitesimal rigid body motions of the system. Moreover, we show that the associated cooperative manipulation grasp matrix is related to the rigidity matrix via a range-nullspace relation, based on which we provide novel results on the relation between the arising interaction and internal forces and consequently on the energy-optimal force distribution on a cooperative manipulation system. Finally, simulation results on a realistic environment enhance the validity of the theoretical findings.

Over the last years, the development of Autonomous Underwater Vehicles (AUV) with attached robotic manipulators, the so-called Underwater Vehicle Manipulator System (UVMS), has gained significant research attention, due to the ability of interaction with underwater environments. In such applications, force/torque controllers which guarantee that the end-effector of the UVMS applies desired forces/torques towards the environment, should be designed in a way that state and input constraints are taken into consideration. Furthermore, due to their complicated structure, unmodeled dynamics as well as external disturbances may arise. Motivated by this, we proposed a robust Model Predicted Control Methodology (NMPC) methodology which can handle the aforementioned constraints in an efficient way and it guarantees that the end-effector is exerting the desired forces/torques towards the environment. Simulation results verify the validity of the proposed framework., Comment: Conference paper to appear in AUV 2018, Porto, Portugal. arXiv admin note: text overlap with arXiv:1809.09825

This paper presents a novel control strategy for the coordination of a multi-agent system subject to high-level goals expressed as linear temporal logic formulas. In particular, each agent, which is modeled as a sphere with 2nd order dynamics, has to satisfy a given local temporal logic specification subject to connectivity maintenance and inter-agent collision avoidance. We propose a novel continuous control protocol that guarantees navigation of one agent to a goal point, up to a set of collision-free initial configurations, while maintaining connectivity of the initial neighboring set and avoiding inter-agent collisions. Based on that, we develop a hybrid switching control strategy that ensures that each agent satisfies its temporal logic task. Simulation results depict the validity of the proposed scheme., Comment: Submitted to Systems & Control Letters

This paper addresses the problem of cooperative transportation of an object rigidly grasped by N robotic agents. We propose a Nonlinear Model Predictive Control (NMPC) scheme that guarantees the navigation of the object to a desired pose in a bounded workspace with obstacles, while complying with certain input saturations of the agents. The control scheme is based on inter-agent communication and is decentralized in the sense that each agent calculates its own control signal. Moreover, the proposed methodology ensures that the agents do not collide with each other or with the workspace obstacles as well as that they do not pass through singular configurations. The feasibility and convergence analysis of the NMPC are explicitly provided. Finally, simulation results illustrate the validity and efficiency of the proposed method., Comment: European Control Conference 2018. arXiv admin note: text overlap with arXiv:1705.01426

This paper presents a novel control protocol for distance and orientation formation control of rigid bodies, whose sensing graph is a static and undirected tree, in the special Euclidean group SE(3). The proposed control laws are decentralized, in the sense that each agent uses only local relative information from its neighbors to calculate its control signal, as well as robust with respect to modeling (parametric and structural) uncertainties and external disturbances. The proposed methodology guarantees the satisfaction of inter-agent distance constraints that resemble collision avoidance and connectivity maintenance properties. Moreover, certain predefined functions characterize the transient and steady state performance of the closed loop system. Finally, simulation results verify the validity and efficiency of the proposed approach., Comment: Provisionally accepted in Automatica. arXiv admin note: text overlap with arXiv:1611.01824

This paper presents a hybrid control framework for the motion planning of a multi-agent system including N robotic agents and M objects, under high level goals expressed as Linear Temporal Logic (LTL) formulas. In particular, we design control protocols that allow the transition of the agents as well as the cooperative transportation of the objects by the agents, among predefined regions of interest in the workspace. This allows to abstract the coupled behavior of the agents and the objects as a finite transition system and to design a high-level multi-agent plan that satisfies the agents' and the objects' specifications, given as temporal logic formulas. Simulation results verify the proposed framework., Comment: Submitted to IEEE Transactions on Automation Science and Engineering. arXiv admin note: text overlap with arXiv:1611.05186

In this paper, the attitude tracking problem is considered using the rotation matrices. Due to the inherent topological restriction, it is impossible to achieve global attractivity with any continuous attitude control system on $SO(3)$. Hence in this work, we propose some control protocols achieve almost global tracking asymptotically and in finite time, respectively. In these protocols, no world frame is needed and only relative state informations are requested. For finite-time tracking case, Filippov solutions and non-smooth analysis techniques are adopted to handle the discontinuities. Simulation examples are provided to verify the performances of the control protocols designed in this paper., Comment: arXiv admin note: text overlap with arXiv:1705.02821

This paper presents two novel control methodologies for the cooperative manipulation of an object by N robotic agents. Firstly, we design an adaptive control protocol which employs quaternion feedback for the object orientation to avoid potential representation singularities. Secondly, we propose a control protocol that guarantees predefined transient and steady-state performance for the object trajectory. Both methodologies are decentralized, since the agents calculate their own signals without communicating with each other, as well as robust to external disturbances and model uncertainties. Moreover, we consider that the grasping points are rigid, and avoid the need for force/torque measurements. Load distribution is also included via a grasp matrix pseudo-inverse to account for potential differences in the agents' power capabilities. Finally, simulation and experimental results with two robotic arms verify the theoretical findings.

This paper addresses the problem of cooperative transportation of an object rigidly grasped by $N$ robotic agents. In particular, we propose a Nonlinear Model Predictive Control (NMPC) scheme that guarantees the navigation of the object to a desired pose in a bounded workspace with obstacles, while complying with certain input saturations of the agents. Moreover, the proposed methodology ensures that the agents do not collide with each other or with the workspace obstacles as well as that they do not pass through singular configurations. The feasibility and convergence analysis of the NMPC are explicitly provided. Finally, simulation results illustrate the validity and efficiency of the proposed method., Comment: Simulation results with 3 agents added

This paper addresses the problem of decentralized abstractions for multiple mobile manipulators with 2nd order dynamics. In particular, we propose decentralized controllers for the navigation of each agent among predefined regions of interest in the workspace, while guaranteeing at the same time inter-agent collision avoidance and connectivity maintenance for a subset of initially connected agents. In that way, the motion of the coupled multi-agent system is abstracted into multiple finite transition systems for each agent, which are then suitable for the application of temporal logic-based high level plans. The proposed methodology is decentralized, since each agent uses local information based on limited sensing capabilities. Finally, simulation studies verify the validity of the approach., Comment: Accepted for publication in the IEEE Conference on Decision and Control, Melbourne, Australia, 2017

This paper addresses the problem of position- and orientation-based formation control of a class of second-order nonlinear multi-agent systems in a $3$D workspace with obstacles. More specifically, we design a decentralized control protocol such that each agent achieves a predefined geometric formation with its initial neighbors, while using local information based on a limited sensing radius. The latter implies that the proposed scheme guarantees that the initially connected agents remain always connected. In addition, by introducing certain distance constraints, we guarantee inter-agent collision avoidance as well as collision avoidance with the obstacles and the boundary of the workspace. The proposed controllers employ a novel class of potential functions and do not require a priori knowledge of the dynamical model, except for gravity-related terms. Finally, simulation results verify the validity of the proposed framework.

Motivated by the recent interest in formal methods-based control for dynamic robots, we discuss the applicability of prescribed performance control to nonlinear systems subject to signal temporal logic specifications. Prescribed performance control imposes a desired transient behavior on the system trajectories that is leveraged to satisfy atomic signal temporal logic specifications. A hybrid control strategy is then used to satisfy a finite set of these atomic specifications. Simulations of a multi-agent system, using consensus dynamics, show that a wide range of specifications, i.e., formation, sequencing, and dispersion, can be robustly satisfied., Comment: 9 pages - this an extended version of the 56th IEEE Conference on Decision and Control (2017) version

This paper presents a fully automated procedure for controller synthesis for a general class of multi-agent systems under coupling constraints. Each agent is modeled with dynamics consisting of two terms: the first one models the coupling constraints and the other one is an additional bounded control input. We aim to design these inputs so that each agent meets an individual high-level specification given as a Metric Interval Temporal Logic (MITL). Furthermore, the connectivity of the initially connected agents, is required to be maintained. First, assuming a polyhedral partition of the workspace, a novel decentralized abstraction that provides controllers for each agent that guarantee the transition between different regions is designed. The controllers are the solution of a Robust Optimal Control Problem (ROCP) for each agent. Second, by utilizing techniques from formal verification, an algorithm that computes the individual runs which provably satisfy the high-level tasks is provided. Finally, simulation results conducted in MATLAB environment verify the performance of the proposed framework.

In this paper, we consider the two dimensional (2-D) predecessor-following control problem for a platoon of unicycle vehicles moving on a planar surface. More specifically, we design a decentralized kinematic control protocol, in the sense that each vehicle calculates its own control signal based solely on local information regarding its preceding vehicle, by its on-board camera, without incorporating any velocity measurements. Additionally, the transient and steady state response is a priori determined by certain designer-specified performance functions and is fully decoupled by the number of vehicles composing the platoon and the control gains selection. Moreover, collisions between successive vehicles as well as connectivity breaks, owing to the limited field of view of cameras, are provably avoided. Finally, an extensive simulation study is carried out in the WEBOTS realistic simulator, clarifying the proposed control scheme and verifying its effectiveness., Comment: Proceedings of the IEEE/RSJ Conference on Intelligent Robots and Systems (IROS), 2015

In this paper, we study the longitudinal control problem for a platoon of vehicles with unknown nonlinear dynamics under both the predecessor-following and the bidirectional control architectures. The proposed control protocols are fully distributed in the sense that each vehicle utilizes feedback from its relative position with respect to its preceding and following vehicles as well as its own velocity, which can all be easily obtained by onboard sensors. Moreover, no previous knowledge of model nonlinearities/disturbances is incorporated in the control design, enhancing in that way the robustness of the overall closed loop system against model imperfections. Additionally, certain designer-specified performance functions determine the transient and steady-state response, thus preventing connectivity breaks due to sensor limitations as well as inter-vehicular collisions. Finally, extensive simulation studies and a real-time experiment conducted with mobile robots clarify the proposed control protocols and verify their effectiveness., Comment: IEEE Transactions on Control Systems Technology, accepted

This paper presents a hybrid control framework for the motion planning of a multi-agent system including N robotic agents and M objects, under high level goals. In particular, we design control protocols that allow the transition of the agents as well as the transportation of the objects by the agents, among predefined regions of interest in the workspace. This allows us to abstract the coupled behavior of the agents and the objects as a finite transition system and to design a high-level multi-agent plan that satisfies the agents' and the objects' specifications, given as temporal logic formulas. Simulation results verify the proposed framework., Comment: To appear in the World Congress of the International Federation of Automatic Control (IFAC), Toulouse, France, July 2017

This paper addresses the problem of distance- and orientation-based formation control of a class of second-order nonlinear multi-agent systems in 3D space, under static and undirected communication topologies. More specifically, we design a decentralized model-free control protocol in the sense that each agent uses only local information from its neighbors to calculate its own control signal, without incorporating any knowledge of the model nonlinearities and exogenous disturbances. Moreover, the transient and steady state response is solely determined by certain designer-specified performance functions and is fully decoupled by the agents' dynamic model, the control gain selection, the underlying graph topology as well as the initial conditions. Additionally, by introducing certain inter-agent distance constraints, we guarantee collision avoidance and connectivity maintenance between neighboring agents. Finally, simulation results verify the performance of the proposed controllers., Comment: IFAC Word Congress 2017

This paper proposes a task-space control protocol for the collaborative manipulation of a single object by N robotic agents. The proposed methodology is decentralized in the sense that each agent utilizes information associated with its own and the object's dynamic/kinematic parameters and no on-line communication takes place. Moreover, no feedback of the contact forces/torques is required, therefore employment of corresponding sensors is avoided. An adaptive version of the control scheme is also introduced, where the agents' and object's dynamic parameters are considered unknown. We also use unit quaternions to represent the object's orientation. In addition, load sharing coefficients between the agents are employed and internal force regulation is guaranteed. Finally, experimental studies with two robotic arms verify the validity and effectiveness of the proposed control protocol., Comment: To appear in the World Congress of the International Federation of Automatic Control (IFAC), Toulouse, France, July 2017