Coordination control of robot manipulators using flat outputs

Published ArticleThis paper focuses on the synchronizing control of multiple interconnected flexible robotic manipulators using differential flatness theory. The flatness theory has the advantage of simplifying trajectory tracking tasks of complex mechanical systems. Using this theory, we propose a new synchronization scheme whereby a formation of flatness based systems can be stabilized using their respective flat outputs. Using the flat outputs, we eliminate the need for cross coupling laws and communication protocols associated with such formations. The problem of robot coordination is reduced to synchronizing the flat outputs between the respective robot manipulators. Furthermore, the selection of the flat output used for the synchronizing control is not restricted as any system variable can be used. The problem of unmeasured states used in the control is also solved by reconstructing the missing states using flatness based interpolation. The proposed control law is less computationally intensive when compared to earlier reported work as integration of the differential equations is not required. Simulations using a formation of single link flexible joint robots are used to validate the proposed synchronizing control

Decentralized, Noncooperative Multirobot Path Planning with Sample-BasedPlanners

In this thesis, the viability of decentralized, noncooperative multi-robot path planning algorithms is tested. Three algorithms based on the Batch Informed Trees (BIT*) algorithm are presented. The first of these algorithms combines Optimal Reciprocal Collision Avoidance (ORCA) with BIT*. The second of these algorithms uses BIT* to create a path which the robots then follow using an artificial potential field (APF) method. The final algorithm is a version of BIT* that supports replanning. While none of these algorithms take advantage of sharing information between the robots, the algorithms are able to guide the robots to their desired goals, with the algorithm that combines ORCA and BIT* having the robots successfully navigate to their goals over 93% for multiple environments with teams of two to eight robots

A robot swarm assisting a human fire-fighter

Emergencies in industrial warehouses are a major concern for fire-fighters. The large dimensions, together with the development of dense smoke that drastically reduces visibility, represent major challenges. The GUARDIANS robot swarm is designed to assist fire-fighters in searching a large warehouse. In this paper we discuss the technology developed for a swarm of robots assisting fire-fighters. We explain the swarming algorithms that provide the functionality by which the robots react to and follow humans while no communication is required. Next we discuss the wireless communication system, which is a so-called mobile ad-hoc network. The communication network provides also the means to locate the robots and humans. Thus, the robot swarm is able to provide guidance information to the humans. Together with the fire-fighters we explored how the robot swarm should feed information back to the human fire-fighter. We have designed and experimented with interfaces for presenting swarm-based information to human beings

Motion Planning For Micro Aerial Vehicles

A Micro Aerial Vehicle (MAV) is capable of agile motion in 3D making it an ideal platform for developments of planning and control algorithms. For fully autonomous MAV systems, it is essential to plan motions that are both dynamically feasible and collision-free in cluttered environments. Recent work demonstrates precise control of MAVs using time-parameterized trajectories that satisfy feasibility and safety requirements. However, planning such trajectories is non-trivial, especially when considering constraints, such as optimality and completeness. For navigating in unknown environments, the capability for fast re-planning is also critical. Considering all of these requirements, motion planning for MAVs is a challenging problem. In this thesis, we examine trajectory planning algorithms for MAVs and present methodologies that solve a wide range of planning problems. We first introduce path planning and geometric control methods, which produce spatial paths that are inadequate for high speed flight, but can be used to guide trajectory optimization. We then describe optimization-based trajectory planning and demonstrate this method for solving navigation problems in complex 3D environments. When the initial state is not fixed, an optimization-based method is prone to generate sub-optimal trajectories. To address this challenge, we propose a search-based approach using motion primitives to plan resolution complete and sub-optimal trajectories. This algorithm can also be used to solve planning problems with constraints such as motion uncertainty, limited field-of-view and moving obstacles. The proposed methods can run in real time and are applicable for real-world autonomous navigation, even with limited on-board computational resources. This thesis includes a carefully analysis of the strengths and weaknesses of our planning paradigm and algorithms, and demonstration of their performance through simulation and experiments

A survey on active simultaneous localization and mapping: state of the art and new frontiers

Active simultaneous localization and mapping (SLAM) is the problem of planning and controlling the motion of a robot to build the most accurate and complete model of the surrounding environment. Since the first foundational work in active perception appeared, more than three decades ago, this field has received increasing attention across different scientific communities. This has brought about many different approaches and formulations, and makes a review of the current trends necessary and extremely valuable for both new and experienced researchers. In this article, we survey the state of the art in active SLAM and take an in-depth look at the open challenges that still require attention to meet the needs of modern applications. After providing a historical perspective, we present a unified problem formulation and review the well-established modular solution scheme, which decouples the problem into three stages that identify, select, and execute potential navigation actions. We then analyze alternative approaches, including belief-space planning and deep reinforcement learning techniques, and review related work on multirobot coordination. This article concludes with a discussion of new research directions, addressing reproducible research, active spatial perception, and practical applications, among other topics