Motivated by the growing importance of flexible automation in industrial environments, this article investigates the impact of wireless solutions in collaborative robotics, toward which we provide a quality of control (QoC)-based abstraction and methodology that comprehensively captures the interplay between network-induced delays, reliability, and robotic workload parameters for wireless collaborative robotics (WCR). For such a setting, we formulate a joint control-communication co-design based optimization framework to maximize the QoC across all robots, for 5G resource dimensioning. This is crucial for identifying optimal co-design parameters maximizing the QoC for limited 5G bandwidth across different topologies of robotic connectivity, prior to the deployment of these WCRs, or when selecting appropriate connectivity priority levels. We compare the performance of our proposed algorithm to different state of the art schemes in the literature. Our simulation results highlight the latency-reliability tradeoff and its implications on the control performance. We also demonstrate that our abstraction can be utilized for control-communication co-design, identifying optimal latency-reliability points in conjunction with the maximum velocity the robots operate with, while highlighting the energy gains due to co-design as well.

Rapid advancements in digitalization and artificial intelligence (AI) have catalyzed the adoption of digital twin technologies in the construction sector, enabling real-time synchronization between virtual models and physical systems. Simultaneously, on-site robotic automation has shown promise for reducing physical workloads, enhancing productivity, and contributing to sustainability goals that are key values of Industry 5.0. However, current digital twin implementations rarely incorporate multirobot construction systems, often relying on single-robot approaches or purely offline simulations. This gap hinders the realization of truly integrated construction environments that combine sensing, data analytics, wireless communications, and multirobot coordination. In response, this article proposes ConstrucTwin, a digital twin-driven multirobot construction framework designed to support complex construction tasks in real-world settings. By combining a 5G communication estimation-involved architecture and a cross-level planning strategy, ConstrucTwin streamlines interactions between physical robots and their digital counterparts. Essential tasks such as motion and task-level planning, as well as remote human-in-the-loop (HIL) oversight, are orchestrated within a single unified architecture. Through case studies involving rebar cage and brick wall construction, we demonstrate how an integrated approach to vision-based servoing and multirobot coordination enhances execution speed, precision, and scalability. The results underscore the system’s potential to advance human-centric, resilient, and sustainable construction, thereby aligning with the broader vision of Industry 5.0.

With the increasing focus on flexible automation, which emphasizes systems capable of adapting to varied tasks and conditions, exploring future deployments of cloud and edge-based network infrastructures in robotic systems becomes crucial. This work, examines how wireless solutions could support the shift from rigid, wired setups toward more adaptive, flexible automation in industrial environments. We provide a quality of control (QoC) based abstraction for robotic workloads, parameterized on loop latency and reliability, and jointly optimize system performance. The setup involves collaborative robots working on distributed tasks, underscoring how wireless communication can enable more dynamic coordination in flexible automation systems. We use our abstraction to optimally maximize the QoC ensuring efficient operation even under varying network conditions. Additionally, our solution allocates the communication resources in time slots, optimizing the balance between communication and control costs. Our simulation results highlight that minimizing the delay in the system may not always ensure the best QoC but can lead to substantial gains in QoC if delays are sometimes relaxed, allowing more packets to be delivered reliably.

We consider multi-robot systems under recurring tasks formalized as linear temporal logic (LTL) specifications. To solve the planning problem efficiently, we propose a bottomup approach combining offline plan synthesis with online coordination, dynamically adjusting plans via real-time communication. To address action delays, we introduce a synchronization mechanism ensuring coordinated task execution, leading to a multi-agent coordination and synchronization framework that is adaptable to a wide range of multi-robot applications. The software package is developed in Python and ROS2 for broad deployment. We validate our findings through lab experiments involving nine robots showing enhanced adaptability compared to previous methods. Additionally, we conduct simulations with up to ninety agents to demonstrate the reduced computational complexity and the scalability features of our work.

In this work, we present a coordination strategy tailored for scenarios involving multiple agents and tasks. We devise a range of tasks using signal temporal logic (STL), each earmarked for specific agents. These tasks are then imposed through control barrier function (CBF) constraints to ensure completion. To extend existing methodologies, our framework adeptly manages interactions among multiple agents. This extension is facilitated by leveraging nonlinear model predictive control (NMPC) to compute trajectories that avoid collisions. An integral aspect of our approach is the integration of a human-in-the-loop (HIL) model. This model enables real-time integration of human directives into the coordination process. A novel task allocation protocol is embedded within the frame-work to guide this process. We substantiate our methodology through a series of experiments, which corroborate the viability and relevance of our algorithms.

