Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Sadeghi, Armin"'
Visibility is a crucial aspect of planning and control of autonomous vehicles (AV), particularly when navigating environments with occlusions. However, when an AV follows a trajectory with multiple occlusions, existing methods evaluate each occlusion
Externí odkaz:
http://arxiv.org/abs/2404.07781
Autor:
Botros, Alexander, Gilhuly, Barry, Wilde, Nils, Sadeghi, Armin, Alonso-Mora, Javier, Smith, Stephen L.
We study the problem of deploying a fleet of mobile robots to service tasks that arrive stochastically over time and at random locations in an environment. This is known as the Dynamic Vehicle Routing Problem (DVRP) and requires robots to allocate in
Externí odkaz:
http://arxiv.org/abs/2307.03984
Many problems in robotics seek to simultaneously optimize several competing objectives under constraints. A conventional approach to solving such multi-objective optimization problems is to create a single cost function comprised of the weighted sum
Externí odkaz:
http://arxiv.org/abs/2206.00663
In this paper, we study the well-known team orienteering problem where a fleet of robots collects rewards by visiting locations. Usually, the rewards are assumed to be known to the robots; however, in applications such as environmental monitoring or
Externí odkaz:
http://arxiv.org/abs/2112.08000
Autor:
Abdolmohammadi-Vahid, Samaneh, Baradaran, Behzad, Sadeghi, Armin, Bezemer, Gillina F.G., Kiaee, Fatemeh, Adcock, Ian M., Folkerts, Gert, Garssen, Johan, Mortaz, Esmaeil
Publikováno v:
In Experimental and Molecular Pathology June 2024 137
Autor:
Mardi, Amirhossein, Abdolmohammadi-Vahid, Samaneh, Sadeghi, Sarvin Alizadeh, Jafarzadeh, Sajad, Abbaspour-Aghdam, Sanaz, Hazrati, Ali, Mikaeili, Haleh, Valizadeh, Hamed, Sadeghi, Armin, Ahmadi, Majid, Nadiri, Mehdi
Publikováno v:
In Heliyon 15 May 2024 10(9)
Mobile robots are often tasked with repeatedly navigating through an environment whose traversability changes over time. These changes may exhibit some hidden structure, which can be learned. Many studies consider reactive algorithms for online plann
Externí odkaz:
http://arxiv.org/abs/2012.02271
In this paper, we revisit the distributed coverage control problem with multiple robots on both metric graphs and in non-convex continuous environments. Traditionally, the solutions provided for this problem converge to a locally optimal solution wit
Externí odkaz:
http://arxiv.org/abs/2005.02471
Autor:
Sadeghi, Armin, Smith, Stephen L.
This paper focuses on the problem of controlling self-interested drivers in ride-sourcing applications. Each driver has the objective of maximizing its profit, while the ride-sourcing company focuses on customer experience by seeking to minimizing th
Externí odkaz:
http://arxiv.org/abs/1909.04615
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.