A Data-Driven Model for Predicting Fault-Tolerant Safe Navigation in Multi-Robot Systems

A Data-Driven Model for Predicting Fault-Tolerant Safe Navigation in Multi-Robot Systems

A. Madhesh, Clara Barathi Priyadharshini
DOI: 10.4018/979-8-3693-5767-5.ch003
OnDemand:
(Individual Chapters)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Earlier methods focused on reducing the forecast uncertainty for individual agents and avoiding this unduly cautious behavior by either employing more experienced models or heuristically restricting the predictive covariance. Findings indicate neither the individual prediction nor the forecast uncertainty have a major impact on the frozen robot problem. The result is that dynamic agents can solve the frozen robot problem by employing joint collision avoidance and clear the way for each other to build feasible pathways. Potential paths for safety evaluation are ranked according to the likelihood of collisions with known objects and those that happen outside the planning horizon. The whole collision probability is examined. Monte Carlo sampling is utilized to approximate the collision probabilities. Designing and selecting routes to reach the intended location, this approach aims to provide a navigation framework that reduces the likelihood of collisions.
Chapter Preview
Top

I. Introduction

Drones, ground robots, and autonomous cars are examples of the multi-robot systems that have grown significantly due to applications such as military search and rescue missions, enhanced mobility, subterranean exploration, interior movements, warehouses, and entertainment purposes. In these situations, each individual robot must navigate safely through highly variable terrain, dodging obstacles and other group members. Therefore, motion planning in uncertain environments, collision avoidance safety, and distributed computation are some of the main challenges in autonomous multi-robot systems; see a recent review for further details. To ensure safe navigation of robotic systems, optimization-based motion planning approaches like Model Predictive Control, or MPC, are being considered more and more said by Bajcsy, Andrea, et al. (2019).

MPC is an especially powerful framework that may be applied to iteratively solve a finite-horizon numerical optimization problem to compute control instructions that maximize relevant performance measures while respecting constraints (e.g., collision avoidance). The controlled object's distance from an impediment larger than a safe threshold is commonly used to model constraints on collision avoidance.

The model predictive control (MPC) framework encapsulates the suggested approach, which permits decentralized multi-robot motion planning in dynamic scenarios. Specifically, we first generate a demonstration dataset of robot trajectories using a multi-robot collision avoidance simulator. It uses a centralized sequential MPC for local motion planning based on inter robot communication used by Navsalkar, Atharva, and Ashish R. Hota (2023). The robot trajectory prediction problem is then framed in terms of sequence modeling, enabling us to develop a model that makes use of recurrent neural networks (RNNs). Using the obtained dataset, the model may be trained to predict the planning behaviors of the robots and to resemble the centralized sequential MPC. Finally, multi-robot local motion planning is completed in a. main contributions of this work are:

• For a large number of robots, an RNN-based robot trajectory prediction model that is aware of obstacles and interactions.

• Combining MPC with the trajectory prediction model allows for decentralized multi-robot local motion planning in dynamic environments.

We showcase the benefits of our data-driven metric for the joint use of multiple robots for active interference and crowd observation. Our aim is to provide maximum social invisibility while providing the fastest feasible navigation. In order to investigate a variety of scenarios and applications, we show the efficacy of our work in multiple surveillance scenarios based on the degree of increasing social interaction between the humans and robots explained by Firoozi, Roya, et al (2020).

1.1 Our Approach Has the Following Benefits

1. The attitude of entitlement Computation: Our algorithm predicts pedestrians' emotional responses to robots in groups with high accuracy.

2. Robust computation: Our method is robust and capable of accounting for noise in pedestrian routes extracted from motion pictures.

3. Our method evaluates the entitativity behaviors at interactive rates with speed and accuracy, avoiding the need for any previous computation.

1.2 Active Surveillance

This kind of patrolling or monitoring involves autonomous robots that live side by side with pedestrians. These robots will need to be able to navigate through crowds and plan ahead in real time in order to perform surveillance and analysis without colliding. In this case, the robots have to predict each pedestrian's movements and path. For example, spectators at marathon races are sometimes quite huge and highly mobile. In these kinds of scenarios, a monitoring system that can identify and adjust to shifting focal points is crucial said by Olcay, Ertug (2020).

In these kinds of scenarios, robots have to be very socially invisible (s = 0). To do this, the entitativity features are set to the minimum, E = Emin.

Complete Chapter List

Search this Book:
Reset