In this work, we develop a control algorithm for mobile manipulators manipulating an object within a leader-follower framework. Unlike existing literature, we avoid the knowledge of the object’s dynamics, and only the leader is aware of the tasks to be executed by the object. The followers are primarily tasked to lift the object and maintain a desired posture while the leader manipulates the object despite its unknown dynamic parameters. We employ a stiffness-based controller for the followers, allowing set-point stabilisation with permissible flexibility and a high-gain prescribed performance controller for the leader to facilitate manipulation from the object's equilibrium state. We present simulation results with two followers and one leader KUKA youbots to validate our proposed framework.

In this work, we propose a novel approach for the continuous-time control synthesis of nonlinear systems under nested signal temporal logic (STL) specifications. While the majority of existing literature focuses on control synthesis for STL specifications without nested temporal operators, addressing nested temporal operators poses a notably more challenging scenario and requires new theoretical advancements. Our approach hinges on the concepts of signal temporal logic tree (sTLT) and control barrier function (CBF). Specifically, we detail the construction of an sTLT from a given STL formula and a continuous-time dynamical system, the sTLT semantics (i.e., satisfaction condition), and the equivalence or under-approximation relation between sTLT and STL. Leveraging the fact that the satisfaction condition of an sTLT is essentially keeping the state within certain sets during certain time intervals, it provides explicit guidelines for the CBF design. The resulting controller is obtained through the utilization of an online CBF-based program coupled with an event-triggered scheme for online updating the activation time interval of each CBF, with which the correctness of the system behavior can be established by construction. We demonstrate the efficacy of the proposed method for single-integrator and unicycle models under nested STL formulas.

This paper investigates the planning and control problems for multi-robot systems under linear temporal logic (LTL) specifications. In contrast to most of existing literature, which presumes a static and known environment, our study focuses on dynamic environments that can have unknown moving obstacles like humans walking through. Depending on whether local communication is allowed between robots, we consider two different online re-planning approaches. When local communication is allowed, we propose a local trajectory generation algorithm for each robot to resolve conflicts that are detected on-line. In the other case, i.e., no communication is allowed, we develop a model predictive controller to reactively avoid potential collisions. In both cases, task satisfaction is guaranteed whenever it is feasible. In addition, we consider the human-in-the-Ioop scenario where humans may additionally take control of one or multiple robots. We design a mixed initiative controller for each robot to prevent unsafe human behaviors while guarantee the LTL satisfaction. Using our previous developed ROS software package, several experiments are conducted to demonstrate the effectiveness and the applicability of the proposed strategies.

In this work, we propose a distributed control scheme for multi-robot systems in the presence of multiple constraints using control barrier functions. The proposed scheme expands previous work where only one single constraint can be handled. Here we show how to transform multiple constraints to a collective one using a smoothly approximated minimum function. Additionally, human-in-the-loop control is also incorporated seamlessly to our control design, both through the nominal control in the optimization objective as well as a safety condition in the constraints. Possible failure regions are identified and a suitable fix is proposed. Two types of human-in- the-loop scenarios are tested on real multi-robot systems with multiple constraints, including collision avoidance, connectivity maintenance, and arena range limits.

We present a distributed, event-triggered, and adaptive control algorithm for cooperative object manipulation with rolling contacts and unknown dynamic parameters. Whereas conventional cooperative manipulation methods require rigid contact points, our approach exploits rolling effects of passive end-effectors and does not require force/torque sensing. The removal of rigidity allows for more modular grasping, increased application to more object types, and online adjustment of the grasp. The proposed control algorithm exhibits the following properties: 1) it is distributed, in the sense that the robotic agents calculate their own control signal, under an event-triggered communication scheme. Such a scheme reduces the interagent communication requirements with respect to continuous communication schemes; 2) it uses an online adaptation mechanism to accommodate for unknown dynamic parameters of the object and the agents and 3) it adapts existing internal force controllers to guarantee no slip throughout the manipulation task despite the event-triggered nature of the communication scheme. Hardware implementation validates the effectiveness of the proposed approach.

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 (also known as differential constraints). First, we use ageometricplanner to obtain a high-level safe path in a user-defined extended free space. Second, 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 uses 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 hardware experiments with a 6-DOF robotic arm validate the proposed approach.

This paper presents algorithms for performing data-driven reachability analysis under temporal logic side information. In certain scenarios, the data-driven reachable sets of a robot can be prohibitively conservative due to the inherent noise in the robot's historical measurement data. In the same scenarios, we often have side information about the robot's expected motion (e.g., limits on how much a robot can move in a one-time step) that could be useful for further specifying the reachability analysis. In this work, we show that if we can model this side information using a signal temporal logic (STL) fragment, we can constrain the data-driven reachability analysis and safely limit the conservatism of the computed reachable sets. Moreover, we provide formal guarantees that, even after incorporating side information, the computed reachable sets still properly over-approximate the robot's future states. Lastly, we empirically validate the prac-ticality of the over-approximation by computing constrained, data-driven reachable sets for the Small- Vehicles-for-Autonomy (SVEA) hardware platform in two driving scenarios.

