Decentralized MPC based Obstacle Avoidance for Multi-Robot Target Tracking Scenarios

In this work, we consider the problem of decentralized multi-robot target tracking and obstacle avoidance in dynamic environments. Each robot executes a local motion planning algorithm which is based on model predictive control (MPC). The planner is designed as a quadratic program, subject to constraints on robot dynamics and obstacle avoidance. Repulsive potential field functions are employed to avoid obstacles. The novelty of our approach lies in embedding these non-linear potential field functions as constraints within a convex optimization framework. Our method convexifies non-convex constraints and dependencies, by replacing them as pre-computed external input forces in robot dynamics. The proposed algorithm additionally incorporates different methods to avoid field local minima problems associated with using potential field functions in planning. The motion planner does not enforce predefined trajectories or any formation geometry on the robots and is a comprehensive solution for cooperative obstacle avoidance in the context of multi-robot target tracking. We perform simulation studies in different environmental scenarios to showcase the convergence and efficacy of the proposed algorithm. Video of simulation studies: \url{https://youtu.be/umkdm82Tt0M

Adaptive Robot Navigation with Collision Avoidance subject to 2nd-order Uncertain Dynamics

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

Conflict-Based Model Predictive Control for Scalable Multi-Robot Motion Planning

This paper presents a scalable multi-robot motion planning algorithm called Conflict-Based Model Predictive Control (CB-MPC). Inspired by Conflict-Based Search (CBS), the planner leverages a similar high-level conflict tree to efficiently resolve robot-robot conflicts in the continuous space, while reasoning about each agent's kinematic and dynamic constraints and actuation limits using MPC as the low-level planner. We show that tracking high-level multi-robot plans with a vanilla MPC controller is insufficient, and results in unexpected collisions in tight navigation scenarios. Compared to other variations of multi-robot MPC like joint, prioritized, and distributed, we demonstrate that CB-MPC improves the executability and success rate, allows for closer robot-robot interactions, and reduces the computational cost significantly without compromising the solution quality across a variety of environments. Furthermore, we show that CB-MPC combined with a high-level path planner can effectively substitute computationally expensive full-horizon multi-robot kinodynamic planners

Reactive Base Control for On-The-Move Mobile Manipulation in Dynamic Environments

We present a reactive base control method that enables high performance mobile manipulation on-the-move in environments with static and dynamic obstacles. Performing manipulation tasks while the mobile base remains in motion can significantly decrease the time required to perform multi-step tasks, as well as improve the gracefulness of the robot's motion. Existing approaches to manipulation on-the-move either ignore the obstacle avoidance problem or rely on the execution of planned trajectories, which is not suitable in environments with dynamic objects and obstacles. The presented controller addresses both of these deficiencies and demonstrates robust performance of pick-and-place tasks in dynamic environments. The performance is evaluated on several simulated and real-world tasks. On a real-world task with static obstacles, we outperform an existing method by 48\% in terms of total task time. Further, we present real-world examples of our robot performing manipulation tasks on-the-move while avoiding a second autonomous robot in the workspace. See https://benburgesslimerick.github.io/MotM-BaseControl for supplementary materials

Developing Design and Analysis Framework for Hybrid Mechanical-Digital Control of Soft Robots: from Mechanics-Based Motion Sequencing to Physical Reservoir Computing

The recent advances in the field of soft robotics have made autonomous soft robots working in unstructured dynamic environments a close reality. These soft robots can potentially collaborate with humans without causing any harm, they can handle fragile objects safely, perform delicate surgeries inside body, etc. In our research we focus on origami based compliant mechanisms, that can be used as soft robotic skeleton. Origami mechanisms are inherently compliant, lightweight, compact, and possess unique mechanical properties such as– multi-stability, nonlinear dynamics, etc. Researchers have shown that multi-stable mechanisms have applications in motion-sequencing applications. Additionally, the nonlinear dynamic properties of origami and other soft, compliant mechanisms are shown to be useful for ‘morphological computation’ in which the body of the robot itself takes part in performing complex computations required for its control. In our research we demonstrate the motion-sequencing capability of multi-stable mechanisms through the example of bistable Kresling origami robot that is capable of peristaltic locomotion. Through careful theoretical analysis and thorough experiments, we show that we can harness multistability embedded in the origami robotic skeleton for generating actuation cycle of a peristaltic-like locomotion gait. The salient feature of this compliant robot is that we need only a single linear actuator to control the total length of the robot, and the snap-through actions generated during this motion autonomously change the individual segment lengths that lead to earthworm-like peristaltic locomotion gait. In effect, the motion-sequencing is hard-coded or embedded in the origami robot skeleton. This approach is expected to reduce the control requirement drastically as the robotic skeleton itself takes part in performing low-level control tasks. The soft robots that work in dynamic environments should be able to sense their surrounding and adapt their behavior autonomously to perform given tasks successfully. Thus, hard-coding a certain behavior as in motion-sequencing is not a viable option anymore. This led us to explore Physical Reservoir Computing (PRC), a computational framework that uses a physical body with nonlinear properties as a ‘dynamic reservoir’ for performing complex computations. The compliant robot ‘trained’ using this framework should be able to sense its surroundings and respond to them autonomously via an extensive network of sensor-actuator network embedded in robotic skeleton. We show for the first time through extensive numerical analysis that origami mechanisms can work as physical reservoirs. We also successfully demonstrate the emulation task using a Miura-ori based reservoir. The results of this work will pave the way for intelligently designed origami-based robots with embodied intelligence. These next generation of soft robots will be able to coordinate and modulate their activities autonomously such as switching locomotion gait and resisting external disturbances while navigating through unstructured environments

Intelligent Hybrid Approach for Multi Robots- Multi Objectives Motion Planning Optimization

Abstract: This paper proposes enhanced approach to find multi objective optimization and obstacle avoidance of motion planning problem for multi mobile robots that have to move smoothly, safely with a shorter time and minimum distance along curvature-constrained motion planning in completely known dynamic environments. The research includes two stages: the first stage is to find an multi objective optimal path and trajectory planning for each robot individually using the Enhanced GA with modified A*. The second stage consists of designing a fuzzy logic to control the movement of the robots with collision free. The global optimal trajectory is fed to fuzzy motion controller which has ability to regenerate the local trajectory of the robot based on the probability of having another dynamic robot in the area. A simulation of the strategy has been presented and the results show that the proposed approach is able to achieve multi objective optimization of motion planning for multi mobile robot in dynamic environment efficiently. Also, it has the ability to find a solution when the environment is complex and the number of obstacles is increasing. The performance of the above mentioned approach has been found to be satisfactory of dynamic obstacle avoidance

Collaborative Trolley Transportation System with Autonomous Nonholonomic Robots

Cooperative object transportation using multiple robots has been intensively studied in the control and robotics literature, but most approaches are either only applicable to omnidirectional robots or lack a complete navigation and decision-making framework that operates in real time. This paper presents an autonomous nonholonomic multi-robot system and an end-to-end hierarchical autonomy framework for collaborative luggage trolley transportation. This framework finds kinematic-feasible paths, computes online motion plans, and provides feedback that enables the multi-robot system to handle long lines of luggage trolleys and navigate obstacles and pedestrians while dealing with multiple inherently complex and coupled constraints. We demonstrate the designed collaborative trolley transportation system through practical transportation tasks, and the experiment results reveal their effectiveness and reliability in complex and dynamic environments

Steering herds away from dangers in dynamic environments

Shepherding, the task of guiding a herd of autonomous individuals in a desired direction, is an essential skill to herd animals, enable crowd control and rescue from danger. Equipping robots with the capability of shepherding would allow performing such tasks with increased efficiency and reduced labour costs. So far, only single-robot or centralized multi-robot solutions have been proposed. The former is unable to observe dangers at any place surrounding the herd, and the latter does not generalize to unconstrained environments. Therefore, we propose a decentralized control algorithm for multi-robot shepherding, where the robots maintain a caging pattern around the herd to detect potential nearby dangers. When danger is detected, part of the robot swarm positions itself in order to repel the herd towards a safer region. We study the performance of our algorithm for different collective motion models of the herd. We task the robots to shepherd a herd to safety in two dynamic scenarios: (i) to avoid dangerous patches appearing over time and (ii) to remain inside a safe circular enclosure. Simulations show that the robots are always successful in shepherding when the herd remains cohesive, and enough robots are deployed