In this article, we present and experimentally validate a safe docking control strategy designed for an experimental planar floating platform, called the Slider. Three degrees-of-freedom (DOF) platforms like the Slider are used extensively in space industry and academia to emulate micro-gravity conditions on Earth, for validating in-plane Guidance, Navigation and Control (GNC) algorithms. The Slider uses an air cushion (induced by air bearings) to levitate on a smooth flat table, thus emulating the in-plane zero-gravity motion of a spacecraft in orbit. The proposed docking control strategy is applicable in the in-plane approach and docking phases of space docking missions, and is based on the Control Barrier Functions (CBF) approach, where a safe set (a Cardioid), capturing the clearance and direction-of-approach constraints, is rendered positively forward invariant. To enable precise and safe docking in the presence of unmodeled dynamics, disturbances induced by the tether and drifts induced by the non-flat floating surface, we present a switching strategy among the zero and positive level sets of a Cardioid function. In the approach phase, the positive contour of the Cardioid function smoothly steers the Slider platform into the neighborhood of a deadlock point, which is designed to be at a safe distance from the docking port. In the neighborhood of the deadlock point, Slider corrects its proximity and heading until its configuration is well-suited to enter the docking phase. The docking maneuver is initiated by the CBF switching mechanism (positive to zero contour), which expands the safe zone to include the final docking configuration. We present an analysis of the Quadratic program defining the CBF filter, and identify two deadlock points (an asymptotically stable point in the vicinity of the docking port and an unstable point diametrically opposite on the CBF boundary). Both the approach and docking phases are validated through experimentation on the Slider platform, in the presence of tether-induced disturbances and drifts induced by the non-ideal floating surface. In the docking phase, the CBF switching condition effectively handles experimental non-idealities and recovers the slider platform from unsafe configurations. The proposed docking strategy caters to the in-plane (3DOF) approach and docking phases of real space docking missions and is scalable to three-dimensional 6DOF operations, in conjunction with controllers that stabilize the attitude and the out-of-plane degree-of-freedom. Link to the video of experimental demonstration: https://youtu.be/eBiWvnKtG7U?si=QFPD-vm11wydyZSd.

In this article, we propose a control solution for the safe transfer of a quadrotor UAV between two surface robots positioning itself only using the visual features on the surface robots, which enforces safety constraints for precise landing and visual locking, in the presence of modeling uncertainties and external disturbances. The controller handles the ascending and descending phases of the navigation using a visual locking control barrier function (VCBF) and a parametrizable switching descending CBF (DCBF) respectively, eliminating the need for an external planner. The control scheme has a backstepping approach for the position controller with the CBF filter acting on the position kinematics to produce a filtered virtual velocity control input, which an adaptive controller tracks to overcome modeling uncertainties and external disturbances. The experimental validation is carried out with a UAV that navigates from the base to the target using an RGB camera.

In this article, we present a reactive multi-agent coordination architecture for the management of material flows between production/pickup stages and delivery/drop-off stages, in scenarios such as underground mines and automated factory floors. The pickup and delivery stages are modelled as variable task queues, with no a priori information about the inflow into the production queues. The proposed solution coordinates the movement of a group of mobile agents operating between the two stages in a reactive and scalable manner, so that the material is transported from multiple production queues to multiple delivery queues in a balanced/equalized manner. In such a scenario, centralized planners suffer from low reactivity and poor scaling, as the number of agents and number of queues increases. To overcome this problem, we propose a decentralized approach comprising of two separate auction-based task distribution systems for the production and delivery stages, along with behavior-tree based management of agent autonomy and task bidding. Each auction system tracks the length of production/delivery queues and solves the optimal task assignment, based on the bids submitted by the agents. The agents participate in one of the two auction systems at any given time, based on the status of the behavior tree executing the two-stage tasks. We analytically show that the proposed decentralized auctioning approach along with agent autonomy and bidding managed by behavior trees, offers better scalability and reactiveness compared to the centralized approach. The proposed methodology is experimentally validated in a lab environment, in three illustrative material flow management scenarios, using TurtleBot3 robots as agents.

In this article, we propose the novel concept of Belief Scene Graphs, which are utility-driven extensions of partial 3D scene graphs, that enable efficient high-level task planning with partial information. We propose a graph-based learning methodology for the computation of belief (also referred to as expectation) on any given 3D scene graph, which is then used to strategically add new nodes (referred to as blind nodes) that are relevant to a robotic mission. We propose the method of Computation of Expectation based on Correlation Information (CECI), to reasonably approximate real Belief/Expectation, by learning histograms from available training data. A novel Graph Convolutional Neural Network (GCN) model is developed, to learn CECI from a repository of 3D scene graphs. As no database of 3D scene graphs exists for the training of the novel CECI model, we present a novel methodology for generating a 3D scene graph dataset based on semantically annotated real-life 3D spaces. The generated dataset is then utilized to train the proposed CECI model and for extensive validation of the proposed method. We establish the novel concept of \textit{Belief Scene Graphs} (BSG), as a core component to integrate expectations into abstract representations. This new concept is an evolution of the classical 3D scene graph concept and aims to enable high-level reasoning for task planning and optimization of a variety of robotics missions. The efficacy of the overall framework has been evaluated in an object search scenario, and has also been tested in a real-life experiment to emulate human common sense of unseen-objects. 