In this paper we analyze the equilibrium points of a collaborative transportation task, composed of two unmanned aerial vehicles and a payload - in this case, a bar. Moreover, centralized and decentralized linear model predictive controllers are designed, where the nonlinear dynamics are linearized around the equilibrium points previously analyzed. A comparison between the centralized and decentralized formulations is provided, based on experimental results for both setups, and considering the time to solution and performance of each controller. Our findings provide new operational equilibrium points that can be paired with predictive model-based controllers for efficient operation.

This article investigates the online motion coordination problem for a group of mobile robots moving in a shared workspace, each of which is assigned a linear temporal logic specification. Based on the realistic assumptions that each robot is subject to both state and input constraints and can have only local view and local information, a fully distributed multirobot motion coordination strategy is proposed. For each robot, the motion coordination strategy consists of three layers. An offline layer precomputes the braking area for each region in the workspace, the controlled transition system, and a so-called potential function. An initialization layer outputs an initially safely satisfying trajectory. An online coordination layer resolves conflicts when one occurs. The online coordination layer is further decomposed into three steps. First, a conflict detection algorithm is implemented, which detects conflicts with neighboring robots. Whenever conflicts are detected, a rule is designed to assign dynamically a planning order to each pair of neighboring robots. Finally, a sampling-based algorithm is designed to generate local collision-free trajectories for the robot, which at the same time guarantees the feasibility of the specification. Safety is proven to be guaranteed for all robots at any time. The effectiveness and the computational tractability of the resulting solution is verified numerically by two case studies.

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.

A formulation of the area defense and surveillance problem for one intruder and one defense and surveillance robot and its corresponding solution using control barrier functions is presented. The defense robot must follow the intruder as it moves through a rectangular region in the plane, ensuring that the position of the intruder is also within a rectangular region attached to the surveillance robot. The proposed reactive and closed-form control laws depend on the positions of the robots, their maximum speeds, and the size of the rectangular regions. We show the application and effectiveness of our results in experiments with real robots.

This article addresses the tracking control problem of 3-D trajectories for underactuated underwater robotic vehicles operating in a constrained workspace including obstacles. More specifically, a robust nonlinear model predictive control (NMPC) scheme is presented for the case of underactuated autonomous underwater vehicles (AUVs) (i.e., unicycle-like vehicles actuated only in the surge, heave, and yaw). The purpose of the controller is to steer the unicycle-like AUV to the desired trajectory with guaranteed input and state constraints (e.g., obstacles, predefined vehicle velocity bounds, and thruster saturations) inside a partially known and dynamic environment where the knowledge of the operating workspace is constantly updated via the vehicle’s onboard sensors. In particular, considering the sensing range of the vehicle, obstacle avoidance with any of the detected obstacles is guaranteed by the online generation of a collision-free trajectory tracking path, despite the model dynamic uncertainties and the presence of external disturbances representing ocean currents and waves. Finally, realistic simulation studies verify the performance and efficiency of the proposed framework.Note to Practitioners—This article was motivated by the problem of robust trajectory tracking for an autonomous underwater vehicle (AUV) operating in an uncertain environment where the knowledge of the operating workspace (e.g., obstacle positions) is constantly updated online via the vehicle’s onboard sensors (e.g., multibeam imaging sonars and laser-based vision systems). In addition, there may be other system limitations (e.g., thruster saturation limits) and other operational constraints, induced by the need of various common underwater tasks (e.g., a predefined vehicle speed limit for inspecting the seabed, and mosaicking), where it should also be considered into the control strategy. However, based on the existing trajectory tracking control approaches for underwater robotics, there is a lack of an autonomous control scheme that provides a complete and credible control strategy that takes the aforementioned issues into consideration. Based on this, we present a reliable control strategy that takes into account the aforementioned issues, along with dynamic uncertainties of the model and the presence of ocean currents. In future research, we will extend the proposed methodology for multiple AUV performing collaborative inspection tasks in an uncertain environment.

In this article, we consider a scenario of cooperative task servicing, with a team of heterogeneous robots with different maximum speeds and communication radii, in charge of keeping the network intermittently connected. We abstract the task locations into a one-dimensional cycle graph that is traversed by the communicating robots, and we discuss intermittent communication strategies so that each task location is periodically visited, with a worst-case revisiting time. Robots move forward and backward along the cycle graph, exchanging data with their previous and next neighbors when they meet, and updating their region boundaries. Asymptotically, each robot is in charge of a region of the cycle graph, depending on its capabilities. The method is distributed, and robots only exchange data when they meet.

