activity
20192024
most citedOptimizing Task Waiting Times in Dynamic Vehicle Routing

8 citations · 15 across the 7 of their papers we have counts for

collaborators

7 papers

cs.RO2024

AUTO-IceNav: A Local Navigation Strategy for Autonomous Surface Ships in Broken Ice Fields

Rodrigue de Schaetzen, Alexander Botros, Ninghan Zhong +3

Ice conditions often require ships to reduce speed and deviate from their main course to avoid damage to the ship. In addition, broken ice fields are becoming the dominant ice cond…

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…

cs.RO2023★ 6 cited

Real-Time Navigation for Autonomous Surface Vehicles In Ice-Covered Waters

Rodrigue de Schaetzen, Alexander Botros, Robert Gash +2

Vessel transit in ice-covered waters poses unique challenges in safe and efficient motion planning. When the concentration of ice is high, it may not be possible to find collision-…

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

Spatio-Temporal Lattice Planning Using Optimal Motion Primitives

Alexander Botros, Stephen L. Smith

Lattice-based planning techniques simplify the motion planning problem for autonomous vehicles by limiting available motions to a pre-computed set of primitives. These primitives a…

cs.RO2021★ 1 cited

Tunable Trajectory Planner Using G3 Curves

Alexander Botros, Stephen L. Smith

Trajectory planning is commonly used as part of a local planner in autonomous driving. This paper considers the problem of planning a continuous-curvature-rate trajectory between f…

cs.RO2019

Computing a Minimal Set of t-Spanning Motion Primitives for Lattice Planners

Alexander Botros, Stephen L. Smith

In this paper we consider the problem of computing an optimal set of motion primitives for a lattice planner. The objective we consider is to compute a minimal set of motion primit…