Fabricio Carvalho

Learn More
The assignment of target points to multiple robots in exploration missions is a combinatorial problem that is known to be NP-Hard. Negotiation-based methods, such as auctions, have been extensively investigated in the literature, but the provided solution is usually sub-optimal. In this study, we propose an approach which models the multi-robot exploration(More)
Determining hardware and software elements used to process an application request and group them in a set, called causal path, that exposes relevant parameters, such as processing time and delays, and that may explain the behavior of the application is a challenging task. Several tools for building causal paths have been proposed for the current Internet(More)
  • 1