Recovering the 3D structure of the surrounding environment is an essential task in any vision-controlled Structure-from-Motion (SfM) scheme. This paper focuses on the theoretical properties of the SfM, known as the incremental active depth estimation. The term incremental stands for estimating the 3D structure of the scene over a chronological sequence of image frames. Active means that the camera actuation is such that it improves estimation performance. Starting from a known depth estimation filter, this paper presents the stability analysis of the filter in terms of the control inputs of the camera. By analyzing the convergence of the estimator using the Lyapunov theory, we relax the constraints on the projection of the 3D point in the image plane when compared to previous results. Nonetheless, our method is capable of dealing with the cameras' limited field-of-view constraints. The main results are validated through experiments with simulated data.

This paper considers the optimal cooperative robotic manipulation problem in terms of energy resources. In particular, we consider rigid cooperative manipulation systems, i.e., with rigid grasping contacts, and study energy-optimal conditions in the sense of minimization of the arising internal forces, which are inter-agent forces that do not contribute to object motion. Firstly, we use recent results to derive a closed form expression for the internal forces. Secondly, by using a standard inverse dynamics control protocol, we provide novel conditions on the force distribution to the robotic agents for provable internal force minimization. Moreover, we derive novel results on the provable achievement of a desired non-zero inter-agent internal force vector. Extensive simulation results in a realistic environment verify the theoretical analysis.

Cooperative robotics is a trending topic nowadays as it makes possible a number of tasks that cannot be performed by individual robots, such as heavy payload transportation and agile manipulation. In this work, we address the problem of cooperative transportation by heterogeneous, manipulator- endowed robots. Specifically, we consider a generic number of robotic agents simultaneously grasping an object, which is to be transported to a prescribed set point while avoiding obstacles. The procedure is based on a decentralized leader-follower Model Predictive Control scheme, where a designated leader agent is responsible for generating a trajectory compatible with its dynamics, and the followers must compute a trajectory for their own manipulators that aims at minimizing the internal forces and torques that might be applied to the object by the different grippers. The Model Predictive Control approach appears to be well suited to solve such a problem, because it provides both a control law and a technique to generate trajectories, which can be shared among the agents. The proposed algorithm is implemented using a system comprised of a ground and an aerial robot, both in the robotic Gazebo simulator as well as in experiments with real robots, where the methodological approach is assessed and the controller design is shown to be effective for the cooperative transportation task.

This work proposes a novel method of incorporating calls to a motion planner inside a potential field control policy for safe multi-robot navigation with uncertain dynamics. The proposed framework can handle more general scenes than the control policy and has low computational costs. Our work is robust to uncertain dynamics and quickly finds high-quality paths in scenarios generated from real-world floor plans. In the proposed approach, we attempt to follow the control policy as much as possible, and use calls to the motion planner to escape local minima. Trajectories returned from the motion planner are followed using a path-following controller guaranteeing robustness. We demonstrate the utility of our approach with experiments based on floor plans gathered from real buildings.

This paper studies the problem of Image-Based Visual Servo Control (IBVS) for quadrotors. Although the control of quadrotors has been extensively studied in the last decades, combining the IBVS module with the quadrotor's dynamics is still hard, mainly due to the under-actuation issues related to the quadrotor control as opposed to the 6 DoF control outputs generated by the IBVS modules. We propose an alternative formulation to solve this problem, by particularly using linear Model Predictive Control (MPC), that allows us to relax the UAVs under-actuation issues. Stability guarantees of the proposed scheme are presented. The proposed model is validated with synthetic data and tested in a real UAV's setup.

This article describes a system to facilitate dynamic en route formation of heavy-duty vehicle platoons with the goal of reducing fuel consumption. Safe vehicle platooning is a maturing technology that leverages modern sensor, control, and communication technology to automatically regulate the inter-vehicle distances. Truck platooning has been shown to reduce fuel consumption through slipstreaming by up to 10%; under realistic highway-driving conditions. To further benefit from this technology, a platoon coordinator is proposed, which interfaces with fleet management systems and suggests how platoons can be formed in a fuel-efficient manner over a large region. The coordinator frequently updates the plans to react to newly available information. This way, it requires a minimum of customization with respect to the logistic operations. We discuss the system architecture in detail and introduce important underlying methodological foundations. Plans are derived in computationally tractable stages optimizing fuel savings from platooning. The effectiveness of this approach is verified in a simulation study. It shows that the coordinated platooning system can improve over spontaneously occurring platooning even under the presence of disturbances. A real demonstrator has also been developed. We present data from an experiment in which three vehicles were coordinated to form a platoon on public highways under normal traffic conditions. It demonstrates the feasibility of coordinated en route platoon formation with current communication and on-board technology. Simulations and experiments support that the proposed system is technically feasible and a potential solution to the problem of using vehicle platooning in an operational context.