For a video of the article, showcasing the experimental demonstration, please refer to the following link: \url{https://youtu.be/hsGlSCa12iY}

In this article, we propose a body-aware local navigation strategy for asymmetric holonomic robots for collision-free navigation in narrow pathways with sharp turns. In such scenarios, a robot with non-circular or asymmetric footprint that is comparable to the dimension of the pathways collides with walls when tracking Voronoi paths or risk-aware paths. This problem is addressed in this article through a novel multi-control barrier functions (CBF) based control strategy that achieves the objective of safe collision-free maneuvering at sharp turns. The proposed method is significantly computationally light in comparison to approaches based on model predictive control and online occupancy-grid based free-space and collision detection. In the proposed approach, a minimal set of parameters that characterize a sharp turn and the robot footprint are used to define six control barrier functions that define safe and unsafe regions of operation for a robot. A quadratic programming based CBF safety filter is designed that takes a nominal goal-reaching control as input and returns a minimally-deviating output that enforces the control barrier constraints and renders the safe set forward invariant throughout the turning maneuver. The three kinematic control inputs of the holonomic robot are shared in a conflict-free manner among the six control barrier constraints. The proposed local navigation approach was thoroughly validated in multiple scenarios in a simulated environment, where a robot with asymmetric footprint achieves collision-free maneuvering along multiple sharp turns, while respecting the safety and actuation constraints.

In this article, we present a centralized approach for the control of multiple unmanned aerial vehicles (UAVs) for landing on moving unmanned ground vehicles (UGVs) using control barrier functions (CBFs). The proposed control framework employs two kinds of CBFs to impose safety constraints on the UAVs' motion. The first class of CBFs (LCBF) is a three-dimensional exponentially decaying function centered above the landing platform, designed to safely and precisely land UAVs on the UGVs. The second set is a spherical CBF (SCBF), defined between every pair of UAVs, which avoids collisions between them. The LCBF is time-varying and adapts to the motions of the UGVs. In the proposed CBF approach, the control input from the UAV's nominal tracking controller designed to reach the landing platform is filtered to choose a minimally-deviating control input that ensures safety (as defined by the CBFs). As the control inputs of every UAV are shared in establishing multiple CBF constraints, we prove that the control inputs are shared without conflict in rendering the safe sets forward invariant. The performance of the control framework is validated through a simulated scenario involving three UAVs landing on three moving targets.

The fifth generation (5G) cellular network technology is mature and increasingly utilized in many industrial and robotics applications, while an important functionality is the advanced Quality of Service (QoS) features. Despite the prevalence of 5G QoS discussions in the related literature, there is a notable absence of real-life implementations and studies concerning their application in time-critical robotics scenarios. This article considers the operation of time-critical applications for 5G-enabled unmanned aerial vehicles (UAVs) and how their operation can be improved by the possibility to dynamically switch between QoS data flows with different priorities. As such, we introduce a robotics oriented analysis on the impact of the 5G QoS functionality on the performance of 5G-enabled UAVs. Furthermore, we introduce a novel framework for the dynamic selection of distinct 5G QoS data flows that is autonomously managed by the 5G-enabled UAV. This problem is addressed in a novel feedback loop fashion utilizing a probabilistic finite state machine (PFSM). Finally, the efficacy of the proposed scheme is experimentally validated with a 5G-enabled UAV in a real-world 5G stand-alone (SA) network. https://www.youtube.com/watch?v=lWtMOlVMEFI&t=1s

This article introduces a novel approach to constructing a topometric map that allows for efficient navigation and decision-making in mobile robotics applications. The method generates the topometric map from a 2D grid-based map. The topometric map segments areas of the input map into different structural-semantic classes: intersections, pathways, dead ends, and pathways leading to unexplored areas. This method is grounded in a new technique for intersection detection that identifies the area and the openings of intersections in a semantically meaningful way. The framework introduces two levels of pre-filtering with minimal computational cost to eliminate small openings and objects from the map which are unimportant in the context of high-level map segmentation and decision making. The topological map generated by GRID-FAST enables fast navigation in large-scale environments, and the structural semantics can aid in mission planning, autonomous exploration, and human-to-robot cooperation. The efficacy of the proposed method is demonstrated through validation on real maps gathered from robotic experiments: 1) a structured indoor environment, 2) an unstructured cave-like subterranean environment, and 3) a large-scale outdoor environment, which comprises pathways, buildings, and scattered objects. Additionally, the proposed framework has been compared with state-of-the-art topological mapping solutions and is able to produce a topometric and topological map with up to 92% fewer nodes than the next best solution. The method proposed in this article has been implemented in the robotics framework ROS and is open-sourced. The code is available at: https://github.com/LTU-RAI/GRID-FAST.

This article proposes local bidding strategies for autonomous agents participating in an auction-based multi-agent coordination system, in order to improve the scalability and reactivity of the architecture in large-scale coordination scenarios. Based on a careful analysis of the reactivity requirements and the computational costs of the central auctioneer (costs for solving Linear Integer Programs) and the local agents (costs for path-planning and task execution), this article explores the idea of each agent bidding for a subset of available tasks that are locally relevant to the agent. Each agent first employs a computationally light euclidean distance-based and percentile-based screening method to choose a subset of available tasks, followed by a more computationally complex, but realistic path-planning based cost-estimation and bidding for the chosen subset. The proposed strategy not only reduces the overall computational cost at the agents, but also at the central auctioneer, by reducing the size of the combinatorial optimization problems and the overall communication requirements of the architecture, thereby improving the scalability and reactivity of the overall system. It is shown that, through a one-time simulation-guided design of the bidding parameters, the improved reactivity and scaling is achieved while retaining the optimality or near-optimality of the resulting task-allocation. The performance of the proposed bidding strategies is evaluated in two large-scale simulation scenarios and the reduction in computational costs and the near-optimality of the task allocation is demonstrated.