Certification of Bottleneck Task Assignment With Shortest Path Criteria
Related publications (38)
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.
This paper presents a solution to the Simultaneous Localization and Mapping (SLAM) problem in the stochastic map framework for a mobile robot navigating in an indoor environment. The approach is based on the concept of the relative map. The idea consists i ...
Simultaneous link failures are common in IP networks \cite{Markopoulou04}. In this paper, we develop a technique for locating multiple failures in Service Provider or Enterprise IP networks using active measurement. We propose a two-phased approach that mi ...
This paper presents a solution to the Simultaneous Localization and Mapping (SLAM) problem in the stochastic map framework for a mobile robot navigating in an indoor environment. The approach is based on the concept of the relative map. The idea consists i ...
After a quarter century of mobile robot research, applications of this fascinating technology appear in real-world settings. Some require operation in environments that are densely cluttered with moving obstacles. Public mass exhibitions or conventions are ...
This paper studies the interaction between the communication costs in a sensor network and the structure of the data that it measures. We formulate an optimization problem definition for power efficient data gathering and assess its computational difficult ...
2003
,
The poser scheduling problem has been shown to be NP-complete in the general case but in P for a special case by Chang and Edmonds. In this paper, we extend the class of polynomially solvable cases and give some polyhedral characterizations. ...
The common point between the different chapters of the present work is graph theory. We investigate some well known graph theory problems, and some which arise from more specific applications. In the first chapter, we deal with the maximum stable set probl ...
This paper presents a navigation framework which enables multiple mobile robots to attain individual goals, coordinate their actions and work safely and reliably in a highly dynamic environment. We give an overview of the framework architecture, its layeri ...