This work addresses the problem of robot navigation under timed temporal specifications in workspaces cluttered with obstacles. We propose a hybrid control strategy that guarantees the accomplishment of a high-level specification expressed as a timed temporal logic formula, while preserving safety (i.e., obstacle avoidance) of the system. In particular, we utilize a motion controller that achieves safe navigation inside the workspace in predetermined time, thus allowing us to abstract the motion of the agent as a finite timed transition system among certain regions of interest. Next, we employ standard formal verification and convex optimization techniques to derive high-level timed plans that satisfy the agent's specifications. A simulation study illustrates and clarifies the proposed scheme.

The 3D depth estimation and relative pose estimation problem within a decentralized architecture is a challenging problem that arises in missions that require coordination among multiple vision-controlled robots. The depth estimation problem aims at recovering the 3D information of the environment. The relative localization problem consists of estimating the relative pose between two robots, by sensing each other's pose or sharing information about the perceived environment. Most solutions for these problems use a set of discrete data without taking into account the chronological order of the events. This paper builds on recent results on continuous estimation to propose a framework that estimates the depth and relative pose between two non-holonomic vehicles. The basic idea consists in estimating the depth of the points by explicitly considering the dynamics of the camera mounted on a ground robot, and feeding the estimates of 3D points observed by both cameras in a filter that computes the relative pose between the robots. We evaluate the convergence for a set of simulated scenarios and show experimental results validating the proposed framework.

This paper considers the motion control and task planning problem of mobile robots under complex high-level tasks and human initiatives. The assigned task is specified as Linear Temporal Logic (LTL) formulas that consist of hard and soft constraints. The human initiative influences the robot autonomy in two explicit ways: with additive terms in the continuous controller and with contingent task assignments. We propose an online coordination scheme that encapsulates (i) a mixed-initiative continuous controller that ensures all-time safety despite of possible human errors, (ii) a plan adaptation scheme that accommodates new features discovered in the workspace and short-term tasks assigned by the operator during run time, and (iii) an iterative inverse reinforcement learning (IRL) algorithm that allows the robot to asymptotically learn the human preference on the parameters during the plan synthesis. The results are demonstrated by both realistic human-in-the-loop simulations and experiments.

We consider a system composed of a bar tethered to two unmanned aerial vehicles (UAVs), where the cables behave as rigid links under tensile forces, and with the control objective of stabilizing the bar's pose around a desired pose. Each UAV is equipped with a PID control law, and we verify that the bar's motion is decomposable into three decoupled motions, namely a longitudinal, a lateral and a vertical. We then provide relations between the UAV s' gains, which, if satisfied, allows us to decompose each of those motions into two cascaded motions; the latter relations between the UAV s' gains are found so as to counteract the system asymmetries, such as the different cable lengths and the different UAV s' weights. Finally, we provide conditions, based on the system's physical parameters, that describe good and bad types of asymmetries. We present experiments that demonstrate the stabilization of the bar's pose.

Coordinating a team of robots to fulfill a common task is still a demanding problem. This is even more the case when considering uncertainty in the environment, as well as temporal dependencies within the task specification. A multi-robot cooperation from a single goal specification requires mechanisms for decomposing the goal as well as an efficient planning for the team. However, planning action sequences offline is insufficient in real world applications. Rather, due to uncertainties, the robots also need to closely coordinate during execution and adjust their policies when additional observations are made. The framework presented in this paper enables the robot team to cooperatively fulfill tasks given as temporal logic specifications while explicitly considering uncertainty and incorporating observations during execution. We present the effectiveness of our ROS implementation of this approach in a case study scenario.

The problem of how to coordinate a large fleet of trucks with a given itinerary to enable fuel-efficient platooning is considered. Platooning is a promising technology that enables trucks to save significant amounts of fuel by driving close together and thus reducing air drag. A setting is considered in which each truck in a fleet is provided with a start location, a destination, a departure time, and an arrival deadline from a higher planning level. Fuel-efficient plans should be computed. The plans consist of routes and speed profiles that allow trucks to arrive by their arrival deadlines. Hereby, trucks can meet on common parts of their routes and form platoons, resulting in decreased fuel consumption. We formulate a combinatorial optimization problem that combines plans involving only two vehicles. We show that this problem is difficult to solve for large problem instances. Hence, a heuristic algorithm is proposed. The resulting plans are further optimized using convex optimization techniques. The method is evaluated with Monte Carlo simulations in a realistic setting. We demonstrate that the proposed algorithm can compute plans for thousands of trucks and that significant fuel savings can be achieved.

