Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Akella, Srinivas"'
Autor:
Jakkala, Kalvik, Akella, Srinivas
Wastewater monitoring is an effective approach for the early detection of viral and bacterial disease outbreaks. It has recently been used to identify the presence of individuals infected with COVID-19. To monitor large communities and accurately loc
Externí odkaz:
http://arxiv.org/abs/2312.16750
Multi-Robot Informative Path Planning from Regression with Sparse Gaussian Processes (with Appendix)
Autor:
Jakkala, Kalvik, Akella, Srinivas
This paper addresses multi-robot informative path planning (IPP) for environmental monitoring. The problem involves determining informative regions in the environment that should be visited by robots to gather the most information about the environme
Externí odkaz:
http://arxiv.org/abs/2309.07050
Autor:
Jakkala, Kalvik, Akella, Srinivas
The sensor placement problem is a common problem that arises when monitoring correlated phenomena, such as temperature, precipitation, and salinity. Existing approaches to this problem typically formulate it as the maximization of information metrics
Externí odkaz:
http://arxiv.org/abs/2303.00028
Autor:
Agarwal, Saurav, Akella, Srinivas
The area coverage problem is the task of efficiently servicing a given two-dimensional surface using sensors mounted on robots such as unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs). We present a novel formulation for generating
Externí odkaz:
http://arxiv.org/abs/2208.09865
Autor:
Agarwal, Saurav, Akella, Srinivas
Line coverage is the task of servicing a given set of one-dimensional features in an environment. It is important for the inspection of linear infrastructure such as road networks, power lines, and oil and gas pipelines. This paper addresses the sing
Externí odkaz:
http://arxiv.org/abs/2208.09861
Autor:
Agarwal, Saurav, Akella, Srinivas
The line coverage problem involves finding efficient routes for the coverage of linear features by one or more resource-constrained robots. Linear features model environments like road networks, power lines, and oil and gas pipelines. Two modes of tr
Externí odkaz:
http://arxiv.org/abs/2208.09419
Autor:
Agarwal, Saurav, Akella, Srinivas
This paper introduces the correlated arc orienteering problem (CAOP), where the task is to find routes for a team of robots to maximize the collection of rewards associated with features in the environment. These features can be one-dimensional or po
Externí odkaz:
http://arxiv.org/abs/2208.07524
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.