Copilot MIKE: An Autonomous Assistant for Multi-Robot Operations in Cave Exploration
No abstract provided
Agha-mohammadi, Ali-akbar↗
Engineering topics
Vaquero, Tiago
Publications and source records attributed to Vaquero, Tiago.
Robustness Computation of Dynamic Controllability in Probabilistic Temporal Networks with Ordinary Distributions
Most existing works in Probabilistic Simple Temporal Networks (PSTNs) base their frameworks on well-defined probability distributions. This paper addresses on PSTN Dynamic Controllability (DC) robustness measure, i.e. the execution success probability of a network under dynamic control.We consider PSTNs where the probability distributions of the contingent edges are ordinary distributed (e.g. non-parametric, non-symmetric). We introduce the concepts of dispatching protocol (DP) as well as DP-robustness, the probability of success under a predefined dynamic policy.We propose a fixed-parameter pseudo-polynomial time algorithm to compute the exact DP-robustness of any PSTN under \textit{NextFirst} protocol, and apply to various PSTN datasets, including the real case of planetary exploration in the context of the Mars 2020 rover, and propose an original structural analysis.
Saint-Guillain, Michael↗
Enabling Limited Resource-Bounded Disjunction in Scheduling
We describe three approaches to enabling a severely computationallylimited embedded scheduler to consider a smallnumber of alternative activities based on resource availability.We consider the case where the scheduler is so computationallylimited that it cannot backtrack search. The first twoapproaches precompile resource checks (called guards) thatonly enable selection of a preferred alternative activity if sufficientresources are estimated to be available to schedule theremaining activities. The third approach mimics backtrackingby invoking the scheduler multiple times with the alternativeactivities. We present an evaluation of these techniques onMars mission scenarios (called sol types) from NASA’s nextplanetary rover where these techniques are being evaluatedfor inclusion in an onboard scheduler.
Vaquero, Tiago↗
Dynamic Shared Computing Resources for Multi-Robot Mars Exploration
The NASA roadmap for 2020 and beyond includes several key technologies which will have a game-changing impact on planetary exploration. The first of these is High Performance Spaceflight Computing (HPSC), which will provide orders of magnitude increases in processing power for next-generation rovers and orbiters (Doyle et al. 2013). The second is Delay Tolerant Networking, which overlays the Deep Space Network, providing internet-like abstractions and store-forward to route data through intermittent delays in connectivity. The third is a trend toward small, co-dependent robots included in flagship missions (MarCO, PUFFER, and Mars Heli). Taken together, these imply an increasing amount of communication and computing heterogeneity on Mars in coming decades. Motivated by these technological trends, we study the concept of Mars on-site shared analysis, information, and communication (MOSAIC) for Mars exploration. The key algorithmic problem associated with MOSAIC networks is simultaneous scheduling of computation, communication, and caching of data, which we illustrate using the three scenarios. We present models, preliminary solutions, and simulation results for two scenarios, showing how mission efficiency relates to communication bandwidth, processing power, geography of the environment, and optimal scheduling of computation, communication, and data caching. The third scenario illustrates future directions of this work.
Chien, Steve↗