We propose a control law for stabilization of a quadrotor-load system, and provide conditions on the control law's gains that guarantee exponential stability of the equilibrium. The system is composed of a load and an unmanned aerial vehicle (UAV) attached to each other by a cable of fixed length, which behaves as a rigid link under tensile forces; and the control input is composed of a three dimensional force requested to the UAV, which the UAV provides with or without delay. Given the proposed control law, we analyze the stability of the equilibrium in two separate parts. In the first, the system is modeled assuming that the UAV provides the requested control input without delay, and we verify that the equilibrium is exponentially stable. In the second part, the UAV is modeled as possessing an attitude inner loop, and we provide a lower bound on the attitude gain for which exponential stability of the equilibrium is preserved. An integral action term is also included in the control law, which compensates for battery drainage or model mismatches, such as an unknown load mass. We present experiments for different scenarios that demonstrate and validate the robustness of the proposed control law.

We present an efficient approach to plan action sequences for a team of robots from a single finite LTL mission specification. The resulting execution strategy is proven to solve the given mission with minimal team costs, e.g., with shortest execution time. For planning, an established graph-based search method based on the multi-objective shortest path problem is adapted to multi-robot planning and extended to support resource constraints. We further improve planning efficiency significantly for missions which consist of independent parts by using previous results regarding LTL decomposition. The efficiency and practicality of the ROS implementation of our approach is demonstrated in example scenarios.

This paper addresses the motion planning problem for a team of aerial agents under high level goals. We propose a hybrid control strategy that guarantees the accomplishment of each agent's local goal specification, which is given as a temporal logic formula, while guaranteeing inter-agent collision avoidance. In particular, by defining 3-D spheres that bound the agents' volume, we extend previous work on decentralized navigation functions and propose control laws that navigate the agents among predefined regions of interest of the workspace while avoiding collision with each other. This allows us to abstract the motion of the agents as finite transition systems and, by employing standard formal verification techniques, to derive a high-level control algorithm that satisfies the agents' specifications. Simulation and experimental results with quadrotors verify the validity of the proposed method.

In this article, we propose a planning algorithm for coverage of complex structures with a network of robotic sensing agents, with multi-robot surveillance missions as our main motivating application. The sensors are deployed to monitor the external surface of a 3D structure. The algorithm controls the motion of each sensor so that a measure of the collective coverage attained by the network is nondecreasing, while the sensors converge to an equilibrium configuration. A modified version of the algorithm is also provided to introduce collision avoidance properties. The effectiveness of the algorithm is demonstrated in a simulation and validated experimentally by executing the planned paths on an aerial robot.

We consider a multiagent system that consists of heterogeneous groups of homogeneous agents. Instead of defining a global task for the whole team, each agent is assigned a local task as syntactically cosafe linear temporal logic formulas that specify both motion and action requirements. Interagent dependence is introduced by collaborative actions, of which the execution requires multiple agents' collaboration. To ensure the satisfaction of all local tasks without central coordination, we propose a bottom-up motion and task coordination strategy that contains an off-line initial plan synthesis and an online coordination scheme based on real-time exchange of request and reply messages. It facilitates not only the collaboration among heterogeneous agents but also the task swapping between homogeneous agents to reduce the total execution cost. It is distributed as any decision is made locally by each agent based on local computation and communication within neighboring agents. It is scalable and resilient to agent failures as the dependence is formed and removed dynamically based on agent capabilities and their plan execution status, instead of preassigned agent identities. The overall scheme is demonstrated by a simulated scenario of 20 agents with loosely coupled local tasks.

We propose a distributed and cooperative motion and task control scheme for a team of mobile robots that are subject to dynamic constraints including inter-robot collision avoidance and connectivity maintenance of the communication network. Moreover, each agent has a local high-level task given as a Linear Temporal Logic (LTL) formula of desired motion and actions. Embedded graph grammars (EGGs) are used as the main tool to specify local interaction rules and switching control modes among the robots, which is then combined with the model-checking-based task planning module. It is ensured that all local tasks are satisfied while the dynamic constraints are obeyed at all time. The overall approach is demonstrated by simulation and experimental results.

In this paper, we model an aerial vehicle, specifically a quadrotor, and a load attached to each other by a rigid link. We assume a torque input at the joint between the aerial vehicle and the rigid link is available. After modeling, we decouple the system dynamics in two separate subsystems, one concerning the position of the center of mass, which we control independently from the chosen torque input; and a second subsystem, concerning the attitude of the rigid link, which we control by appropriately designing a torque control law. Differential flatness is used to show that controlling these two separate systems is equivalent to controlling the complete system. We design control laws for the quadrotor thrust, the quadrotor angular velocity and the torque input, and provide convergence proofs that guarantee that the quadrotor follows asymptotically a desired position trajectory while the manipulator follows a desired orientation. Simulation and experimental works are presented which validate the proposed algorithms.

In this paper, we study the decentralized control problem of a two-agent system under local goal specifications given as temporal logic formulas. The agents collaboratively carry an object in a leader-follower scheme and lack means to exchange messages on-line, i.e., to communicate explicitly. Specifically, we propose a decentralized control protocol and a leader re-election strategy that secure the accomplishment of both agents' local goal specifications. The challenge herein lies in exploiting exclusively implicit inter-robot communication that is a natural outcome of the physical interaction of the robots with the object. An illustrative experiment is included clarifying and verifying the approach.

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 WEBOTSTM realistic simulator, clarifying the proposed control scheme and verifying its effectiveness.

