activity
20162024
most citedLearning Submodular Objectives for Team Environmental Monitoring

13 citations · 37 across the 8 of their papers we have counts for

collaborators

9 papers

cs.RO2024★ 3 cited

Estimating Visibility from Alternate Perspectives for Motion Planning with Occlusions

Barry Gilhuly, Armin Sadeghi, Stephen L. Smith

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 traject…

cs.RO2023★ 8 cited

Optimizing Task Waiting Times in Dynamic Vehicle Routing

Alexander Botros, Barry Gilhuly, Nils Wilde +3

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 Dyn…

gr-qc2023★ 13 cited

On the gravitational collapse in 4-dimensional Einstein-Gauss-Bonnet gravity

R. Hassannejad, A. Sadeghi, F. Shojai

In this paper, we treat 4-dimensional Einstein-Gauss-Bonnet gravity as general relativity with an effective stress-energy tensor. We will study the modified Oppenheimer-Snyder-Datt…

cs.RO2022

Error-Bounded Approximation of Pareto Fronts in Robot Planning Problems

Alexander Botros, Armin Sadeghi, Nils Wilde +2

Many problems in robotics seek to simultaneously optimize several competing objectives under constraints. A conventional approach to solving such multi-objective optimization probl…

cs.RO2021★ 13 cited

Learning Submodular Objectives for Team Environmental Monitoring

Nils Wilde, Armin Sadeghi, Stephen L. Smith

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…

cs.RO2020

LAMP: Learning a Motion Policy to Repeatedly Navigate in an Uncertain Environment

Florence Tsang, Tristan Walker, Ryan A. MacDonald +2

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…

cs.MA2020

Approximation Algorithms for Distributed Multi-Robot Coverage in Non-Convex Environments

Armin Sadeghi, Ahmad Bilal Asghar, Stephen L. Smith

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 solution…

cs.MA2019

On Re-Balancing Self-Interested Agents in Ride-Sourcing Transportation Networks

Armin Sadeghi, Stephen L. Smith

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-sourc…

eess.SY2016

On Efficient Computation of Shortest Dubins Paths Through Three Consecutive Points

Armin Sadeghi, Stephen L. Smith

In this paper, we address the problem of computing optimal paths through three consecutive points for the curvature-constrained forward moving Dubins vehicle. Given initial and fin…