Multi-robot task allocation for safe planning against stochastic hazard dynamics
Related publications (45)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Institutional robotics (IR) is an approach to the coordination of multi-robot systems that draws inspiration from social sciences, namely from institutional economics. Using the concept of institution, it aims to provide a comprehensive strategy for specif ...
Searching for olfactory targets with mobile robots has received much attention in the recent years due to its applications in chemical leak detection, environmental monitoring, pollution monitoring, inspection of landfills, and search and rescue operations ...
In most multi-robot systems, an individual robot is not capable of solving computationally hard problems due to lack of high processing power. This paper introduces the novel concept of robotic clusters to empower these systems in their problem solving. A ...
We compare six different algorithms for localizing odor sources with mobile robots. Three algorithms are bio-inspired and mimic the behavior of insects when exposed to airborne pheromones. Two algorithms are based on probability and information theory, and ...
Designing effective behavioral controllers for mobile robots can be difficult and tedious; this process can be circumvented by using online learning techniques which allow robots to generate their own controllers online in an automated fash- ion. In multi- ...
2009
,
Decision making and planning for which the state information is only partially available is a problem faced by all forms of intelligent entities they being either virtual, synthetic or biological. The standard approach to mathematically solve such a decisi ...
2014
,
We describe a framework for analyzing probabilistic reachability and safety problems for discrete time stochastic hybrid systems within a dynamic games setting. In particular, we consider finite horizon zero-sum stochastic games in which a control has the ...
2013
,
Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, we solve index tuning for large problem instances that are common in practice, e.g., thousands of queries in the workload, ...
2011
, , ,
Model-based synthesis of distributed controllers for multi-robot systems is commonly approached in either a top-down or bottom-up fashion. In this paper, we investigate the experimental challenges of both approaches, with a special emphasis on resource-con ...
Springer-Verlag2010
,
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal reward of such a Markov Decision Process, satisfying a Bellman equation, con ...