In this paper consensus in second-order multi-agent systems with a non-periodic sampled-data exchange among agents is investigated. The sampling is random with bounded inter-sampling intervals. It is assumed that each agent has exact knowledge of its own state at any time instant. The considered local interaction rule is PD-type. Sufficient conditions for stability of the consensus protocol to a time-invariant value are derived based on LMIs. Such conditions only require the knowledge of the connectivity of the graph modeling the network topology. Numerical simulations are presented to corroborate the theoretical results.

In this paper consensus in second-order multi-agent systems with a non-periodic sampled-data exchange among agents is investigated. The sampling is random with bounded inter-sampling intervals. It is assumed that each agent has exact knowledge of its own state at all times. The considered local interaction rule is PD-type. The characterization of the convergence properties exploits a Lyapunov-Krasovskii functional method, sufficient conditions for stability of the consensus protocol to a time-invariant value are derived. Numerical simulations are presented to corroborate the theoretical results.

We propose a cooperative motion and task planning scheme for multi-agent systems where the agents have independently-assigned local tasks, specified as Linear Temporal Logic (LTL) formulas. These tasks contain hard and soft sub-specifications. A least-violating initial plan is synthesized first for the potentially infeasible task and the partially-known workspace. While the system runs, each agent updates its knowledge about the workspace via its sensing capability and shares this knowledge with its neighboring agents. Based on this update, each agent verifies and revises its plan in real time. It is ensured that the hard specification is always fulfilled and the satisfaction for the soft specification is improved gradually. The design is distributed as only local interactions are assumed. The overall framework is demonstrated by a case study.

