• Corpus ID: 245123689

Multi-Robot On-site Shared Analytics Information and Computing

  title={Multi-Robot On-site Shared Analytics Information and Computing},
  author={Joshua Vander Hook and Federico Rossi and Tiago Stegun Vaquero and Martina Troesch and Marc Sanchez Net and Joshua Schoolcraft and Jean-Pierre de la Croix and Steve A. Chien},
Computation load-sharing across a network of heterogeneous robots is a promising approach to increase robots capabilities and efficiency as a team in extreme environments. However, in such environments, communication links may be intermittent and connections to the cloud or internet may be nonexistent. In this paper we introduce a communicationaware, computation task scheduling problem for multi-robot systems and propose an integer linear program (ILP) that optimizes the allocation of… 


Mars On-Site Shared Analytics Information and Computing
This work model a network of small rovers with access to computing resources from a static base station based on current design efforts and extrapolation from the Mars 2020 rover autonomy, and presents a consensus-backed scheduler for sharedworld, distributed scheduling based on an Integer Linear Program.
The Pluggable Distributed Resource Allocator (PDRA): a Middleware for Distributed Computing in Mobile Robotic Networks
Simulation results show that PDRA can reduce energy and CPU usage by over 50% in representative multi-robot scenarios compared to a naive scheduler; runs on embedded platforms; and performs well in delay- and disruption-tolerant networks (DTNs).
Dynamic Shared Computing Resources for Multi-Robot Mars Exploration
The concept of Mars on-site shared analysis, information, and communication (MOSAIC) for Mars exploration is studied, showing how mission efficiency relates to communication bandwidth, processing power, geography of the environment, and optimal scheduling of computation, communication, and data caching.
Communication-Aware Scheduling of Serial Tasks for Dispersed Computing
This work considers a network where servers are capable of serving all task types, and sending the results of processed tasks from one server to another server results in some communication delay that makes the design of optimal scheduling policy significantly more challenging than classical queueing networks.
Robotic data mules for collecting data over sparse sensor fields
This work addresses the problem of planning paths of multiple robots so as to collect the data from all sensors in the shortest time in a new routing problem, which is called the data gathering problem (DGP).
Co-Optimization of Communication and Motion Planning of a Robotic Operation under Resource Constraints and in Fading Environments
This work proposes a co-optimization framework that allows the robot to plan its motion speed, transmission rate and stop time, based on its probabilistic prediction of the channel quality along the trajectory, and proves that if the robot must stop, it should then stop only once and at the location with the best predicted channel quality.
Decentralized decision-making on robotic networks with hybrid performance metrics
  • F. Rossi, M. Pavone
  • Computer Science
    2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2013
This paper presents and rigorously analyze a tunable, semi-hierarchical algorithm, where the tuning parameter allows a graceful transition from time-optimal to communication-Optimal performance, and determines the algorithm's robustness, measured as the time required to recover from a failure.
Communication-Aware Motion Planning in Mobile Networks
The results indicate that networked robotic operations can benefit considerably from the probabilistic channel assessment and its integration with sensing/motion planning.
A stochastic scheduling algorithm for precedence constrained tasks on Grid
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
Two novel scheduling algorithms for a bounded number of heterogeneous processors with an objective to simultaneously meet high performance and fast scheduling time are presented, called the Heterogeneous Earliest-Finish-Time (HEFT) algorithm and the Critical-Path-on-a-Processor (CPOP) algorithm.