skip to main content

Explore Research Products in the NSF-PAR

Title: Search and Rescue Operations with Mesh Networked Robots
Efficient path planning and communication of multi-robot systems in the case of a search and rescue operation is a critical issue facing robotics disaster relief efforts. Ensuring all the nodes of a specialized robotic search team are within range, while also covering as much area as possible to guarantee efficient response time, is the goal of this paper. We propose a specialized search-and-rescue model based on a mesh network topology of aerial and ground robots. The proposed model is based on several methods. First, each robot determines its position relative to other robots within the system, using RSSI. Packets are then communicated to other robots in the system detailing important information regarding robot system status, status of the mission, and identification number. The results demonstrate the ability to determine multi-robot navigation with RSSI, allowing low computation costs and increased search-and-rescue time efficiency.  more » « less
Award ID(s):
1757929
NSF-PAR ID:
10084781
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
Proceedings - International Conference on Computer Communications and Networks
ISSN:
1095-2055
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ( , Computing and Communication Workshop and Conference (CCWC))
    null (Ed.)
    Intelligent robot swarms are increasingly being explored as tools for search and rescue missions. Efficient path planning and robust communication networks are critical elements of completing missions. The focus of this research is to give unmanned aerial vehicles (UAVs) the ability to self-organize a mesh network that is optimized for area coverage. The UAVs will be able to read the communication strength between themselves and all the UAVs it is connected to using RSSI. The UAVs should be able to adjust their positioning closer to other UAVs if RSSI is below a threshold, and they should also maintain communication as a group if they move together along a search path. Our approach was to use Genetic Algorithms in a simulated environment to achieve multi-node exploration with emphasis on connectivity and swarm spread. 
    more » « less
  2. ; ; ; ; ( , Applied Sciences)
    null (Ed.)
    Complex service robotics scenarios entail unpredictable task appearance both in space and time. This requires robots to continuously relocate and imposes a trade-off between motion costs and efficiency in task execution. In such scenarios, multi-robot systems and even swarms of robots can be exploited to service different areas in parallel. An efficient deployment needs to continuously determine the best allocation according to the actual service needs, while also taking relocation costs into account when such allocation must be modified. For large scale problems, centrally predicting optimal allocations and movement paths for each robot quickly becomes infeasible. Instead, decentralized solutions are needed that allow the robotic system to self-organize and adaptively respond to the task demands. In this paper, we propose a distributed and asynchronous approach to simultaneous task assignment and path planning for robot swarms, which combines a bio-inspired collective decision-making process for the allocation of robots to areas to be serviced, and a search-based path planning approach for the actual routing of robots towards tasks to be executed. Task allocation exploits a hierarchical representation of the workspace, supporting the robot deployment to the areas that mostly require service. We investigate four realistic environments of increasing complexity, where each task requires a robot to reach a location and work for a specific amount of time. The proposed approach improves over two different baseline algorithms in specific settings with statistical significance, while showing consistently good results overall. Moreover, the proposed solution is robust to limited communication and robot failures. 
    more » « less
  3. ; ; ( , IEEE International Conference on Blockchain (Blockchain))
    The use of blockchain in cyber-physical systems, such as robotics, is an area with immense potential to address many shortcomings in robotic coordination and control. In traditional swarm robotic applications, where homogeneous robots are utilized, it is possible to replace a robot if it malfunctions, and it can be assumed that all robots are interchangeable. However, in many real-world applications spanning from search and rescue missions to future household robotic appliances, heterogeneous robots will need to work together with the other robots and human agents to achieve specific tasks. Nevertheless, no such system exists. Therefore, we propose a system that utilizes a token economy for robotic agents that makes agents responsive to token acquisition as an incentive for collaboration in achieving a given task. The economy enables the system to self-govern, even under Byzantine and adversarial settings. We further incorporate a novel subcontracting framework within a blockchain environment to allow the robotic agents to efficiently and cost-effectively perform complex jobs requiring multiple agents with various capabilities. We conducted a thorough evaluation of the system in a prototype warehouse application scenario, and the results are promising. 
    more » « less
  4. ; ; ; ( , Journal of NeuroEngineering and Rehabilitation)
    Abstract Background

    A robotic rehabilitation gym can be defined as multiple patients training with multiple robots or passive sensorized devices in a group setting. Recent work with such gyms has shown positive rehabilitation outcomes; furthermore, such gyms allow a single therapist to supervise more than one patient, increasing cost-effectiveness. To allow more effective multipatient supervision in future robotic rehabilitation gyms, we propose an automated system that could dynamically assign patients to different robots within a session in order to optimize rehabilitation outcome.

     Methods

    As a first step toward implementing a practical patient-robot assignment system, we present a simplified mathematical model of a robotic rehabilitation gym. Mixed-integer nonlinear programming algorithms are used to find effective assignment and training solutions for multiple evaluation scenarios involving different numbers of patients and robots (5 patients and 5 robots, 6 patients and 5 robots, 5 patients and 7 robots), different training durations (7 or 12 time steps) and different complexity levels (whether different patients have different skill acquisition curves, whether robots have exit times associated with them). In all cases, the goal is to maximize total skill gain across all patients and skills within a session.

     Results

    Analyses of variance across different scenarios show that disjunctive and time-indexed optimization models significantly outperform two baseline schedules: staying on one robot throughout a session and switching robots halfway through a session. The disjunctive model results in higher skill gain than the time-indexed model in the given scenarios, and the optimization duration increases as the number of patients, robots and time steps increases. Additionally, we discuss how different model simplifications (e.g., perfectly known and predictable patient skill level) could be addressed in the future and how such software may eventually be used in practice.

     Conclusions

    Though it involves unrealistically simple scenarios, our study shows that intelligently moving patients between different rehabilitation robots can improve overall skill acquisition in a multi-patient multi-robot environment. While robotic rehabilitation gyms are not yet commonplace in clinical practice, prototypes of them already exist, and our study presents a way to use intelligent decision support to potentially enable more efficient delivery of technologically aided rehabilitation.

     
    more » « less
  5. ; ( , The International Journal of Robotics Research)

    Consider deploying a team of robots in order to visit sites in a risky environment (i.e., where a robot might be lost during a traversal), subject to team-based operational constraints such as limits on team composition, traffic throughputs, and launch constraints. We formalize this problem using a graph to represent the environment, enforcing probabilistic survival constraints for each robot, and using a matroid (which generalizes linear independence to sets) to capture the team-based operational constraints. The resulting “Matroid Team Surviving Orienteers” (MTSO) problem has broad applications for robotics such as informative path planning, resource delivery, and search and rescue. We demonstrate that the objective for the MTSO problem has submodular structure, which leads us to develop two polynomial time algorithms which are guaranteed to find a solution with value within a constant factor of the optimum. The second of our algorithms is an extension of the accelerated continuous greedy algorithm, and can be applied to much broader classes of constraints while maintaining bounds on suboptimality. In addition to in-depth analysis, we demonstrate the efficiency of our approaches by applying them to a scenario where a team of robots must gather information while avoiding dangers in the Coral Triangle and characterize scaling and parameter selection using a synthetic dataset.

     
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email