This paper presents a novel Vision-based Nonlinear Model Predictive Control (NMPC) scheme for an under-actuated underwater robotic vehicle. In this scheme, the control loop does not close periodically, but instead a self-triggering framework decides when to provide the next control update. Between two consecutive triggering instants, the control sequence computed by the NMPC is applied to the system in an open-loop fashion, i.e, no state measurements are required during that period. This results to a significant smaller number of requested measurements from the vision system, as well as less frequent computations of the control law, reducing in that way the processing time and the energy consumption. The image constraints (i.e preserving the target inside the camera's field of view), the external disturbances induced by currents and waves, as well as the vehicle's kinematic constraints due to under-actuation, are being considered during the control design. The closed-loop system has analytically guaranteed stability and convergence properties, while the performance of the proposed control scheme is experimentally verified using a small under-actuated underwater vehicle in a test tank.

We focus on autonomous robot action planning problem from Linear Temporal Logic (LTL) specifications, where the action refers to a “simple” motion or manipulation task, such as “go from A to B” or “grasp a ball”. At the high-level planning layer, we propose an algorithm to synthesize a maximally satisfying discrete control strategy while taking into account that the robot's action executions may fail. Furthermore, we interface the high-level plan with the robot's low-level controller through a reactive middle-layer formalism called Behavior Trees (BTs). We demonstrate the proposed framework using a NAO robot capable of walking, ball grasping and ball dropping actions.

In this paper, we study the coordinated tracking problem of multiple heterogeneous Lagrange systems with a dynamic leader. Only nominal parameters of Lagrange dynamics are assumed to be available. Under the local interaction constraints, i.e., the followers only have access to their neighbors' information and the leader being a neighbor of only a subset of the followers, continuous coordinated tracking algorithms with adaptive coupling gains are proposed. Except for the benefit of the chattering-free control achieved, the proposed algorithm also has the attribute that it does not require the neighbors' generalized coordinate derivatives. Global asymptotic coordinated tracking is guaranteed, and the tracking errors between the followers and the leader are shown to converge to zero. Examples are given to validate the effectiveness of the proposed algorithms.

In this paper we propose a generic framework for real-time motion planning based on model-checking and revision. The task specification is given as a Linear Temporal Logic formula over a finite abstraction of the robot motion. A preliminary motion plan is first generated based on the initial knowledge of the system model. Then real-time information obtained during the runtime is used to update the system model, verify and further revise the motion plan. The implementation and revision of the motion plan are performed in real-time. This framework can be applied to partially-known workspaces and workspaces with large uncertainties. Computer simulations are presented to demonstrate the efficiency of the framework.

In this paper, we combine navigation functionlike potential fields and constraint based programming to achieve obstacle avoidance in formation. Constraint based programming was developed in robotic manipulation as a technique to take several constraints into account when controlling redundant manipulators. The approach has also been generalized, and applied to other control systems such as dual arm manipulators and unmanned aerial vehicles. Navigation functions are an elegant way to design controllers with provable properties for navigation problems. By combining these tools, we take advantage of the redundancy inherent in a multi-agent control problem and are able to concurrently address features such as formation maintenance and goal convergence, even in the presence of moving obstacles. We show how the user can decide a priority ordering of the objectives, as well as a clear way of seeing what objectives are currently addressed and what are postponed. We also analyze the theoretical properties of the proposed controller. Finally, we use a set of simulations to illustrate the approach.

We propose a novel framework to combine model-checking-based motion planning with action planning using action description languages, aiming to tackle task specifications given as Linear Temporal Logic (LTL) formulas. The specifications implicitly require both sequential regions to visit and the desired actions to perform at these regions. The robot's motion is abstracted based on sphere regions of interest in the workspace and the structure of navigation function(NF)-based controllers, while the robot's action map is constructed based on precondition and effect functions associated with the actions. An optimal planner is designed that generates the discrete motion-and-action plan fulfilling the specification, as well as the low-level hybrid controllers that implement this plan. The whole framework is demonstrated by a case study.

A distributed control law that guarantees connectivity maintenance in a network of multiple mobile agents is presented. The control law respects the limited sensing capabilities of the agents by allowing each agent to take into account only agents within its sensing radius in the controller implementation. In contrast to previous approaches to the problem, the proposed control law does not attain infinite values whenever an edge tends to be lost, and is therefore a bounded distributed control law. This is achieved via the use of decentralized navigation functions which are potential fields with guaranteed boundedness and are redefined in this paper in order to take into account the connectivity maintenance objective. We first treat the case of connectivity maintenance in a static initial position based communication graph and extend the results to the case of dynamic edge addition. The results are then applied to a formation control problem.

We propose an inverse agreement control strategy for multiple nonholonomic agents that forces the team members to disperse in the workspace in a distributed manner. Both the cases of an unbounded and a circular bounded workspace are considered. In the first case, we show that the closed loop system reaches a configuration in which the minimum distance between any pair of agents is larger than a specific lower bound. It is proved that this lower bound coincides with the agents' sensing radius. In the case of a bounded workspace, the control law is modified to force the agents to remain within the workspace boundary throughout the closed loop system evolution. Moreover the proposed control guarantees collision avoidance between the team members. The results are supported through relevant computer simulations.

A distributed swarm aggregation algorithm is developed for a team of multiple kinematic agents. Specifically, each agent is assigned a control law, which is the sum of two elements: a repulsive potential field, which is responsible for the collision avoidance objective, and an attractive potential field, which forces the agents to converge to a configuration where they are close to each other. Furthermore, the attractive potential field forces the agents that are initially located within the sensing radius of an agent to remain within this area for all time. In this way, the connectivity properties of the initially formed communication graph are rendered invariant for the trajectories of the closed-loop system. It is shown that under the proposed control law, agents converge to a configuration where each agent is located at a bounded distance from each of its neighbors. The results are also extended to the case of nonholonomic kinematic unicycle-type agents and to the case of dynamic edge addition. In the latter case, we derive a smaller bound in the swarm size than in the static case.

This paper contains two main features: a probably correct distributed control strategy for convergence of multiple nonholonomic agents to a desired feasible formation configuration and a connection between formation infeasibility and flocking behavior in nonholonomic kinematic multi-agent systems. In particular, it is shown that when inter-agent formation objectives cannot occur simultaneously in the state-space then, under certain assumptions, the agents velocity vectors and orientations converge to a common value at steady state, under the same control strategy that would lead to a feasible formation. Convergence guarantees are provided in both cases using tools form algebraic graph theory and Lyapunov analysis. The results are verified through computer simulations. This is an extension of a result established in our previous work for multiple holonomic kinematic agents

A distributed feedback control architecture that guarantees collision avoidance and destination convergence for multiple sphere world holonomic agents is presented. The well established tool of decentralized navigation functions is redefined to cope with the communication restrictions of the system. Each agent plans its actions without knowing the destinations of the others and the positions of those agents lying outside its sensing neighborhood. The stability properties of the closed loop system are checked via Lyapunov stability techniques for hybrid systems. The collision avoidance and goal convergence properties are verified through simulations. The key advantage of the proposed algorithm with respect to the previous ones is the significant decrease of computational load and its applicability to large scale groups

This paper represents an extension of our previous work [D. Dimarogonas, et al. (2003), S. Loizou, et al. (2003)] on multiagent navigation to the case of decentralized control of multiple nonholonomic vehicles. Our main motivation comes from the field of air traffic management systems and from the field of micro robotic multiagent systems. A discontinuous feedback control scheme, based on dipolar navigation fields, is implemented and integrator backstepping is applied to suppress chattering behavior. The methodology has guaranteed global convergence and collision avoidance properties, which are verified by nontrivial computer simulations.