Picture for Armin Sadeghi

Armin Sadeghi

University of Waterloo

Estimating Visibility from Alternate Perspectives for Motion Planning with Occlusions

Add code
Apr 11, 2024
Figure 1 for Estimating Visibility from Alternate Perspectives for Motion Planning with Occlusions
Figure 2 for Estimating Visibility from Alternate Perspectives for Motion Planning with Occlusions
Figure 3 for Estimating Visibility from Alternate Perspectives for Motion Planning with Occlusions
Figure 4 for Estimating Visibility from Alternate Perspectives for Motion Planning with Occlusions
Viaarxiv icon

Optimizing Task Waiting Times in Dynamic Vehicle Routing

Add code
Jul 08, 2023
Figure 1 for Optimizing Task Waiting Times in Dynamic Vehicle Routing
Figure 2 for Optimizing Task Waiting Times in Dynamic Vehicle Routing
Figure 3 for Optimizing Task Waiting Times in Dynamic Vehicle Routing
Figure 4 for Optimizing Task Waiting Times in Dynamic Vehicle Routing
Viaarxiv icon

Error-Bounded Approximation of Pareto Fronts in Robot Planning Problems

Add code
Jun 01, 2022
Figure 1 for Error-Bounded Approximation of Pareto Fronts in Robot Planning Problems
Figure 2 for Error-Bounded Approximation of Pareto Fronts in Robot Planning Problems
Figure 3 for Error-Bounded Approximation of Pareto Fronts in Robot Planning Problems
Figure 4 for Error-Bounded Approximation of Pareto Fronts in Robot Planning Problems
Viaarxiv icon

Learning Submodular Objectives for Team Environmental Monitoring

Add code
Dec 15, 2021
Figure 1 for Learning Submodular Objectives for Team Environmental Monitoring
Figure 2 for Learning Submodular Objectives for Team Environmental Monitoring
Figure 3 for Learning Submodular Objectives for Team Environmental Monitoring
Viaarxiv icon

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

Add code
Dec 03, 2020
Figure 1 for LAMP: Learning a Motion Policy to Repeatedly Navigate in an Uncertain Environment
Figure 2 for LAMP: Learning a Motion Policy to Repeatedly Navigate in an Uncertain Environment
Figure 3 for LAMP: Learning a Motion Policy to Repeatedly Navigate in an Uncertain Environment
Figure 4 for LAMP: Learning a Motion Policy to Repeatedly Navigate in an Uncertain Environment
Viaarxiv icon

On Efficient Computation of Shortest Dubins Paths Through Three Consecutive Points

Add code
Sep 21, 2016
Figure 1 for On Efficient Computation of Shortest Dubins Paths Through Three Consecutive Points
Figure 2 for On Efficient Computation of Shortest Dubins Paths Through Three Consecutive Points
Figure 3 for On Efficient Computation of Shortest Dubins Paths Through Three Consecutive Points
Figure 4 for On Efficient Computation of Shortest Dubins Paths Through Three Consecutive Points
Viaarxiv icon