Multi-robot task allocation for safe planning against stochastic hazard dynamics
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.
In any N-city travelling salesman problem there are (N-1)!/2 possible tours. We use the Metropolis algorithm to generate a sequence of such tours. This sequence may be viewed as the random evolution of a physical system in contact with a heat-bath. As the ...
We present a modified version of the Particle swarm Optimization algorithm in which we adjust the virtual swarm search by incorporating inter-agent dynamics native to multi-robot search scenarios. The neighborhood structure of PSO is modified to accurately ...
Given three or four synchronized videos taken at eye level and from different angles, we show that we can effectively use dynamic programming to accurately follow up to six individuals across thousands of frames in spite of significant occlusions. In addit ...
We describe a new multi-robot system, named SWARM-BOTS, that exploits physical inter-connections to solve tasks that are impossible for a single robot. This is for instance the case of passing large gaps or high steps in all-terrain conditions. In order to ...
We consider the problem of a sensor network tracking a moving target that exhibits a Markov model of mobility. The sensor nodes have adjustable power levels and the precision of the measurement of the target location depends on both the relative distance f ...
